| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_sort.py | 17 raw.sort(compare)
19 raw.sort()
103 s.sort(lambda a, b: int(random.random() * 3) - 1)
112 s.sort()
117 check("exception during sort left some permutation", x, s)
121 augmented.sort() # forced stable because ties broken by index
122 x = [e for e, i in augmented] # a stable sort of s
130 # bug 453523 -- list.sort() crasher.
132 # Mutations during a list sort should raise a ValueError.
143 self.assertRaises(ValueError, L.sort)
[all...] |
| /external/chromium_org/chrome/browser/resources/net_internals/ |
| events_view.html | 10 <td width=98%><input type="search" incremental id=events-view-filter-input title="Sort and filter"></td>
17 Sort options:
19 <li>sort:id (default)
20 <li>sort:desc
21 <li>sort:duration
22 <li>sort:type
23 <li>-sort:<option> Reverses sort order
41 <td id=events-view-sort-by-id>ID</td>
42 <td id=events-view-sort-by-source>Source Type</td
[all...] |
| /external/chromium/chrome/browser/resources/shared/js/cr/ui/table/ |
| table_data_model.js | 34 * array before sort.
74 * Returns current sort status.
75 * @return {!Object} Current sort status.
89 * This implementation runs sort after splice and creates permutation for
140 * This implementation runs sort after updating.
147 this.sort(this.sortStatus.field, this.sortStatus.direction);
151 * Creates sort status with given field and direction.
152 * @param {string} field Sort field.
153 * @param {string} direction Sort direction.
154 * @return {!Object} Created sort status
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/inspector/ |
| DEPS | 2 # In order to link modules as a separate dylib, we'll need to sort out
|
| /external/chromium_org/third_party/openssl/openssl/crypto/lhash/ |
| num.pl | 13 @a=sort {$a <=> $b } keys %num;
|
| /external/junit/src/org/junit/runner/manipulation/ |
| package-info.java | 2 * Provides classes to {@link org.junit.runner.manipulation.Filter filter} or {@link org.junit.runner.manipulation.Sorter sort} tests.
|
| /external/libvpx/libvpx/tools/ |
| gen_authors.sh | 9 $(git log --pretty=format:"%aN <%aE>" | sort | uniq)
|
| /external/openssl/crypto/lhash/ |
| num.pl | 13 @a=sort {$a <=> $b } keys %num;
|
| /external/qemu-pc-bios/bochs/bios/ |
| bios_usage | 2 gcc -E rombios.c | grep "^\.org" | sed -e 's/\.org //' | sed -e 's/ .*//' | sort >! temp.usage
|
| /frameworks/opt/vcard/tests/res/raw/ |
| v30_simple.vcf | 6 SORT-STRING:android
|
| /packages/apps/Contacts/tests/assets/ |
| v30_simple.vcf | 6 SORT-STRING:android
|
| /external/replicaisland/src/com/replica/replicaisland/ |
| 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/chromium_org/v8/test/mjsunit/regress/ |
| regress-326.js | 29 // Should sort non-array into equivalent of [37,42,undefined,,0]
32 Array.prototype.sort.call(nonArray);
35 assertEquals(37, nonArray[0], "sort smallest first");
36 assertEquals(42, nonArray[1], "sort largest last");
38 assertEquals(undefined, nonArray[2], "sort undefined after largest");
|
| /external/v8/test/mjsunit/regress/ |
| regress-326.js | 29 // Should sort non-array into equivalent of [37,42,undefined,,0]
32 Array.prototype.sort.call(nonArray);
35 assertEquals(37, nonArray[0], "sort smallest first");
36 assertEquals(42, nonArray[1], "sort largest last");
38 assertEquals(undefined, nonArray[2], "sort undefined after largest");
|
| /frameworks/av/media/libmedia/ |
| StringArray.h | 29 // An expanding array of strings. Add, get, sort, delete.
47 // Sort the array.
49 void sort(int (*compare)(const void*, const void*));
52 // Pass this to the sort routine to do an ascending alphabetical sort.
|
| /cts/tools/signature-tools/src/signature/io/html/ |
| ClassOverviewPage.java | 99 Collections.sort(removedFields, fieldComparator);
103 Collections.sort(addedFields, fieldComparator);
107 Collections.sort(changedFields, fieldComparator);
113 Collections.sort(removedAnnotationFields, annotationfieldComparator);
117 Collections.sort(addedAnnotationFields, annotationfieldComparator);
121 Collections.sort(changedAnnotationFields, annotationfieldComparator);
127 Collections.sort(removedEnumConstants, enumConstantComparator);
131 Collections.sort(addedEnumConstants, enumConstantComparator);
135 Collections.sort(changedEnumConstants, enumConstantComparator);
141 Collections.sort(removedConstructors, constructorComparator)
[all...] |
| /external/chromium_org/third_party/sqlite/src/test/ |
| where7.test | 29 lappend r scan [db status step] sort [db status sort]
34 return "$r scan [db status step] sort [db status sort]"
56 } {2 3 scan 0 sort 1}
61 } {2 3 scan 4 sort 0}
66 } {2 3 scan 4 sort 0}
71 } {2 3 scan 0 sort 1}
76 } {2 3 scan 0 sort 1}
81 } {2 5 scan 0 sort 0
[all...] |
| /external/oprofile/pp/ |
| opreport_options.cpp | 59 vector<string> sort; member in namespace:__anon24412
75 popt::option(sort, "sort", 's',
76 "sort by", "sample,image,app-name,symbol,debug,vma"),
77 popt::option(options::reverse_sort, "reverse-sort", 'r',
78 "use reverse sort"),
117 if (options::xml && !sort.empty()) {
118 cerr << "warning: sort options ignored because they "
122 sort.clear();
125 if (sort.empty() || options::xml)
[all...] |
| /external/chromium_org/chrome/common/extensions/docs/examples/extensions/plugin_settings/domui/js/cr/ui/ |
| array_data_model.js | 75 * Returns current sort status.
76 * @return {!Object} Current sort status.
111 * This implementation runs sort after splice and creates permutation for
167 // change), and then sort again.
171 setTimeout(this.sort.bind(this, status.field, status.direction), 0);
195 * This runs sort after updating.
213 // We should first call prepareSort (data may change), and then sort.
216 setTimeout(this.sort.bind(this, status.field, status.direction), 0);
221 * Creates sort status with given field and direction.
222 * @param {string} field Sort field
[all...] |
| /external/compiler-rt/make/ |
| lib_info.mk | 18 AvailableModules := $(sort $(foreach key,$(SubDirKeys),\
25 AvailableArchs := $(sort $(foreach key,$(SubDirKeys),\
28 AvailableFunctions := $(sort $(foreach key,$(SubDirKeys),\
31 CommonFunctions := $(sort\
40 $(call Append,ArchFunctions.$(arch),$(sort \
45 $(call Set,ArchFunctions.$(arch),$(sort $(ArchFunctions.$(arch))))\
|
| /ndk/sources/host-tools/make-3.81/tests/scripts/functions/ |
| sort | 2 ."the ability of make to sort lists of object. Sort\n"
7 ."and includes some duplicates. Make should sort all of the elements\n"
31 ."\t\@echo \$(sort \$(bar2) \$(foo) \$(addsuffix \$(s1), \$(bar) ) \$(t2) \$(bar2) \$(bar3))\n"
32 ."\t\@echo \$(sort \$(blank) \$(foo) \$(bar2) \$(t1) \$(p1) )\n"
33 ."\t\@echo \$(sort \$(foo) \$(bar2) \$(t1) \$(t4) \$(t5) \$(t7) \$(t6) )\n";
|
| /external/chromium_org/chrome/browser/extensions/ |
| OWNERS | 9 # a unique random sort (sort -R) of these owners.
|
| /external/chromium_org/third_party/WebKit/Source/build/scripts/templates/ |
| MakeQualifiedNames.h.tmpl | 17 {%- for tag in tags|sort %}
22 {%- for attr in attrs|sort %}
|
| /external/chromium_org/third_party/icu/source/test/perf/collationperf/ |
| readme.html | 18 <LI>Sort Key generation. Report on key lengths and key generation times.
21 <LI>Quick Sort. Report the time required to sort the file in memory, using the C library qsort function. The file
22 order is randomized prior to the sort.
53 -level n Sort level, 1 to 5, for Primary, Secndary, Tertiary, Quaternary, Identical
55 -keygen Sort Key Generation timing test
72 Sort Key Generation: total # of keys = 197704<BR>
73 Sort Key Generation: time per key = 4253 ns<BR>
|
| /external/chromium_org/third_party/icu/source/tools/genren/ |
| Makefile | 74 sorts: urename.sort urename.old.sort
76 @echo "Try 'diff --side-by-side urename.old.sort urename.sort'"
78 urename.sort: urename.h
79 sort urename.h > $@
81 urename.old.sort: $(TOP)/common/unicode/urename.h
82 sort $(TOP)/common/unicode/urename.h > $@
|
