Documentation ¶
Index ¶
- Constants
- Variables
- func TestBatchDelete(t *testing.T, db Database)
- func TestBatchInner(t *testing.T, db Database)
- func TestBatchPut(t *testing.T, db Database)
- func TestBatchReplay(t *testing.T, db Database)
- func TestBatchReset(t *testing.T, db Database)
- func TestBatchReuse(t *testing.T, db Database)
- func TestBatchRewrite(t *testing.T, db Database)
- func TestCompactNoPanic(t *testing.T, db Database)
- func TestIterator(t *testing.T, db Database)
- func TestIteratorClosed(t *testing.T, db Database)
- func TestIteratorMemorySafety(t *testing.T, db Database)
- func TestIteratorPrefix(t *testing.T, db Database)
- func TestIteratorStart(t *testing.T, db Database)
- func TestIteratorStartPrefix(t *testing.T, db Database)
- func TestSimpleKeyValue(t *testing.T, db Database)
- func TestSimpleKeyValueClosed(t *testing.T, db Database)
- func TestStatNoPanic(t *testing.T, db Database)
- type Batch
- type Batcher
- type Compacter
- type Database
- type Iteratee
- type Iterator
- type KeyValueReader
- type KeyValueWriter
- type Stater
Constants ¶
const ( // MaxExcessCapacityFactor ... // If, when a batch is reset, the cap(batch)/len(batch) > MaxExcessCapacityFactor, // the underlying array's capacity will be reduced by a factor of capacityReductionFactor. // Higher value for MaxExcessCapacityFactor --> less aggressive array downsizing --> less memory allocations // but more unnecessary data in the underlying array that can't be garbage collected. // Higher value for CapacityReductionFactor --> more aggressive array downsizing --> more memory allocations // but less unnecessary data in the underlying array that can't be garbage collected. MaxExcessCapacityFactor = 4 // CapacityReductionFactor ... CapacityReductionFactor = 2 )
Variables ¶
var ( ErrClosed = errors.New("closed") ErrNotFound = errors.New("not found") )
common errors
var ( // Tests is a list of all database tests Tests = []func(t *testing.T, db Database){ TestSimpleKeyValue, TestSimpleKeyValueClosed, TestBatchPut, TestBatchDelete, TestBatchReset, TestBatchReuse, TestBatchRewrite, TestBatchReplay, TestBatchInner, TestIterator, TestIteratorStart, TestIteratorPrefix, TestIteratorStartPrefix, TestIteratorMemorySafety, TestIteratorClosed, TestStatNoPanic, TestCompactNoPanic, } )
Functions ¶
func TestIteratorMemorySafety ¶ added in v0.8.0
TestIteratorMemorySafety ...
func TestIteratorStartPrefix ¶
TestIteratorStartPrefix ...
func TestSimpleKeyValueClosed ¶
TestSimpleKeyValueClosed ...
Types ¶
type Batch ¶
type Batch interface { KeyValueWriter // ValueSize retrieves the amount of data queued up for writing. ValueSize() int // Write flushes any accumulated data to disk. Write() error // Reset resets the batch for reuse. Reset() // Replay replays the batch contents. Replay(w KeyValueWriter) error // Inner returns a Batch writing to the inner database, if one exists. If // this batch is already writing to the base DB, then itself should be // returned. Inner() Batch }
Batch is a write-only database that commits changes to its host database when Write is called. A batch cannot be used concurrently.
type Batcher ¶
type Batcher interface { // NewBatch creates a write-only database that buffers changes to its host db // until a final write is called. NewBatch() Batch }
Batcher wraps the NewBatch method of a backing data store.
type Compacter ¶
type Compacter interface { // Compact the underlying DB for the given key range. // Specifically, deleted and overwritten versions are discarded, // and the data is rearranged to reduce the cost of operations // needed to access the data. This operation should typically only // be invoked by users who understand the underlying implementation. // // A nil start is treated as a key before all keys in the DB. // And a nil limit is treated as a key after all keys in the DB. // Therefore if both are nil then it will compact entire DB. Compact(start []byte, limit []byte) error }
Compacter wraps the Compact method of a backing data store.
type Database ¶
type Database interface { KeyValueReader KeyValueWriter Batcher Iteratee Stater Compacter io.Closer }
Database contains all the methods required to allow handling different key-value data stores backing the database.
type Iteratee ¶
type Iteratee interface { // NewIterator creates a binary-alphabetical iterator over the entire // keyspace contained within the key-value database. NewIterator() Iterator // NewIteratorWithStart creates a binary-alphabetical iterator over a subset // of database content starting at a particular initial key (or after, if it // does not exist). NewIteratorWithStart(start []byte) Iterator // NewIteratorWithPrefix creates a binary-alphabetical iterator over a // subset of database content with a particular key prefix. NewIteratorWithPrefix(prefix []byte) Iterator // NewIteratorWithStartAndPrefix creates a binary-alphabetical iterator over // a subset of database content with a particular key prefix starting at a // specified key. NewIteratorWithStartAndPrefix(start, prefix []byte) Iterator }
Iteratee wraps the NewIterator methods of a backing data store.
type Iterator ¶
type Iterator interface { // Next moves the iterator to the next key/value pair. It returns whether // the iterator is exhausted. Next() bool // Error returns any accumulated error. Exhausting all the key/value pairs // is not considered to be an error. Error() error // Key returns the key of the current key/value pair, or nil if done. Key() []byte // Value returns the value of the current key/value pair, or nil if done. Value() []byte // Release releases associated resources. Release should always succeed and // can be called multiple times without causing error. Release() }
Iterator iterates over a database's key/value pairs in ascending key order.
When it encounters an error any seek will return false and will yield no key/ value pairs. The error can be queried by calling the Error method. Calling Release is still necessary.
An iterator must be released after use, but it is not necessary to read an iterator until exhaustion. An iterator is not safe for concurrent use, but it is safe to use multiple iterators concurrently.
type KeyValueReader ¶
type KeyValueReader interface { // Has retrieves if a key is present in the key-value data store. Has(key []byte) (bool, error) // Get retrieves the given key if it's present in the key-value data store. Get(key []byte) ([]byte, error) }
KeyValueReader wraps the Has and Get method of a backing data store.