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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121

mod compare;

pub use compare::compare;
use idx_file::IdxFileAllocator;
pub use idx_file::{Avltriee, AvltrieeHolder, AvltrieeIter, FileMmap, Found, IdxFile};
pub use various_data_file::DataAddress;

use std::{
    cmp::Ordering,
    num::NonZeroU32,
    ops::{Deref, DerefMut},
    path::Path,
    thread,
};

use various_data_file::VariousDataFile;

type IdxBinaryAllocator = IdxFileAllocator<DataAddress>;

pub struct IdxBinary {
    index: IdxFile<DataAddress>,
    data_file: VariousDataFile,
}

impl AsRef<Avltriee<DataAddress, IdxBinaryAllocator>> for IdxBinary {
    fn as_ref(&self) -> &Avltriee<DataAddress, IdxBinaryAllocator> {
        self
    }
}
impl AsMut<Avltriee<DataAddress, IdxBinaryAllocator>> for IdxBinary {
    fn as_mut(&mut self) -> &mut Avltriee<DataAddress, IdxBinaryAllocator> {
        self
    }
}

impl Deref for IdxBinary {
    type Target = IdxFile<DataAddress>;
    fn deref(&self) -> &Self::Target {
        &self.index
    }
}
impl DerefMut for IdxBinary {
    fn deref_mut(&mut self) -> &mut Self::Target {
        &mut self.index
    }
}

impl AvltrieeHolder<DataAddress, &[u8], IdxBinaryAllocator> for IdxBinary {
    fn cmp(&self, left: &DataAddress, right: &&[u8]) -> Ordering {
        self.cmp(left, right)
    }

    fn search(&self, input: &&[u8]) -> Found {
        self.index.search(|data| self.cmp(data, input))
    }

    fn convert_value(&mut self, input: &[u8]) -> DataAddress {
        self.data_file.insert(input).address().clone()
    }

    fn delete_before_update(&mut self, row: NonZeroU32) {
        let unique_value = if let Some((true, node)) = self.index.is_unique(row) {
            Some((**node).clone())
        } else {
            None
        };
        thread::scope(|s| {
            let h1 = s.spawn(|| {
                if let Some(unique_value) = unique_value {
                    self.data_file.delete(unique_value);
                }
            });
            let h2 = s.spawn(|| self.index.delete(row));

            h1.join().unwrap();
            h2.join().unwrap();
        });
    }
}

impl IdxBinary {
    /// Opens the file and creates the IdxBinary.
    /// # Arguments
    /// * `path` - Path of file to save data
    /// * `allocation_lot` - Extends the specified size when the file size becomes insufficient due to data addition.
    /// If you expect to add a lot of data, specifying a larger size will improve performance.
    pub fn new<P: AsRef<Path>>(path: P, allocation_lot: u32) -> Self {
        let path = path.as_ref();
        Self {
            index: IdxFile::new(
                {
                    let mut path = path.to_path_buf();
                    path.push(".i");
                    path
                },
                allocation_lot,
            ),
            data_file: VariousDataFile::new({
                let mut path = path.to_path_buf();
                path.push(".d");
                path
            }),
        }
    }

    /// Returns the value of the specified row. Returns None if the row does not exist.
    pub fn bytes(&self, row: NonZeroU32) -> Option<&[u8]> {
        self.index.get(row).map(|v| self.data_file.bytes(&v))
    }

    /// Updates the byte string of the specified row.
    /// If row does not exist, it will be expanded automatically..
    pub fn update(&mut self, row: NonZeroU32, content: &[u8]) {
        Avltriee::update_with_holder(self, row, content);
    }

    /// Compare the stored data and the byte sequence.
    pub fn cmp(&self, data: &DataAddress, content: &[u8]) -> Ordering {
        compare(self.data_file.bytes(data), content)
    }
}