| /external/v8/src/ |
| list-inl.h | 140 void List<T, P>::Sort(int (*cmp)(const T* x, const T* y)) {
141 ToVector().Sort(cmp);
150 void List<T, P>::Sort() {
151 Sort(PointerValueCompare<T>);
|
| list.h | 121 // Sort all list entries (using QuickSort)
122 void Sort(int (*cmp)(const T* x, const T* y));
123 void Sort();
|
| utils.h | 323 void Sort(int (*cmp)(const T*, const T*)) {
331 void Sort() {
332 Sort(PointerValueCompare<T>);
|
| heap-profiler.h | 193 void SortRefs() { refs.Sort(JSObjectsCluster::Compare); }
|
| heap-profiler.cc | 481 sim_list_.Sort(ClusterBackRefsCmp);
|
| scopeinfo.cc | 75 // sort them by context slot index before adding them to the
80 locals.Sort(&CompareLocal);
|
| factory.cc | 642 // Sort the result before returning.
643 result->Sort();
[all...] |
| spaces.cc | 195 // Sort and merge the free blocks on the free list and the allocation list.
198 free_list_.Sort(&CompareFreeBlockAddress);
[all...] |
| heap.cc | [all...] |
| objects.h | [all...] |
| objects.cc | [all...] |
| jsregexp.cc | [all...] |
| /external/webkit/JavaScriptCore/tests/mozilla/ecma/Array/ |
| 15.4.4.5-1.js | 24 ECMA Section: Array.prototype.sort(comparefn)
29 The elements of this array are sorted. The sort is not necessarily stable.
77 4.If the argument comparefn was not provided in the call to sort, go to step 7.
87 property values always sort to the end of the result. It is implementation-dependent whether or not such
88 properties will exist or not at the end of the array when the sort is concluded.
90 Note that the sort function is intentionally generic; it does not require that its this value be an Array object.
91 Therefore it can be transferred to other kinds of objects for use as a method. Whether the sort function can be
102 var TITLE = "Array.prototype.sort(comparefn)";
158 var E = Sort( A );
161 S +"; A.sort(); A.length"
[all...] |
| 15.4.4.5-2.js | 24 ECMA Section: Array.prototype.sort(comparefn)
28 In this cases, the sort creates a reverse sort.
30 The elements of this array are sorted. The sort is not necessarily stable.
78 4.If the argument comparefn was not provided in the call to sort, go to step 7.
88 property values always sort to the end of the result. It is implementation-dependent whether or not such
89 properties will exist or not at the end of the array when the sort is concluded.
91 Note that the sort function is intentionally generic; it does not require that its this value be an Array object.
92 Therefore it can be transferred to other kinds of objects for use as a method. Whether the sort function can be
103 var TITLE = "Array.prototype.sort(comparefn)"
[all...] |
| /external/chromium/base/ |
| tracked_objects.h | 367 // which specify a sort order.
368 // Since it is not meaningful to sort more than once on a specific key, we
371 // Sort orders.
390 // the sort algorithm makes copies of this object, and then deletes them,
395 // The less() operator for sorting the array via std::sort().
398 void Sort(DataCollector::Collection* collection) const;
400 // Check to see if the items are sort equivalents (should be aggregated).
411 // Indicate if this instance is set up to sort by the given Selector, thereby
424 // Parse a query in an about:objects URL to decide on sort ordering.
448 // We or together all the selectors we sort on (not counting sub-grou
[all...] |
| tracked_objects.cc | 163 // Data Gathering is complete. Now to sort/process/render.
166 // Create filtering and sort comparison object.
178 comparator.Sort(&match_array);
187 "sort and aggregate the data, or to select data.<br><ul>"
197 "<li><b>about:tasks/file</b> would sort the above data by file, and"
201 "<li><b>about:tasks/birth/death</b> would sort the above list by birth"
678 void Comparator::Sort(DataCollector::Collection* collection) const {
679 std::sort(collection->begin(), collection->end(), *this);
733 return left.count() > right.count(); // Sort large at front of vector.
881 // Sorting and aggretation keywords, which specify how to sort the data, o
[all...] |
| /external/v8/tools/ |
| tickprocessor.js | 378 // Sort by total time, desc, then by name, desc.
379 producersView.sort(function(rec1, rec2) {
416 // Sort by self time, desc, then by name, desc.
417 flatView.sort(function(rec1, rec2) {
457 // Sort by total time, desc, then by name, desc.
458 heavyView.sort(function(rec1, rec2) {
|
| /external/v8/test/mjsunit/ |
| array-sort.js | 30 // Test array sort.
36 // Default sort converts each element to string and orders
38 a.sort();
40 // Sort numbers by value using a compare functions.
41 a.sort(function(x, y) { return x - y; });
44 // Default sort on negative numbers.
46 a.sort();
49 // Default sort on negative and non-negative numbers.
51 a.sort();
55 a = [9, 1000000000].sort();
[all...] |
| /external/freetype/src/raster/ |
| ftraster.c | 119 /* boundary. These positions are called `y-turns' because they (sort */
[all...] |
| /external/protobuf/src/google/protobuf/ |
| repeated_field_unittest.cc | 823 TEST_F(RepeatedPtrFieldPtrsIteratorTest, Sort) {
834 sort(proto_array_.pointer_begin(),
|
| /external/v8/test/cctest/ |
| test-regexp.cc | 590 range.Sort();
[all...] |
| /prebuilt/common/ant/ |
| ant.jar | |
| /external/libvpx/examples/includes/PHP-Markdown-Extra-1.2.3/ |
| markdown.php | 259 # Sort document, block, and span gamut in ascendent priority order.
[all...] |
| /external/sqlite/dist/ |
| sqlite3.c | [all...] |
| sqlite3.c.orig | [all...] |
