| /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
|
| /external/lzma/CPP/7zip/UI/Common/ |
| SortUtils.cpp | 21 indices.Sort(CompareStrings, (void *)&strings);
|
| /bionic/libc/bionic/ |
| scandir.cpp | 70 void Sort(int (*comparator)(const dirent**, const dirent**)) {
71 // If we have entries and a comparator, sort them.
112 names.Sort(comparator);
|
| /external/lzma/CPP/Common/ |
| MyVector.h | 150 void Sort(int (*compare)(const T*, const T*, void *), void *param)
258 void Sort(int (*compare)(void *const *, void *const *, void *), void *param)
259 { CPointerVector::Sort(compare, param); }
263 void Sort() { CPointerVector::Sort(CompareObjectItems, 0); }
|
| /external/lldb/source/Plugins/SymbolFile/DWARF/ |
| DWARFDebugAranges.cpp | 136 DWARFDebugAranges::Sort (bool minimize)
146 log->Printf ("DWARFDebugAranges::Sort(minimize = %u) with %" PRIu64 " entries", minimize, (uint64_t)orig_arange_size);
149 m_aranges.Sort();
158 log->Printf ("DWARFDebugAranges::Sort() %" PRIu64 " entries after minimizing (%" PRIu64 " entries combined for %" PRIu64 " bytes saved)",
|
| DWARFDebugAranges.h | 43 // Use append range multiple times and then call sort
50 Sort (bool minimize);
|
| NameToDIE.cpp | 28 m_map.Sort ();
|
| /external/skia/tests/ |
| SortTest.cpp | 34 DEF_TEST(Sort, reporter) {
37 /** The reference sort of the random numbers. */
40 then this array is compared against the reference sort. */
48 // Use qsort as the reference sort.
|
| /external/v8/src/ |
| list.h | 149 // Sort all list entries (using QuickSort)
150 void Sort(int (*cmp)(const T* x, const T* y));
151 void Sort();
|
| small-pointer-list.h | 49 void Sort() {
51 list()->Sort(compare_value);
|
| vector.h | 68 void Sort(int (*cmp)(const T*, const T*)) {
69 std::sort(start(), start() + length(), RawComparer(cmp));
72 void Sort() {
73 std::sort(start(), start() + length());
|
| list-inl.h | 194 void List<T, P>::Sort(int (*cmp)(const T* x, const T* y)) {
195 ToVector().Sort(cmp);
204 void List<T, P>::Sort() {
205 ToVector().Sort();
|
| /external/lldb/source/Interpreter/ |
| OptionValueEnumeration.cpp | 122 m_enumerations.Sort();
|
| /external/vixl/src/vixl/ |
| invalset.h | 49 // `std::sort()` can be used.
135 // Sort the elements.
144 void Sort(SortType sort_type);
333 Sort(kHardSort);
469 void InvalSet<TEMPLATE_INVALSET_P_DEF>::Sort(SortType sort_type) {
481 std::sort(StorageBegin(), StorageEnd());
634 Sort(kHardSort);
664 inval_set->Sort(S::kSoftSort);
|
| /external/v8/test/intl/collator/ |
| de-sort.js | 28 // Sort plain German text using defaults.
34 var result = strings.sort(collator.compare);
|
| en-sort.js | 28 // Sort plain English text using defaults.
33 var result = strings.sort(collator.compare);
|
| sr-sort.js | 28 // Sort plain Serbian text using defaults.
34 var result = strings.sort(collator.compare);
|
| /external/lldb/source/Symbol/ |
| Symtab.cpp | 411 m_name_to_index.Sort();
413 m_selector_to_index.Sort();
415 m_basename_to_index.Sort();
417 m_method_to_index.Sort();
610 // No need to sort if we have zero or one items...
614 // Sort the indexes in place using std::stable_sort.
615 // NOTE: The use of std::stable_sort instead of std::sort here is strictly for performance,
617 // stable sort handles better.
[all...] |
| /external/lldb/include/lldb/Core/ |
| RangeMap.h | 205 Sort ()
485 Sort ()
818 Sort ()
1079 Sort ()
[all...] |
| UniqueCStringMap.h | 69 // this map, then later call UniqueCStringMap<T>::Sort() before doing
278 // call to UniqueCStringMap::Sort()) or to UniqueCStringMap::Insert().
287 // Sort the unsorted contents in this map. A typical code flow would
296 // my_map.Sort();
299 Sort ()
301 std::sort (m_map.begin(), m_map.end());
|
| /external/boringssl/src/crypto/err/ |
| err_data_generate.go | 24 "sort"
130 sort.Sort(keySlice(st.entries))
244 sort.Strings(names)
|
| /art/runtime/gc/accounting/ |
| atomic_stack.h | 49 // This comparator is for std::sort.
182 void Sort() {
185 std::sort(Begin(), End(), ObjectComparator());
|
| /external/lldb/source/Plugins/SymbolFile/Symtab/ |
| SymbolFileSymtab.cpp | 102 // sort them by value (address) and dump the sorted symbols.
133 m_objc_class_name_to_index.Sort();
|
| /external/lldb/source/Target/ |
| CPPLanguageRuntime.cpp | 32 m_impl.Sort();
|
| /external/v8/tools/push-to-trunk/ |
| releases.py | 56 """Sort branches with version number names."""
|
