Struct CachedEntry 

#[non_exhaustive]
pub struct CachedEntry {
    pub name: String,
    pub data: DexBytes,
    /* private fields */
}

A cached inflated entry.

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

name: String

The APK entry name.

data: DexBytes

The inflated entry.

Implementations

impl CachedEntry

pub fn logical(&self) -> &[LogicalDex]

Logical DEX files of this entry (one, unless it is a 041 container).

pub fn resident_bytes(&self) -> usize

Bytes this entry keeps resident once searched: the inflated entry plus, for a 041 container, one full-container copy per further logical DEX (what logical() materialises). Computed from the headers alone so accounting does not itself trigger those copies.

pub fn state_bytes(&self) -> usize

Bytes of the locator tables built (on the heap) or mapped (from L2) so far for this entry’s logical DEX files (0 before the first search).

pub fn charged_bytes(&self) -> usize

What the in-memory cache charges for this entry: heap bytes in full (the inflated entry when not mapped, a container’s logical copies, tables built on the heap) and file-backed bytes (the entry mapped from L1 or the APK, tables mapped from L2) at 1/MAPPED_CHARGE_DIVISOR.

pub fn is_mapped(&self) -> bool

Whether the entry’s bytes are mapped from the disk cache.