coordinode-lsm-tree 5.4.0

Embedded LSM-tree storage engine: BuRR filters, zstd dictionary compression, MVCC, range tombstones, merge operators, K/V separation, AES-256-GCM at rest.
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

// SPDX-License-Identifier: Apache-2.0
// Copyright (c) 2024-present, fjall-rs
// Copyright (c) 2026-present, Structured World Foundation

use crate::TableId;

/// The hidden set keeps track of which tables are currently being compacted
///
/// When a table is hidden (being compacted), no other compaction task can include that
/// table, or it will be declined to be run.
///
/// If a compaction task fails, the tables are shown again (removed from the hidden set).
#[derive(Clone, Default)]
pub struct HiddenSet {
    pub(crate) set: crate::HashSet<TableId>,
}

impl HiddenSet {
    pub(crate) fn hide<T: IntoIterator<Item = TableId>>(&mut self, keys: T) {
        self.set.extend(keys);
    }

    pub(crate) fn show<T: IntoIterator<Item = TableId>>(&mut self, keys: T) {
        for key in keys {
            self.set.remove(&key);
        }
    }

    pub(crate) fn is_blocked<T: IntoIterator<Item = TableId>>(&self, ids: T) -> bool {
        ids.into_iter().any(|id| self.is_hidden(id))
    }

    pub(crate) fn is_hidden(&self, key: TableId) -> bool {
        self.set.contains(&key)
    }

    pub(crate) fn is_empty(&self) -> bool {
        self.set.is_empty()
    }

    pub(crate) fn should_decline_compaction<T: IntoIterator<Item = TableId>>(
        &self,
        ids: T,
    ) -> bool {
        self.is_blocked(ids)
    }
}