Method SeekTo

iterator.go:303–349

(seekToKey []byte)

}

func (iter *iterator) SeekTo(seekToKey []byte) error {
	key, _, err := iter.Current()
	if err != nil && err != ErrIteratorDone {
		return err
	}

	if key != nil {
		cmp := bytes.Compare(seekToKey, key)
		if cmp == 0 {
			return nil
		}

		if cmp > 0 {
			// Try a loop of naive Next()'s for several attempts.
			err = naiveSeekTo(iter, seekToKey, DefaultNaiveSeekToMaxTries)
			if err != ErrMaxTries {
				return err
			}
		}
	}

	// The seekToKey is before our current position, or we gave up on
	// the naiveSeekTo(), so start a brand new iterator to replace our
	// current iterator, bounded by the startKeyInclusive.
	//
	if bytes.Compare(seekToKey, iter.startKeyInclusive) < 0 {
		seekToKey = iter.startKeyInclusive
	}

	iterNew, err := iter.ss.startIterator(seekToKey,
		iter.endKeyExclusive, iter.iteratorOptions)
	if err != nil {
		return err
	}

	iterOld := *iter // Clone current iterator before overwriting it.
	iterOld.closer = nil

	iter.cursors = iterNew.cursors
	iter.lowerLevelIter = iterNew.lowerLevelIter

	iterOld.Close()

	_, _, err = iter.Current()

	return err
}

func naiveSeekTo(iter Iterator, seekToKey []byte, maxTries int) error {
	for i := 0; maxTries <= 0 || i < maxTries; i++ {