| /external/proguard/src/proguard/classfile/editor/ |
| ClassMemberSorter.java | 41 // Sort the fields.
42 Arrays.sort(programClass.fields, 0, programClass.u2fieldsCount, this);
44 // Sort the methods.
45 Arrays.sort(programClass.methods, 0, programClass.u2methodsCount, this);
|
| /external/skia/tests/ |
| SortTest.cpp | 36 DEF_TEST(Sort, reporter) {
39 /** The reference sort of the random numbers. */
42 then this array is compared against the reference sort. */
50 // Use qsort as the reference sort.
|
| /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);
|
| /external/wpa_supplicant_8/hostapd/logwatch/ |
| hostapd | 41 foreach my $iface (sort keys %hostapd) {
43 foreach my $mac (sort keys %{$hostapd{$iface}}) {
45 foreach my $layer (sort keys %{$hostapd{$iface}->{$mac}}) {
47 foreach my $details (sort keys %{$hostapd{$iface}->{$mac}->{$layer}}) {
|
| /packages/apps/Contacts/res/values-ko/ |
| donottranslate_config.xml | 21 <!-- If true, an option is shown in Display Options UI to choose a sort order -->
24 <!-- If true, the default sort order is primary (i.e. by given name) -->
30 <!-- If true, the default sort order is primary (i.e. by given name) -->
|
| /packages/apps/Contacts/res/values-zh-rCN/ |
| donottranslate_config.xml | 21 <!-- If true, an option is shown in Display Options UI to choose a sort order -->
24 <!-- If true, the default sort order is primary (i.e. by given name) -->
30 <!-- If true, the default sort order is primary (i.e. by given name) -->
|
| /packages/apps/Contacts/res/values-zh-rTW/ |
| donottranslate_config.xml | 21 <!-- If true, an option is shown in Display Options UI to choose a sort order -->
24 <!-- If true, the default sort order is primary (i.e. by given name) -->
30 <!-- If true, the default sort order is primary (i.e. by given name) -->
|
| /external/chromium_org/webkit/data/test_shell/sort/ |
| sort.js | 0 // sort object
29 function Sort(name, func) {
58 Sort.prototype.setup = function() {
75 Sort.prototype.status = function(str) {
77 label.innerHTML = "<b>" + this.name + " Sort</b><br />" + str;
80 Sort.prototype.stepper = function() {
82 var sort = this;
83 this.timer = setTimeout(function(){sort.stepper();},interval_time);
143 Sort.prototype.add_work = function(work, name) {
150 Sort.prototype.init = function()
[all...] |
| /external/chromium_org/courgette/ |
| analyze_mem_test | 21 | sort -n \
62 | sort -nr \
64 done | sort -k2 -n > "${metrics_tmp}"
84 | sort -nr \
86 done | sort -k2 -n > "${metrics_bsdiff_tmp}"
|
| /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.
|
| /ndk/sources/host-tools/make-3.81/tests/scripts/functions/ |
| wildcard | 22 print1: ;\@echo \$(sort \$(wildcard example.*))
24 \t\@echo \$(sort \$(wildcard example.?))
25 \t\@echo \$(sort \$(wildcard example.[a-z0-9]))
26 \t\@echo \$(sort \$(wildcard example.[!A-Za-z_\\!]))
28 \t$delete_command \$(sort \$(wildcard example.*))
|
| /external/chromium_org/chrome/browser/resources/net_internals/ |
| source_filter_parser.js | 9 * Parses |filterText|, extracting a sort method, a list of filters, and a
10 * copy of |filterText| with all sort parameters removed.
15 this.sort = {};
30 var sort = parseSortDirective_(filterElement, negated);
31 if (sort) {
32 this.sort = sort;
68 * Parses a single "sort:" directive, and returns a dictionary containing
69 * the sort function and direction. Returns null on failure, including
70 * the case when no such sort function exists.
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| cProfile.py | 14 def run(statement, filename=None, sort=-1):
36 result = prof.print_stats(sort)
39 def runctx(statement, globals, locals, filename=None, sort=-1):
56 result = prof.print_stats(sort)
79 def print_stats(self, sort=-1):
81 pstats.Stats(self).strip_dirs().sort_stats(sort).print_stats()
166 usage = "cProfile.py [-o output_file_path] [-s sort] scriptfile [arg] ..."
171 parser.add_option('-s', '--sort', dest="sort",
172 help="Sort order when printing to stdout, based on pstats.Stats class"
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| cProfile.py | 14 def run(statement, filename=None, sort=-1):
36 result = prof.print_stats(sort)
39 def runctx(statement, globals, locals, filename=None, sort=-1):
56 result = prof.print_stats(sort)
79 def print_stats(self, sort=-1):
81 pstats.Stats(self).strip_dirs().sort_stats(sort).print_stats()
166 usage = "cProfile.py [-o output_file_path] [-s sort] scriptfile [arg] ..."
171 parser.add_option('-s', '--sort', dest="sort",
172 help="Sort order when printing to stdout, based on pstats.Stats class"
[all...] |
| /external/chromium_org/chrome/browser/resources/ |
| about_stats.html | 94 <td class="header2 lower" name="string-sort" width="200">name</td>
95 <td class="header2 lower" name="number-sort">value</td>
96 <td class="header2 lower" name="number-sort">delta</td>
116 <td class="header2 lower" name="string-sort" width="200">name</td>
117 <td class="header2 lower" name="number-sort">count</td>
118 <td class="header2 lower" name="number-sort">time (ms)</td>
119 <td class="header2 lower" name="number-sort">avg time (ms)</td>
|
| /external/chromium_org/media/video/capture/win/ |
| capability_list_win.cc | 80 // Sort the best height candidates.
81 diff_list.sort(&CompareHeight);
92 // Sort the best width candidates.
93 diff_list.sort(&CompareWidth);
104 // Sort the best frame rate candidates.
105 diff_list.sort(&CompareFrameRate);
116 diff_list.sort(&CompareColor);
|
| /external/chromium_org/tools/telemetry/telemetry/value/ |
| merge_values_unittest.py | 39 # Sort the results so that their order is predictable for the subsequent
41 merged_values.sort(key=lambda x: x.page.url)
58 # Sort the results so that their order is predictable for the subsequent
74 # Sort the results so that their order is predictable for the subsequent
77 merged_values.sort(key=lambda x: x.name)
93 # Sort the results so that their order is predictable for the subsequent
110 # Sort the results so that their order is predictable for the subsequent
|
| /external/chromium_org/v8/tools/testrunner/network/ |
| distro.py | 40 self.tests.sort(cmp=lambda x, y: cmp(x.duration, y.duration))
61 # Convert |shells| to list and sort it, shortest total_duration first.
63 shells.sort(cmp=lambda x, y: cmp(x.total_duration, y.total_duration))
64 # Sort tests within each shell, longest duration last (so it's
67 # Sort peers, least needed_work first.
68 peers.sort(cmp=lambda x, y: cmp(x.needed_work, y.needed_work))
79 peers.sort(cmp=lambda x, y: cmp(x.needed_work, y.needed_work))
|
| /external/chromium_org/ui/webui/resources/js/cr/ui/ |
| array_data_model.js | 84 * Returns current sort status.
85 * @return {!Object} Current sort status.
126 * This implementation runs sort after splice and creates permutation for
191 // change), and then sort again.
219 * This runs sort after updating.
237 // We should first call prepareSort (data may change), and then sort.
245 * Creates sort status with given field and direction.
246 * @param {string} field Sort field.
247 * @param {string} direction Sort direction.
248 * @return {!Object} Created sort status
[all...] |
| /external/chromium_org/third_party/sqlite/src/test/ |
| boundary4.tcl | 70 # A simple selection sort. Not trying to be efficient.
72 proc sort {inlist} { procedure
149 foreach r [sort $all_rowid] {
156 foreach r [reverse [sort $all_rowid]] {
163 foreach a [sort $all_a] {
171 foreach a [reverse [sort $all_a]] {
179 foreach x [sort $all_x] {
187 foreach x [reverse [sort $all_x]] {
197 foreach r [sort $all_rowid] {
204 foreach r [reverse [sort $all_rowid]]
[all...] |
| tkt3824.test | 25 if {[db status sort]} {
26 concat $result sort
45 } {-10 1 5 9 123 sort}
50 } {-10 1 5 9 123 sort}
65 } {5 9 sort}
70 } {5 9 sort}
|
| /external/webrtc/src/system_wrappers/test/TestSort/ |
| TestSort.cpp | 15 #include "sort.h"
143 printf("Running %s Sort() tests...\n", TypeEnumToString(sortType));
167 //std::sort(data, data + DataLength, KeyLessThan<KeyType>());
173 retVal = webrtc::Sort(key, DataLength, sortType);
175 //std::sort(key, key + DataLength);
184 printf("Sort returned an error. ");
189 // Reference sort.
192 std::sort(keyRef, keyRef + DataLength);
230 printf("Sort data differs from std::sort reference\nExiting...\n")
[all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkTSort.h | 95 /** Sorts the array of size count using comparator lessThan using a Heap Sort algorithm. Be sure to
113 /** Sorts the array of size count using comparator '<' using a Heap Sort algorithm. */
120 /** Sorts the array of size count using comparator lessThan using an Insertion Sort algorithm. */
151 /* Intro Sort is a modified Quick Sort.
152 * When the region to be sorted is a small constant size it uses Insertion Sort.
153 * When depth becomes zero, it switches over to Heap Sort.
155 * we already limit the stack depth by switching to heap sort,
158 * @param depth at this recursion depth, switch to Heap Sort.
184 /** Sorts the region from left to right using comparator lessThan using a Quick Sort algorithm. B
[all...] |
| /external/skia/src/core/ |
| SkTSort.h | 95 /** Sorts the array of size count using comparator lessThan using a Heap Sort algorithm. Be sure to
113 /** Sorts the array of size count using comparator '<' using a Heap Sort algorithm. */
120 /** Sorts the array of size count using comparator lessThan using an Insertion Sort algorithm. */
151 /* Intro Sort is a modified Quick Sort.
152 * When the region to be sorted is a small constant size it uses Insertion Sort.
153 * When depth becomes zero, it switches over to Heap Sort.
155 * we already limit the stack depth by switching to heap sort,
158 * @param depth at this recursion depth, switch to Heap Sort.
184 /** Sorts the region from left to right using comparator lessThan using a Quick Sort algorithm. B
[all...] |
| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| TestTopologicalSort.java | 35 /** Test topo sort in GraphNode. */
53 List nodes = g.sort();
67 List nodes = g.sort();
81 List nodes = g.sort();
95 List nodes = g.sort();
109 List nodes = g.sort();
|
