| /external/llvm/test/Object/ |
| coff-archive-short.test | 8 RUN: llvm-nm --numeric-sort -s %p/Inputs/coff_archive_short.lib | FileCheck -check-prefix=CHECKIDX %s
|
| /external/llvm/utils/ |
| UpdateCMakeLists.pl | 53 foreach my $file (sort @$files) {
109 foreach my $dir (sort keys %dirCMake) {
|
| /external/openssl/crypto/objects/ |
| objxref.pl | 40 my @srt1 = sort { $oid_tbl{$a} <=> $oid_tbl{$b}} @xrkeys;
47 my @srt2 = sort
|
| /external/stlport/test/unit/ |
| includes_test.cpp | 77 sort(v1.begin(), v1.end(), compare_strings);
78 sort(v2.begin(), v2.end(), compare_strings);
|
| collate_facets_test.cpp | 65 sort(strs, strs + 4, loc);
71 sort(transformed, transformed + 4);
116 sort(strs, strs + 4, loc);
122 sort(transformed, transformed + 4);
237 sort(v1.begin(), v1.end(), loc);
239 sort(v2.begin(), v2.end(), locale::classic());
|
| /external/v8/test/mjsunit/regress/ |
| regress-1360.js | 28 // Check the receiver for the sort and replace functions to
29 // Array.prototype.sort and String.prototype.replace.
35 [1,2,3].sort(strict);
36 [1,2,3].sort(non_strict);
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| includes_test.cpp | 77 sort(v1.begin(), v1.end(), compare_strings);
78 sort(v2.begin(), v2.end(), compare_strings);
|
| /ndk/tests/device/test-stlport/unit/ |
| includes_test.cpp | 77 sort(v1.begin(), v1.end(), compare_strings);
78 sort(v2.begin(), v2.end(), compare_strings);
|
| /packages/apps/Bluetooth/src/com/android/bluetooth/map/ |
| BluetoothMapMessageListing.java | 99 public void sort() { method in class:BluetoothMapMessageListing
100 Collections.sort(list);
|
| /packages/apps/Camera2/src/com/android/camera/data/ |
| LocalDataList.java | 86 public void sort(Comparator<LocalData> comparator) { method in class:LocalDataList
87 Collections.sort(mList, comparator);
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/ui/ |
| ResourceContentProvider.java | 75 Arrays.sort(array);
105 Collections.sort(types);
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| IncludeFinderTest.java | 98 Collections.sort(includes);
123 Collections.sort(includes);
|
| /external/chromium_org/v8/test/webkit/ |
| array-sort-numericCompare.js | 25 "This tests that a call to array.sort(compareFunction) works correctly for numeric comparisons (arg1 - arg2), and also for things that might look like numeric comparisons."
38 shouldBe("[3,1,5,2,4].sort(doSort)", "[1,2,3,4,5]");
39 shouldBe("[3,1,5,2,4].sort(dontSort)", "[3,1,5,2,4]");
|
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| Arrays2Test.java | 116 * @tests java.util.Arrays#sort(double[])
119 // Test a basic sort
124 Arrays.sort(reversedArray);
130 // These have to sort as per the Double compare ordering
135 Arrays.sort(specials1);
140 assertTrue("Assert 1: specials sort incorrectly" + Arrays.asList(print1),
143 Arrays.sort(specials2);
148 assertTrue("Assert 2: specials sort incorrectly " + Arrays.asList(print2),
153 * @tests java.util.Arrays#sort(float[])
156 // Test a basic sort
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| NodeVector.java | 632 * Sort an array using a quicksort algorithm.
640 public void sort(int a[], int lo0, int hi0) throws Exception method in class:NodeVector
655 * sort a two element list by swapping if necessary
726 sort(a, lo0, lo - 1); method
727 sort(a, hi + 1, hi0); method
731 * Sort an array using a quicksort algorithm.
735 public void sort() throws Exception method in class:NodeVector
737 sort(m_map, 0, m_firstFree - 1); method
|
| /external/chromium/net/base/ |
| directory_lister.cc | 55 SORT_TYPE sort,
60 sort_(sort),
132 // Sort the results. See the TODO above (this sort should be removed and we
135 std::sort(e->data.begin(), e->data.end(), CompareDate);
137 std::sort(e->data.begin(), e->data.end(), CompareFullPath);
139 std::sort(e->data.begin(), e->data.end(), CompareAlphaDirsFirst);
|
| /external/chromium_org/third_party/protobuf/python/google/protobuf/internal/ |
| message_test.py | 314 message.repeated_int32.sort()
322 message.repeated_float.sort()
330 message.repeated_string.sort()
338 message.repeated_bytes.sort()
350 message.repeated_int32.sort(lambda x,y: cmp(abs(x), abs(y)))
358 message.repeated_string.sort(lambda x,y: cmp(len(x), len(y)))
364 """Check passing a custom comparator to sort a repeated composite field."""
373 message.repeated_nested_message.sort(lambda x,y: cmp(x.bb, y.bb))
382 """Check sorting a repeated composite field using list.sort() arguments."""
393 message.repeated_nested_message.sort(key=get_bb
[all...] |
| /external/chromium_org/v8/test/webkit/fast/js/kde/ |
| Array.js | 126 shouldBe("String([].sort())", "''")
127 shouldBe("String([3,1,'2'].sort())", "'1,2,3'");
128 shouldBe("String([,'x','aa'].sort())", "'aa,x,'");
129 shouldBe("String([,undefined,'x','aa'].sort())", "'aa,x,,'");
130 shouldBe("2 in [,undefined,'x','aa'].sort()", "true");
131 shouldBe("3 in [,undefined,'x','aa'].sort()", "false");
133 // sort by length
144 shouldBe("var a = ['aa', 'b', 'cccc', 'ddd']; String(a.sort(comp))", "'b,aa,ddd,cccc'");
147 shouldBe("[0, Infinity].sort(function(a, b) { return a - b }).toString()", "'0,Infinity'");
194 propnames.sort();
[all...] |
| /external/linux-tools-perf/scripts/perl/Perf-Trace-Util/lib/Perf/Trace/ |
| Core.pm | 39 foreach my $idx (sort {$a <=> $b} keys %trace_flags) {
69 foreach my $idx (sort {$a <=> $b} keys %{$flag_fields{$event_name}{$field_name}{"values"}}) {
109 foreach my $idx (sort {$a <=> $b} keys %{$flag_fields{$event}{$field}{"values"}}) {
121 foreach my $idx (sort {$a <=> $b} keys %{$symbolic_fields{$event_name}{$field_name}{"values"}}) {
155 foreach my $idx (sort {$a <=> $b} keys %{$symbolic_fields{$event}{$field}{"values"}}) {
|
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/settings/ |
| SettingsValues.java | 114 Arrays.sort(mSymbolsPrecededBySpace);
117 Arrays.sort(mSymbolsFollowedBySpace);
120 Arrays.sort(mWordConnectors);
188 Arrays.sort(mSymbolsPrecededBySpace);
190 Arrays.sort(mSymbolsFollowedBySpace);
192 Arrays.sort(mWordConnectors);
|
| /external/chromium_org/ui/base/l10n/ |
| l10n_util_collator.h | 72 sort(elements->begin(), elements->end(),
77 std::sort(elements->begin(), elements->end(),
136 sort(elements->begin() + begin_index, elements->begin() + end_index, c);
|
| /external/replicaisland/src/com/replica/replicaisland/ |
| FixedSizeArray.java | 183 * Searches the array for the specified object. If the array has been sorted with sort(),
184 * and if no other order-changing events have occurred since the sort (e.g. add()), a
240 * setComparator(), it will be used for the sort; otherwise the object's natural ordering will
243 * objects in the array has not changed since the last sort.
245 public void sort(boolean forceResort) {
248 mSorter.sort(mContents, mCount, mComparator);
250 DebugLog.d("FixedSizeArray", "No comparator specified for this type, using Arrays.sort().");
252 Arrays.sort(mContents, 0, mCount);
|
| /external/v8/test/message/ |
| testcfg.py | 110 mjsunit.sort()
111 regress.sort()
112 bugs.sort()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/rand/rand.dis/rand.dist.norm/rand.dist.norm.f/ |
| eval_param.pass.cpp | 65 std::sort(u.begin(), u.end());
84 std::sort(u.begin(), u.end());
103 std::sort(u.begin(), u.end());
|
| /external/chromium_org/v8/test/mjsunit/ |
| function-caller.js | 51 [Array.prototype.sort, Array.prototype.sort].sort(f); method
|
