Struct CacheKey 

pub struct CacheKey {
    pub original_url: String,
    pub method: String,
    pub query: BTreeMap<String, String>,
    pub user_agent: String,
    pub body: String,
    pub source_ip: String,
}

Data structure used by clients to create a cache entry for each request.

Fields

original_url: String

method: String

query: BTreeMap<String, String>

user_agent: String

body: String

source_ip: String

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 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