Struct Q42Volume 

pub struct Q42Volume { /* private fields */ }

Memory-mapped unified v2 volume reader.

Implementations

impl Q42Volume

pub fn block_cursor(&self) -> Q42BlockCursor<'_>

Return a sequential cursor which decodes into a caller-owned buffer.

impl Q42Volume

pub fn open(path: &Path) -> Result<Self>

pub fn header(&self) -> &Q42VolumeHeader

pub fn as_bytes(&self) -> &[u8]

pub fn lex_bytes(&self) -> &[u8]

pub fn lex_view(&self) -> Result<Q42LexMmap<'_>, LexError>

pub fn bidx_bytes(&self) -> &[u8]

pub fn volume_manifest_bytes(&self) -> Result<Option<&[u8]>>

Return the root descriptor bytes embedded between the lexicon and BIDX.

pub fn volume_manifest(&self) -> Result<Option<Q42VolumeManifest>>

Decode the front-embedded descriptor for a logical multi-segment Q42 snapshot. A regular v3 Q42 returns Ok(None).

pub fn block_count(&self) -> u64

pub fn verify_all_blocks(&self) -> Result<Q42VerificationReceipt>

Decode and verify every block without materialising the graph. This checks SuperBlock counts, parity, per-block/global object ordering, and the BIDX range advertised for each block. Logical roots have no local records and must be verified through their manifest children.

pub fn bidx_blocks_for_hash(&self, object_hash: u64) -> Vec<usize>

Binary-search BIDX for object_hash; returns block indices that may contain it.

This allocating compatibility helper now returns the complete matching interval. New query paths should use Self::bidx_blocks_for_hash_into to enumerate a high-frequency object through a caller buffer.

pub fn bidx_block_range_for_hash( &self, object_hash: u64, ) -> Result<Option<BidxBlockRange>>

Return the full contiguous BIDX interval that may contain object_hash.

pub fn bidx_blocks_for_hash_into( &self, object_hash: u64, cursor: usize, out: &mut [usize], ) -> Result<Option<BidxMatchPage>>

Fill out with one page of matching BIDX block indices.

cursor is an offset relative to the returned interval’s start. Resume with next_cursor until it is None; an empty output buffer never causes a silent partial success.

pub fn object_hash_bounds(&self) -> Option<(u64, u64)>

Minimum and maximum object hash advertised by this segment’s validated BIDX. Empty root/catalog segments return None.

pub fn block_directory_entry(&self, index: usize) -> Result<BlockDirectoryEntry>

pub fn read_superblock_into( &self, index: usize, out: &mut [u8], ) -> Result<usize>

Decompress SuperBlock index into out (must be >= 40960 bytes).

pub fn read_all_quins(&self) -> Result<Vec<NQuin>>

Read every live Quin from this volume’s SuperBlocks into a heap Vec.

Cold path (CLI / daemon vault load). A .q42 is not a flat array of 48-byte records — each SuperBlock is LZ4-compressed and carries a 160-byte header whose bytes [16..24] hold the block’s live quin count. Callers that bytemuck::cast_slice the raw file will panic (OutputSliceWouldHaveSlop) because the file length is not a multiple of QUIN_SIZE. Use this instead.