| /external/webrtc/src/system_wrappers/interface/ |
| sort.h | 42 WebRtc_Word32 Sort(void* data, WebRtc_UWord32 numOfElements, Type dataType);
45 // key values which will be used to sort the data array. There must be a
52 // key [in] A pointer to an array of keys used to sort the
|
| /bionic/libc/bionic/ |
| scandir.cpp | 67 void Sort(int (*comparator)(const dirent**, const dirent**)) {
68 // If we have entries and a comparator, sort them.
110 names.Sort(comparator);
|
| /external/v8/src/ |
| list.h | 138 // Sort all list entries (using QuickSort)
139 void Sort(int (*cmp)(const T* x, const T* y));
140 void Sort();
|
| list-inl.h | 186 void List<T, P>::Sort(int (*cmp)(const T* x, const T* y)) {
187 ToVector().Sort(cmp);
196 void List<T, P>::Sort() {
197 Sort(PointerValueCompare<T>);
|
| liveobjectlist.h | 180 void Sort();
|
| utils.h | 384 void Sort(int (*cmp)(const T*, const T*)) {
392 void Sort() {
393 Sort(PointerValueCompare<T>);
|
| scopeinfo.cc | 110 // order with the variable list anymore. Thus, we first need to sort them by
112 context_locals.Sort(&Variable::CompareIndex);
|
| bootstrapper.cc | 422 descriptors->Sort(witness);
569 descriptors->Sort(witness);
[all...] |
| liveobjectlist.cc | 1020 // up in the GCEpilogue, while preserving the sort order of the lol.
1041 // NOTE: we sort the lol in increasing order. So, if an object has been
1066 void LiveObjectList::Sort() {
1069 elements_v.Sort(CompareElement);
[all...] |
| /external/webkit/Source/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/chrome/common/extensions/docs/examples/api/history/showHistory/ |
| typedUrls.js | 104 // Sort the URLs by the number of times the user typed them.
105 urlArray.sort(function(a, b) {
|
| /external/chromium/base/ |
| tracked_objects.h | 370 // which specify a sort order.
371 // Since it is not meaningful to sort more than once on a specific key, we
374 // Sort orders.
393 // the sort algorithm makes copies of this object, and then deletes them,
398 // The less() operator for sorting the array via std::sort().
401 void Sort(DataCollector::Collection* collection) const;
403 // Check to see if the items are sort equivalents (should be aggregated).
414 // Indicate if this instance is set up to sort by the given Selector, thereby
427 // Parse a query in an about:tasks URL to decide on sort ordering.
451 // We or together all the selectors we sort on (not counting sub-grou
[all...] |
| tracked_objects.cc | 175 // Data Gathering is complete. Now to sort/process/render.
178 // Create filtering and sort comparison object.
190 comparator.Sort(&match_array);
199 "sort and aggregate the data, or to select data.<br><ul>"
209 "<li><b>about:tasks/file</b> would sort the above data by file, and"
213 "<li><b>about:tasks/birth/death</b> would sort the above list by birth"
796 return left.count() > right.count(); // Sort large at front of vector.
814 void Comparator::Sort(DataCollector::Collection* collection) const {
815 std::sort(collection->begin(), collection->end(), *this);
948 // Sorting and aggretation keywords, which specify how to sort the data, o
[all...] |
| /external/chromium/chrome/browser/task_manager/ |
| task_manager.h | 177 FRIEND_TEST_ALL_PREFIXES(TaskManagerWindowControllerTest, 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/v8/tools/ |
| tickprocessor.js | 395 // Sort by total time, desc, then by name, desc.
396 producersView.sort(function(rec1, rec2) {
422 // Sort by self time, desc, then by name, desc.
423 flatView.sort(function(rec1, rec2) {
463 // Sort by total time, desc, then by name, desc.
464 heavyView.sort(function(rec1, rec2) {
|
| /external/chromium/build/ |
| install-build-deps.sh | 110 // Sort a Read_multiple vector by file offset.
507 sort -u); do
511 sort -n | tail -n 1)"
|
| /external/webrtc/src/system_wrappers/source/ |
| sort.cc | 16 #include "sort.h"
25 #include <algorithm> // std::sort
241 std::sort(dataT, dataT + numOfElements);
323 std::sort(ptrSortKey, ptrSortKey + numOfElements,
337 WebRtc_Word32 Sort(void* data, WebRtc_UWord32 numOfElements, Type type)
381 // Fall back to std::sort for 64-bit types and floats due to compiler
512 // Fall back to std::sort for 64-bit types and floats due to compiler
|
| /external/freetype/src/raster/ |
| ftraster.c | 119 /* boundary. These positions are called `y-turns' because they (sort */
[all...] |
| /external/v8/test/cctest/ |
| test-cpu-profiler.cc | 192 bottom_up_root_children.Sort(&CompareProfileNodes);
|
| /external/chromium/chrome/common/extensions/docs/examples/api/webNavigation/basic/ |
| navigation_collector.js | 364 // Sort the array.
365 result.sort(function(a, b) {
|
| /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/robolectric/lib/main/ |
| sqlite-jdbc-3.7.2.jar | |
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
| Antlr.Runtime.Tools.pas | 168 procedure Sort; overload;
169 procedure Sort(const AComparer: IComparer<T>); overload;
|
