Searched defs:sorted (Results 26 - 50 of 66) sorted by relevance

123

/external/clang/utils/TableGen/
H A DClangSACheckersEmitter.cpp268 std::map<int, const Record *> sorted; local
271 sorted[(*I)->getID()] = *I;
274 I = sorted.begin(), E = sorted.end(); I != E; ++I)
283 std::map<int, const Record *> sorted; local
286 sorted[(*I)->getID()] = *I;
289 I = sorted.begin(), E = sorted.end(); I != E; ++I) {
/external/skia/experimental/Intersection/
H A DShapeOps.cpp43 SkTDArray<Angle*> sorted; local
44 bool sortable = Segment::SortAngles(angles, sorted);
45 int angleCount = sorted.count();
47 sorted[0]->segment()->debugShowSort(__FUNCTION__, sorted, 0);
56 angle = sorted[++firstIndex];
60 segment->debugShowSort(__FUNCTION__, sorted, firstIndex);
75 angle = sorted[nextIndex];
H A DEdgeWalker.cpp1463 // intersected. Later, when sorted, and this near-coincidence is found,
1875 HorizontalEdge** sorted = horizontal; local
1876 horzEdge = *sorted;
1912 horzEdge = *++sorted;
2330 // the coincident edges may not have been sorted above -- advance
2681 // walk the sorted edges from top to bottom, computing accumulated winding
/external/valgrind/main/coregrind/
H A Dm_xarray.c49 Bool sorted; /* is it sorted? */ member in struct:_XArray
77 xa->sorted = False;
134 xa->sorted = False;
194 xa->sorted = False;
215 xa->sorted = False;
225 xa->sorted = True;
273 vg_assert(xa->sorted);
346 xa->sorted = False;
/external/chromium_org/tools/gn/
H A Dcommand_desc.cc66 // Combine all deps into one sorted list.
160 // Collect the sorted list of deps.
314 Target::FileList sorted = files; local
315 std::sort(sorted.begin(), sorted.end());
316 for (size_t i = 0; i < sorted.size(); i++)
317 OutputString(indent + sorted[i].value() + "\n");
486 " Shows configs applied to the given target, sorted in the order\n"
496 " \"--all\" shows them sorted alphabetically. Using both flags will\n"
/external/chromium_org/v8/test/mjsunit/
H A Darray-sort.js369 var sorted = ["a2", "a3", "b1", "b2", "c1", "c2", "d1", "d2", "e3", variable
371 for (var i = 0; i < sorted.length; i++) {
373 assertEquals(sorted[i], x[i], name + i);
375 assertFalse(x.hasOwnProperty(sorted.length), name + "haspost");
376 assertFalse(sorted.length in x, name + "haspost2");
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3collections.h395 * to be sorted will be numeric indexes into some other structure such as an ANTLR3_VECTOR.
398 * array of the sorted noded indexes, in case you are not sorting ANTLR3_VECTORS but
417 * A vector used to build up the sorted output order. Note that
421 pANTLR3_UINT32 sorted; member in struct:ANTLR3_TOPO_struct
452 * One more than the largest node index that is contained in edges/sorted.
479 * A method that returns a pointer to an array of sorted node indexes.
480 * The array is sorted in topological sorted order. Note that the array
483 * was 16, then the returned array will be the sorted order of the first 16
487 * NB: If the structure that contains the array is freed, then the sorted
[all...]
/external/dhcpcd/
H A Dipv6rs.c235 struct ra *rap, *sorted, *ran, *rat; local
241 sorted = ifp->ras;
243 sorted->next = NULL;
246 if (timercmp(&rap->received, &sorted->received, <)) {
247 rap->next = sorted;
248 sorted = rap;
252 for (rat = sorted; rat->next; rat = rat->next) {
/external/chromium_org/chrome/common/extensions/docs/examples/apps/hello-python/httplib2/
H A D__init__.py94 def sorted(seq): function in function:has_timeout
897 auth = auths and sorted(auths)[0][1] or None
/external/chromium_org/third_party/freetype/src/pshinter/
H A Dpshalgo.c119 PSH_Hint* sorted = table->sort_global; local
125 for ( ; count > 0; count--, sorted++ )
127 hint2 = sorted[0];
140 FT_TRACE0(( "psh_hint_table_record: too many sorted hints! BUG!\n" ));
317 /* will be already sorted -- and the sort will be linear */
/external/freetype/src/pshinter/
H A Dpshalgo.c119 PSH_Hint* sorted = table->sort_global; local
125 for ( ; count > 0; count--, sorted++ )
127 hint2 = sorted[0];
140 FT_TRACE0(( "psh_hint_table_record: too many sorted hints! BUG!\n" ));
317 /* will be already sorted -- and the sort will be linear */
/external/guava/guava-tests/test/com/google/common/collect/
H A DSetsTest.java1030 SortedSet<Long> sorted = Sets.newTreeSet();
1032 sorted.add(i);
1034 SortedSet<Long> filteredEven = Sets.filter(sorted, new Predicate<Long>() {
1047 assertEquals("comparator", sorted.comparator(), filteredEven.comparator());
1049 sorted.add(12L);
1050 sorted.add(0L);
1076 static SortedSet<Long> sorted = Sets.newTreeSet(); field in class:SetsTest
1079 sorted.add(i);
1082 static SortedSet<Long> filterAllElements = Sets.filter(sorted, Predicates.alwaysFalse());
/external/pdfium/core/src/fxge/agg/agg23/
H A Dagg_rasterizer_scanline_aa.h107 bool sorted() const function in class:agg::outline_aa
243 if(m_outline.sorted()) {
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/pshinter/
H A Dpshalgo.c119 PSH_Hint* sorted = table->sort_global; local
125 for ( ; count > 0; count--, sorted++ )
127 hint2 = sorted[0];
140 FT_TRACE0(( "psh_hint_table_record: too many sorted hints! BUG!\n" ));
317 /* will be already sorted -- and the sort will be linear */
/external/chromium_org/chrome/browser/safe_browsing/
H A Dsafe_browsing_store_file.cc28 // Starting with version 8, the storage is sorted and can be sharded to allow
292 // Return |true| if the range is sorted by the given comparator.
294 bool sorted(CTI beg, CTI end, LESS less) { function in namespace:__anon4617
304 // Merge |beg|..|end| into |container|. Both should be sorted by the given
310 DCHECK(sorted(container->begin(), container->end(), less));
311 DCHECK(sorted(beg, end, less));
342 DCHECK(sorted(container->begin(), container->end(), less));
394 // The current state and the range given should corrospond to the same sorted
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DEdgeWalker.cpp1463 // intersected. Later, when sorted, and this near-coincidence is found,
1875 HorizontalEdge** sorted = horizontal; local
1876 horzEdge = *sorted;
1912 horzEdge = *++sorted;
2330 // the coincident edges may not have been sorted above -- advance
2681 // walk the sorted edges from top to bottom, computing accumulated winding
/external/chromium_org/third_party/skia/tests/
H A DPathOpsSkpClipTest.cpp619 SkTDArray<TestResult>* tests, SkTDArray<SortByName*>* sorted) {
645 if (!sorted) {
651 *sorted[dirNo - firstDirNo].append() = (SortByName*) &testSet[index];
653 if (sorted[dirNo - firstDirNo].count()) {
654 SkTQSort<SortByName>(sorted[dirNo - firstDirNo].begin(),
655 sorted[dirNo - firstDirNo].end() - 1);
702 SkTDArray<SortByName*> sorted[1]; local
703 if (!buildTestDir(dirNo, dirNo, tests, sorted)) {
719 int count = sorted[0].count();
720 int idx = SkTSearch<SortByName, Less>(sorted[
618 buildTestDir(int dirNo, int firstDirNo, SkTDArray<TestResult>* tests, SkTDArray<SortByName*>* sorted) argument
880 buildTests(SkTDArray<TestResult>* tests, SkTDArray<SortByName*>* sorted) argument
[all...]
/external/opencv/ml/src/
H A Dmlboost.cpp211 const CvPair32s32f* sorted = data->get_ord_var_data(node,vi); local
220 int idx = sorted[i].i;
228 int idx = sorted[i].i;
235 dir[sorted[i].i] = (char)0;
247 const CvPair32s32f* sorted = data->get_ord_var_data(node, vi); local
262 int idx = sorted[i].i;
277 int idx = sorted[i].i;
287 if( sorted[i].val + epsilon < sorted[i+1].val )
302 int idx = sorted[
443 const CvPair32s32f* sorted = data->get_ord_var_data(node, vi); local
574 const CvPair32s32f* sorted = data->get_ord_var_data(node, vi); local
[all...]
H A Dmltree.cpp1477 const CvPair32s32f* sorted = data->get_ord_var_data(node,vi); local
1486 dir[sorted[i].i] = (char)-1;
1488 dir[sorted[i].i] = (char)1;
1490 dir[sorted[i].i] = (char)0;
1503 int idx = sorted[i].i;
1511 int idx = sorted[i].i;
1518 dir[sorted[i].i] = (char)0;
1569 const CvPair32s32f* sorted = data->get_ord_var_data(node, vi); local
1590 rc[responses[sorted[i].i]]--;
1601 int idx = responses[sorted[
2051 const CvPair32s32f* sorted = data->get_ord_var_data(node, vi); local
2470 const CvPair32s32f* sorted = data->get_ord_var_data(node, vi); local
[all...]
/external/skia/tests/
H A DPathOpsSkpClipTest.cpp979 SkTDArray<SortByName*>* sorted) {
1006 if (!sorted) {
1012 *sorted[dirNo - firstDirNo].append() = (SortByName*) &testSet[index];
1014 if (sorted[dirNo - firstDirNo].count()) {
1015 SkTQSort<SortByName>(sorted[dirNo - firstDirNo].begin(),
1016 sorted[dirNo - firstDirNo].end() - 1);
1038 SkTDArray<SortByName*> sorted[dirCount]; local
1039 if (!buildTests(reporter, firstDirNo, lastDirNo, tests, sorted)) {
1062 count = sorted[dirNo - firstDirNo].count();
1063 if (SkTSearch<SortByName, Less>(sorted[dirN
978 buildTests(skiatest::Reporter* reporter, int firstDirNo, int lastDirNo, SkTDArray<TestResult>* tests, SkTDArray<SortByName*>* sorted) argument
[all...]
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/
H A DHeapSnapshotGridNodes.js275 function sorted()
279 this._provider().sortAndRewind(this.comparator(), sorted.bind(this));
/external/chromium_org/third_party/sqlite/src/tool/
H A Dlemon.c278 struct state **sorted; /* Table of states sorted by state number */ member in struct:lemon
813 /* Extract the sorted basis of the new state. The basis was constructed
932 stp = lemp->sorted[i];
941 stp = lemp->sorted[i];
965 for(cfp=lemp->sorted[i]->cfp; cfp; cfp=cfp->next){
973 for(cfp=lemp->sorted[i]->cfp; cfp; cfp=cfp->next){
1005 stp = lemp->sorted[i];
1029 Action_add(&lemp->sorted[0]->ap,ACCEPT,sp,0);
1035 stp = lemp->sorted[
[all...]
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dorg.eclipse.equinox.p2.jarprocessor_1.0.200.v20100503a.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
H A Dorg.eclipse.core.resources_3.6.1.R36x_v20101007-1215.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
/external/owasp/sanitizer/tools/findbugs/lib/
H A Dfindbugs-ant.jarMETA-INF/ META-INF/MANIFEST.MF edu/ edu/umd/ edu/umd/cs/ edu/umd/cs/findbugs/ ...

Completed in 4473 milliseconds

123