Struct BifIndexEntry 

pub struct BifIndexEntry {
    pub resource_id: ResourceId,
    pub resource_type: ResourceTypeCode,
    pub storage: BifResourceStorage,
    pub offset: u64,
    pub size: u64,
    pub packed_size: u64,
    pub defect: Option<EntryDefect>,
}

One indexed resource: its identity and where its bytes live.

Fields

resource_id: ResourceId

Resource id linking this entry to a KEY table row.

resource_type: ResourceTypeCode

Resource type code.

storage: BifResourceStorage

Source table this entry came from.

offset: u64

Byte offset of the resource data within the archive, as declared by the resource table.

size: u64

Byte length of the resource data, as declared by the resource table.

For a compressed archive this is the uncompressed length; the bytes on disk occupy Self::packed_size instead.

packed_size: u64

Byte length the resource actually occupies on disk.

Equal to size for an uncompressed archive.

defect: Option<EntryDefect>

Set when the entry cannot be read, leaving the rest of the archive usable. Reading a defective entry returns this as an error.

Implementations

impl BifIndexEntry

pub fn is_readable(&self) -> bool

Returns whether this entry’s bytes can be read.

Trait Implementations

impl Clone for BifIndexEntry

fn clone(&self) -> BifIndexEntry

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BifIndexEntry

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

Formats the value using the given formatter.

impl PartialEq for BifIndexEntry

fn eq(&self, other: &BifIndexEntry) -> 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 BifIndexEntry

impl StructuralPartialEq for BifIndexEntry