Method Has

tx_btree.go:260–289

Has returns true if the record exists. It checks without retrieving the value from disk making lookups significantly faster while keeping memory usage down as well. It does require the `HintKeyAndRAMIdxMode` option to be enabled to function as described.

(bucket string, key []byte)

// usage down as well. It does require the `HintKeyAndRAMIdxMode` option to be
// enabled to function as described.
func (tx *Tx) Has(bucket string, key []byte) (exists bool, err error) {
	if err := tx.checkTxIsClosed(); err != nil {
		return false, err
	}

	status, b := tx.getBucketAndItsStatus(DataStructureBTree, bucket)
	if isBucketNotFoundStatus(status) {
		return false, ErrNotFoundBucket
	}
	bucketId := b.Id

	status, _ = tx.findEntryAndItsStatus(DataStructureBTree, bucket, string(key))
	switch status {
	case EntryDeleted:
		return false, ErrKeyNotFound
	case EntryUpdated:
		return true, nil
	}

	idx, bucketExists := tx.db.Index.BTree.exist(bucketId)
	if !bucketExists {
		return false, ErrBucketNotExist
	}

	if _, recordExists := idx.Find(key); recordExists {
		return true, nil
	}

	return false, nil
}

// 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.