Searched defs:sorted (Results 1 - 25 of 66) sorted by last modified time

123

/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/sqlite/dist/orig/
H A Dsqlite3.c9899 /* Get a list of all dirty pages in the cache, sorted by page number */
13447 ** be sorted A-Z.
110852 u8 sorted; /* True if really sorted (not just grouped) */ member in struct:WhereInfo
[all...]
/external/sqlite/dist/
H A Dsqlite3.c9899 /* Get a list of all dirty pages in the cache, sorted by page number */
13447 ** be sorted A-Z.
110872 u8 sorted; /* True if really sorted (not just grouped) */ member in struct:WhereInfo
[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/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
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];
/external/owasp/sanitizer/tools/findbugs/lib/
H A Dant.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/apache/ org/apache/tools/ org/apache/tools/ant/ ...
H A Dfindbugs-ant.jarMETA-INF/ META-INF/MANIFEST.MF edu/ edu/umd/ edu/umd/cs/ edu/umd/cs/findbugs/ ...
H A Dfindbugs.jarMETA-INF/ META-INF/MANIFEST.MF default.xsl edu/ edu/umd/ edu/umd/cs/ edu/ ...
/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/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/openfst/src/lib/
H A Dsymbol-table-ops.cc86 map<int, string> sorted; local
89 sorted[stiter.Value()] = stiter.Symbol();
93 for (map<int, string>::const_iterator si = sorted.begin();
94 si != sorted.end(); ++si) {
/external/openssl/crypto/stack/
H A Dstack.h70 int sorted; member in struct:stack_st
/external/openssl/include/openssl/
H A Dstack.h70 int sorted; member in struct:stack_st
/external/libvorbis/vq/
H A Dvqgen.h23 int sorted; member in struct:vqgen
/external/jdiff/
H A Dxerces.jarMETA-INF/ META-INF/MANIFEST.MF META-INF/services/ org/ org/apache/ org/apache/html/ ...
/external/jarjar/lib/
H A Dapache-ant-1.9.4.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/apache/ org/apache/tools/ org/apache/tools/ant/ ...
/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/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/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.apache.ant_1.7.1.v20090120-1145/lib/
H A Dant-nodeps.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/apache/ org/apache/tools/ org/apache/tools/ant/ ...
H A Dant.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/apache/ org/apache/tools/ org/apache/tools/ant/ ...
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
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 ...
H A Dorg.eclipse.equinox.p2.jarprocessor_1.0.200.v20100503a.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...

Completed in 1509 milliseconds

123