| /external/libgdx/gdx/src/com/badlogic/gdx/utils/ |
| Sort.java | 18 /** Provides methods to sort arrays of objects. Sorting requires working memory and this class allows that memory to be reused to
19 * avoid allocation. The sorting is otherwise identical to the Arrays.sort methods (uses timsort).<br>
21 * Note that sorting primitive arrays with the Arrays.sort methods does not allocate memory (unless sorting large arrays of char,
24 public class Sort {
25 static private Sort instance;
30 public <T> void sort (Array<T> a) {
method in class:Sort
35 public <T> void sort (T[] a) {
method in class:Sort
40 public <T> void sort (T[] a, int fromIndex, int toIndex) {
method in class:Sort
45 public <T> void sort (Array<T> a, Comparator<? super T> c) {
method in class:Sort
50 public <T> void sort (T[] a, Comparator<? super T> c) { method in class:Sort
55 public <T> void sort (T[] a, Comparator<? super T> c, int fromIndex, int toIndex) { method in class:Sort
[all...] |
| /prebuilts/go/darwin-x86/src/go/scanner/ |
| errors.go | 11 "sort"
47 // ErrorList implements the sort Interface.
69 // Sort sorts an ErrorList. *Error entries are sorted by position,
73 func (p ErrorList) Sort() {
74 sort.Sort(p)
79 sort.Sort(p)
|
| /prebuilts/go/darwin-x86/src/sort/ |
| example_keys_test.go | 9 "sort"
26 // Sort is a method on the function type, By, that sorts the argument slice according to the function.
27 func (by By) Sort(planets []Planet) {
30 by: by, // The Sort method's receiver is the function (closure) that defines the sort order.
32 sort.Sort(ps)
41 // Len is part of sort.Interface.
46 // Swap is part of sort.Interface.
51 // Less is part of sort.Interface. It is implemented by calling the "by" closure in the sorter
[all...] |
| example_multi_test.go | 9 "sort"
21 // multiSorter implements the Sort interface, sorting the changes within.
27 // Sort sorts the argument slice according to the less functions passed to OrderedBy.
28 func (ms *multiSorter) Sort(changes []Change) {
30 sort.Sort(ms)
34 // Call its Sort method to sort the data.
41 // Len is part of sort.Interface.
46 // Swap is part of sort.Interface
[all...] |
| sort.go | 5 // Package sort provides primitives for sorting slices and user-defined
7 package sort package
9 // A type, typically a collection, that satisfies sort.Interface can be
16 // index i should sort before the element with index j.
29 // Insertion sort
76 // ``Engineering a Sort Function,'' SP&E November 1993.
80 // sort 3 elements
188 // Sort sorts data.
190 // data.Less and data.Swap. The sort is not guaranteed to be stable.
191 func Sort(data Interface)
[all...] |
| /prebuilts/go/linux-x86/src/go/scanner/ |
| errors.go | 11 "sort"
47 // ErrorList implements the sort Interface.
69 // Sort sorts an ErrorList. *Error entries are sorted by position,
73 func (p ErrorList) Sort() {
74 sort.Sort(p)
79 sort.Sort(p)
|
| /prebuilts/go/linux-x86/src/sort/ |
| example_keys_test.go | 9 "sort"
26 // Sort is a method on the function type, By, that sorts the argument slice according to the function.
27 func (by By) Sort(planets []Planet) {
30 by: by, // The Sort method's receiver is the function (closure) that defines the sort order.
32 sort.Sort(ps)
41 // Len is part of sort.Interface.
46 // Swap is part of sort.Interface.
51 // Less is part of sort.Interface. It is implemented by calling the "by" closure in the sorter
[all...] |
| example_multi_test.go | 9 "sort"
21 // multiSorter implements the Sort interface, sorting the changes within.
27 // Sort sorts the argument slice according to the less functions passed to OrderedBy.
28 func (ms *multiSorter) Sort(changes []Change) {
30 sort.Sort(ms)
34 // Call its Sort method to sort the data.
41 // Len is part of sort.Interface.
46 // Swap is part of sort.Interface
[all...] |
| sort.go | 5 // Package sort provides primitives for sorting slices and user-defined
7 package sort package
9 // A type, typically a collection, that satisfies sort.Interface can be
16 // index i should sort before the element with index j.
29 // Insertion sort
76 // ``Engineering a Sort Function,'' SP&E November 1993.
80 // sort 3 elements
188 // Sort sorts data.
190 // data.Less and data.Swap. The sort is not guaranteed to be stable.
191 func Sort(data Interface)
[all...] |
| /art/tools/ahat/src/ |
| Sort.java | 35 class Sort {
|
| /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);
|
| /art/runtime/gc/accounting/ |
| atomic_stack.h | 48 // This comparator is for std::sort.
185 void Sort() {
188 std::sort(Begin(), End(), ObjectComparator());
|
| /external/gemmlowp/profiling/ |
| profiler.h | 232 std::sort(node->children.begin(), node->children.end(), CompareNodes);
238 void Sort() { SortNode(&root_); }
246 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);
|
| /external/webrtc/webrtc/system_wrappers/source/ |
| sort.cc | 16 #include "webrtc/system_wrappers/include/sort.h"
26 #include <algorithm> // std::sort
202 std::sort(data_type, data_type + num_of_elements);
274 std::sort(ptr_sort_key, ptr_sort_key + num_of_elements,
287 int32_t Sort(void* data, uint32_t num_of_elements, Type type) {
328 // Fall back to std::sort for 64-bit types and floats due to compiler
450 // Fall back to std::sort for 64-bit types and floats due to compiler
|
| /prebuilts/go/darwin-x86/src/regexp/ |
| onepass.go | 10 "sort"
289 // Sort is a convenience method.
290 func (p runeSlice) Sort() {
291 sort.Sort(p)
405 sort.Sort(runeSlice(runes))
429 sort.Sort(runeSlice(runes))
|
| /prebuilts/go/linux-x86/src/regexp/ |
| onepass.go | 10 "sort"
289 // Sort is a convenience method.
290 func (p runeSlice) Sort() {
291 sort.Sort(p)
405 sort.Sort(runeSlice(runes))
429 sort.Sort(runeSlice(runes))
|
| /external/pdfium/xfa/src/fwl/src/lightwidget/ |
| listbox.cpp | 127 FWL_ERR* CFWL_ListBox::Sort(IFWL_ListBoxCompare* pCom) {
128 return static_cast<IFWL_ListBox*>(m_pIface)->Sort(pCom);
|
| /system/keymaster/ |
| authorization_set.cpp | 149 void AuthorizationSet::Sort() {
155 Sort();
175 Sort();
|
| /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); }
|
| /external/protobuf/python/google/protobuf/pyext/ |
| repeated_composite_container.cc | 119 return 0; // Nothing to sort.
175 /* sort [start..right[ */
180 /* sort [left..limit[ */
183 /* sort [left..limit[ */
188 /* sort [start..right[ */
486 // sort()
491 // Sort the underlying Message array.
498 if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOi:sort",
534 ScopedPyObjectPtr m(PyObject_GetAttrString(self->child_messages, "sort"));
542 static PyObject* Sort(RepeatedCompositeContainer* self
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| dxtmpl.h | 109 void Sort(int (__cdecl *compare)(const void *elem1,const void *elem2));
293 void CDXArray<TYPE,ARG_TYPE>::Sort(int (__cdecl *compare)(const void *elem1,const void *elem2)) {
|
| /external/pdfium/fpdfsdk/include/ |
| fsdk_mgr.h | 676 void Sort(LP_COMPARE pCompare, FX_BOOL bAscent = TRUE) {
|
| /external/pdfium/xfa/src/fwl/src/basewidget/ |
| fwl_listboximp.cpp | 55 FWL_ERR* IFWL_ListBox::Sort(IFWL_ListBoxCompare* pCom) {
56 return static_cast<CFWL_ListBoxImp*>(GetImpl())->Sort(pCom);
307 FWL_ERR* CFWL_ListBoxImp::Sort(IFWL_ListBoxCompare* pCom) {
[all...] |
