Method RangeScanEntries

tx_btree.go:293–338

RangeScanEntries query a range at given bucket, start and end slice. It will return keys and/or values based on the includeKeys and includeValues flags.

(bucket string, start, end []byte, includeKeys, includeValues bool)

// RangeScanEntries query a range at given bucket, start and end slice. It will
// return keys and/or values based on the includeKeys and includeValues flags.
func (tx *Tx) RangeScanEntries(bucket string, start, end []byte, includeKeys, includeValues bool) (keys, values [][]byte, err error) {
	if err := tx.checkTxIsClosed(); err != nil {
		return nil, nil, err
	}
	status, b := tx.getBucketAndItsStatus(DataStructureBTree, bucket)
	if isBucketNotFoundStatus(status) {
		return nil, nil, ErrNotFoundBucket
	}
	bucketId := b.Id
	pendingKeys, pendingValues := tx.pendingWrites.getDataByRange(start, end, b.Name)
	if index, ok := tx.db.Index.BTree.exist(bucketId); ok {
		records := index.Range(start, end)

		needKeysForMerge := includeKeys || len(pendingKeys) > 0

		keys, values, err = tx.getHintIdxDataItemsWrapper(
			records, ScanNoLimit, bucketId, needKeysForMerge, includeValues,
		)
		if err != nil && len(pendingKeys) == 0 && len(pendingValues) == 0 {
			// If there is no item in pending and persist db,
			// return error itself.
			return nil, nil, err
		}
	}

	if len(pendingKeys) > 0 || len(pendingValues) > 0 {
		keys, values = mergeKeyValues(pendingKeys, pendingValues, keys, values)
	}

	// Check for empty results before setting to nil
	if includeKeys && len(keys) == 0 {
		return nil, nil, ErrRangeScan
	}
	if includeValues && len(values) == 0 {
		return nil, nil, ErrRangeScan
	}

	if !includeKeys {
		keys = nil
	}
	if !includeValues {
		values = nil
	}

	return
}

// RangeScan query a range at given bucket, start and end slice.
func (tx *Tx) RangeScan(bucket string, start, end []byte) (values [][]byte, err error) {