wedb_embed 0.1.13

Embedded database engine providing Redis-like APIs, built on fjall / 嵌入式数据库引擎,提供类似 Redis 的接口,底层基于 fjall 开发
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
use std::ops::Bound;

use crate::{
  api::zset::{
    ZSetKeyMemberScore, ZSetMemberScore, ZSetPopResult, compose_zset_key,
    compose_zset_score_from_bytes_key,
    r#impl::{
      compose_zset_meta_key, compose_zset_prefix, compose_zset_score_prefix, get_zset_meta,
      lex_range_bounds, normalize_range, parse_score_sub, score_range_bounds,
    },
    meta::{ZSetMeta, decode_sortable_f64_slice},
    opt::{IntoRangeLex, IntoRangeRank, IntoRangeScore},
  },
  engine::{Engine, KvEntry, Partition},
  error::{Error, Result},
  key::clear_prefix_in_batch,
  meta::current_now_ms,
  wedb::{Db, DbBatch},
};

#[inline]
pub(crate) fn commit_zset_batch<E: Engine>(
  meta_k: &[u8],
  meta: &ZSetMeta,
  mut batch: DbBatch<E>,
) -> Result<()>
where
  Error: From<E::Error>,
{
  if meta.base.size == 0 {
    batch.rm_meta(meta_k);
  } else {
    batch.insert_meta(meta_k, &meta.encode());
  }
  batch.commit()?;
  Ok(())
}

/// Pop and range removal operations for Sorted Set.
/// 有序集合弹出与范围删除操作
impl<E: Engine> Db<E>
where
  Error: From<E::Error>,
{
  #[inline]
  pub(crate) fn zpop_one_internal<K: AsRef<[u8]>>(
    &self,
    key: K,
    reverse: bool,
  ) -> Result<Option<ZSetMemberScore>> {
    let kc = self.kc();
    let k_bytes = key.as_ref();
    let meta_k = compose_zset_meta_key(&kc, k_bytes);
    let now_ms = current_now_ms();

    let mut meta = match get_zset_meta(self, k_bytes, &meta_k, now_ms)? {
      Some(m) if m.size() > 0 => m,
      _ => return Ok(None),
    };

    let prefix = compose_zset_score_prefix(&kc, k_bytes);
    let data_ks = self.data();

    let target = if reverse {
      data_ks.prefix(&prefix).next_back()
    } else {
      data_ks.prefix(&prefix).next()
    };

    if let Some(g) = target {
      let entry = g?;
      let k = entry.key();
      if k.starts_with(&prefix)
        && let Some((score, member)) = parse_score_sub(&k[prefix.len()..])
      {
        let m_key = compose_zset_key(&kc, k_bytes, member);
        let mut batch = self.batch_with_capacity(3);
        batch.rm_weak_data(k);
        batch.rm_weak_data(m_key.as_slice());
        meta.base.size = meta.base.size.saturating_sub(1);
        commit_zset_batch(&meta_k, &meta, batch)?;
        return Ok(Some((member.to_vec(), score)));
      }
    }
    Ok(None)
  }

  #[inline]
  pub(crate) fn zpop_internal<K: AsRef<[u8]>>(
    &self,
    key: K,
    count: usize,
    reverse: bool,
  ) -> Result<Vec<ZSetMemberScore>> {
    if count == 0 {
      return Ok(Vec::new());
    }
    if count == 1 {
      return Ok(match self.zpop_one_internal(key, reverse)? {
        Some(item) => vec![item],
        None => Vec::new(),
      });
    }
    let kc = self.kc();
    let k_bytes = key.as_ref();
    let meta_k = compose_zset_meta_key(&kc, k_bytes);
    let now_ms = current_now_ms();

    let mut meta = match get_zset_meta(self, k_bytes, &meta_k, now_ms)? {
      Some(m) if m.size() > 0 => m,
      _ => return Ok(Vec::new()),
    };

    let actual_count = count.min(meta.size() as usize);
    let prefix = compose_zset_score_prefix(&kc, k_bytes);
    let mut popped = Vec::with_capacity(actual_count);
    let mut batch = self.batch_with_capacity(actual_count * 2 + 1);
    let data_ks = self.data();

    macro_rules! drain_entry {
      ($g:expr) => {{
        let entry = $g?;
        let k = entry.key();
        if !k.starts_with(&prefix) {
          break;
        }
        if let Some((score, member)) = parse_score_sub(&k[prefix.len()..]) {
          let m_key = compose_zset_key(&kc, k_bytes, member);
          batch.rm_weak_data(k);
          batch.rm_weak_data(m_key.as_slice());
          popped.push((member.to_vec(), score));
          if popped.len() >= actual_count {
            break;
          }
        }
      }};
    }

    if reverse {
      for g in data_ks.prefix(&prefix).rev() {
        drain_entry!(g);
      }
    } else {
      for g in data_ks.prefix(&prefix) {
        drain_entry!(g);
      }
    }

    if !popped.is_empty() {
      meta.base.size = meta.base.size.saturating_sub(popped.len() as u64);
      commit_zset_batch(&meta_k, &meta, batch)?;
    }
    Ok(popped)
  }

  /// ZPOPMIN key [count] (pops lowest score members atomically).
  /// ZPOPMIN key [count](单批次读取并删除极小值,原子高效)
  #[inline]
  pub fn zpopmin_one<K: AsRef<[u8]>>(&self, key: K) -> Result<Option<ZSetMemberScore>> {
    self.zpop_one_internal(key, false)
  }

  #[inline]
  pub fn zpopmin<K: AsRef<[u8]>>(&self, key: K, count: usize) -> Result<Vec<ZSetMemberScore>> {
    self.zpop_internal(key, count, false)
  }

  /// ZPOPMAX key [count] (pops highest score members atomically).
  /// ZPOPMAX key [count](单批次读取并删除极大值,原子高效)
  #[inline]
  pub fn zpopmax_one<K: AsRef<[u8]>>(&self, key: K) -> Result<Option<ZSetMemberScore>> {
    self.zpop_one_internal(key, true)
  }

  #[inline]
  pub fn zpopmax<K: AsRef<[u8]>>(&self, key: K, count: usize) -> Result<Vec<ZSetMemberScore>> {
    self.zpop_internal(key, count, true)
  }

  /// ZMPOP numkeys key [key ...] <MIN | MAX> [COUNT count] (Redis 7.0 multi-key pop).
  /// ZMPOP numkeys key [key ...] <MIN | MAX> [COUNT count] (对标 Redis 7.0 多键批量弹出)
  #[inline]
  pub fn zmpop<K: AsRef<[u8]>>(
    &self,
    keys: &[K],
    min: bool,
    count: usize,
  ) -> Result<Option<ZSetPopResult>> {
    if count == 0 {
      return Ok(None);
    }
    for k in keys {
      let popped = self.zpop_internal(k, count, !min)?;
      if !popped.is_empty() {
        return Ok(Some((k.as_ref().to_vec(), popped)));
      }
    }
    Ok(None)
  }

  #[inline]
  pub(crate) fn bzpop_internal<K: AsRef<[u8]>>(
    &self,
    keys: &[K],
    reverse: bool,
  ) -> Result<Option<ZSetKeyMemberScore>> {
    for k in keys {
      if let Some((member, score)) = self.zpop_one_internal(k, reverse)? {
        return Ok(Some((k.as_ref().to_vec(), member, score)));
      }
    }
    Ok(None)
  }

  /// BZPOPMIN key [key ...] (checks keys and pops lowest score member from first non-empty set).
  /// BZPOPMIN key [key ...] (检查多键并弹出第一个非空的最小值)
  #[inline]
  pub fn bzpopmin<K: AsRef<[u8]>>(&self, keys: &[K]) -> Result<Option<ZSetKeyMemberScore>> {
    self.bzpop_internal(keys, false)
  }

  /// BZPOPMAX key [key ...] (checks keys and pops highest score member from first non-empty set).
  /// BZPOPMAX key [key ...] (检查多键并弹出第一个非空的最大值)
  #[inline]
  pub fn bzpopmax<K: AsRef<[u8]>>(&self, keys: &[K]) -> Result<Option<ZSetKeyMemberScore>> {
    self.bzpop_internal(keys, true)
  }

  /// ZRANDMEMBER key (single random element extraction with zero full-scan memory).
  /// 随机获取单个元素(零全量扫描内存开销,单次元数据点查与惰性分数解码优化)
  #[inline]
  pub fn zrandmember_one<K: AsRef<[u8]>>(&self, key: K) -> Result<Option<ZSetMemberScore>> {
    let kc = self.kc();
    let k_bytes = key.as_ref();
    let meta_k = compose_zset_meta_key(&kc, k_bytes);
    let now_ms = current_now_ms();

    let meta = match get_zset_meta(self, k_bytes, &meta_k, now_ms)? {
      Some(m) if m.size() > 0 => m,
      _ => return Ok(None),
    };

    let card = meta.size() as usize;
    let target = fastrand::usize(0..card);
    let prefix = compose_zset_prefix(&kc, k_bytes);
    for (current_idx, g) in self.data().prefix(&prefix).enumerate() {
      let entry = g?;
      let (k, v) = (entry.key(), entry.value());
      if !k.starts_with(&prefix) {
        break;
      }
      if current_idx == target {
        let member = &k[prefix.len()..];
        let score = decode_sortable_f64_slice(v).unwrap_or(0.0);
        return Ok(Some((member.to_vec(), score)));
      }
    }

    Ok(None)
  }

  /// ZRANDMEMBER key [count] (random member extraction aligned with Kvrocks).
  /// ZRANDMEMBER key [count] (对标 Apache Kvrocks ExtractRandMemberFromSet)
  #[inline]
  pub fn zrandmember<K: AsRef<[u8]>>(&self, key: K, count: i64) -> Result<Vec<ZSetMemberScore>> {
    if count == 0 {
      return Ok(Vec::new());
    }
    if count == 1 || count == -1 {
      return match self.zrandmember_one(&key)? {
        Some(item) => Ok(vec![item]),
        None => Ok(Vec::new()),
      };
    }
    let all = self.zget_all(key)?;
    let total = all.len();
    if total == 0 {
      return Ok(Vec::new());
    }

    if count > 0 {
      let num = (count as usize).min(total);
      if num == total {
        return Ok(all);
      }
      let mut all = all;
      for i in 0..num {
        let j = fastrand::usize(i..total);
        all.swap(i, j);
      }
      all.truncate(num);
      Ok(all)
    } else {
      let num = count.unsigned_abs() as usize;
      let mut results = Vec::with_capacity(num);
      for _ in 0..num {
        let idx = fastrand::usize(0..total);
        results.push(all[idx].clone());
      }
      Ok(results)
    }
  }

  /// ZREMRANGEBYRANK key start stop (single-pass rank-based deletion).
  /// ZREMRANGEBYRANK key start stop (单遍流式扫描与删除,零二次点查,对标 Kvrocks RangeByRank with_deletion)
  #[inline]
  pub fn zremrangebyrank<K: AsRef<[u8]>>(&self, key: K, spec: impl IntoRangeRank) -> Result<usize> {
    let spec = spec.into_range_rank();
    let kc = self.kc();
    let k_bytes = key.as_ref();
    let meta_k = compose_zset_meta_key(&kc, k_bytes);
    let now_ms = current_now_ms();

    let mut meta = match get_zset_meta(self, k_bytes, &meta_k, now_ms)? {
      Some(m) => m,
      None => return Ok(0),
    };

    let card = meta.size() as usize;
    let (s, e) = match normalize_range(card, spec.start, spec.stop) {
      Some(range) => range,
      None => return Ok(0),
    };

    let count = e - s + 1;
    let prefix = compose_zset_score_prefix(&kc, k_bytes);
    if s == 0 && e + 1 >= card {
      let mut batch = self.batch();
      clear_prefix_in_batch(self.data(), &prefix, &mut batch)?;
      let member_prefix = compose_zset_prefix(&kc, k_bytes);
      clear_prefix_in_batch(self.data(), &member_prefix, &mut batch)?;
      batch.rm_meta(&meta_k);
      batch.commit()?;
      return Ok(card);
    }

    let mut deleted = 0usize;
    let mut current_idx = 0usize;
    let mut batch = self.batch_with_capacity(count * 2 + 1);
    let data_ks = self.data();

    for g in data_ks.prefix(&prefix) {
      let entry = g?;
      let k = entry.key();
      if !k.starts_with(&prefix) {
        break;
      }
      if let Some((_, member)) = parse_score_sub(&k[prefix.len()..]) {
        if current_idx >= s {
          let m_key = compose_zset_key(&kc, k_bytes, member);
          batch.rm_weak_data(k);
          batch.rm_weak_data(m_key.as_slice());
          deleted += 1;
          if deleted >= count {
            break;
          }
        }
        current_idx += 1;
        if current_idx > e {
          break;
        }
      }
    }

    if deleted > 0 {
      meta.base.size = meta.base.size.saturating_sub(deleted as u64);
      commit_zset_batch(&meta_k, &meta, batch)?;
    }

    Ok(deleted)
  }

  /// ZREMRANGEBYSCORE key min max (single-pass score-based deletion).
  /// ZREMRANGEBYSCORE key min max (基于保序十六进制分数前缀精准范围遍历与删除,零二次点查,对标 Kvrocks RangeByScore with_deletion)
  #[inline]
  pub fn zremrangebyscore<K: AsRef<[u8]>>(
    &self,
    key: K,
    spec: impl IntoRangeScore,
  ) -> Result<usize> {
    let spec_obj = spec.into_range_score();
    let spec = &spec_obj;
    if spec.is_empty() {
      return Ok(0);
    }
    let kc = self.kc();
    let k_bytes = key.as_ref();
    let meta_k = compose_zset_meta_key(&kc, k_bytes);
    let now_ms = current_now_ms();

    let mut meta = match get_zset_meta(self, k_bytes, &meta_k, now_ms)? {
      Some(m) => m,
      None => return Ok(0),
    };

    let prefix = compose_zset_score_prefix(&kc, k_bytes);
    let (start, end) = score_range_bounds(&prefix, spec);
    let start_ref = Bound::as_ref(&start).map(|v| v.as_slice());
    let end_ref = Bound::as_ref(&end).map(|v| v.as_slice());

    let mut deleted = 0usize;
    let mut batch = self.batch_with_capacity(32);
    let data_ks = self.data();

    for g in data_ks.range((start_ref, end_ref)) {
      let entry = g?;
      let k = entry.key();
      if !k.starts_with(&prefix) {
        break;
      }
      if let Some((score, member)) = parse_score_sub(&k[prefix.len()..]) {
        if (spec.maxex && score >= spec.max) || score > spec.max {
          break;
        }
        if spec.check(score) {
          let m_key = compose_zset_key(&kc, k_bytes, member);
          batch.rm_weak_data(k);
          batch.rm_weak_data(m_key.as_slice());
          deleted += 1;
        }
      }
    }

    if deleted > 0 {
      meta.base.size = meta.base.size.saturating_sub(deleted as u64);
      commit_zset_batch(&meta_k, &meta, batch)?;
    }

    Ok(deleted)
  }

  /// ZREMRANGEBYLEX key min max (single-pass lexicographical deletion).
  /// ZREMRANGEBYLEX key min max (基于字典序精准范围遍历与删除,零二次点查,对标 Kvrocks RangeByLex with_deletion)
  #[inline]
  pub fn zremrangebylex<K: AsRef<[u8]>>(&self, key: K, spec: impl IntoRangeLex) -> Result<usize> {
    let spec_obj = spec.into_range_lex();
    let spec = &spec_obj;
    if spec.is_empty() {
      return Ok(0);
    }
    let kc = self.kc();
    let k_bytes = key.as_ref();
    let meta_k = compose_zset_meta_key(&kc, k_bytes);
    let now_ms = current_now_ms();

    let mut meta = match get_zset_meta(self, k_bytes, &meta_k, now_ms)? {
      Some(m) => m,
      None => return Ok(0),
    };

    let prefix = compose_zset_prefix(&kc, k_bytes);
    let (start, end) = lex_range_bounds(&prefix, spec);
    let start_ref = Bound::as_ref(&start).map(|v| v.as_slice());
    let end_ref = Bound::as_ref(&end).map(|v| v.as_slice());

    let mut deleted = 0usize;
    let mut batch = self.batch_with_capacity(32);
    let data_ks = self.data();

    for g in data_ks.range((start_ref, end_ref)) {
      let entry = g?;
      let (k, v) = (entry.key(), entry.value());
      if !k.starts_with(&prefix) {
        break;
      }
      let member = &k[prefix.len()..];
      if !spec.max_infinite {
        if spec.maxex && member >= spec.max.as_slice() {
          break;
        }
        if !spec.maxex && member > spec.max.as_slice() {
          break;
        }
      }
      if spec.check(member) {
        if v.len() >= 8 {
          let s_key = compose_zset_score_from_bytes_key(&kc, k_bytes, &v[..8], member);
          batch.rm_weak_data(s_key.as_slice());
        }
        batch.rm_weak_data(k);
        deleted += 1;
      }
    }

    if deleted > 0 {
      meta.base.size = meta.base.size.saturating_sub(deleted as u64);
      commit_zset_batch(&meta_k, &meta, batch)?;
    }

    Ok(deleted)
  }
}