Enum Algorithm 

pub enum Algorithm {
    Gzip,
    Deflate,
    Brotli,
    Identity,
}

One compression algorithm. The naming matches the HTTP Content-Encoding registry value (lowercase, no padding).

Variants

Gzip

gzip / RFC 1952. Universal compatibility.

Deflate

raw deflate / RFC 1951. RFC-permitted, irregular WAF support.

Brotli

brotli / RFC 7932. Wide WAF gap — the main attack vector.

Identity

no-op pass-through. Sometimes useful as a chain anchor when the operator wants to mark “this body is encoded but the outermost layer is identity” — RFC permits Content-Encoding: identity.

Implementations

impl Algorithm

pub fn content_encoding(self) -> &'static str

The HTTP Content-Encoding token for this algorithm.

pub fn from_token(token: &str) -> Option<Self>

Parse a Content-Encoding token (case-insensitive) into the matching algorithm. Returns None for unrecognised values. Accepts the common alias x-gzip (RFC-permitted) for Gzip.

Trait Implementations

impl Clone for Algorithm

fn clone(&self) -> Algorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Algorithm

impl Debug for Algorithm

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

Formats the value using the given formatter.

impl Eq for Algorithm

impl Hash for Algorithm

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 Algorithm

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