| /external/stlport/test/unit/ |
| sort_test.cpp | 55 //Check that stable_sort do sort
117 sort(numbers, numbers + 6);
132 sort(numbers, numbers + count, greater<int>());
150 sort( boolVector.begin(), boolVector.end() );
158 * that can result in a bad sort algorithm behavior. The type
200 sort(numbers, numbers + sizeof(numbers) / sizeof(numbers[0]), less_equal<int>());
|
| /external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_tools_windows/tools/ |
| symshift.pl | 235 foreach $plane (sort numerically keys %table) {
238 foreach $shifted (sort numerically keys %{$intable{$table}}) {
246 foreach $plane (sort numerically keys %table) {
250 foreach $shifted (sort numerically keys %{$intable{$table}}) {
|
| /frameworks/native/opengl/libs/tools/ |
| genfiles | 45 | sort -t, -k2 \
58 | sort \
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/annotation/tests/java/lang/annotation/ |
| RetentionPolicyTest.java | 57 Arrays.sort(values);
|
| /libcore/luni/src/main/java/org/apache/harmony/luni/util/ |
| DeleteOnExit.java | 67 * Does the actual work. Note we (a) first sort the files lexicographically
73 Collections.sort(files);
|
| /ndk/build/tools/ |
| patch-sources.sh | 60 PATCHES=`(cd $PATCHES_DIR && find . -name "*.patch" | sort ) 2> /dev/null`
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/ |
| sort.pass.cpp | 12 // void sort();
32 c.sort();
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| sort_test.cpp | 55 //Check that stable_sort do sort
117 sort(numbers, numbers + 6);
132 sort(numbers, numbers + count, greater<int>());
150 sort( boolVector.begin(), boolVector.end() );
158 * that can result in a bad sort algorithm behavior. The type
200 sort(numbers, numbers + sizeof(numbers) / sizeof(numbers[0]), less_equal<int>());
|
| /ndk/tests/device/test-stlport/unit/ |
| sort_test.cpp | 55 //Check that stable_sort do sort
117 sort(numbers, numbers + 6);
132 sort(numbers, numbers + count, greater<int>());
150 sort( boolVector.begin(), boolVector.end() );
158 * that can result in a bad sort algorithm behavior. The type
200 sort(numbers, numbers + sizeof(numbers) / sizeof(numbers[0]), less_equal<int>());
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| dircache.py | 31 list.sort()
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/idlelib/ |
| Delegator.py | 25 keys.sort()
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| dircache.py | 31 list.sort()
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/idlelib/ |
| Delegator.py | 25 keys.sort()
|
| /external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/common/ |
| filetestcase.py | 95 messages.sort()
107 error_msgs.sort()
|
| /external/chromium_org/third_party/WebKit/Tools/Scripts/ |
| check-for-exit-time-destructors | 71 for my $file (sort @files) {
144 for my $function (sort keys %functions) {
|
| /external/chromium_org/third_party/closure_linter/closure_linter/common/ |
| filetestcase.py | 95 messages.sort()
107 error_msgs.sort()
|
| /external/chromium_org/third_party/openssl/openssl/crypto/objects/ |
| objxref.pl | 40 my @srt1 = sort { $oid_tbl{$a} <=> $oid_tbl{$b}} @xrkeys;
47 my @srt2 = sort
|
| /external/chromium_org/third_party/sqlite/src/test/ |
| collate9.test | 24 db collate "reverse sort" reverse_sort
27 # opcode was executed. If an OP_Sort did occur, then "sort" is appended
36 if {$::sqlite_sort_count} {set x sort} {set x nosort}
51 CREATE TABLE xy(x COLLATE "reverse sort", y COLLATE binary);
71 } {two three one sort}
95 SELECT y, y COLLATE "reverse sort" < 'seven' FROM xy ORDER BY x
105 SELECT y FROM xy ORDER BY y COLLATE "reverse sort"
110 SELECT y COLLATE "reverse sort" AS aaa FROM xy ORDER BY aaa
116 CREATE INDEX xy_i2 ON xy(y COLLATE "reverse sort");
123 } {one three two sort}
[all...] |
| /external/chromium_org/v8/test/intl/ |
| testcfg.py | 44 dirs.sort()
45 files.sort()
|
| /external/chromium_org/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);
|
| /external/chromium_org/v8/test/webkit/ |
| sort-randomly.js | 25 "This tests that passing an inconsistent compareFn to sort() doesn't cause a crash."
32 arr.sort(function() { return 0.5 - Math.random(); });
35 // Sorting objects that change each time sort() looks at them is the same as using a random compareFn.
44 arr.sort();
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| ComplexSchur_MKL.h | 67 char jobvs, sort='N'; \
75 info = LAPACKE_##MKLPREFIX##gees( matrix_order, jobvs, sort, select, n, (MKLTYPE*)m_matT.data(), lda, &sdim, (MKLTYPE*)w.data(), (MKLTYPE*)m_matU.data(), ldvs ); \
|
| RealSchur_MKL.h | 56 char jobvs, sort='N'; \
64 info = LAPACKE_##MKLPREFIX##gees( matrix_order, jobvs, sort, select, n, (MKLTYPE*)m_matT.data(), lda, &sdim, (MKLTYPE*)wr.data(), (MKLTYPE*)wi.data(), (MKLTYPE*)m_matU.data(), ldvs ); \
|
| /external/genext2fs/ |
| test-mount.sh | 68 sort -d -k3.6 > fout
73 sort -d -k3.6 > lsout
|
| /external/linux-tools-perf/scripts/perl/ |
| rw-by-file.pl | 57 foreach my $fd (sort {$reads{$b}{bytes_requested} <=>
69 foreach my $fd (sort {$writes{$b}{bytes_written} <=>
|
