sort.Interface.Less (method)
24 uses
sort (current package)
sort.go#L31: Less(i, j int) bool
sort.go#L40: for j := i; j > a && data.Less(j, j-1); j-- {
sort.go#L55: if child+1 < hi && data.Less(first+child, first+child+1) {
sort.go#L58: if !data.Less(first+root, first+child) {
sort.go#L89: if data.Less(m1, m0) {
sort.go#L93: if data.Less(m2, m1) {
sort.go#L96: if data.Less(m1, m0) {
sort.go#L130: for ; a < c && data.Less(a, pivot); a++ {
sort.go#L134: for ; b < c && !data.Less(pivot, b); b++ { // data[b] <= pivot
sort.go#L136: for ; b < c && data.Less(pivot, c-1); c-- { // data[c-1] > pivot
sort.go#L152: if !data.Less(pivot, hi-1) { // data[hi-1] = pivot
sort.go#L157: if !data.Less(b-1, pivot) { // data[b-1] = pivot
sort.go#L164: if !data.Less(m, pivot) { // data[m] = pivot
sort.go#L178: for ; a < b && !data.Less(b-1, pivot); b-- { // data[b] == pivot
sort.go#L180: for ; a < b && data.Less(a, pivot); a++ { // data[a] < pivot
sort.go#L218: if data.Less(i, i-6) {
sort.go#L260: return r.Interface.Less(j, i)
sort.go#L272: if data.Less(i, i-1) {
sort.go#L437: if data.Less(h, a) {
sort.go#L461: if !data.Less(m, h) {
sort.go#L488: if !data.Less(p-c, c) {
container/heap
heap.go#L93: if i == j || !h.Less(j, i) {
heap.go#L109: if j2 := j1 + 1; j2 < n && h.Less(j2, j1) {
heap.go#L112: if !h.Less(j, i) {