// store inserts si into the sorted results, if si has a high enough score.
store inserts si into the sorted results, if si has a high enough score.
// store inserts si into the sorted results if si has a high enough score .
func (sc *symbolStore) store(si symbolInformation) {
	if sc.tooLow(si.score) {
		return
	}
	insertAt := sort.Search(len(sc.res), func(i int) bool {
		return sc.res[i].score < si.score
	})
	if insertAt < len(sc.res)-1 {
		copy(sc.res[insertAt+1:], sc.res[insertAt:len(sc.res)-1])
	}
	sc.res[insertAt] = si
}
func ( sc * symbolStore ) store ( si symbolInformation ) { if sc . tooLow ( si . score ) { return } insertAt := sort . Search ( len ( sc . res ) , func ( i int ) bool { return sc . res [ i ] . score < si . score } ) if insertAt < len ( sc . res ) - 1 { copy ( sc . res [ insertAt + 1 : ] , sc . res [ insertAt : len ( sc . res ) - 1 ] ) } sc . res [ insertAt ] = si }
store inserts si into the sorted results, if si has a high enough score.
store inserts si into the sorted results if si has a high enough score .