mylsm-lsm-store

Search uses release 0.3.2.0 · 672 definitions

Releases (6)

0.5.0.0 invalid
expected a fresh constructor name (duplicate declaration: Text)

at src/SstFile.bend:543
12 files do not load
0.4.0.0 invalid
expected a fresh constructor name (duplicate declaration: Text)

at src/SstFile.bend:543
10 files do not load
0.3.2.0 indexed
0.3.1.0 unindexed
0.3.0.0 unindexed
0.2.0.0 unindexed

Definitions (672)

mylsm.bend

def cmp--- Level 2: part control (1:1 delegates) ---
def eqKey equality: true exactly for identical strings.
def mem_emptyEmpty MemTable: no entries, count zero.
def mem_putMemTable with one live version prepended (newest-first log).
def mem_delMemTable with one tombstone prepended; hides older versions on read.
def mem_getNewest-first read; a tombstone answers None and hides older versions.
def mem_countNumber of log entries, live and tombstoned.
def sort_newestCanonicalize newest-first entries into a strict ordered run.
def range_scanRange scan over a merged run: lo <= key < hi, tombstones dropped.
def sst_buildBuild an SSTable, canonicalizing entries newest-first.
def sst_from_sorted_uniqueBuild an SSTable trusting an already strict, unique run (no sorting).
def sst_build_sortedBuild an SSTable from a sorted run with an explicit key estimate.
def wal_encodeEncode a WAL batch to its exact on-disk bytes.
def wal_decodeDecode WAL bytes; None on corrupt or truncated input (fail-closed).
def sst_serializeSerialize entries to the compact v2 table wire format.
def sst_parseParse v2 table bytes with checksum verification; None when rejected.
def mfst_serializeSerialize a Manifest to its exact on-disk bytes.
def mfst_parseParse Manifest bytes; None on corrupt input (fail-closed).
type Sess--- Level 1: Sess session monad (primary API) ---
def Sess.pure
def Sess.run_go
def Sess.apply
def Sess.bind
def openOpen a database handle over a directory label (pure; no IO touched).
def reopenReopen a directory replaying wal.log chunks into a fresh memtable.
def put_goPure put transition used by the session action.
def del_goPure delete transition used by the session action.
def batch_goPure batch transition used by the session action.
def sget_goPure point-read transition used by the session action (cache-backed).
def sputSession step writing one key.
def sdelSession step deleting one key.
def sbatchSession step applying a whole mutation batch at once.
def sgetSession step reading one key.
def run_sessExecute a whole session against a handle.
def value_ofProject the answer out of a runner pair.
def encode_batchRender the exact WAL bytes a VFS adapter frames with wal_frame plus fsync.

src/BitTree.bend

type WordTree
type BitTree
type Plan
def plan_goFind the least power of two >= need.
def plan
def zero_treeIndependent subtrees are built in parallel.
def new_from_plan
def new
def word_countMetadata helpers intended to keep representation laws independent of field layout.
def capacity_words
def tree_height
def bit_count
def valid_bit
def same_metadata
def path_bitBuild the root-to-leaf path by consuming low bits while prepending them.
def index_path
def tree_word
def tree_set_word
def word_at_if
def word_atSafe logical-word lookup; padding leaves are not externally addressable.
def replace_word_if
def replace_wordSafe logical-word update.
def set_if
def setSet one logical bit.
def test_if
def testTest one logical bit.
def union_bitsWord-wise union for chunked Bloom builds.
def shape_okStructural checker for the exact perfect-tree shape described by metadata.
def empty_metadata_ok
def nonempty_metadata_ok
def well_formedChecks zero canonicality, logical bounds, power-of-two capacity, height, and exact tree shape.

src/Console.bend

def read_line
def get_env

src/CrashPoint.bend

def nonemptyPure checkpoint policy.
def enabled
def stopIrreducible host boundary: emit an unbuffered marker and stop this process.
def hit_decision
def hitTest-only checkpoint.

src/Db.bend

type BEntry
def default_batch_cap
def bcache_bound
type Dbmanifest_token is the exact serialized Manifest observed by this handle.
type RotResRotation result: both tables plus their exact counts, so no pass ever walks a memtable to learn its size.
def wal_path
def open_db
def apply_mut
def apply_batch
def table_entries
def level_entries
def all_level_entries
def all_entries
def table_hit_if
def table_hit
def tables_hits
def levels_hits
def hits_first
def flatten_opt
def db_get
def pick_hit
def bcache_go
def bcache_lookup
def bcache_push_all
def probe_fill
def probe_cached