/external/eigen/bench/btl/generic_bench/timers/ |
STL_timer.hh | 62 sort(iterations.begin(), iterations.end());
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
TestEnumSetGenerator.java | 60 Collections.sort(insertionOrder);
|
/external/icu/icu4c/source/layout/ |
OpenTypeUtilities.h | 33 static void sort(le_uint16 *array, le_int32 count);
|
/external/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/ |
sort.pass.cpp | 12 // void sort(); 32 c.sort();
|
/external/linux-tools-perf/perf-3.12.0/tools/perf/scripts/perl/ |
rw-by-pid.pl | 82 foreach my $pid (sort { ($reads{$b}{bytes_read} || 0) <=> 109 @errcounts = sort { $b->[3] <=> $a->[3] } @errcounts; 123 foreach my $pid (sort { ($writes{$b}{bytes_written} || 0) <=> 149 @errcounts = sort { $b->[3] <=> $a->[3] } @errcounts;
|
rw-by-file.pl | 57 foreach my $fd (sort {$reads{$b}{bytes_requested} <=> 69 foreach my $fd (sort {$writes{$b}{bytes_written} <=>
|
/external/lldb/test/example/ |
TestSequenceFunctions.py | 20 self.seq.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/boringssl/src/crypto/obj/ |
obj_xref.pl | 40 my @srt1 = sort { $oid_tbl{$a} <=> $oid_tbl{$b}} @xrkeys; 47 my @srt2 = sort
|
/external/chromium_org/third_party/closure_linter/closure_linter/common/ |
filetestcase.py | 94 messages.sort() 107 error_msgs.sort()
|
/external/chromium_org/third_party/closure_linter/closure_linter/ |
errorrules_test.py | 99 error_nums.sort() 100 expected_errors.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/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();
|
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/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/llvm/test/Object/ |
coff-archive-short.test | 8 RUN: llvm-nm --numeric-sort -M %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/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_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...] |