Struct SortedSetManager 

pub struct SortedSetManager { /* private fields */ }

Sorted Set data structure interface (Redis-compatible)

Provides scored, ordered collections with ranking and range query capabilities.

Implementations

impl SortedSetManager

pub async fn add<K, M>(&self, key: K, member: M, score: f64) -> Result<bool>

where K: AsRef<str>, M: AsRef<str>,

Add member with score to sorted set (ZADD)

Example

client.sorted_set().add("leaderboard", "player1", 100.0).await?;

pub async fn add_multiple<K>( &self, key: K, members: Vec<ScoredMember>, ) -> Result<usize>

where K: AsRef<str>,

Add multiple members with scores to sorted set (ZADD with array)

Example

let members = vec![
    ScoredMember { member: "player1".to_string(), score: 100.0 },
    ScoredMember { member: "player2".to_string(), score: 200.0 },
];
client.sorted_set().add_multiple("leaderboard", members).await?;

pub async fn rem<K>(&self, key: K, members: Vec<String>) -> Result<usize>

where K: AsRef<str>,

Remove members from sorted set (ZREM)

pub async fn score<K, M>(&self, key: K, member: M) -> Result<Option<f64>>

where K: AsRef<str>, M: AsRef<str>,

Get score of a member (ZSCORE)

pub async fn card<K>(&self, key: K) -> Result<usize>

where K: AsRef<str>,

Get cardinality (number of members) (ZCARD)

pub async fn incr_by<K, M>( &self, key: K, member: M, increment: f64, ) -> Result<f64>

where K: AsRef<str>, M: AsRef<str>,

Increment score of member (ZINCRBY)

pub async fn range<K>( &self, key: K, start: i64, stop: i64, with_scores: bool, ) -> Result<Vec<ScoredMember>>

where K: AsRef<str>,

Get range by rank (0-based index) (ZRANGE)

Example

// Get top 10 from leaderboard
let top10 = client.sorted_set().range("leaderboard", 0, 9, true).await?;
for member in top10 {
    tracing::info!("{}: {}", member.member, member.score);
}

pub async fn rev_range<K>( &self, key: K, start: i64, stop: i64, with_scores: bool, ) -> Result<Vec<ScoredMember>>

where K: AsRef<str>,

Get reverse range by rank (highest to lowest) (ZREVRANGE)

pub async fn rank<K, M>(&self, key: K, member: M) -> Result<Option<usize>>

where K: AsRef<str>, M: AsRef<str>,

Get rank of member (0-based, lowest score = rank 0) (ZRANK)

pub async fn rev_rank<K, M>(&self, key: K, member: M) -> Result<Option<usize>>

where K: AsRef<str>, M: AsRef<str>,

Get reverse rank of member (0-based, highest score = rank 0) (ZREVRANK)

pub async fn count<K>(&self, key: K, min: f64, max: f64) -> Result<usize>

where K: AsRef<str>,

Count members with scores in range (ZCOUNT)

pub async fn range_by_score<K>( &self, key: K, min: f64, max: f64, with_scores: bool, ) -> Result<Vec<ScoredMember>>

where K: AsRef<str>,

Get range by score (ZRANGEBYSCORE)

pub async fn pop_min<K>( &self, key: K, count: usize, ) -> Result<Vec<ScoredMember>>

where K: AsRef<str>,

Pop minimum scored members (ZPOPMIN)

pub async fn pop_max<K>( &self, key: K, count: usize, ) -> Result<Vec<ScoredMember>>

where K: AsRef<str>,

Pop maximum scored members (ZPOPMAX)

pub async fn rem_range_by_rank<K>( &self, key: K, start: i64, stop: i64, ) -> Result<usize>

where K: AsRef<str>,

Remove members by rank range (ZREMRANGEBYRANK)

pub async fn rem_range_by_score<K>( &self, key: K, min: f64, max: f64, ) -> Result<usize>

where K: AsRef<str>,

Remove members by score range (ZREMRANGEBYSCORE)

pub async fn inter_store<D>( &self, destination: D, keys: Vec<&str>, weights: Option<Vec<f64>>, aggregate: &str, ) -> Result<usize>

where D: AsRef<str>,

Compute intersection and store in destination (ZINTERSTORE)

Example

// Intersect two leaderboards
let count = client.sorted_set().inter_store(
    "combined",
    vec!["board1", "board2"],
    None,
    "sum",
).await?;

pub async fn union_store<D>( &self, destination: D, keys: Vec<&str>, weights: Option<Vec<f64>>, aggregate: &str, ) -> Result<usize>

where D: AsRef<str>,

Compute union and store in destination (ZUNIONSTORE)

pub async fn diff_store<D>( &self, destination: D, keys: Vec<&str>, ) -> Result<usize>

where D: AsRef<str>,

Compute difference and store in destination (ZDIFFSTORE)

pub async fn stats(&self) -> Result<SortedSetStats>

Get statistics

Trait Implementations

impl Clone for SortedSetManager

fn clone(&self) -> SortedSetManager

Returns a duplicate of the value.

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

Performs copy-assignment from source.