| /third_party/mindspore/tests/st/ops/cpu/ |
| D | test_rank_op.py | 42 def __init__(self, axis: int, method: str, na_option: str, ascending: bool, pct: bool):
47 self.ascending = validator.check_value_type("ascending", ascending, [bool], self.name)
62 def __init__(self, axis: int, method: str, na_option: str, ascending: bool, pct: bool):
64 self.rank = Rank(axis, method, na_option, ascending, pct)
82 def test_rank_1d(shape: List[int], dtype, method: str, ascending: bool, pct: bool, na_option: str):
91 …pd_result = pandas_rank(arr, method=method, ascending=ascending, pct=pct, na_option=na_option).fla…
92 rank = RankNet(0, method=method, ascending=ascending, pct=pct, na_option=na_option)
109 def test_rank_2d(shape: List[int], dtype, method: str, ascending: bool, pct: bool, axis: int, na_op…
118 …pd_result = pandas_rank(arr, method=method, ascending=ascending, pct=pct, na_option=na_option, axi…
119 rank = RankNet(axis=axis, method=method, ascending=ascending, pct=pct, na_option=na_option)
|
| /third_party/boost/boost/multi_array/ |
| D | storage_order.hpp | 38 AscendingIter ascending) { in general_storage_order() argument
40 boost::detail::multi_array::copy_n(ascending,NumDims,ascending_.begin()); in general_storage_order()
62 bool ascending(size_type dim) const { return ascending_[dim]; } in ascending() function in boost::general_storage_order
89 boost::array<bool,NumDims> ascending; in operator general_storage_order<NumDims>() local
93 ascending[i] = true; in operator general_storage_order<NumDims>()
96 ascending.begin()); in operator general_storage_order<NumDims>()
111 boost::array<bool,NumDims> ascending; in operator general_storage_order<NumDims>() local
115 ascending[i] = true; in operator general_storage_order<NumDims>()
118 ascending.begin()); in operator general_storage_order<NumDims>()
|
| /third_party/flutter/flutter/examples/flutter_gallery/lib/demo/material/ |
| D | data_table_demo.dart | 82 void _sort<T>(Comparable<T> getField(Dessert d), bool ascending) {
84 if (!ascending) {
158 void _sort<T>(Comparable<T> getField(Dessert d), int columnIndex, bool ascending) {
159 _dessertsDataSource._sort<T>(getField, ascending);
162 _sortAscending = ascending;
189 …onSort: (int columnIndex, bool ascending) => _sort<String>((Dessert d) => d.name, columnIndex, asc…
195 …onSort: (int columnIndex, bool ascending) => _sort<num>((Dessert d) => d.calories, columnIndex, as…
200 …onSort: (int columnIndex, bool ascending) => _sort<num>((Dessert d) => d.fat, columnIndex, ascendi…
205 …onSort: (int columnIndex, bool ascending) => _sort<num>((Dessert d) => d.carbs, columnIndex, ascen…
210 …onSort: (int columnIndex, bool ascending) => _sort<num>((Dessert d) => d.protein, columnIndex, asc…
[all …]
|
| /third_party/boost/libs/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()
|
| /third_party/boost/libs/multi_array/test/ |
| D | storage_order.cpp | 80 bool ascending[] = {true,true,true}; in main() local
83 array A(extents[2][3][4], storage(ordering,ascending)); in main()
100 bool ascending[] = {true,true,true}; in main() local
103 array A(extents[2][3][4], storage(ordering,ascending)); in main()
133 bool ascending[] = {false,true,true}; in main() local
136 array A(extents[2][3][4], storage(ordering,ascending)); in main()
|
| D | storage_order_convert.cpp | 28 array<bool,5> ascending = {{true,true,true,true,true}}; in main() local
30 ascending.begin()); in main()
32 ascending.begin()); in main()
|
| D | generative_tests.hpp | 226 bool ascending[] = {false,true,true,true}; in run_storage_tests() local
227 run_configuration(boost::general_storage_order<3>(ordering,ascending), in run_storage_tests()
228 boost::general_storage_order<4>(ordering,ascending), in run_storage_tests()
|
| /third_party/node/deps/npm/node_modules/asynckit/ |
| D | serialOrdered.js | 9 module.exports.ascending = ascending;
60 function ascending(a, b) function
74 return -1 * ascending(a, b);
|
| /third_party/boost/libs/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 | 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` …
|
| 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 | binary_search.qbk | 46 `rng` is ordered in ascending order according to `operator<`.
50 `rng` is ordered in ascending order according to the function object `pred`.
|
| D | upper_bound.qbk | 78 `rng` is sorted in ascending order according to `operator<`.
82 `rng` is sorted in ascending order according to `pred`.
|
| D | set_intersection.qbk | 69 `rng1` and `rng2` are sorted in ascending order according to `operator<`.
73 `rng1` and `rng2` are sorted in ascending order according to `pred`.
|
| D | set_union.qbk | 68 `rng1` and `rng2` are sorted in ascending order according to `operator<`.
72 `rng1` and `rng2` are sorted in ascending order according to `pred`.
|
| D | includes.qbk | 57 `rng1` and `rng2` are sorted in ascending order according to `operator<`.
61 `rng1` and `rng2` are sorted in ascending order according to `pred`.
|
| D | set_symmetric_difference.qbk | 71 `rng1` and `rng2` are sorted in ascending order according to `operator<`.
75 `rng1` and `rng2` are sorted in ascending order according to `pred`.
|
| /third_party/python/Lib/test/ |
| D | test_uuid.py | 36 ascending = []
202 ascending.append(u)
205 for i in range(len(ascending)):
206 for j in range(len(ascending)):
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])
212 equal(i != j, ascending[i] != ascending[j])
[all …]
|
| /third_party/icu/ohos_icu4j/src/main/tests/ohos/global/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()
|
| /third_party/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()
|
| /third_party/boost/boost/compute/algorithm/detail/ |
| D | radix_sort.hpp | 256 const bool ascending, in radix_sort_impl() argument
309 if(ascending){ in radix_sort_impl()
448 const bool ascending, in radix_sort() argument
451 radix_sort_impl(first, last, buffer_iterator<int>(), ascending, queue); in radix_sort()
458 const bool ascending, in radix_sort_by_key() argument
461 radix_sort_impl(keys_first, keys_last, values_first, ascending, queue); in radix_sort_by_key()
|
| /third_party/boost/libs/compute/include/boost/compute/algorithm/detail/ |
| D | radix_sort.hpp | 256 const bool ascending, in radix_sort_impl() argument
309 if(ascending){ in radix_sort_impl()
448 const bool ascending, in radix_sort() argument
451 radix_sort_impl(first, last, buffer_iterator<int>(), ascending, queue); in radix_sort()
458 const bool ascending, in radix_sort_by_key() argument
461 radix_sort_impl(keys_first, keys_last, values_first, ascending, queue); in radix_sort_by_key()
|
| /third_party/node/deps/npm/node_modules/asynckit/lib/ |
| D | readable_serial_ordered.js | 6 module.exports.ascending = serialOrdered.ascending;
|
| /third_party/flutter/flutter/packages/flutter/test/material/ |
| D | data_table_test.dart | 30 onSort: (int columnIndex, bool ascending) {
31 log.add('column-sort: $columnIndex $ascending');
292 onSort: (int columnIndex, bool ascending) {},
328 onSort: (int columnIndex, bool ascending) {},
413 onSort: (int columnIndex, bool ascending) {},
419 onSort: (int columnIndex, bool ascending) {},
520 onSort: (int columnIndex, bool ascending) {},
526 onSort: (int columnIndex, bool ascending) {},
634 onSort: (int columnIndex, bool ascending) {},
640 onSort: (int columnIndex, bool ascending) {},
[all …]
|