#data-structures #reached

archivist

Store files in a time or index based directory hierarchy, automatically deleting the oldest files if the size limit is reached

8 releases (4 breaking)

new 0.4.0 May 7, 2025
0.3.0 Oct 25, 2024
0.2.0 Oct 10, 2024
0.1.1 May 16, 2024
0.0.0 Aug 30, 2019

#696 in Filesystem

MIT license

1MB
298 lines

Archivist

Crates.io Version Crates.io License docs.rs

Store files in a time or index based directory hierarchy, automatically deleting the oldest files if the size limit is reached.

It's using an efficient kv-store database for persistency and performance reasons.

    // Store at max 1GB of files
    let mut a = Archivist::new("/tmp/archive", DateTimeTree::default(), 1000).await?;
   
    // Our humble file that we want to keep, but may lose interest after some time 
    let mut f = fs::File::open("/tmp/my_words.txt").unwrap();

    // crate a store object for file compression
    let ss = GzStore::new(Cursor::new(f.clone()));

    // add the file to the archive
    a.add("words.txt.gz", &ss).await?;

Copyright 2022-2024, Falco Hirschenberger falco.hirschenberger@gmail.com

Dependencies

~10–18MB
~222K SLoC