Enum TileLayout 

#[non_exhaustive]
pub enum TileLayout {
    Regular {
        tile_width: u32,
        tile_height: u32,
        tiles_across: u64,
        tiles_down: u64,
    },
    Irregular {
        tile_advance: (f64, f64),
        extra_tiles: (u32, u32, u32, u32),
        tiles: HashMap<(i64, i64), TileEntry>,
    },
    WholeLevel {
        width: u64,
        height: u64,
        virtual_tile_width: u32,
        virtual_tile_height: u32,
    },
}

How tiles are organized at a given level.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Regular

Regular grid — fixed tile size, row-major.

Fields

tile_width: u32

tile_height: u32

tiles_across: u64

tiles_down: u64

Irregular

Per-tile offsets (Ventana BIF, some DICOM). Geometry follows compatibility tilemap semantics and uses floating-point tile advances/offsets plus conservative extra-tile expansion.

Fields

tile_advance: (f64, f64)

extra_tiles: (u32, u32, u32, u32)

Extra tiles to consider around the nominal tilemap region, in the order (top, bottom, left, right).

tiles: HashMap<(i64, i64), TileEntry>

WholeLevel

Entire level is one contiguous image (NDPI giant JPEG). Backend exposes it as a virtual tile grid.

Fields

width: u64

height: u64

virtual_tile_width: u32

virtual_tile_height: u32

Implementations

impl TileLayout

pub fn tiles_for_region(&self, x: i64, y: i64, w: u32, h: u32) -> Vec<TileHit>

Compute which tiles intersect the given pixel region.

Trait Implementations

impl Debug for TileLayout

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

Formats the value using the given formatter.