| /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 | 7 // Package sort provides primitives for sorting slices and user-defined
9 package sort package
11 // A type, typically a collection, that satisfies sort.Interface can be
18 // index i should sort before the element with index j.
24 // Insertion sort
71 // ``Engineering a Sort Function,'' SP&E November 1993.
75 // sort 3 elements
213 // Sort sorts data.
215 // data.Less and data.Swap. The sort is not guaranteed to be stable.
216 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 | 7 // Package sort provides primitives for sorting slices and user-defined
9 package sort package
11 // A type, typically a collection, that satisfies sort.Interface can be
18 // index i should sort before the element with index j.
24 // Insertion sort
71 // ``Engineering a Sort Function,'' SP&E November 1993.
75 // sort 3 elements
213 // Sort sorts data.
215 // data.Less and data.Swap. The sort is not guaranteed to be stable.
216 func Sort(data Interface)
[all...] |
| /art/tools/ahat/src/main/com/android/ahat/heapdump/ |
| Sort.java | 33 public class Sort {
86 * Constructs a comparator giving sort priority to earlier comparators in
96 * Constructs a comparator giving sort priority to earlier comparators in
117 * Returns a comparator that gives sort priority to earlier comparators in
129 * Returns a comparator that gives a default instance sort for the given
|
| /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 | 58 // This comparator is for std::sort.
195 void Sort() {
198 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 | 205 void List<T, P>::Sort(CompareFunction cmp) {
206 Sort(cmp, 0, length_);
212 void List<T, P>::Sort(CompareFunction cmp, size_t s, size_t l) {
213 ToVector().Sort(cmp, s, l);
221 void List<T, P>::Sort() {
222 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
|
| /system/security/keystore/ |
| authorization_set.cpp | 90 void AuthorizationSet::Sort() {
91 std::sort(data_.begin(), data_.end(), keyParamLess);
97 Sort();
|
| /external/protobuf/python/google/protobuf/pyext/ |
| repeated_composite_container.cc | 338 // sort()
364 ScopedPyObjectPtr m(PyObject_GetAttrString(self->child_messages, "sort"));
375 static PyObject* Sort(RepeatedCompositeContainer* self,
562 { "sort", (PyCFunction) Sort, METH_VARARGS | METH_KEYWORDS,
|
| /external/tensorflow/tensorflow/compiler/jit/graphcycles/ |
| graphcycles.cc | 19 // A dynamic topological sort algorithm for directed acyclic graphs
27 // with the topological sort of the graph. I.e., path from x to y
160 static void Sort(const Vec<Node*>&, Vec<int32>* delta);
248 Sort(r->nodes_, &r->deltab_);
249 Sort(r->nodes_, &r->deltaf_);
267 static void Sort(const Vec<Node*>& nodes, Vec<int32>* delta) {
276 std::sort(delta->begin(), delta->end(), cmp);
|
| /frameworks/base/tools/aapt2/ |
| StringPool.cpp | 305 std::sort(entries.begin(), entries.end(), [&cmp](const UEntry& a, const UEntry& b) -> bool {
313 std::sort(entries.begin(), entries.end(),
318 void StringPool::Sort(const std::function<int(const Context&, const Context&)>& cmp) {
|
| /hardware/interfaces/keymaster/3.0/vts/functional/ |
| authorization_set.cpp | 93 void AuthorizationSet::Sort() {
94 std::sort(data_.begin(), data_.end(), keyParamLess);
100 Sort();
|
| /hardware/interfaces/keymaster/4.0/support/ |
| authorization_set.cpp | 84 void AuthorizationSet::Sort() {
85 std::sort(data_.begin(), data_.end(), keyParamLess);
91 Sort();
|
| /system/extras/simpleperf/ |
| sample_tree.h | 34 // build the tree, sort the tree, and display it. For example, if we want to
40 // 2. Sort the SampleTree by cpu-cycles in the sample. As we want to display the
41 // samples in a decreasing order of cpu-cycles, we should sort it like this.
50 // sorted by SampleTreeSorter. The sort result decides the order to show
316 void Sort(std::vector<EntryT*>& v, bool sort_callchain) {
323 std::sort(v.begin(), v.end(), [this](const EntryT* s1, const EntryT* s2) {
|
| /system/keymaster/android_keymaster/ |
| authorization_set.cpp | 149 void AuthorizationSet::Sort() {
155 Sort();
175 Sort();
|
| /external/lzma/CPP/Common/ |
| MyVector.h | 343 void Sort(int (*compare)(const T*, const T*, void *), void *param)
615 void Sort(int (*compare)(void *const *, void *const *, void *), void *param)
616 { _v.Sort(compare, param); }
621 void Sort() { _v.Sort(CompareObjectItems, 0); }
|
| /prebuilts/go/darwin-x86/src/cmd/vendor/github.com/google/pprof/internal/graph/ |
| graph.go | 22 "sort"
285 sort.Sort(ts)
496 sort.Strings(labels)
777 // Sort nodes based on requested mode
780 // Specialized sort to produce a more visually-interesting graph
781 g.Nodes.Sort(EntropyOrder)
783 g.Nodes.Sort(CumNameOrder)
785 g.Nodes.Sort(FlatNameOrder)
855 in := n.In.Sort()
[all...] |
