Struct CacheKey 

pub struct CacheKey {
    pub layer: String,
    pub z: u8,
    pub x: u32,
    pub y: u32,
    pub format: String,
    pub style: Option<String>,
}

Cache key for tiles

Fields

layer: String

Layer name

z: u8

Zoom level

x: u32

Tile X coordinate

y: u32

Tile Y coordinate

format: String

Image format extension (png, jpg, webp)

style: Option<String>

Optional style name

Implementations

impl CacheKey

pub fn new(layer: String, z: u8, x: u32, y: u32, format: String) -> Self

Create a new cache key

pub fn with_style(self, style: String) -> Self

Create a cache key with style

pub fn to_path(&self, base_dir: &Path) -> PathBuf

Get the file path for disk cache

Trait Implementations

impl Clone for CacheKey

fn clone(&self) -> CacheKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CacheKey

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

Formats the value using the given formatter.

impl Display for CacheKey

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

Formats the value using the given formatter.

impl Hash for CacheKey

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for CacheKey

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

impl StructuralPartialEq for CacheKey