HomeSort by relevance Sort by last modified time
    Searched refs:sort (Results 301 - 325 of 2471) sorted by null

<<11121314151617181920>>

  /packages/apps/Settings/src/com/android/settings/deviceinfo/
UsageBarPreference.java 55 Collections.sort(mEntries);
  /packages/apps/VoiceDialer/src/com/android/voicedialer/
VoiceDialerTester.java 80 Arrays.sort(fa);
88 Arrays.sort(mWavDirs);
185 Arrays.sort(names);
205 Arrays.sort(names);
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
keyword.py 71 lines.sort()
heapq.py 29 without surprises: heap[0] is the smallest item, and heap.sort()
74 By iterating over all items, you get an O(n ln n) sort.
76 A nice feature of this sort is that you can efficiently insert new
77 items while the sort is going on, provided that the inserted items are
93 know that a big sort implies producing "runs" (which are pre-sorted
97 sort produces the longest runs possible. Tournaments are a good way
218 result.sort(reverse=True)
236 result.sort()
290 # The total compares needed by list.sort() on the same lists were 8627,
292 # heappop() compares): list.sort() is (unsurprisingly!) more efficien
474 sort = [] variable
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
test_dumbdbm.py 132 keys.sort()
134 dkeys.sort()
160 expected.sort()
162 got.sort()
test_epoll.py 161 events.sort()
164 expected.sort()
182 events.sort()
185 expected.sort()
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/
keyword.py 71 lines.sort()
heapq.py 29 without surprises: heap[0] is the smallest item, and heap.sort()
74 By iterating over all items, you get an O(n ln n) sort.
76 A nice feature of this sort is that you can efficiently insert new
77 items while the sort is going on, provided that the inserted items are
93 know that a big sort implies producing "runs" (which are pre-sorted
97 sort produces the longest runs possible. Tournaments are a good way
218 result.sort(reverse=True)
236 result.sort()
290 # The total compares needed by list.sort() on the same lists were 8627,
292 # heappop() compares): list.sort() is (unsurprisingly!) more efficien
474 sort = [] variable
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
test_dumbdbm.py 132 keys.sort()
134 dkeys.sort()
160 expected.sort()
162 got.sort()
test_epoll.py 161 events.sort()
164 expected.sort()
182 events.sort()
185 expected.sort()
  /external/chromium_org/third_party/WebKit/Source/core/inspector/
CodeGeneratorInstrumentation.py 207 self.includes.sort()
452 forward_list.sort()
453 accessor_list.sort()
454 member_list.sort()
455 init_list.sort()
456 reset_list.sort()
490 cpp_includes.sort()
  /external/linux-tools-perf/
builtin-kmem.c 440 struct sort_dimension *sort; local
449 list_for_each_entry(sort, sort_list, list) {
450 cmp = sort->cmp(data, this);
621 struct sort_dimension *sort; local
626 sort = malloc(sizeof(*sort));
627 if (!sort)
629 memcpy(sort, avail_sorts[i], sizeof(*sort));
630 list_add_tail(&sort->list, list)
    [all...]
  /external/chromium_org/third_party/WebKit/Source/devtools/front_end/
ProfileDataGridTree.js 123 sort: function(comparator, force)
134 // If the grid node is collapsed, then don't sort children (save operation for later).
148 children.sort(comparator);
224 this.sort(currentComparator, true);
339 sort: WebInspector.ProfileDataGridNode.prototype.sort,
  /external/chromium_org/v8/test/webkit/fast/js/
array-functions-non-arrays.js 43 names.sort();
72 flags.sort();
104 shouldBe("Array.prototype.toString.call({sort: function() { return 'sort' }})", '"' + Object.prototype.toString.call({}) + '"');
172 shouldBe("properties(Array.prototype.sort.call({}))", "''");
173 shouldBe("properties(Array.prototype.sort.call(['b', 'a']))", "'0:a, 1:b, length:2(DontDelete, DontEnum)'");
174 shouldBe("properties(Array.prototype.sort.call({ length:2, 0:'b', 1:'a' }))", "'0:a, 1:b, length:2'");
175 shouldBe("properties(Array.prototype.sort.call(new OneItemConstructor))", "'0:a(FromPrototype), length:1(FromPrototype)'");
176 shouldBe("properties(Array.prototype.sort.call(new TwoItemConstructor))", "'0:a, 1:b, length:2(FromPrototype)'");
  /external/doclava/src/com/google/doclava/
Stubs.java 782 // extract the set of packages, sort them by name, and write them out in that order
785 Arrays.sort(allPackages, PackageInfo.comparator);
796 Arrays.sort(packages, PackageInfo.comparator);
814 Arrays.sort(classes, ClassInfo.comparator);
853 Collections.sort(interfaces, ClassInfo.comparator);
862 Collections.sort(constructors, MethodInfo.comparator);
868 Collections.sort(methods, MethodInfo.comparator);
876 Collections.sort(fields, FieldInfo.comparator);
    [all...]
  /system/core/include/utils/
Vector.h 168 * sort (stable) the array
174 inline status_t sort(compar_t cmp);
175 inline status_t sort(compar_r_t cmp, void* state);
377 status_t Vector<TYPE>::sort(Vector<TYPE>::compar_t cmp) { function in class:android::Vector
378 return VectorImpl::sort((VectorImpl::compar_t)cmp);
382 status_t Vector<TYPE>::sort(Vector<TYPE>::compar_r_t cmp, void* state) { function in class:android::Vector
383 return VectorImpl::sort((VectorImpl::compar_r_t)cmp, state);
  /external/chromium/chrome/browser/resources/net_internals/
eventsview.js 81 // Sets sort order and filter.
155 // started one after another, so sort in the opposite order of their
217 // sort: and sort:- are allowed
231 // Can only sort items with an actual row in the table.
235 sourceEntries.sort(this.comparisonFuncWithReversing_.bind(this));
290 * Parse any "sort:" directives, and update |comparisonFunction_| and
291 * |doSortBackwards_|as needed. Note only the last valid sort directive
294 * Returns |filterText| with all sort directives removed, including
302 var sortInfo = this.parseNegatableDirective_(filterText, 'sort');
    [all...]
  /bionic/libc/tools/zoneinfo/
update-tzdata.py 52 zones.sort()
161 tzdata_filenames.sort()
  /build/core/tasks/
collect_gpl_sources.mk 17 $(gpl_source_tgz): PRIVATE_PATHS := $(sort $(patsubst %/, %, $(dir $(ALL_GPL_MODULE_LICENSE_FILES))))
vendor_module_check.mk 40 _vendor_check_modules := $(sort $(PRODUCTS.$(INTERNAL_PRODUCT).PRODUCT_PACKAGES))
48 $(eval _ersl_new_modules := $(sort $(subst $(comma),$(space),$(_ersl_new_modules))))\
  /cts/tools/cts-api-coverage/src/com/android/cts/apicoverage/
XmlReport.java 56 Collections.sort(packages, comparator);
74 Collections.sort(classes, comparator);
  /dalvik/dexgen/src/com/android/dexgen/util/
IntList.java 265 // sort status is unchanged
357 public void sort() { method in class:IntList
361 Arrays.sort(values, 0, size);
444 * @see #sort
  /dalvik/dx/src/com/android/dx/util/
IntList.java 265 // sort status is unchanged
357 public void sort() { method in class:IntList
361 Arrays.sort(values, 0, size);
445 * @see #sort
  /external/ceres-solver/internal/ceres/
compressed_row_jacobian_writer.cc 96 // Sort the parameters by their position in the state vector.
97 sort(parameter_indices.begin(), parameter_indices.end());
185 sort(evaluated_jacobian_blocks.begin(), evaluated_jacobian_blocks.end());
  /external/chromium/chrome/browser/chromeos/options/
wifi_config_model.cc 102 std::sort(user_certs_.begin(), user_certs_.end(), cert_name_comparator);
103 std::sort(server_ca_certs_.begin(), server_ca_certs_.end(),

Completed in 1382 milliseconds

<<11121314151617181920>>