func (t *funcTab) sort() {
	sort.Slice(t.entries, func(i, j int) bool {
		return t.entries[i].min < t.entries[j].min
	})
}
func (t *funcTab) sort() {
	sort.Slice(t.entries, func(i, j int) bool {
		return t.entries[i].min < t.entries[j].min
	})
}
func ( t * funcTab ) sort ( ) { sort . Slice ( t . entries , func ( i , j int ) bool { return t . entries [ i ] . min < t . entries [ j ] . min } ) }
// sort must be called after all the adds, but before any find.
sort must be called after all the adds but before any find .