#io #fifo #queue

queue-file

queue-file is a lightning-fast, transactional, file-based FIFO

16 stable releases

1.4.10 Mar 17, 2023
1.4.8 Feb 14, 2023
1.4.6 Jul 4, 2022
1.3.0 Feb 22, 2022
1.0.2 Jun 27, 2019

#102 in Data structures

Download history 3814/week @ 2023-11-02 2009/week @ 2023-11-09 3458/week @ 2023-11-16 1385/week @ 2023-11-23 2061/week @ 2023-11-30 1328/week @ 2023-12-07 1277/week @ 2023-12-14 1214/week @ 2023-12-21 954/week @ 2023-12-28 2977/week @ 2024-01-04 1553/week @ 2024-01-11 2304/week @ 2024-01-18 2043/week @ 2024-01-25 3290/week @ 2024-02-01 1923/week @ 2024-02-08 2764/week @ 2024-02-15

10,739 downloads per month
Used in 2 crates

Apache-2.0

49KB
924 lines

queue-file

Crate API License Windows Build Status

queue-file is a lightning-fast, transactional, file-based FIFO.

Addition and removal of an element from the queue is an O(1) operation and is atomic. Writes are synchronous by default; data will be written to disk before an operation returns.

queue-file crate is a feature complete and binary compatible port of QueueFile class from Tape2 by Square, Inc. Check the original project here.

Documentation

Usage

To use queue-file, first add this to your Cargo.toml:

[dependencies]
queue-file = "1"

Example

use queue_file::QueueFile;

fn main() {
    let mut qf = QueueFile::open("example.qf")
        .expect("cannot open queue file");

    qf.add("ELEMENT #1".as_bytes()).expect("add failed");
    qf.add("ELEMENT #2".as_bytes()).expect("add failed");
    qf.add("ELEMENT #3".as_bytes()).expect("add failed");

    qf.remove().expect("remove failed");

    for (index, elem) in qf.iter().enumerate() {
        println!(
            "{}: {} bytes -> {}",
            index,
            elem.len(),
            std::str::from_utf8(&elem).unwrap_or("<invalid>")
        );
    }

    qf.clear().expect("clear failed");
}

MSRV

Current MSRV is 1.58.1

License

This project is licensed under the Apache 2.0 license.

Dependencies

~1.5MB
~39K SLoC