| /prebuilts/go/darwin-x86/src/cmd/internal/obj/ |
| util.go | 375 // Not even worth sorting.
444 // Not even worth sorting
|
| /prebuilts/go/linux-x86/src/cmd/internal/obj/ |
| util.go | 375 // Not even worth sorting.
444 // Not even worth sorting
|
| /external/icu/icu4c/source/test/perf/collationperf/ |
| CollPerf.pl | 220 of multi-level sorting, and other features of collation, see <a href=
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| sparsetree.go | 183 // domorder returns a value for dominator-oriented sorting.
|
| /prebuilts/go/darwin-x86/src/index/suffixarray/ |
| qsufsort.go | 5 // This algorithm is based on "Faster Suffix Sorting"
30 // initial sorting by first byte of suffix
|
| /prebuilts/go/darwin-x86/src/net/http/ |
| header.go | 111 // A headerSorter implements sort.Interface by sorting a []keyValues
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| sparsetree.go | 183 // domorder returns a value for dominator-oriented sorting.
|
| /prebuilts/go/linux-x86/src/index/suffixarray/ |
| qsufsort.go | 5 // This algorithm is based on "Faster Suffix Sorting"
30 // initial sorting by first byte of suffix
|
| /prebuilts/go/linux-x86/src/net/http/ |
| header.go | 111 // A headerSorter implements sort.Interface by sorting a []keyValues
|
| /packages/apps/DocumentsUI/src/com/android/documentsui/dirlist/ |
| DirectoryFragment.java | 102 import com.android.documentsui.sorting.SortDimension;
103 import com.android.documentsui.sorting.SortModel;
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/gen/ |
| main.go | 366 // for sorting a pair of integers by key
|
| /prebuilts/go/darwin-x86/src/go/ast/ |
| commentmap.go | 71 // does not follow source order, the sorting call below will be
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/gen/ |
| main.go | 366 // for sorting a pair of integers by key
|
| /prebuilts/go/linux-x86/src/go/ast/ |
| commentmap.go | 71 // does not follow source order, the sorting call below will be
|
| /external/v8/src/js/ |
| array.js | 965 // We do this by copying them to this object and sorting only
966 // own elements. This is not very efficient, but sorting with
970 // might interact with sorting.
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/pprof/internal/report/ |
| report.go | 170 // objSymbols is a wrapper type to enable sorting of []*objSymbol.
1117 // preprocess does any required filtering/sorting according to the
1170 // Force cum sorting for graph output, to preserve connectivity.
[all...] |
| /prebuilts/go/linux-x86/src/cmd/pprof/internal/report/ |
| report.go | 170 // objSymbols is a wrapper type to enable sorting of []*objSymbol.
1117 // preprocess does any required filtering/sorting according to the
1170 // Force cum sorting for graph output, to preserve connectivity.
[all...] |
| /external/libvorbis/doc/ |
| 07-floor1.tex | 345 Decode begins by sorting the scalars from vectors
|
| /prebuilts/go/darwin-x86/src/regexp/ |
| onepass.go | 283 // runeSlice exists to permit sorting the case-folded rune sets.
|
| /prebuilts/go/darwin-x86/src/sort/ |
| sort_test.go | 326 d.t.Errorf("%s: used %d swaps sorting slice of %d", d.desc, d.nswap, len(d.data))
|
| /prebuilts/go/linux-x86/src/regexp/ |
| onepass.go | 283 // runeSlice exists to permit sorting the case-folded rune sets.
|
| /prebuilts/go/linux-x86/src/sort/ |
| sort_test.go | 326 d.t.Errorf("%s: used %d swaps sorting slice of %d", d.desc, d.nswap, len(d.data))
|
| /prebuilts/go/darwin-x86/src/go/doc/ |
| reader.go | 687 // Sorting
699 // sortBy is a helper function for sorting
715 // sortingName returns the name to use when sorting d into place.
|
| /prebuilts/go/linux-x86/src/go/doc/ |
| reader.go | 687 // Sorting
699 // sortBy is a helper function for sorting
715 // sortingName returns the name to use when sorting d into place.
|
| /external/libunwind/doc/ |
| libunwind-dynamic.tex | 317 overhead of explicit sorting is only paid when there is a real benefit
|
