transient-btree-index 0.5.1

This crate allows you to create a BTree index backed by temporary files.
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

use std::{array::TryFromSliceError, num::TryFromIntError};

use thiserror::Error;

pub type Result<T> = std::result::Result<T, Error>;

#[derive(Error, Debug)]
#[non_exhaustive]
pub enum Error {
    #[error("Size of existing block (ID {block_id}) is too small to write new block. It needs {needed}.")]
    ExistingBlockTooSmall { block_id: usize, needed: u64 },
    #[error("The order of the tree must be at least 2, but {0} was requested.")]
    OrderTooSmall(usize),
    #[error("The order of the tree must is too large ({0} was requested).")]
    OrderTooLarge(usize),
    #[error("Requested index {idx} is larger than the number of keys in the node ({len})")]
    KeyIndexOutOfBounds { idx: usize, len: usize },
    #[error("When trying to insert a non-existing key, the found node block was internal and not a leaf node")]
    InsertFoundInternalNode,
    #[error("Splitting a node resulted in an empty child node.")]
    EmptyChildNodeInSplit,
    #[error("The given capacity of {capacity} was invalid.")]
    InvalidCapacity { capacity: usize },
    #[error("Deserialization of block failed: {0}")]
    DeserializeBlock(String),
    #[error(transparent)]
    IO(#[from] std::io::Error),
    #[error(transparent)]
    IntConversion(#[from] TryFromIntError),
    #[error(transparent)]
    SliceConversion(#[from] TryFromSliceError),
    #[error(transparent)]
    Bincode(#[from] bincode::Error),
    #[error("Non-existing key")]
    NonExistingKey,
}