| /external/webrtc/webrtc/system_wrappers/include/ |
| sort.h | 42 int32_t Sort(void* data, uint32_t num_of_elements, Type data_type);
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 | 22 indices.Sort(CompareStrings, (void *)&strings);
|
| /art/tools/ahat/test/ |
| SortTest.java | 47 // Sort by size.
48 Collections.sort(list, new Sort.ObjectsInfoBySize());
55 // Sort by class name.
56 Collections.sort(list, new Sort.ObjectsInfoByClassName());
63 // Sort by heap name.
64 Collections.sort(list, new Sort.ObjectsInfoByHeapName());
71 // Sort first by class name, then by size
[all...] |
| /system/keymaster/ |
| attestation_record_test.cpp | 136 hw_set.Sort();
137 sw_set.Sort();
138 parsed_hw_set.Sort();
139 parsed_sw_set.Sort();
|
| /external/skia/tools/lua/ |
| ngrams_aggregate.lua | 13 -- Sort the data.
17 table.sort(countArray, compare)
|
| /art/tools/ahat/src/ |
| SiteHandler.java | 51 Collections.sort(children, new Sort.SiteBySize("app"));
88 Comparator<Site.ObjectsInfo> compare = new Sort.WithPriority<Site.ObjectsInfo>(
89 new Sort.ObjectsInfoByHeapName(),
90 new Sort.ObjectsInfoBySize(),
91 new Sort.ObjectsInfoByClassName());
92 Collections.sort(infos, compare);
|
| NativeAllocationsHandler.java | 61 = new Sort.WithPriority<InstanceUtils.NativeAllocation>(
62 new Sort.NativeAllocationByHeapName(),
63 new Sort.NativeAllocationBySize());
64 Collections.sort(allocs, compare);
|
| DominatedList.java | 44 Collections.sort(insts, Sort.defaultInstanceCompare(snapshot));
|
| ObjectsHandler.java | 51 Collections.sort(insts, Sort.defaultInstanceCompare(mSnapshot));
|
| Sort.java | 35 class Sort {
|
| /external/v8/src/ |
| list-inl.h | 204 void List<T, P>::Sort(CompareFunction cmp) {
205 Sort(cmp, 0, length_);
211 void List<T, P>::Sort(CompareFunction cmp, size_t s, size_t l) {
212 ToVector().Sort(cmp, s, l);
220 void List<T, P>::Sort() {
221 ToVector().Sort();
|
| small-pointer-list.h | 49 void Sort() {
51 list()->Sort(compare_value);
|
| list.h | 156 // Sort all list entries (using QuickSort)
158 void Sort(CompareFunction cmp, size_t start, size_t length);
160 void Sort(CompareFunction cmp);
161 void Sort();
|
| vector.h | 73 void Sort(CompareFunction cmp, size_t s, size_t l) {
74 std::sort(start() + s, start() + s + l, RawComparer<CompareFunction>(cmp));
78 void Sort(CompareFunction cmp) {
79 std::sort(start(), start() + length(), RawComparer<CompareFunction>(cmp));
82 void Sort() {
83 std::sort(start(), start() + length());
|
| /bionic/libc/bionic/ |
| scandir.cpp | 72 void Sort(int (*comparator)(const dirent**, const dirent**)) {
73 // If we have entries and a comparator, sort them.
124 names.Sort(comparator);
|
| /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/gemmlowp/profiling/ |
| profiler.h | 232 std::sort(node->children.begin(), node->children.end(), CompareNodes);
238 void Sort() { SortNode(&root_); }
246 Sort();
|
| /external/lzma/C/ |
| Android.mk | 36 Sort.c \
|
| /external/lzma/CPP/7zip/UI/Console/ |
| makefile | 65 $O\Sort.obj \
|
| /external/lzma/CPP/Common/ |
| MyVector.h | 334 void Sort(int (*compare)(const T*, const T*, void *), void *param)
604 void Sort(int (*compare)(void *const *, void *const *, void *), void *param)
605 { _v.Sort(compare, param); }
610 void Sort() { _v.Sort(CompareObjectItems, 0); }
|
| /prebuilts/go/darwin-x86/test/bench/shootout/ |
| k-nucleotide.go | 44 "sort"
74 return kn[i].name > kn[j].name // sort down
87 sort.Sort(kn)
|
| /prebuilts/go/linux-x86/test/bench/shootout/ |
| k-nucleotide.go | 44 "sort"
74 return kn[i].name > kn[j].name // sort down
87 sort.Sort(kn)
|
| /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/dng_sdk/source/ |
| dng_bad_pixels.h | 186 /// Sort the bad single pixels and bad rectangles by coordinates (top to
189 void Sort ();
|
| /external/pdfium/xfa/include/fwl/basewidget/ |
| fwl_listbox.h | 124 FWL_ERR* Sort(IFWL_ListBoxCompare* pCom);
|
