Struct Dict 

pub struct Dict { /* private fields */ }

High-performance in-memory dictionary

The core storage structure that holds all key-value pairs in memory. Uses SwissTable (hashbrown) with AHash for fast lookups and supports all Redis-compatible operations.

Implementations

impl Dict

pub fn get(&self, k: &[u8]) -> Option<Value>

Get a value by key (immutable reference)

Arguments

• k - Key to lookup as byte slice

Returns

• Some(&Value) if key exists
• None if key doesn’t exist

pub fn set(&self, k: Bytes, v: Value)

Set a key-value pair

Inserts or updates a key with the given value. If key already exists, the old value is replaced.

Arguments

• k - Key as owned Bytes
• v - Value to store

pub fn del(&self, k: &[u8]) -> bool

Delete a key

Removes the key and its associated value from the dictionary.

Arguments

• k - Key to delete as byte slice

Returns

• true if key existed and was deleted
• false if key didn’t exist

pub fn rename(&self, from: Bytes, to: Bytes) -> bool

Rename a key

Moves the value from the old key to the new key. The old key is deleted and the new key gets the value.

Arguments

• from - Current key name as owned Bytes
• to - New key name as owned Bytes

Returns

• true if rename was successful
• false if source key didn’t exist

pub fn exists(&self, k: &[u8]) -> bool

Check if a key exists

Tests for key existence without retrieving the value.

Arguments

• k - Key to check as byte slice

Returns

• true if key exists
• false if key doesn’t exist

pub fn incr(&self, k: &[u8]) -> i64

Atomically increment an integer-like value stored under key, creating it if missing

Trait Implementations

impl Default for Dict

fn default() -> Dict

Returns the “default value” for a type.