Struct ByteStringPool 

pub struct ByteStringPool { /* private fields */ }

Append-only byte arena. Each interned byte sequence gets a stable ByteStrView handle whose (offset, len) survives all subsequent insertions (the underlying Vec<u8> may reallocate, but the indices into it are stable).

Pool capacity:

• bytes: up to 4 GiB total raw payload (u32 offsets).
• offsets: up to 2³² distinct entries.
• lens: up to 2³² individual byte length (per-entry cap is also 2³²).

These limits are documented but not actively enforced beyond a try_push API: in v3 use the pool well below those numbers; if a future workload approaches the cap, promote to a u64-offset variant.

Implementations

impl ByteStringPool

pub fn new() -> Self

Create an empty pool.

pub fn len(&self) -> usize

Number of entries currently in the pool.

pub fn is_empty(&self) -> bool

True if the pool has no entries.

pub fn byte_size(&self) -> usize

Total bytes stored (sum of all entry lengths). O(1).

pub fn push(&mut self, bytes: &[u8]) -> Result<ByteStrView, ByteDictError>

Append a byte sequence and return a stable view.

Returns Err if the per-entry length exceeds u32::MAX or the total byte payload would exceed u32::MAX. These limits are wide enough that real-world pipelines never hit them, but we surface them as errors rather than panic for safety at boundaries.

pub fn get(&self, view: ByteStrView) -> &[u8]

Resolve a view back to its byte slice. Panics in debug builds if the view points outside the pool; in release builds returns an empty slice for an out-of-bounds view (defensive — should never happen if views are only constructed by push).

pub fn get_by_index(&self, idx: usize) -> Option<&[u8]>

Resolve a view by entry index (position in insertion order).

Returns None if idx >= self.len().

pub fn iter(&self) -> impl Iterator<Item = (usize, &[u8])> + '_

Iterate (index, bytes) in insertion order. Deterministic.

pub fn iter_views(&self) -> impl Iterator<Item = ByteStrView> + '_

Iterate views in insertion order. Use when you want to keep the (offset, len) representation (e.g. to thread it through a dictionary lookup).

Trait Implementations

impl Clone for ByteStringPool

fn clone(&self) -> ByteStringPool

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for ByteStringPool

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

Formats the value using the given formatter.

impl Default for ByteStringPool

fn default() -> ByteStringPool

Returns the “default value” for a type.

impl PartialEq for ByteStringPool

fn eq(&self, other: &ByteStringPool) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for ByteStringPool

impl StructuralPartialEq for ByteStringPool