HomeSort by relevance Sort by last modified time
    Searched refs:sort (Results 201 - 225 of 555) sorted by null

1 2 3 4 5 6 7 891011>>

  /build/core/
config.mk 323 # on each line for sort to process.
324 # sort -g is a numeric sort, so 1 2 3 10 instead of 1 10 2 3.
326 # Numerically sort a list of numbers
332 ( sgrax $(1) | sort -g ) )
base_rules.mk 56 #$(shell echo $(lastword $(filter-out config/% out/%,$(MAKEFILE_LIST))),$(LOCAL_MODULE),$(strip $(LOCAL_MODULE_CLASS)),$(subst $(space),$(comma),$(sort $(LOCAL_MODULE_TAGS))) >> tag-list.csv)
58 LOCAL_MODULE_TAGS := $(sort $(LOCAL_MODULE_TAGS))
88 LOCAL_MODULE_TAGS := $(sort $(LOCAL_MODULE_TAGS) user)
514 ALL_MODULE_TAGS := $(sort $(ALL_MODULE_TAGS) $(LOCAL_MODULE_TAGS))
  /packages/apps/Settings/src/com/android/settings/battery_history/
BatteryHistory.java 310 Collections.sort(names);
563 Collections.sort(mCpuUsage);
580 Collections.sort(mNetworkUsage);
631 Collections.sort(mGpsUsage);
632 Collections.sort(mSensorUsage);
669 Collections.sort(mWakelockUsage);
743 Collections.sort(mMiscUsage);
  /build/tools/releasetools/
check_target_files_signatures 291 x.sort()
322 order.sort()
327 apks.sort()
  /external/stlport/test/unit/
list_test.cpp 141 str.sort();
405 //We check that sort implementation is correct when list is instanciated
408 lint1.sort();
409 lint1.sort(greater<int>());
  /frameworks/base/awt/org/apache/harmony/awt/gl/render/
JavaShapeRasterizer.java 241 * Sort buffers
243 void sort(int[] master, int[] slave, int length) { method in class:JavaShapeRasterizer
337 // Sort edgesY and edgesN
338 sort(edgesYS, edgesN, edgesCount); method
460 // Sort X crossings
461 sort(crossX, crossDY, crossCount); method
  /dalvik/dx/src/com/android/dx/dex/file/
AnnotationItem.java 91 * @param array {@code non-null;} array to sort
94 Arrays.sort(array, TYPE_ID_SORTER);
  /dalvik/libcore/luni/src/main/java/java/io/
ObjectStreamClass.java 464 // Only attempt to sort if really needed (saves object
471 Arrays.sort(interfaces, interfaceComparator);
482 // Only attempt to sort if really needed (saves object creation,
489 Arrays.sort(fields, fieldComparator);
525 // Only attempt to sort if really needed (saves object creation,
529 // All constructors have same name, so we sort based on
535 Arrays.sort(constructors, constructorComparator);
575 Arrays.sort(methods, methodComparator);
    [all...]
ObjectStreamField.java 339 // Sort if necessary
346 Arrays.sort(fields, fieldDescComparator);
  /dalvik/libcore/luni/src/main/java/java/util/
TimSort.java 23 * on random arrays. Like all proper mergesorts, this sort is stable and
24 * runs O(n log n) time (worst case). In the worst case, this sort requires
28 * This implementation was adapted from Tim Peters's list sort for
47 * sort, assuming the input array is large enough to warrant the full-blown
48 * TimSort. Small arrays are sorted in place, using a binary insertion sort.
76 * The comparator for this sort.
129 * Creates a TimSort instance to maintain the state of an ongoing sort.
132 * @param c the comparator to determine the order of the sort
168 static <T> void sort(T[] a, Comparator<? super T> c) { method in class:TimSort
169 sort(a, 0, a.length, c) method
172 static <T> void sort(T[] a, int lo, int hi, Comparator<? super T> c) { method in class:TimSort
    [all...]
  /dalvik/libcore/luni/src/test/java/tests/api/java/util/
TreeMapTest.java 426 SortedMap sort = tm.headMap("100"); local
428 sort.headMap("50");
748 SortedMap sort = tm.tailMap("99"); local
751 sort.tailMap("101");
  /dalvik/libcore/security/src/main/java/org/apache/harmony/security/x501/
Name.java 191 Collections.sort(sortedList,
  /dalvik/libcore/security/src/main/java/org/bouncycastle/asn1/
ASN1Collection.java 128 * Sets the element at a given index (used by {@link #sort}).
200 protected void sort() { method in class:ASN1Collection
207 // TODO: This is bubble sort. Probably not the best choice.
  /development/apps/Development/src/com/android/development/
AppHwConfigList.java 99 Collections.sort(mList, sDisplayNameComparator);
AppPicker.java 108 Collections.sort(mPackageInfoList, sDisplayNameComparator);
InstrumentationList.java 54 Collections.sort(mList, new InstrumentationInfo.DisplayNameComparator(mPM));
RunningProcesses.java 90 Collections.sort(mList, sDisplayNameComparator);
  /development/samples/ApiDemos/src/com/example/android/apis/
ApiDemos.java 105 Collections.sort(myData, sDisplayNameComparator);
  /development/tools/zoneinfo/
ZoneCompactor.java 135 Collections.sort(l);
  /external/emma/core/java12/com/vladium/jcd/cls/
ClassDef.java 320 Arrays.sort (ifcs);
349 Arrays.sort (fds, 0, fcount);
418 Arrays.sort (cds, 0, ccount);
432 Arrays.sort (mds, 0, mcount);
  /external/icu4c/layout/
OpenTypeUtilities.cpp 157 // Straight insertion sort from Knuth vol. III, pg. 81
159 void OpenTypeUtilities::sort(le_uint16 *array, le_int32 count) function in class:OpenTypeUtilities
  /external/stlport/stlport/stl/debug/
_list.h 429 void sort() { function in class:list
430 _M_non_dbg_impl.sort();
480 void sort(_StrictWeakOrdering __comp) { function in class:list
481 _M_non_dbg_impl.sort(__comp);
  /external/stlport/stlport/stl/pointers/
_slist.h 386 void sort() {_M_impl.sort(); } function in class:slist
402 void sort(_StrictWeakOrdering __comp) function in class:slist
403 { _M_impl.sort(_STLP_PRIV _BinaryPredWrapper<_StorageType, _Tp, _StrictWeakOrdering>(__comp)); }
  /external/v8/test/mjsunit/
debug-clearbreakpointgroup.js 115 assertEquals([bp2, bp3, bp5].sort(), breakpointNumbers.sort());
mjsunit.js 61 aProps.sort();
62 bProps.sort();

Completed in 1968 milliseconds

1 2 3 4 5 6 7 891011>>