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

1 2 3 4 5 6 7 8 91011>>

  /external/autotest/frontend/client/src/autotest/common/table/
DataSource.java 10 public static enum SortDirection {ASCENDING, DESCENDING}
22 this(field, SortDirection.ASCENDING);
26 return direction == SortDirection.ASCENDING ? 1 : -1;
50 return new SortSpec(sortString, SortDirection.ASCENDING);
DynamicTable.java 43 image.setUrl(direction == SortDirection.ASCENDING ? SORT_UP_IMAGE : SORT_DOWN_IMAGE);
124 * @param sortDirection DynamicTable.ASCENDING or DynamicTable.DESCENDING
140 * Defaults to ascending order.
143 sortOnColumn(columnField, SortDirection.ASCENDING);
314 SortDirection newSortDirection = SortDirection.ASCENDING;
330 return direction == SortDirection.ASCENDING ?
331 SortDirection.DESCENDING : SortDirection.ASCENDING;
  /external/wpa_supplicant_8/src/ap/
vlan.h 17 int tagged[MAX_NUM_TAGGED_VLAN]; /* first k items, ascending order */
  /dalvik/libdex/
DexDebugInfo.h 43 * posCb is called in ascending address order.
44 * localCb is called in order of ascending end address.
  /external/webrtc/webrtc/system_wrappers/include/
sort.h 37 // Upon return it will be sorted in ascending order.
51 // Upon return it will be sorted in ascending order.
  /prebuilts/go/darwin-x86/src/sort/
example_search_test.go 12 // This example demonstrates searching a list sorted in ascending order.
28 // The approach is the same as searching a list in ascending order,
search.go 25 // For instance, given a slice data sorted in ascending order,
35 // x in an integer slice data sorted in ascending order:
81 // The slice must be sorted in ascending order.
90 // The slice must be sorted in ascending order.
99 // The slice must be sorted in ascending order.
  /prebuilts/go/linux-x86/src/sort/
example_search_test.go 12 // This example demonstrates searching a list sorted in ascending order.
28 // The approach is the same as searching a list in ascending order,
search.go 25 // For instance, given a slice data sorted in ascending order,
35 // x in an integer slice data sorted in ascending order:
81 // The slice must be sorted in ascending order.
90 // The slice must be sorted in ascending order.
99 // The slice must be sorted in ascending order.
  /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/collator/
Counter.java 114 public EntryComparator(boolean ascending, Comparator<T> byValue) {
115 countOrdering = ascending ? 1 : -1;
128 public Set<T> getKeysetSortedByCount(boolean ascending) {
129 return getKeysetSortedByCount(ascending, null);
132 public Set<T> getKeysetSortedByCount(boolean ascending, Comparator<T> byValue) {
133 Set<Entry<T>> count_key = new TreeSet<Entry<T>>(new EntryComparator<T>(ascending, byValue));
  /external/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/
Counter.java 113 public EntryComparator(boolean ascending, Comparator<T> byValue) {
114 countOrdering = ascending ? 1 : -1;
127 public Set<T> getKeysetSortedByCount(boolean ascending) {
128 return getKeysetSortedByCount(ascending, null);
131 public Set<T> getKeysetSortedByCount(boolean ascending, Comparator<T> byValue) {
132 Set<Entry<T>> count_key = new TreeSet<Entry<T>>(new EntryComparator<T>(ascending, byValue));
  /frameworks/base/core/java/android/util/
LongSparseLongArray.java 41 * <code>keyAt(int)</code> with ascending values of the index will return the
42 * keys in ascending order, or the values corresponding to the keys in ascending
164 * <p>The keys corresponding to indices in ascending order are guaranteed to
165 * be in ascending order, e.g., <code>keyAt(0)</code> will return the
178 * <p>The values corresponding to indices in ascending order are guaranteed
179 * to be associated with keys in ascending order, e.g.,
SparseIntArray.java 43 * <code>keyAt(int)</code> with ascending values of the index will return the
44 * keys in ascending order, or the values corresponding to the keys in ascending
164 * <p>The keys corresponding to indices in ascending order are guaranteed to
165 * be in ascending order, e.g., <code>keyAt(0)</code> will return the
178 * <p>The values corresponding to indices in ascending order are guaranteed
179 * to be associated with keys in ascending order, e.g.,
SparseLongArray.java 41 * <code>keyAt(int)</code> with ascending values of the index will return the
42 * keys in ascending order, or the values corresponding to the keys in ascending
179 * <p>The keys corresponding to indices in ascending order are guaranteed to
180 * be in ascending order, e.g., <code>keyAt(0)</code> will return the
193 * <p>The values corresponding to indices in ascending order are guaranteed
194 * to be associated with keys in ascending order, e.g.,
  /external/llvm/lib/Target/Hexagon/MCTargetDesc/
HexagonShuffler.h 45 // Check if the resources are in ascending slot order.
49 // Check if the resources are in ascending weight order.
118 // Check if the handles are in ascending order for shuffling purposes.
122 // Check if the handles are in ascending order by core slots.
126 // Check if the handles are in ascending order by HVX slots.
  /external/testng/eclipse-projects/beust.com/web/
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" />
  /sdk/eclipse/sites/external/web/
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" />
  /sdk/eclipse/sites/internal/web/
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" />
  /cts/tests/tests/widget/src/android/widget/cts/util/
TestUtilsMatchers.java 27 * Returns a matcher that matches lists of int values that are in ascending order.
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/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
  /external/guava/guava-tests/test/com/google/common/hash/
Crc32cHashFunctionTest.java 46 // Test 32 byte arrays of ascending.
47 byte[] ascending = new byte[32];
49 ascending[i] = (byte) i;
51 assertCrc(0x46dd794e, ascending);
  /external/python/cpython2/Lib/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
  /libcore/jsr166-tests/src/test/java/jsr166/
ConcurrentSkipListSetTest.java 780 int min, int max, boolean ascending,
782 check(set, min, max, ascending, bs);
783 check(set.descendingSet(), min, max, !ascending, bs); local
786 check(set, min, max, ascending, bs);
787 check(set.descendingSet(), min, max, !ascending, bs); local
797 if (ascending) {
814 if (ascending) {
837 if (ascending) {
862 final int min, final int max, final boolean ascending,
866 return ascending
    [all...]
TreeSetTest.java 783 int min, int max, boolean ascending) {
784 check(set, min, max, ascending);
785 check(set.descendingSet(), min, max, !ascending); local
788 check(set, min, max, ascending);
789 check(set.descendingSet(), min, max, !ascending); local
799 if (ascending) {
816 if (ascending) {
839 if (ascending) {
864 final int min, final int max, final boolean ascending) {
867 return ascending
    [all...]
  /packages/apps/DocumentsUI/tests/common/com/android/documentsui/bots/
SortHeaderBot.java 120 final boolean ascending = Matchers.present(
125 if (ascending) {
160 final boolean ascending =
165 if (ascending) {

Completed in 803 milliseconds

1 2 3 4 5 6 7 8 91011>>