dochy_fs 0.10.1

A file system which composes chlonological diff files efficiently.
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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184

use crate::imp::history::file_name::file_name_props::FileNameProps;
use crate::imp::history::file_hist::file_history::FileHistory;
use std::path::{PathBuf, Path};
use crate::error::FsResult;

// pub(crate) struct Ancestors{
//     vec : Vec<FileNameProps>,
// }
//
// impl Ancestors {
//     //pub(crate) fn empty(dir_path : PathBuf) -> Ancestors{ Ancestors{ vec : vec![] }}
//
//     pub(crate) fn create(history: &FileHistory,
//                          props: &FileNameProps,
//                          max_phase: usize,
//                          cumulative : bool) -> FsResult<Ancestors> {
//         let mut ancestors_rev = create_ancestors_rev(history, props, max_phase, cumulative)?;
//         ancestors_rev.reverse();
//         Ok(Ancestors{ vec : ancestors })
//     }
//
//     pub(crate) fn calc_paths(&self, history_dir: &Path) -> Vec<PathBuf>{
//         self.vec.iter().map(|props|{
//            history_dir.join(props.calc_filename())
//         }).collect()
//     }
// }

pub(crate) fn create_ancestors_paths<'a>(history: &'a FileHistory,
                                        props: &'a FileNameProps,
                                        max_phase: usize,
                                        cumulative : bool,
                                         history_dir : &Path) -> FsResult<Vec<PathBuf>>{
    let mut rev = create_ancestors_rev(history, props, max_phase, cumulative)?;
    rev.reverse();
    Ok(calc_ancestors_paths(&rev, history_dir))
}

pub(crate) fn calc_ancestors_paths(ancestors : &[&FileNameProps], history_dir : &Path) -> Vec<PathBuf>{
    ancestors.iter().map(|&props| history_dir.join(props.calc_filename())).collect()
}

///最も遠い祖先から自分自身まで並べる
pub(crate) fn create_ancestors<'a>(history: &'a FileHistory,
                                   props: &'a FileNameProps,
                                   max_phase: usize,
                                   cumulative : bool) -> FsResult<Vec<&'a FileNameProps>>{
    let mut r = create_ancestors_rev(history, props, max_phase, cumulative)?;
    r.reverse();
    Ok(r)
}

///ancestors から next_phase までを切り出し、次のFileNameも計算する
pub(crate) fn create_dependencies<'a,'b>(ancestors : &'b[&'a FileNameProps],
                                      next_phase : usize,
                                      ctl : u32,
                                      tag : Option<String>,
                                      max_phase: usize,
                                      cumulative : bool) -> FsResult<(&'b[&'a FileNameProps], FileNameProps)>{

    let len = ancestors.len();
    if len == 0{
        return Err("no ancestors")?;
    }

    let last_prop = *ancestors.last().unwrap();
    let mut order = last_prop.order().to_vec();
    let prev_ctl;
    if order.len() - 1 < max_phase{
        order.push(0);
        prev_ctl = last_prop.control();
    } else if next_phase == max_phase{
        *order.last_mut().unwrap() += 1;
        prev_ctl = last_prop.control();
    } else {
        order = order[0..next_phase+1].to_vec();
        *order.last_mut().unwrap() += 1;
        prev_ctl = ancestors[next_phase].prev_ctl();
    }
    let props = FileNameProps::new(ctl, prev_ctl, order, tag)?;

    if next_phase == max_phase && cumulative {
        Ok((ancestors, props))
    } else {
        if next_phase <= ancestors.len() {
            Ok((&ancestors[0..next_phase], props))
        } else{
            Err("create dependencies failed")?
        }
    }
}

///自分自身からスタートして、最も遠い祖先まで並べる。なので通常の親子関係の逆順になる
pub(crate) fn create_ancestors_rev<'a>(history: &'a FileHistory,
                    props: &'a FileNameProps,
                    max_phase: usize,
                    cumulative : bool) -> FsResult<Vec<&'a FileNameProps>>{
    let mut vec : Vec<&FileNameProps> = vec![props];

    let len = props.order().len();
    if len == 0{
        return Ok(vec);
    }
    let mut props = props;

    if len - 1 == max_phase{
        if cumulative {
            let order_last = props.order_last();
            let mut order = Vec::with_capacity(props.order().len());
            for v in props.order_base(){
                order.push(*v);
            }

            for inv_i in 0..order_last {
                let ind = order_last - 1 - inv_i;
                order.push(ind);
                if let Some(p) = history.get_props(props.prev_ctl(), &order) {
                    props = p;
                    order.pop();
                    vec.push(p);
                } else {
                    Err(format!("missing ancestor {} {:?}", props.prev_ctl(), &order))?
                }
            }
        }
    }

    loop{
        if 2 <= props.order().len() {
            if let Some(p) = history.get_parent(props){
                vec.push(p);
                props = p;
            } else{
                Err(format!("l missing ancestor {} {:?}",props.prev_ctl(), props.order_base()))?
            }
        } else{
            return Ok(vec)
        }
    }

}
//
// fn create_ancestors_b(history: &FileHistory,
//                     props: &FileNameProps,
//                     max_phase: usize,
//                     cumulative : bool) -> FsResult<Vec<FileNameProps>>{
//     let mut vec : Vec<FileNameProps> = vec![];
//
//     let first_his = history.get_ctl(props.control())?;
//     let mut his = first_his;
//     let len = props.order().len();
//     if len == 0{
//         //nextのorderが空の時点で不正であるが、ここでは関知しない
//         return Ok(vec);
//     }
//
//     kokowoyare
//
//     for (i, order) in props.order().iter().take(len-1).enumerate(){
//         vec.push(his.items().get(order)?.clone());
//         if let Some(next_his) = his.children().get(order) {
//             his = next_his;
//         } else{
//             //cumulativeでない場合、ancestorはorderの最後の一つ前までである。
//             //orderの最後のファイルはこれから作るので当然まだ存在しないし、
//             //そのphaseがまだない場合childrenも存在していなくて正常
//             if i == len - 2 && props.order_last() == 0{
//                 //別に場合分けしなくても、historyが不正でない限り結果は変わらないが・・・
//                 return Ok(vec);
//             } else{
//                 //ここに来るのは俺のバグなのでpanicでも良い・・・
//                 Err(format!("Invalid history, order {:?} his {:?}", props.order(), first_his))?
//             }
//         }
//     }
//
//     if len - 1 == max_phase && cumulative{
//         let order_last = props.order_last();
//         for i in 0..order_last{
//             vec.push(his.items().get(&i)?.clone())
//         }
//     }
//     return Ok(vec)
// }