| /external/google-cloud-java/java-dataflow/proto-google-cloud-dataflow-v1beta3/src/main/java/com/google/dataflow/v1beta3/ |
| D | ListJobMessagesResponseOrBuilder.java | 30 * Messages in ascending timestamp order.
40 * Messages in ascending timestamp order.
50 * Messages in ascending timestamp order.
60 * Messages in ascending timestamp order.
71 * Messages in ascending timestamp order.
107 * Autoscaling events in ascending timestamp order.
117 * Autoscaling events in ascending timestamp order.
127 * Autoscaling events in ascending timestamp order.
137 * Autoscaling events in ascending timestamp order.
148 * Autoscaling events in ascending timestamp order.
|
| D | ListJobMessagesResponse.java | 80 * Messages in ascending timestamp order.
93 * Messages in ascending timestamp order.
107 * Messages in ascending timestamp order.
120 * Messages in ascending timestamp order.
133 * Messages in ascending timestamp order.
202 * Autoscaling events in ascending timestamp order.
215 * Autoscaling events in ascending timestamp order.
229 * Autoscaling events in ascending timestamp order.
242 * Autoscaling events in ascending timestamp order.
255 * Autoscaling events in ascending timestamp order.
[all …]
|
| /external/sdv/vsomeip/third_party/boost/range/test/algorithm_ext_test/ |
| D | is_sorted.cpp | 26 Container ascending; in test_is_sorted_impl() local
30 BOOST_CHECK( boost::is_sorted(ascending) ); in test_is_sorted_impl()
31 BOOST_CHECK( boost::is_sorted(ascending, std::less<std::size_t>()) ); in test_is_sorted_impl()
32 BOOST_CHECK( boost::is_sorted(ascending, std::greater<std::size_t>()) ); in test_is_sorted_impl()
36 ascending.push_back(i); in test_is_sorted_impl()
40 BOOST_CHECK( boost::is_sorted(ascending) ); in test_is_sorted_impl()
42 BOOST_CHECK( !boost::is_sorted(ascending, std::greater<std::size_t>()) ); in test_is_sorted_impl()
|
| /external/rappor/ui/ |
| D | table-lib.js | 149 this.ascending = false; // if sortCol is sorted in ascending order
201 this.ascending = false; // if sortCol is sorted in ascending order
207 this.ascending = !this.ascending;
212 this.ascending = false;
220 var ascending;
222 ascending = true;
224 ascending = false;
232 this.ascending = ascending;
242 s += this.ascending ? 'a' : 'd';
249 setArrows(tHead, this.sortCol, this.ascending);
[all …]
|
| /external/pdfium/core/fxcrt/ |
| D | fx_extension_unittest.cpp | 199 const float ascending[] = {fMin, 1.0f, 2.0f, fMax, fInf, fNan}; in TEST() local
201 for (size_t i = 0; i < std::size(ascending); ++i) { in TEST()
202 for (size_t j = 0; j < std::size(ascending); ++j) { in TEST()
204 EXPECT_TRUE(FXSYS_SafeEQ(ascending[i], ascending[j])) in TEST()
207 EXPECT_FALSE(FXSYS_SafeEQ(ascending[i], ascending[j])) in TEST()
211 EXPECT_TRUE(FXSYS_SafeLT(ascending[i], ascending[j])) in TEST()
214 EXPECT_FALSE(FXSYS_SafeLT(ascending[i], ascending[j])) in TEST()
|
| /external/python/google-api-python-client/samples/searchforshopping/ |
| D | ranking.py | 19 text search query for 'digital camera' ranked by ascending price.
26 "modificationTime:ascending"
28 "price:ascending"
38 # this case by ascending price.
40 rankBy='price:ascending')
|
| /external/tensorflow/tensorflow/python/ops/ |
| D | sort_ops_test.py | 52 negative_axis=False, dtype=np.float32, direction='ASCENDING')
56 negative_axis=True, dtype=np.float32, direction='ASCENDING')
81 self._test_sort(arr, sort_axis, 'ASCENDING')
86 negative_axis=False, dtype=dtype, direction='ASCENDING')
94 self._test_sort(edges, 0, 'ASCENDING')
100 negative_axis=False, dtype=dtype, direction='ASCENDING')
105 self._test_sort(edges, 0, 'ASCENDING')
159 ascending = [0, 2, 3, 4, 1]
163 sort_ops.argsort(arr, direction='ASCENDING', stable=True), ascending)
|
| D | sort_ops.py | 31 def sort(values, axis=-1, direction='ASCENDING', name=None):
69 direction: The direction in which to sort the values (`'ASCENDING'` or
88 def argsort(values, axis=-1, direction='ASCENDING', stable=False, name=None):
131 direction: The direction in which to sort the values (`'ASCENDING'` or
159 direction: 'ASCENDING' or 'DESCENDING'.
242 """Sorts values in ascending order.
283 'ASCENDING': _ascending_sort,
|
| /external/sdv/vsomeip/third_party/boost/range/doc/reference/algorithm/ |
| D | inplace_merge.qbk | 36 …ists of two pieces each of which is in ascending order, and rearranges it so that the entire range…
62 * `[begin(rng), middle)` is in ascending order. That is for each pair of adjacent elements `[x,y]`,…
63 * `[middle, end(rng))` is in ascending order. That is for each pair of adjacent elements `[x,y]`, `…
68 * `[begin(rng), middle)` is in ascending order. That is for each pair of adjacent elements `[x,y]`,…
69 * `[middle, end(rng))` is in ascending order. That is for each pair of adjacent elements `[x,y]`, `…
|
| D | merge.qbk | 68 * The elements of `rng1` are in ascending order. That is, for each adjacent element pair `[x,y]` of…
69 * The elements of `rng2` are in ascending order. That is, for each adjacent element pair `[x,y]` of…
76 * The elements of `rng1` are in ascending order. That is, for each adjacent element pair `[x,y]`, o…
77 * The elements of `rng2` are in ascending order. That is, for each adjacent element pair `[x,y]`, o…
|
| D | sort.qbk | 26 `sort` sorts the elements in `rng` into ascending order. `sort` is not guaranteed to be stable. Ret…
28 For versions of the `sort` function without a predicate, ascending order is defined by `operator<()…
30 For versions of the `sort` function with a predicate, ascending order is defined by `pred` such tha…
|
| D | stable_sort.qbk | 26 `stable_sort` sorts the elements in `rng` into ascending order. `stable_sort` is guaranteed to be s…
28 For versions of the `stable_sort` function without a predicate ascending order is defined by `opera…
30 For versions of the `stable_sort` function with a predicate, ascending order is designed by `pred` …
|
| /external/lzma/CPP/7zip/UI/FileManager/ |
| D | ViewSettings.h | 25 bool Ascending; member
31 Ascending = true; in Clear()
38 Ascending(true), in CListViewInfo()
56 Ascending != info.Ascending) in IsEqual()
|
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| D | ElemSort.java | 37 * order %avt; "ascending"
212 * order specifies whether the strings should be sorted in ascending
220 * order specifies whether the strings should be sorted in ascending
221 * or descending order; ascending specifies ascending order; descending
222 * specifies descending order; the default is ascending.
233 * order specifies whether the strings should be sorted in ascending
234 * or descending order; ascending specifies ascending order; descending
235 * specifies descending order; the default is ascending.
|
| /external/cldr/tools/cldr-code/src/main/java/org/unicode/cldr/util/ |
| D | Counter.java | 153 public EntryComparator(boolean ascending, Comparator<T> byValue) { in EntryComparator() argument
154 countOrdering = ascending ? 1 : -1; in EntryComparator()
169 public Set<T> getKeysetSortedByCount(boolean ascending) { in getKeysetSortedByCount() argument
170 return getKeysetSortedByCount(ascending, null); in getKeysetSortedByCount()
173 public Set<T> getKeysetSortedByCount(boolean ascending, Comparator<T> byValue) { in getKeysetSortedByCount() argument
174 Set<Entry<T>> count_key = new TreeSet<>(new EntryComparator<>(ascending, byValue)); in getKeysetSortedByCount()
186 public Set<Row.R2<Long, T>> getEntrySetSortedByCount(boolean ascending, Comparator<T> byValue) { in getEntrySetSortedByCount() argument
187 Set<Entry<T>> count_key = new TreeSet<>(new EntryComparator<>(ascending, byValue)); in getEntrySetSortedByCount()
|
| D | Counter2.java | 108 public EntryComparator(boolean ascending, Comparator<T> byValue) { in EntryComparator() argument
109 countOrdering = ascending ? 1 : -1; in EntryComparator()
126 public Set<T> getKeysetSortedByCount(boolean ascending) { in getKeysetSortedByCount() argument
127 return getKeysetSortedByCount(ascending, null); in getKeysetSortedByCount()
130 public Set<T> getKeysetSortedByCount(boolean ascending, Comparator<T> byValue) { in getKeysetSortedByCount() argument
131 Set<Entry<T>> count_key = new TreeSet<>(new EntryComparator<>(ascending, byValue)); in getKeysetSortedByCount()
|
| /external/autotest/frontend/client/src/autotest/common/table/ |
| D | DataSource.java | 10 public static enum SortDirection {ASCENDING, DESCENDING} enumConstant
22 this(field, SortDirection.ASCENDING); in SortSpec()
26 return direction == SortDirection.ASCENDING ? 1 : -1; in getDirectionMultiplier()
50 return new SortSpec(sortString, SortDirection.ASCENDING); in fromString()
|
| D | DynamicTable.java | 43 image.setUrl(direction == SortDirection.ASCENDING ? SORT_UP_IMAGE : SORT_DOWN_IMAGE); in sortOn()
124 * @param sortDirection DynamicTable.ASCENDING or DynamicTable.DESCENDING
140 * Defaults to ascending order.
143 sortOnColumn(columnField, SortDirection.ASCENDING); in sortOnColumn()
314 SortDirection newSortDirection = SortDirection.ASCENDING; in onCellClicked()
330 return direction == SortDirection.ASCENDING ? in invertSortDirection()
331 SortDirection.DESCENDING : SortDirection.ASCENDING; in invertSortDirection()
|
| /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/google-cloud-java/java-dialogflow-cx/proto-google-cloud-dialogflow-cx-v3beta1/src/main/java/com/google/cloud/dialogflow/cx/v3beta1/ |
| D | RolloutConfigOrBuilder.java | 31 * ascending order.
44 * ascending order.
56 * ascending order.
68 * ascending order.
82 * ascending order.
|
| /external/google-cloud-java/java-dialogflow-cx/proto-google-cloud-dialogflow-cx-v3/src/main/java/com/google/cloud/dialogflow/cx/v3/ |
| D | RolloutConfigOrBuilder.java | 31 * ascending order.
43 * ascending order.
55 * ascending order.
67 * ascending order.
80 * ascending order.
|
| /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/collate/src/test/java/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/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/MCTargetDesc/ |
| D | HexagonShuffler.h | 53 // Check if the resources are in ascending slot order.
58 // Check if the resources are in ascending weight order.
122 // Check if the handles are in ascending order for shuffling purposes.
127 // Check if the handles are in ascending order by core slots.
132 // Check if the handles are in ascending order by HVX slots.
|
| /external/python/cpython3/Lib/test/ |
| D | test_uuid.py | 44 ascending = []
210 ascending.append(u)
213 for i in range(len(ascending)):
214 for j in range(len(ascending)):
215 equal(i < j, ascending[i] < ascending[j])
216 equal(i <= j, ascending[i] <= ascending[j])
217 equal(i == j, ascending[i] == ascending[j])
218 equal(i > j, ascending[i] > ascending[j])
219 equal(i >= j, ascending[i] >= ascending[j])
220 equal(i != j, ascending[i] != ascending[j])
[all …]
|