| /external/python/cpython3/Lib/test/ |
| D | test_uuid.py | 30 ascending = []
196 ascending.append(u)
199 for i in range(len(ascending)):
200 for j in range(len(ascending)):
201 equal(i < j, ascending[i] < ascending[j])
202 equal(i <= j, ascending[i] <= ascending[j])
203 equal(i == j, ascending[i] == ascending[j])
204 equal(i > j, ascending[i] > ascending[j])
205 equal(i >= j, ascending[i] >= ascending[j])
206 equal(i != j, ascending[i] != ascending[j])
[all …]
|
| /external/cldr/tools/java/org/unicode/cldr/util/ |
| D | Counter.java | 152 public EntryComparator(boolean ascending, Comparator<T> byValue) { in EntryComparator() argument
153 countOrdering = ascending ? 1 : -1; in EntryComparator()
167 public Set<T> getKeysetSortedByCount(boolean ascending) { in getKeysetSortedByCount() argument
168 return getKeysetSortedByCount(ascending, null); in getKeysetSortedByCount()
171 public Set<T> getKeysetSortedByCount(boolean ascending, Comparator<T> byValue) { in getKeysetSortedByCount() argument
172 Set<Entry<T>> count_key = new TreeSet<Entry<T>>(new EntryComparator<T>(ascending, byValue)); in getKeysetSortedByCount()
184 public Set<Row.R2<Long, T>> getEntrySetSortedByCount(boolean ascending, Comparator<T> byValue) { in getEntrySetSortedByCount() argument
185 Set<Entry<T>> count_key = new TreeSet<Entry<T>>(new EntryComparator<T>(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()
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/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/v8/tools/profview/ |
| D | profile-utils.js | 150 function addOrUpdateChildNode(parent, file, stackIndex, stackPos, ascending) { argument
158 if (!ascending) {
168 child.delayedExpansion = { frameList : [], ascending }; field
178 let { frameList, ascending } = node.delayedExpansion;
180 let step = ascending ? 2 : -2;
192 addOrUpdateChildNode(node, file, stackIndex, stackPos, ascending);
212 this.tree.delayedExpansion = { frameList : [], ascending : false }; property
238 this.tree.delayedExpansion = { frameList : [], ascending : isBottomUp }; property
360 { frameList : [], ascending : false }; property
363 { frameList : [], ascending : true }; property
|
| /external/guava/guava-tests/test/com/google/common/hash/ |
| D | Crc32cHashFunctionTest.java | 47 byte[] ascending = new byte[32]; in testAscending()
49 ascending[i] = (byte) i; in testAscending()
51 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
248 private BitSet ascending = new BitSet(); field in TablePrinter.ColumnSorter
258 if (ascending.get(curr)) { in compare()
281 return ascending.get(bitIndex); in getSortAscending()
285 ascending.set(bitIndex, value); in setSortAscending()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/ |
| D | IteratorTest.cpp | 358 vector<unsigned> ascending{0, 1, 2, 3, 4, 5}; in TEST() local
360 auto zipped = zip_first(ascending, vector<bool>{0, 1, 0, 1, 0, 1}); in TEST()
379 EXPECT_TRUE(all_of(ascending, [](unsigned n) { return (n & 0x01) == 0; })); in TEST()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/ARM/ |
| D | vldm-liveness.ll | 3 ; Make sure we emit the loads in ascending order, and form a vldmia.
|
| /external/syzkaller/vendor/google.golang.org/appengine/datastore/ |
| D | query.go | 50 ascending sortDirection = iota const
55 ascending: pb.Query_Order_ASCENDING.Enum(),
173 Direction: ascending,
|
| /external/tensorflow/tensorflow/core/api_def/base_api/ |
| D | api_def_Skipgram.pbtxt | 12 Frequencies of words. Sorted in the non-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 &
|
| /external/tensorflow/tensorflow/contrib/distributions/python/ops/ |
| D | statistical_testing.py | 150 def _batch_sort_vector(x, ascending=True, name=None): argument
154 if ascending:
|
| /external/python/cpython2/Objects/ |
| D | listsort.txt | 60 /sort: ascending data
61 3sort: ascending, then 3 random exchanges
62 +sort: ascending, then 10 random at the end
63 %sort: ascending, then randomly replace 1% of elements w/ random values
216 "ascending", which means non-decreasing:
228 a descending run in-place, transforming a descending run into an ascending
675 samplesort special-casing at most one ascending run at the start, then
676 falling back to the general case if it doesn't find an ascending run
679 taught how to deal with mixtures of ascending and descending runs
|
| /external/python/cpython3/Objects/ |
| D | listsort.txt | 60 /sort: ascending data
61 3sort: ascending, then 3 random exchanges
62 +sort: ascending, then 10 random at the end
63 %sort: ascending, then randomly replace 1% of elements w/ random values
216 "ascending", which means non-decreasing:
228 a descending run in-place, transforming a descending run into an ascending
675 samplesort special-casing at most one ascending run at the start, then
676 falling back to the general case if it doesn't find an ascending run
679 taught how to deal with mixtures of ascending and descending runs
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| D | MultisetNavigationTester.java | 243 List<Entry<E>> ascending = new ArrayList<Entry<E>>(); in testDescendingNavigation() local
244 Iterators.addAll(ascending, sortedMultiset.entrySet().iterator()); in testDescendingNavigation()
248 assertEquals(ascending, descending); in testDescendingNavigation()
|
| /external/grpc-grpc-java/services/src/main/proto/grpc/channelz/v1/ |
| D | channelz.proto | 445 // ascending channel_id order.
461 // ascending server_id order.
478 // ascending socket_id order.
|
| /external/grpc-grpc/src/proto/grpc/channelz/ |
| D | channelz.proto | 445 // ascending channel_id order.
461 // ascending server_id order.
478 // ascending socket_id order.
|
| /external/python/cpython3/Doc/howto/ |
| D | sorting.rst | 20 A simple ascending sort is very easy: just call the :func:`sorted` function. It
142 ascending *age*, do the *age* sort first and then sort again using *grade*:
|
| /external/python/cpython2/Doc/howto/ |
| D | sorting.rst | 20 A simple ascending sort is very easy: just call the :func:`sorted` function. It
153 ascending *age*, do the *age* sort first and then sort again using *grade*:
|
| /external/tensorflow/tensorflow/lite/examples/ios/simple/ |
| D | RunModelViewController.mm | 51 // Will contain top N results in ascending order.
|