| /prebuilts/go/darwin-x86/test/fixedbugs/ |
| bug151.go | 13 func (v S) Less(e Empty) bool {
|
| /prebuilts/go/linux-x86/test/fixedbugs/ |
| bug151.go | 13 func (v S) Less(e Empty) bool {
|
| /prebuilts/go/darwin-x86/doc/progs/ |
| eff_sequence.go | 24 func (s Sequence) Less(i, j int) bool {
|
| /prebuilts/go/darwin-x86/src/cmd/internal/obj/ |
| bootstrap.go | 14 func SortSlice(slice interface{}, less func(i, j int) bool) {
17 x := sliceByFn{val: val, tmp: tmp, less: less}
24 less func(i, j int) bool
28 func (x sliceByFn) Less(i, j int) bool { return x.less(i, j) }
|
| /prebuilts/go/darwin-x86/src/cmd/link/internal/ld/ |
| typelink.go | 20 func (s byTypeStr) Less(i, j int) bool { return s[i].TypeStr < s[j].TypeStr }
|
| /prebuilts/go/darwin-x86/src/runtime/pprof/ |
| label_test.go | 24 func (s labelSorter) Less(i, j int) bool { return s[i].key < s[j].key }
|
| /prebuilts/go/darwin-x86/test/bench/garbage/ |
| stats.go | 40 func (t T) Less(i, j int) bool { return t[i] < t[j] }
|
| /prebuilts/go/linux-x86/doc/progs/ |
| eff_sequence.go | 24 func (s Sequence) Less(i, j int) bool {
|
| /prebuilts/go/linux-x86/src/cmd/internal/obj/ |
| bootstrap.go | 14 func SortSlice(slice interface{}, less func(i, j int) bool) {
17 x := sliceByFn{val: val, tmp: tmp, less: less}
24 less func(i, j int) bool
28 func (x sliceByFn) Less(i, j int) bool { return x.less(i, j) }
|
| /prebuilts/go/linux-x86/src/cmd/link/internal/ld/ |
| typelink.go | 20 func (s byTypeStr) Less(i, j int) bool { return s[i].TypeStr < s[j].TypeStr }
|
| /prebuilts/go/linux-x86/src/runtime/pprof/ |
| label_test.go | 24 func (s labelSorter) Less(i, j int) bool { return s[i].key < s[j].key }
|
| /prebuilts/go/linux-x86/test/bench/garbage/ |
| stats.go | 40 func (t T) Less(i, j int) bool { return t[i] < t[j] }
|
| /build/soong/env/ |
| env.go | 91 func (e envFileData) Less(i, j int) bool {
|
| /external/skia/src/core/ |
| SkPtrRecorder.cpp | 20 bool SkPtrSet::Less(const Pair& a, const Pair& b) {
33 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair));
49 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair));
|
| /external/skqp/src/core/ |
| SkPtrRecorder.cpp | 20 bool SkPtrSet::Less(const Pair& a, const Pair& b) {
33 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair));
49 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair));
|
| /prebuilts/go/darwin-x86/src/container/heap/ |
| example_intheap_test.go | 17 func (h IntHeap) Less(i, j int) bool { return h[i] < h[j] }
|
| example_pq_test.go | 26 func (pq PriorityQueue) Less(i, j int) bool {
|
| /prebuilts/go/darwin-x86/src/go/internal/gcimporter/ |
| gcimporter.go | 177 func (a byPath) Less(i, j int) bool { return a[i].Path() < a[j].Path() }
|
| /prebuilts/go/darwin-x86/src/go/types/ |
| ordering.go | 122 func (a inSourceOrder) Less(i, j int) bool { return a[i].order() < a[j].order() }
|
| /prebuilts/go/darwin-x86/src/index/suffixarray/ |
| qsufsort.go | 142 func (x *suffixSortable) Less(i, j int) bool { return x.inv[x.sa[i]+x.h] < x.inv[x.sa[j]+x.h] }
|
| /prebuilts/go/darwin-x86/src/net/ |
| interface_windows_test.go | 29 t.Errorf("%s: got %d; want less than or equal to 1<<31 - 1", ifi.Name, ifi.MTU)
47 func (ps byAddrLen) Less(i, j int) bool {
|
| /prebuilts/go/darwin-x86/src/sort/ |
| example_interface_test.go | 27 func (a ByAge) Less(i, j int) bool { return a[i].Age < a[j].Age }
44 // The other way is to use sort.Slice with a custom Less
48 // the closure with ByAge.Less.
|
| /prebuilts/go/linux-x86/src/container/heap/ |
| example_intheap_test.go | 17 func (h IntHeap) Less(i, j int) bool { return h[i] < h[j] }
|
| example_pq_test.go | 26 func (pq PriorityQueue) Less(i, j int) bool {
|
| /prebuilts/go/linux-x86/src/go/internal/gcimporter/ |
| gcimporter.go | 177 func (a byPath) Less(i, j int) bool { return a[i].Path() < a[j].Path() }
|
