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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
use std::mem;
use std::cmp::Ordering;
use std::collections::BTreeSet;
use file_mmap::FileMmap;
use avltriee::{
    Avltriee
    ,AvltrieeNode
};
pub use avltriee::RemoveResult;

pub type RowSet = BTreeSet<u32>;

pub struct IdxSized<T>{
    mmap:FileMmap
    ,triee:Avltriee<T>
}

const INIT_SIZE: u64=mem::size_of::<usize>() as u64;
impl<T: std::default::Default + Copy> IdxSized<T>{
    pub fn new(path:&str) -> Result<IdxSized<T>,std::io::Error>{
        let filemmap=FileMmap::new(path,INIT_SIZE)?;
        let ep=filemmap.offset(INIT_SIZE as isize) as *mut AvltrieeNode<T>;
        let p=filemmap.as_ptr() as *mut u32;
        Ok(IdxSized{
            mmap:filemmap
            ,triee:Avltriee::new(
                p
                ,ep
            )
        })
    }
    pub fn triee_mut(&mut self)->&mut Avltriee<T>{
        &mut self.triee
    }
    pub fn triee(&self)->&Avltriee<T>{
        &self.triee
    }
    pub fn value(&self,row:u32)->Option<T>{
        self.triee.entity_value(row).map(|v|*v)
    }
    pub fn insert(&mut self,target:T)->Option<u32> where T:Default + std::cmp::Ord{
        if self.triee.root()==0{ //データがまだ無い場合は新規登録
            self.init(target,1)
        }else{
            let (ord,found_row)=self.triee.search(&target);
            assert_ne!(0,found_row);
            if ord==Ordering::Equal{
                self.insert_same(found_row,0)
            }else{
                self.insert_unique(target,found_row,ord,0)
            }
        }
    }
    pub fn update(&mut self,row:u32,value:T) where T:std::cmp::Ord{
        self.triee.update(row,value);
    }
    pub fn delete(&mut self,row:u32)->RemoveResult<T>{
        self.triee.remove(row)
    }
    pub fn resize_to(&mut self,record_count:u32)->Result<u32,std::io::Error>{
        let size=mem::size_of::<usize>()
            +mem::size_of::<AvltrieeNode<T>>()*(1+record_count as usize)
        ;
        if self.mmap.len()<size as u64{
            self.mmap.set_len(size as u64)?;
        }
        Ok(record_count)
    }
    pub fn max_rows(&self)->u32{
        let len=self.mmap.len();
        
        ((len-INIT_SIZE)/mem::size_of::<AvltrieeNode<T>>() as u64) as u32
    }
    fn resize(&mut self,insert_row:u32)->Result<u32,std::io::Error>{
        let new_record_count=self.max_rows();
        let sizing_count=if insert_row!=0{
            insert_row
        }else{
            new_record_count
        };
        let size=mem::size_of::<usize>()
            +mem::size_of::<AvltrieeNode<T>>()*(1+sizing_count as usize)
        ;
        if (self.mmap.len() as usize)<size{
            self.mmap.set_len(size as u64)?;
        }
        
        Ok(sizing_count)
    }
    pub fn init(&mut self,data:T,root:u32)->Option<u32>{
        if let Err(_)=self.mmap.set_len((
            mem::size_of::<usize>()
            +mem::size_of::<AvltrieeNode<T>>()*(root as usize+1)
        ) as u64){
            None
        }else{
            self.triee.init_node(data,root);
            Some(root)
        }
    }
    pub fn insert_unique(&mut self
        ,data:T
        ,root: u32   //起点ノード(親ノード)
        ,ord: Ordering
        ,insert_row:u32
    )->Option<u32> where T:Default{
        if root==0{    //初回登録
            self.init(data,insert_row)
        }else{
            match self.resize(insert_row){
                Err(_)=>None
                ,Ok(new_row)=>{
                    self.triee.update_node(root,new_row,data,ord);
                    Some(new_row)
                 }
             }
         }
    }
    pub fn insert_same(&mut self,root:u32,insert_row:u32)->Option<u32>{
        match self.resize(insert_row){
            Err(_)=>None
            ,Ok(new_row)=>{
                self.triee.update_same(root,new_row);
                Some(new_row)
            }
        }
    }

    pub fn select_by_value(&self,value:&T)->RowSet where T:std::cmp::Ord{
        let mut result=RowSet::default();
        let (ord,row)=self.triee().search(value);
        if ord==Ordering::Equal{
            result.insert(row);
        }
        result
    }
    pub fn select_by_value_from_to(&self,value_min:&T,value_max:&T)->RowSet where T:std::cmp::Ord{
        let mut result=RowSet::default();
        for (_,i,_) in self.triee().iter_by_value_from_to(value_min,value_max){
            result.insert(i);
        }
        result
    }
    pub fn select_by_value_from(&self,value_min:&T)->RowSet where T:std::cmp::Ord{
        let mut result=RowSet::default();
        for (_,i,_) in self.triee().iter_by_value_from(value_min){
            result.insert(i);
        }
        result
    }
    pub fn select_by_value_to(&self,value_max:&T)->RowSet where T:std::cmp::Ord{
        let mut result=RowSet::default();
        for (_,i,_) in self.triee().iter_by_value_to(value_max){
            result.insert(i);
        }
        result
    }
}