| /external/pdfium/core/fxcrt/ |
| D | fx_extension_unittest.cpp | 154 const float ascending[] = {fMin, 1.0f, 2.0f, fMax, fInf, fNan}; in TEST() local
156 for (size_t i = 0; i < FX_ArraySize(ascending); ++i) { in TEST()
157 for (size_t j = 0; j < FX_ArraySize(ascending); ++j) { in TEST()
159 EXPECT_TRUE(FXSYS_SafeEQ(ascending[i], ascending[j])) in TEST()
162 EXPECT_FALSE(FXSYS_SafeEQ(ascending[i], ascending[j])) in TEST()
166 EXPECT_TRUE(FXSYS_SafeLT(ascending[i], ascending[j])) in TEST()
169 EXPECT_FALSE(FXSYS_SafeLT(ascending[i], ascending[j])) in TEST()
|
| /external/cldr/tools/java/org/unicode/cldr/util/ |
| D | Counter.java | 154 public EntryComparator(boolean ascending, Comparator<T> byValue) { in EntryComparator() argument
155 countOrdering = ascending ? 1 : -1; in EntryComparator()
170 public Set<T> getKeysetSortedByCount(boolean ascending) { in getKeysetSortedByCount() argument
171 return getKeysetSortedByCount(ascending, null); in getKeysetSortedByCount()
174 public Set<T> getKeysetSortedByCount(boolean ascending, Comparator<T> byValue) { in getKeysetSortedByCount() argument
175 Set<Entry<T>> count_key = new TreeSet<>(new EntryComparator<>(ascending, byValue)); in getKeysetSortedByCount()
187 public Set<Row.R2<Long, T>> getEntrySetSortedByCount(boolean ascending, Comparator<T> byValue) { in getEntrySetSortedByCount() argument
188 Set<Entry<T>> count_key = new TreeSet<>(new EntryComparator<>(ascending, byValue)); in getEntrySetSortedByCount()
|
| D | Counter2.java | 110 public EntryComparator(boolean ascending, Comparator<T> byValue) { in EntryComparator() argument
111 countOrdering = ascending ? 1 : -1; in EntryComparator()
128 public Set<T> getKeysetSortedByCount(boolean ascending) { in getKeysetSortedByCount() argument
129 return getKeysetSortedByCount(ascending, null); in getKeysetSortedByCount()
132 public Set<T> getKeysetSortedByCount(boolean ascending, Comparator<T> byValue) { in getKeysetSortedByCount() argument
133 Set<Entry<T>> count_key = new TreeSet<>(new EntryComparator<>(ascending, byValue)); in getKeysetSortedByCount()
|
| /external/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/ |
| D | Counter.java | 113 public EntryComparator(boolean ascending, Comparator<T> byValue) { in EntryComparator() argument
114 countOrdering = ascending ? 1 : -1; in EntryComparator()
127 public Set<T> getKeysetSortedByCount(boolean ascending) { in getKeysetSortedByCount() argument
128 return getKeysetSortedByCount(ascending, null); in getKeysetSortedByCount()
131 public Set<T> getKeysetSortedByCount(boolean ascending, Comparator<T> byValue) { in getKeysetSortedByCount() argument
132 Set<Entry<T>> count_key = new TreeSet<Entry<T>>(new EntryComparator<T>(ascending, byValue)); in getKeysetSortedByCount()
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/collator/ |
| D | Counter.java | 116 public EntryComparator(boolean ascending, Comparator<T> byValue) { in EntryComparator() argument
117 countOrdering = ascending ? 1 : -1; in EntryComparator()
130 public Set<T> getKeysetSortedByCount(boolean ascending) { in getKeysetSortedByCount() argument
131 return getKeysetSortedByCount(ascending, null); in getKeysetSortedByCount()
134 public Set<T> getKeysetSortedByCount(boolean ascending, Comparator<T> byValue) { in getKeysetSortedByCount() argument
135 Set<Entry<T>> count_key = new TreeSet<Entry<T>>(new EntryComparator<T>(ascending, byValue)); in getKeysetSortedByCount()
|
| /external/python/cpython3/Lib/test/ |
| D | test_uuid.py | 35 ascending = []
201 ascending.append(u)
204 for i in range(len(ascending)):
205 for j in range(len(ascending)):
206 equal(i < j, ascending[i] < ascending[j])
207 equal(i <= j, ascending[i] <= ascending[j])
208 equal(i == j, ascending[i] == ascending[j])
209 equal(i > j, ascending[i] > ascending[j])
210 equal(i >= j, ascending[i] >= ascending[j])
211 equal(i != j, ascending[i] != ascending[j])
[all …]
|
| /external/rust/crates/plotters/src/coord/ranged1d/combinators/ |
| D | linspace.rs | 41 let ascending = if values.len() < 2 { in search() localVariable
48 if ascending { in search()
56 let offset = if ascending { 0 } else { 1 }; in search()
74 let ascending = if values.len() < 2 { in search() localVariable
81 if ascending { in search()
89 let offset = if ascending { 1 } else { 0 }; in search()
111 let ascending = if values.len() < 2 { in search() localVariable
118 if ascending { in search()
134 let left_delta = if ascending { in search()
139 let right_delta = if ascending { in search()
|
| /external/guava/android/guava-tests/test/com/google/common/hash/ |
| D | Crc32cHashFunctionTest.java | 46 byte[] ascending = new byte[32]; in testAscending()
48 ascending[i] = (byte) i; in testAscending()
50 assertCrc(0x46dd794e, ascending); in testAscending()
|
| /external/guava/guava-tests/test/com/google/common/hash/ |
| D | Crc32cHashFunctionTest.java | 46 byte[] ascending = new byte[32]; in testAscending()
48 ascending[i] = (byte) i; in testAscending()
50 assertCrc(0x46dd794e, ascending); in testAscending()
|
| /external/python/cpython2/Lib/test/ |
| D | test_uuid.py | 17 ascending = []
178 ascending.append(u)
181 for i in range(len(ascending)):
182 for j in range(len(ascending)):
183 equal(cmp(i, j), cmp(ascending[i], ascending[j]))
186 resorted = ascending[:]
189 equal(ascending, resorted)
|
| /external/testng/eclipse-projects/beust.com/web/ |
| D | site.xsl | 16 <xsl:sort select="@label" order="ascending" case-order="upper-first"/>
17 <xsl:sort select="@name" order="ascending" case-order="upper-first"/>
28 <xsl:sort select="ancestor::feature//@version" order="ascending"/>
29 <xsl:sort select="ancestor::feature//@id" order="ascending" case-order="upper-first"/>
94 <xsl:sort select="@id" order="ascending" case-order="upper-first"/>
95 <xsl:sort select="@version" order="ascending" />
155 <xsl:sort select="@id" order="ascending" case-order="upper-first"/>
156 <xsl:sort select="@version" order="ascending" />
|
| /external/bcc/tools/ |
| D | cachetop_example.txt | 18 13:01:01 Buffers MB: 76 / Cached MB: 114 / Sort: HITS / Order: ascending
46 13:01:01 Buffers MB: 76 / Cached MB: 115 / Sort: HITS / Order: ascending
60 13:01:01 Buffers MB: 77 / Cached MB: 193 / Sort: HITS / Order: ascending
|
| /external/cldr/tools/java/org/unicode/cldr/tool/ |
| D | TablePrinter.java | 70 public TablePrinter setSortAscending(boolean ascending) { in setSortAscending() argument
71 columnSorter.setSortAscending(columns.size() - 1, ascending); in setSortAscending() local
249 private BitSet ascending = new BitSet(); field in TablePrinter.ColumnSorter
260 if (ascending.get(curr)) { in compare()
283 return ascending.get(bitIndex); in getSortAscending()
287 ascending.set(bitIndex, value); in setSortAscending()
|
| /external/perfetto/src/trace_processor/tables/ |
| D | macros_benchmark.cc | 136 filtered.Sort({root.root_non_null_2().ascending()})); in BM_TableFilterAndSortRoot()
475 benchmark::DoNotOptimize(root.Sort({root.root_non_null().ascending()})); in BM_TableSortRootNonNull()
498 benchmark::DoNotOptimize(root.Sort({root.root_nullable().ascending()})); in BM_TableSortRootNullable()
526 benchmark::DoNotOptimize(child.Sort({child.root_non_null().ascending()})); in BM_TableSortChildNonNullInParent()
558 benchmark::DoNotOptimize(child.Sort({child.root_nullable().ascending()})); in BM_TableSortChildNullableInParent()
|
| /external/libcups/templates/ru/ |
| D | jobs-header.tmpl | 5 …sted in print order; held jobs appear first.:{which_jobs=Jobs listed in ascending order.?:Jobs lis…
|
| /external/libcups/templates/ja/ |
| D | jobs-header.tmpl | 5 …sted in print order; held jobs appear first.:{which_jobs=Jobs listed in ascending order.?:Jobs lis…
|
| /external/libcups/templates/pt_BR/ |
| D | jobs-header.tmpl | 5 …sted in print order; held jobs appear first.:{which_jobs=Jobs listed in ascending order.?:Jobs lis…
|
| /external/libcups/templates/es/ |
| D | jobs-header.tmpl | 5 …sted in print order; held jobs appear first.:{which_jobs=Jobs listed in ascending order.?:Jobs lis…
|
| /external/libcups/templates/de/ |
| D | jobs-header.tmpl | 5 …sted in print order; held jobs appear first.:{which_jobs=Jobs listed in ascending order.?:Jobs lis…
|
| /external/libcups/templates/ |
| D | jobs-header.tmpl | 5 …sted in print order; held jobs appear first.:{which_jobs=Jobs listed in ascending order.?:Jobs lis…
|
| /external/llvm-project/llvm/test/CodeGen/ARM/ |
| D | vldm-liveness.ll | 3 ; Make sure we emit the loads in ascending order, and form a vldmia.
|
| /external/llvm-project/llvm/unittests/ADT/ |
| D | IteratorTest.cpp | 420 vector<unsigned> ascending{0, 1, 2, 3, 4, 5}; in TEST() local
422 auto zipped = zip_first(ascending, vector<bool>{0, 1, 0, 1, 0, 1}); in TEST()
441 EXPECT_TRUE(all_of(ascending, [](unsigned n) { return (n & 0x01) == 0; })); in TEST()
|
| /external/tensorflow/tensorflow/core/api_def/base_api/ |
| D | api_def_Skipgram.pbtxt | 12 Frequencies of words. Sorted in the non-ascending order.
|
| /external/rust/crates/chrono/ |
| D | AUTHORS.txt | 2 and also the following people (in ascending order):
|
| /external/freetype/docs/ |
| D | raster.txt | 250 be either ascending or descending, i.e., it is monotonic in the
376 necessarily y-monotonic (i.e., flat, ascending, or descending),
399 P1.y <= P2.y <= P3.y for an ever-ascending arc
537 y-monotonic (ascending or descending, and never flat). We now
574 One list, called the `left' one, only contains ascending
592 >/ / | | | them are ascending (1 &
|