| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| TestEnumMultisetGenerator.java | 64 Collections.sort(insertionOrder);
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| ForwardingSortedMapTest.java | 130 return sort(insertionOrder);
152 return sort(insertionOrder);
173 return sort(insertionOrder);
184 private static Iterable<Entry<String, String>> sort(
|
| /external/icu4c/i18n/ |
| uspoof_conf.h | 48 // This is sort of like a sorted set of strings, except that ICU's anemic
67 // Sort the contents; affects the ordering of getByIndex().
68 void sort(UErrorCode &status);
|
| /external/javassist/src/main/javassist/ |
| SerialVersionUID.java | 102 Arrays.sort(interfaces);
108 Arrays.sort(fields, new Comparator() {
136 Arrays.sort(constructors, new Comparator() {
157 Arrays.sort(methods, new Comparator() {
|
| /external/jmonkeyengine/engine/src/core/com/jme3/renderer/queue/ |
| GeometryList.java | 130 public void sort() { method in class:GeometryList
132 // sort the spatial list using the comparator
135 // Arrays.sort(geometries, 0, size, comparator);
|
| /external/libvorbis/vq/ |
| distribution.c | 96 long **sort=calloc(bins,sizeof(long *)); local
100 for(i=0;i<bins;i++)sort[i]=c->quantlist+i;
101 qsort(sort,bins,sizeof(long *),ascend);
143 int ptr=sort[i]-c->quantlist;
|
| /external/openssl/crypto/objects/ |
| obj_dat.pl | 87 @a=sort { $a <=> $b } keys %nid;
149 foreach (sort { $sn{$nid{$a}} cmp $sn{$nid{$b}} } @a)
155 foreach (sort { $ln{$nid{$a}} cmp $ln{$nid{$b}} } @a)
161 foreach (sort obj_cmp @a)
|
| /external/replicaisland/src/com/replica/replicaisland/ |
| PhasedObjectManager.java | 52 getObjects().sort(true);
|
| QuickSorter.java | 22 public void sort(Type[] array, int count, Comparator<Type> comparator) { method in class:QuickSorter
27 // http://www.cs.princeton.edu/introcs/42sort/QuickSort.java.html
|
| ShellSorter.java | 23 * Shell sort implementation based on the one found here:
30 public void sort(Type[] array, int count, Comparator<Type> comparator) { method in class:ShellSorter
33 // Sort by insertion sort at diminishing increments.
49 * Insertion sort modified to sort elements at a
53 * 'if', but I found that it made the sort slower.
|
| /external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/ |
| XMPSerializerHelper.java | 44 // sort the internal data model on demand
47 xmp.sort();
|
| /frameworks/av/media/libmedia/ |
| StringArray.cpp | 29 // An expanding array of strings. Add, get, sort, delete.
86 // Sort the array.
88 void StringArray::sort(int (*compare)(const void*, const void*)) { function in class:android::StringArray
93 // Pass this to the sort routine to do an ascending alphabetical sort.
|
| /frameworks/base/media/java/android/media/ |
| CameraProfile.java | 106 Arrays.sort(levels); // Lower quality level ALWAYS comes before higher one
|
| /frameworks/ex/common/java/com/android/common/content/ |
| ProjectionMap.java | 59 Arrays.sort(columns);
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/annotation/tests/java/lang/annotation/ |
| ElementTypeTest.java | 62 Arrays.sort(values);
|
| /libcore/luni/src/test/java/libcore/java/util/ |
| OldTreeSetTest.java | 142 SortedSet sort = ts.headSet(new Integer(100)); local
144 sort.headSet(new Integer(101));
228 SortedSet sort = ts.tailSet(new Integer(101)); local
231 sort.tailSet(new Integer(100));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/binary.search/ |
| binary_search.pass.cpp | 45 std::sort(v.begin(), v.end());
|
| binary_search_comp.pass.cpp | 46 std::sort(v.begin(), v.end(), std::greater<int>());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/equal.range/ |
| equal_range.pass.cpp | 53 std::sort(v.begin(), v.end());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/lower.bound/ |
| lower_bound.pass.cpp | 48 std::sort(v.begin(), v.end());
|
| lower_bound_comp.pass.cpp | 49 std::sort(v.begin(), v.end(), std::greater<int>());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/upper.bound/ |
| upper_bound.pass.cpp | 48 std::sort(v.begin(), v.end());
|
| upper_bound_comp.pass.cpp | 49 std::sort(v.begin(), v.end(), std::greater<int>());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/ |
| sort_pred.pass.cpp | 12 // template <class Compare> void sort(Compare comp);
33 c.sort(std::greater<T>());
|
| /ndk/tests/build/check-armeabi-v7a-prebuilts/ |
| build.sh | 16 echo $(readelf -A "$1" | awk '$1 == "'$2':" { print $2; }' | sort -u | tr '\n' ' ')
|
