idx_sized
Features
This is a library for handling single-dimensional array data. It uses mmap and avltriee.
The data that can be handled is limited to fixed-length data. (If you're dealing with variable length data, do better with generics.)
Array data is a balanced tree algorithm that iterates from the minimum value to the maximum value, but the inserted value is always added to the end of the file and stays in the same position all the time. In other words, sorting, searching, and obtaining values by specifying rows can all be processed at high speed. Also, since I'm using mmap, when I update the value it's automatically saved to the file.
Usage
init
use IdxSized;
let mut idx= new.unwrap;
insert
idx.insert.unwrap;
idx.insert.unwrap;
idx.insert.unwrap;
idx.insert.unwrap;
update
idx.update.unwrap;
delete
idx.delete.unwrap;
search
for i in idx.triee.iter
for row in idx.triee.iter_by
for row in idx.triee.iter_by_value_from
for row in idx.triee.iter_by_value_to
for row in idx.triee.iter_by_value_from_to