Struct PostingStore 

pub struct PostingStore<'a, const TF: bool> { /* private fields */ }

Key → sorted id list storage; TF adds a one-byte term frequency to every entry (the BM25 flavor).

Implementations

impl<'a, const TF: bool> PostingStore<'a, TF>

pub fn new(shards: usize, max_bytes: usize) -> Result<Self, Error>

Creates an empty store. shards follows the owning index’s config (power of two); max_bytes bounds the chunk pool.

pub fn push(&mut self, raw_key: u32, id: FactId, tf: u8) -> Result<(), Error>

Appends (id, tf) to key’s list. Ids must arrive in strictly ascending order per key — the caller indexes facts in id order, so a violation is a caller bug and panics (debug) / corrupts the one list (release), never the store.

Errors

Error::Arena when a pool hits its byte ceiling.

pub fn count(&self, raw_key: u32) -> u32

Number of entries in key’s list (0 when absent). This is the document frequency for BM25 keys.

pub fn entries(&self, raw_key: u32) -> Entries<'_, TF>

Iterates key’s list as (id, tf) pairs in ascending id order (tf is 1 for TF = false stores).

pub fn pool_bytes(&self) -> usize

Total bytes held by the two underlying pools.

pub fn keys(&self) -> usize

Number of distinct keys.

Trait Implementations

impl<'a, const TF: bool> Debug for PostingStore<'a, TF>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.