| /external/chromium_org/net/dns/ |
| address_sorter.h | 18 // connection. Depending on the platform, the sort could be performed
31 virtual void Sort(const AddressList& list,
|
| address_sorter_unittest.cc | 40 TEST(AddressSorterTest, Sort) {
60 sorter->Sort(list, base::Bind(&OnSortComplete, &result,
|
| address_sorter_posix.h | 67 virtual void Sort(const AddressList& list,
|
| address_sorter_win.cc | 33 virtual void Sort(const AddressList& list,
153 // Wrapper for AddressSorterWin which does not sort IPv4 or IPv4-mapped
162 virtual void Sort(const AddressList& list,
175 sorter_.Sort(list_ipv6, base::Bind(&MergeResults, callback, list_ipv4));
|
| /external/chromium_org/third_party/webrtc/system_wrappers/interface/ |
| 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/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);
|
| /external/chromium_org/webkit/data/test_shell/sort/ |
| sort.js | 0 // sort object
29 function Sort(name, func) {
58 Sort.prototype.setup = function() {
75 Sort.prototype.status = function(str) {
77 label.innerHTML = "<b>" + this.name + " Sort</b><br />" + str;
80 Sort.prototype.stepper = function() {
82 var sort = this;
83 this.timer = setTimeout(function(){sort.stepper();},interval_time);
143 Sort.prototype.add_work = function(work, name) {
150 Sort.prototype.init = function()
[all...] |
| /bionic/libc/bionic/ |
| scandir.cpp | 68 void Sort(int (*comparator)(const dirent**, const dirent**)) {
69 // If we have entries and a comparator, sort them.
109 names.Sort(comparator);
|
| /external/chromium_org/third_party/cld/encodings/compact_lang_det/ |
| tote.h | 22 void Sort(int n);
57 void Sort(int n);
|
| tote.cc | 105 // Sort first n entries by decreasing order of value
107 void Tote::Sort(int n) {
112 // Bubble sort key[sub] and entry[sub]
258 // Sort first n entries by decreasing order of value
260 void ToteWithReliability::Sort(int n) {
265 // Bubble sort key[sub] and entry[sub]
|
| /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/chromium_org/third_party/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/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/chromium_org/v8/src/ |
| list.h | 148 // Sort all list entries (using QuickSort)
149 void Sort(int (*cmp)(const T* x, const T* y));
150 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 | 193 void List<T, P>::Sort(int (*cmp)(const T* x, const T* y)) {
194 ToVector().Sort(cmp);
203 void List<T, P>::Sort() {
204 ToVector().Sort();
|
| /external/chromium_org/cc/trees/ |
| layer_sorter.h | 82 void Sort(LayerImplList::iterator first, LayerImplList::iterator last);
|
| layer_tree_host_common_perftest.cc | 188 layer_sorter_.Sort(test_list.begin(), test_list.end());
|
| layer_sorter_unittest.cc | 166 // things to sort incorrectly.
199 // If there is no reason to re-sort the layers (i.e. no 3d z difference), then
268 layer_sorter.Sort(layer_list.begin(), layer_list.end());
320 layer_sorter.Sort(layer_list.begin(), layer_list.end());
|
| /external/lldb/source/Interpreter/ |
| OptionValueEnumeration.cpp | 122 m_enumerations.Sort();
|
