HomeSort by relevance Sort by last modified time
    Searched full:ascending (Results 26 - 50 of 954) sorted by null

12 3 4 5 6 7 8 91011>>

  /packages/apps/Gallery/src/com/android/camera/gallery/
BaseImageList.java 220 // The list is first sorted by date, then by id. The order can be ascending
225 String ascending = local
240 return dateExpr + ascending + ", _id" + ascending;
  /packages/inputmethods/LatinIME/native/jni/src/utils/
ngram_utils.h 36 const NgramType ASCENDING[] = {
  /prebuilts/gdb/darwin-x86/lib/python2.7/test/
sortperf.py 76 /sort: ascending data
77 3sort: ascending, then 3 random exchanges
78 +sort: ascending, then 10 random at the end
79 %sort: ascending, then randomly replace 1% of the elements w/ random values
  /prebuilts/gdb/linux-x86/lib/python2.7/test/
sortperf.py 76 /sort: ascending data
77 3sort: ascending, then 3 random exchanges
78 +sort: ascending, then 10 random at the end
79 %sort: ascending, then randomly replace 1% of the elements w/ random values
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
sortperf.py 76 /sort: ascending data
77 3sort: ascending, then 3 random exchanges
78 +sort: ascending, then 10 random at the end
79 %sort: ascending, then randomly replace 1% of the elements w/ random values
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
sortperf.py 76 /sort: ascending data
77 3sort: ascending, then 3 random exchanges
78 +sort: ascending, then 10 random at the end
79 %sort: ascending, then randomly replace 1% of the elements w/ random values
  /frameworks/base/core/java/android/util/
LongSparseArray.java 48 * <code>keyAt(int)</code> with ascending values of the index will return the
49 * keys in ascending order, or the values corresponding to the keys in ascending
230 * <p>The keys corresponding to indices in ascending order are guaranteed to
231 * be in ascending order, e.g., <code>keyAt(0)</code> will return the
248 * <p>The values corresponding to indices in ascending order are guaranteed
249 * to be associated with keys in ascending order, e.g.,
SparseBooleanArray.java 42 * <code>keyAt(int)</code> with ascending values of the index will return the
43 * keys in ascending order, or the values corresponding to the keys in ascending
159 * <p>The keys corresponding to indices in ascending order are guaranteed to
160 * be in ascending order, e.g., <code>keyAt(0)</code> will return the
173 * <p>The values corresponding to indices in ascending order are guaranteed
174 * to be associated with keys in ascending order, e.g.,
SparseArray.java 48 * <code>keyAt(int)</code> with ascending values of the index will return the
49 * keys in ascending order, or the values corresponding to the keys in ascending
267 * <p>The keys corresponding to indices in ascending order are guaranteed to
268 * be in ascending order, e.g., <code>keyAt(0)</code> will return the
288 * <p>The values corresponding to indices in ascending order are guaranteed
289 * to be associated with keys in ascending order, e.g.,
  /external/apache-xml/src/main/java/org/apache/xalan/templates/
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
    [all...]
  /packages/apps/Gallery2/src/com/android/gallery3d/ingest/data/
MtpDeviceIndex.java 33 * would be a bit different from simply reversing the ascending list, since the
38 * ascending and descending views of the data:
76 ASCENDING, DESCENDING
248 if (order == SortOrder.ASCENDING) {
278 if (order == SortOrder.ASCENDING) {
339 if (order == SortOrder.ASCENDING) {
371 if (order == SortOrder.ASCENDING) {
388 if (order == SortOrder.ASCENDING) {
405 if (order == SortOrder.ASCENDING) {
424 return (order == SortOrder.ASCENDING) ? results.buckets : results.reversedBuckets
    [all...]
  /frameworks/base/core/java/android/bluetooth/le/
BluetoothLeUtils.java 93 // Keys are guaranteed in ascending order when indices are in ascending order.
  /external/autotest/client/site_tests/camera_V4L2/src/
camera_characteristics.h 19 // 2. camera id should be in ascending order (i.e., 0, 1, 2, ...).
  /external/junit/src/main/java/org/junit/internal/
MethodSorter.java 25 * Method name ascending lexicographic sort order, with {@link Method#toString()} as a tiebreaker
  /external/libjpeg-turbo/
jversion.h 32 * most recent contribution to the project, then in ascending order of the
  /external/pdfium/core/fpdfapi/edit/
cpdf_creator.h 98 std::vector<uint32_t> m_NewObjNumArray; // Sorted, ascending.
  /frameworks/av/media/libmedia/include/media/
StringArray.h 52 // Pass this to the sort routine to do an ascending alphabetical sort.
  /frameworks/base/libs/androidfw/
AssetDir.cpp 31 * Assumes the vector is sorted in ascending order.
  /libcore/jsr166-tests/src/test/java/jsr166/
ConcurrentSkipListMapTest.java 1085 int min, int max, boolean ascending) {
1086 check(map, min, max, ascending);
1087 check(map.descendingMap(), min, max, !ascending);
1090 check(map, min, max, ascending);
1091 check(map.descendingMap(), min, max, !ascending);
    [all...]
TreeMapTest.java 890 int min, int max, boolean ascending) {
891 check(map, min, max, ascending);
892 check(map.descendingMap(), min, max, !ascending);
895 check(map, min, max, ascending);
896 check(map.descendingMap(), min, max, !ascending);
906 if (ascending) {
923 if (ascending) {
946 if (ascending) {
971 final int min, final int max, final boolean ascending) {
974 return ascending ? lowerAscending(key) : higherAscending(key)
    [all...]
  /system/extras/iotop/
iotop.cpp 58 static auto comparator = [](auto& lhs, auto& rhs, auto field, bool ascending) -> bool {
63 return ascending ^ (a < b);
70 auto make_sorter = [](auto field, bool ascending) {
73 auto bound_comparator = std::bind(comparator, _1, _2, field, ascending);
  /packages/inputmethods/LatinIME/native/jni/src/dictionary/header/
header_policy.cpp 137 for (const auto ngramType : AllNgramTypes::ASCENDING) {
164 for (const auto ngramType : AllNgramTypes::ASCENDING) {
174 for (const auto ngramType : AllNgramTypes::ASCENDING) {
  /libcore/ojluni/src/main/java/java/util/
SortedMap.java 228 * The set's iterator returns the keys in ascending order.
241 * ascending order
247 * The collection's iterator returns the values in ascending order
261 * sorted in ascending key order
267 * The set's iterator returns the entries in ascending key order.
281 * sorted in ascending key order
  /cts/tests/tests/location/protos/
ephemeris.proto 70 // Longitude of ascending node of orbit plane at the beginning of week.
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/
test_uuid.py 18 ascending = []
179 ascending.append(u)
182 for i in range(len(ascending)):
183 for j in range(len(ascending)):
184 equal(cmp(i, j), cmp(ascending[i], ascending[j]))
186 # Test sorting of UUIDs (above list is in ascending order).
187 resorted = ascending[:]
190 equal(ascending, resorted)

Completed in 1055 milliseconds

12 3 4 5 6 7 8 91011>>