forest-filecoin 0.33.2

// Copyright 2019-2026 ChainSafe Systems
// SPDX-License-Identifier: Apache-2.0, MIT

use super::*;
use anyhow::Context as _;
use bytes::Bytes;
use cid::Cid;

#[cfg(doc)]
use std::collections::HashSet;
use std::{path::Path, sync::LazyLock};

pub trait CidHashSetLike {
    /// Adds a value to the set.
    ///
    /// Returns whether the value was newly inserted.
    fn insert(&mut self, cid: Cid) -> anyhow::Result<bool>;
}

/// A hash set implemented as a `HashMap` where the value is `()`.
///
/// See also [`HashSet`].
#[derive(Default, Clone, Debug, PartialEq, Eq)]
pub struct CidHashSet {
    inner: CidHashMap<()>,
}

impl CidHashSet {
    /// Creates an empty `HashSet`.
    ///
    /// See also [`HashSet::new`].
    pub fn new() -> Self {
        Self::default()
    }

    /// Adds a value to the set.
    ///
    /// Returns whether the value was newly inserted.
    ///
    /// See also [`HashSet::insert`].
    pub fn insert(&mut self, cid: Cid) -> bool {
        self.inner.insert(cid, ()).is_none()
    }

    /// Returns the number of elements.
    pub fn len(&self) -> usize {
        self.inner.len()
    }

    /// Returns `true` if the set contains a `Cid`.
    #[allow(dead_code)]
    pub fn contains(&self, cid: &Cid) -> bool {
        self.inner.contains_key(cid)
    }

    /// Removes a `Cid` from the set. Returns whether the value was present in the set.
    #[allow(dead_code)]
    pub fn remove(&mut self, cid: &Cid) -> bool {
        self.inner.remove(cid).is_some()
    }

    /// Returns `true` if the set is empty.
    #[allow(dead_code)]
    pub fn is_empty(&self) -> bool {
        self.inner.is_empty()
    }
}

impl CidHashSetLike for CidHashSet {
    fn insert(&mut self, cid: Cid) -> anyhow::Result<bool> {
        Ok(self.insert(cid))
    }
}

////////////////////
// Collection Ops //
////////////////////

impl Extend<Cid> for CidHashSet {
    fn extend<T: IntoIterator<Item = Cid>>(&mut self, iter: T) {
        self.inner.extend(iter.into_iter().map(|it| (it, ())))
    }
}

impl FromIterator<Cid> for CidHashSet {
    fn from_iter<T: IntoIterator<Item = Cid>>(iter: T) -> Self {
        let mut this = Self::new();
        this.extend(iter);
        this
    }
}

/// A file-backed CID hash set.
/// This is intended to be used for large sets of CIDs that may not fit in memory, such as when tracking seen CIDs during a chain export.
pub struct FileBackedCidHashSet {
    db: parity_db::Db,
    // for dropping the temporary directory when the set is dropped
    _dir: tempfile::TempDir,
    lru: hashlink::LruCache<SmallCid, ()>,
}

impl FileBackedCidHashSet {
    pub fn new(temp_dir_root: impl AsRef<Path>) -> anyhow::Result<Self> {
        let dir = tempfile::tempdir_in(temp_dir_root.as_ref()).with_context(|| {
            format!(
                "failed to create temp dir in {}",
                temp_dir_root.as_ref().display(),
            )
        })?;
        let options = parity_db::Options {
            path: dir.path().to_path_buf(),
            sync_wal: false,
            sync_data: false,
            stats: false,
            salt: None,
            columns: vec![
                parity_db::ColumnOptions {
                    uniform: true,
                    append_only: true,
                    ..Default::default()
                },
                parity_db::ColumnOptions {
                    append_only: true,
                    ..Default::default()
                },
            ],
            compression_threshold: Default::default(),
        };
        let db = parity_db::Db::open_or_create(&options).with_context(|| {
            format!(
                "failed to create temp parity-db at {}",
                options.path.display()
            )
        })?;
        Ok(Self {
            db,
            _dir: dir,
            #[allow(clippy::disallowed_methods)]
            lru: hashlink::LruCache::new(2 << 19), // ~80MiB for 1M entries
        })
    }

    pub fn new_in_temp_dir() -> anyhow::Result<Self> {
        Self::new(std::env::temp_dir())
    }
}

impl CidHashSetLike for FileBackedCidHashSet {
    fn insert(&mut self, cid: Cid) -> anyhow::Result<bool> {
        static EMPTY_VALUE: LazyLock<Bytes> = LazyLock::new(|| Bytes::from_static(&[]));

        let small = SmallCid::from(cid);
        if self.lru.get(&small).is_some() {
            return Ok(false);
        }

        let (col, key) = match &small {
            SmallCid::Inline(c) => (0, c.digest().to_vec()),
            SmallCid::Indirect(u) => (1, u.inner().to_bytes()),
        };
        if self.db.get(col, &key).ok().flatten().is_some() {
            self.lru.insert(small, ());
            Ok(false)
        } else {
            self.db.commit_changes_bytes([(
                col,
                parity_db::Operation::Set(key, EMPTY_VALUE.clone()),
            )])?;
            self.lru.insert(small, ());
            Ok(true)
        }
    }
}

#[cfg(test)]
impl Default for FileBackedCidHashSet {
    fn default() -> Self {
        Self::new_in_temp_dir().expect("failed to create FileBackedCidHashSet")
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use ahash::HashSet;

    #[quickcheck_macros::quickcheck]
    fn test_cid_hashset(cids: HashSet<Cid>) {
        let mut set = CidHashSet::default();
        for cid in cids.iter() {
            all_asserts::assert_true!(set.insert(*cid), "expected CID to be newly inserted");
        }
        for cid in cids.iter() {
            all_asserts::assert_false!(set.insert(*cid), "expected CID to be present in the set");
        }
    }

    #[quickcheck_macros::quickcheck]
    fn test_file_backed_cid_hashset(cids: HashSet<Cid>) {
        let mut set = FileBackedCidHashSet::default();
        let dir = set._dir.path().to_path_buf();
        for cid in cids.iter() {
            all_asserts::assert_true!(
                set.insert(*cid).unwrap(),
                "expected CID to be newly inserted"
            );
        }
        for cid in cids.iter() {
            all_asserts::assert_false!(
                set.insert(*cid).unwrap(),
                "expected CID to be present in the set"
            );
        }
        drop(set);
        all_asserts::assert_false!(dir.exists(), "expected temporary directory to be deleted");
    }
}