sort.Interface.Less (method)
23 uses
sort (current package)
sort.go#L36: Less(i, j int) bool
sort.go#L96: return r.Interface.Less(j, i)
sort.go#L111: if data.Less(i, i-1) {
zsortinterface.go#L12: for j := i; j > a && data.Less(j, j-1); j-- {
zsortinterface.go#L27: if child+1 < hi && data.Less(first+child, first+child+1) {
zsortinterface.go#L30: if !data.Less(first+root, first+child) {
zsortinterface.go#L108: if a > 0 && !data.Less(a-1, pivot) {
zsortinterface.go#L139: for i <= j && data.Less(i, a) {
zsortinterface.go#L142: for i <= j && !data.Less(j, a) {
zsortinterface.go#L154: for i <= j && data.Less(i, a) {
zsortinterface.go#L157: for i <= j && !data.Less(j, a) {
zsortinterface.go#L178: for i <= j && !data.Less(a, i) {
zsortinterface.go#L181: for i <= j && data.Less(a, j) {
zsortinterface.go#L202: for i < b && !data.Less(i, i-1) {
zsortinterface.go#L219: if !data.Less(j, j-1) {
zsortinterface.go#L228: if !data.Less(j, j-1) {
zsortinterface.go#L299: if data.Less(b, a) {
zsortinterface.go#L390: if data.Less(h, a) {
zsortinterface.go#L414: if !data.Less(m, h) {
zsortinterface.go#L441: if !data.Less(p-c, c) {
container/heap
heap.go#L92: if i == j || !h.Less(j, i) {
heap.go#L108: if j2 := j1 + 1; j2 < n && h.Less(j2, j1) {
heap.go#L111: if !h.Less(j, i) {