Jeremy Tregunna
6fc3be617d
Some checks failed
Go Tests / Run Tests (1.24.2) (push) Has been cancelled
Adds a complete LSM-based storage engine with these features: - Single-writer based architecture for the storage engine - WAL for durability, and hey it's configurable - MemTable with skip list implementation for fast read/writes - SSTable with block-based structure for on-disk level-based storage - Background compaction with tiered strategy - ACID transactions - Good documentation (I hope)
32 lines
907 B
Go
32 lines
907 B
Go
package iterator
|
|
|
|
// Iterator defines the interface for iterating over key-value pairs
|
|
// This is used across the storage engine components to provide a consistent
|
|
// way to traverse data regardless of where it's stored.
|
|
type Iterator interface {
|
|
// SeekToFirst positions the iterator at the first key
|
|
SeekToFirst()
|
|
|
|
// SeekToLast positions the iterator at the last key
|
|
SeekToLast()
|
|
|
|
// Seek positions the iterator at the first key >= target
|
|
Seek(target []byte) bool
|
|
|
|
// Next advances the iterator to the next key
|
|
Next() bool
|
|
|
|
// Key returns the current key
|
|
Key() []byte
|
|
|
|
// Value returns the current value
|
|
Value() []byte
|
|
|
|
// Valid returns true if the iterator is positioned at a valid entry
|
|
Valid() bool
|
|
|
|
// IsTombstone returns true if the current entry is a deletion marker
|
|
// This is used during compaction to distinguish between a regular nil value and a tombstone
|
|
IsTombstone() bool
|
|
}
|