| /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));
|
| dns_test_util.cc | 165 virtual void Sort(const AddressList& list,
|
| /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/cc/resources/ |
| prioritized_tile_set.h | 25 void Sort();
|
| prioritized_tile_set_unittest.cc | 87 set.Sort();
97 set.Sort();
125 set.Sort();
157 set.Sort();
160 std::sort(tiles.begin(), tiles.end(), BinComparator());
191 set.Sort();
194 std::sort(tiles.begin(), tiles.end(), BinComparator());
225 set.Sort();
228 std::sort(tiles.begin(), tiles.end(), BinComparator());
259 set.Sort();
[all...] |
| prioritized_tile_set.cc | 61 std::sort(tiles->begin(), tiles->end(), BinComparator());
83 void PrioritizedTileSet::Sort() {
|
| /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 | 67 void Sort(int (*comparator)(const dirent**, const dirent**)) {
68 // If we have entries and a comparator, sort them.
110 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/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>);
|
| /external/chromium_org/v8/src/ |
| list-inl.h | 215 void List<T, P>::Sort(int (*cmp)(const T* x, const T* y)) {
216 ToVector().Sort(cmp);
225 void List<T, P>::Sort() {
226 ToVector().Sort();
|
| list.h | 166 // Sort all list entries (using QuickSort)
167 void Sort(int (*cmp)(const T* x, const T* y));
168 void Sort();
|
| small-pointer-list.h | 72 void Sort() {
74 list()->Sort(compare_value);
|
| /external/chromium_org/cc/trees/ |
| layer_sorter.h | 82 void Sort(LayerImplList::iterator first, LayerImplList::iterator last);
|
| layer_sorter_unittest.cc | 165 // things to sort incorrectly.
198 // If there is no reason to re-sort the layers (i.e. no 3d z difference), then
266 layer_sorter.Sort(layer_list.begin(), layer_list.end());
317 layer_sorter.Sort(layer_list.begin(), layer_list.end());
|
| /external/chromium_org/net/quic/congestion_control/ |
| quic_max_sized_map_test.cc | 45 TEST_F(QuicMaxSizedMapTest, Sort) {
|
| /art/runtime/gc/accounting/ |
| atomic_stack.h | 134 void Sort() {
137 std::sort(Begin(), End());
|
| /external/chromium_org/v8/test/intl/collator/ |
| de-sort.js | 28 // Sort plain German text using defaults.
34 var result = strings.sort(collator.compare);
|
