Struct Limits 

pub struct Limits {
    pub max_multibulk: usize,
    pub max_bulk: usize,
    pub max_inline: usize,
    pub max_depth: usize,
}

The bounds the codec enforces, which are Redis’s bounds.

These are not tuning knobs, they are the difference between a protocol error and an allocation the size of whatever a stranger asked for. A count line saying two billion arguments has to be refused before anything is reserved for it, which is why the multibulk limit is checked against the parsed number and not against what arrives.

Fields

max_multibulk: usize

The largest * count accepted. Redis’s PROTO_MAX_MULTIBULK.

max_bulk: usize

The largest $ length accepted. Redis’s proto-max-bulk-len, which is configurable there and so is configurable here.

max_inline: usize

The longest an inline request or an unterminated count line may get before it is refused. Redis’s PROTO_INLINE_MAX_SIZE.

max_depth: usize

How deeply a reply may nest before the decoder gives up.

Redis has no equivalent because Redis never parses a reply. This exists because the reply decoder recurses, and *1\r\n repeated a million times would otherwise be a stack overflow rather than an error. There is no legitimate reply anywhere near this deep.

Implementations

impl Limits

pub const DEFAULT: Limits

Redis’s defaults: a million arguments, a 512 MiB bulk, a 64 KiB inline request.

Trait Implementations

impl Clone for Limits

fn clone(&self) -> Limits

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Limits

impl Debug for Limits

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

Formats the value using the given formatter.

impl Default for Limits

fn default() -> Limits

Returns the “default value” for a type.

impl Eq for Limits

impl PartialEq for Limits

fn eq(&self, other: &Limits) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Limits