// Less reports whether the element with
// index i should sort before the element with index j in the Int16Slice.
172477
func (s Int16Slice) Less(i, j int) bool {
	return s[i] < s[j]
}
555187
func (s Int32Slice) Less(i, j int) bool {
	return s[i] < s[j]
}
998815
func (c cols2HandleSlice) Less(i, j int) bool {
	return c[i].start < c[j].start
}
1148100
func (pt PrimitiveTypes) Less(i, j int) bool {
	return pt[i] < pt[j]
}
246201
func (s *orderedTaxonomySorter) Less(i, j int) bool {
	return s.by(&s.taxonomy[i], &s.taxonomy[j])
}
504800
func (sa *SuffixArrayZ) less(i, j, d int64) bool {
	if i == j {
		return false
	}
	i = i + d
	j = j + d
	for i < sa.n && j < sa.n {
		if sa.input[i] < sa.input[j] {
			return true
		}
		if sa.input[i] > sa.input[j] {
			return false
		}
		i++
		j++
	}
	return i > j
}
438203
func (s int64Sorter) Less(i, j int) bool {
	return s[i] < s[j]
}
585733
func (r reverse) Less(i, j int) bool {
	return r.Interface.Less(j, i)
}
1168675
func (tal TabletAliasList) Less(i, j int) bool {
	if tal[i].Cell < tal[j].Cell {
		return true
	} else if tal[i].Cell > tal[j].Cell {
		return false
	}
	return tal[i].Uid < tal[j].Uid
}
527844
func (s *sstack) Less(i, j int) bool {
	return (s.blocks[i/blockSize][i%blockSize].priority - s.blocks[j/blockSize][j%blockSize].priority) > 0
}
1351456
func (s Sortable) Less(i, j int) bool {
	return len(s[i].Pointers) > len(s[j].Pointers)

}
539097
func (vs VersionSlice) Less(i, j int) bool {
	return Vercmp(vs[i], vs[j]) == -1
}
859412
func (b *Sortable) Less(i, j int) bool {
	for _, c := range b.Comparators {
		if c(i, j) {
			return true
		} else if c(j, i) {
			return false
		}
	}
	return false
}
117423
func (r Responses) Less(i, j int) bool {
	if r[i].Status == r[j].Status {
		return r[i].Name < r[j].Name
	}
	return r[i].Status < r[j].Status
}
1057464
func (s Uint32Slice) Less(i, j int) bool {
	return s[i] < s[j]
}
1194349
func (slice RevelHooks) Less(i, j int) bool {
	return slice[i].order < slice[j].order
}
1351272
func (s sortableInputSlice) Less(i, j int) bool {
	// Input hashes are the same, so compare the index.
	ihash := s[i].PreviousOutPoint.Hash
	jhash := s[j].PreviousOutPoint.Hash
	if ihash == jhash {
		return s[i].PreviousOutPoint.Index < s[j].PreviousOutPoint.Index
	}

	// At this point, the hashes are not equal, so reverse them to
	// big-endian and return the result of the comparison.
	const hashSize = chainhash.HashSize
	for b := 0; b < hashSize/2; b++ {
		ihash[b], ihash[hashSize-1-b] = ihash[hashSize-1-b], ihash[b]
		jhash[b], jhash[hashSize-1-b] = jhash[hashSize-1-b], jhash[b]
	}
	return bytes.Compare(ihash[:], jhash[:]) == -1
}