Struct GitOidIndex 

pub struct GitOidIndex { /* private fields */ }

Reader over a __gunnar_oid__ section.

Implementations

impl GitOidIndex

pub fn parse(bytes: Vec<u8>) -> Result<Self>

Parse a section produced by build_section.

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

Read the section out of a sealed archive. Ok(None) when the archive carries no oid index (i.e. it is not a git-format archive).

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn hash_kind(&self) -> GitHashKind

pub fn key_at(&self, i: usize) -> i64

The key of entry i.

pub fn oid_at(&self, i: usize) -> &[u8]

The full oid of entry i.

pub fn candidate_run(&self, key: i64) -> Range<usize>

The unverified candidate run for a key: every entry sharing that 8-byte prefix, as start..end. Normally length 1; length > 1 is a real prefix collision.

Exposed so a test can assert that a collision actually produces a run of two and that the verify step is what tells the two oids apart. A caller resolving an oid should use lookup, never this.

pub fn lookup(&self, oid: &[u8]) -> Option<OidHit>

Resolve a raw oid. None when absent.

stree narrows to a candidate run; the full oid is then compared against every candidate. Skipping that comparison would return a different object’s row whenever two oids share their first eight bytes.

pub fn lookup_hex(&self, hex_oid: &str) -> Option<OidHit>

Resolve a hex oid.

pub fn lookup_batch(&self, oids: &[&[u8]]) -> Vec<Option<OidHit>>

Resolve many oids at once through stree’s software-pipelined batch traversal. This is the path that matters: serving one pack is hundreds to thousands of lookups, and the pipelined walk overlaps their memory latency instead of paying it serially.

Results are positional — out[i] corresponds to oids[i]. Every hit is full-oid verified, exactly as in lookup.

pub fn lookup_batch_hex(&self, hex_oids: &[&str]) -> Vec<Option<OidHit>>

Hex convenience over lookup_batch.