tokenize_dir 0.1.0

Tokenize file names in directories to access files in a composable way.
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
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
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279

#![no_std]
extern crate alloc;
use alloc::vec::Vec;

pub use tokenize_dir_macros::tokenize_dir;

mod to_constraints;

pub use to_constraints::ToConstraints;

/// returns None for unconstrained
/// 
/// returns Some(Vec<usize>) where the all the values satisfy all the cosntraints
/// where a cosntraint is skipped if it cannot be satisfied given the previous constraints
pub fn solve_constraints_nonstrict<'a>(
    mut constraints: impl Iterator<Item = impl AsRef<[usize]>>,
) -> Option<Vec<usize>> {
    let Some(first_constraint) = constraints.next() else {
        return None;
    };
    let first_nonempty_constraint = if first_constraint.as_ref().is_empty() {
        if let Some(possible_files) = constraints
            .find(|token_associated_files| !token_associated_files.as_ref().is_empty())
        {
            possible_files
        } else {
            return Some(Vec::new());
        }
    } else {
        first_constraint
    };
    let mut partial_solution = Vec::from(first_nonempty_constraint.as_ref());
    while let Some(constraint) = constraints.next() {
        let constraint = constraint.as_ref();
        if partial_solution.len() == 1 {
            break;
        }
        if constraint.is_empty() {
            continue;
        }
        if partial_solution[partial_solution.len() - 1] < constraint[0] {
            continue;
        }
        if partial_solution[0] > constraint[constraint.len() - 1] {
            continue;
        }
        let mut i = 0;
        let mut j = 0;
        if partial_solution.first().unwrap() > constraint.first().unwrap() {
            let x = partial_solution[0];
            let mut b = constraint.len() / 2;
            while b > 0 {
                while j + b < constraint.len() && constraint[j + b] <= x {
                    j += b;
                }
                b /= 2;
            }
        } else
        // if possible_files.first().unwrap() < token_associated_files.first().unwrap()
        {
            let x = constraint[0];
            let mut b = partial_solution.len() / 2;
            while b > 0 {
                while i + b < partial_solution.len() && partial_solution[i + b] <= x {
                    i += b;
                }
                b /= 2;
            }
        }
        let mut next_partial_solution = Vec::with_capacity(partial_solution.len());
        // let mut next_partial_solution = Vec::new();
        while i < partial_solution.len() && j < constraint.len() {
            if partial_solution[i] == constraint[j] {
                next_partial_solution.push(partial_solution[i]);
                i += 1;
                j += 1;
            } else if partial_solution[i] < constraint[j] {
                i += 1;
            } else {
                j += 1;
            }
        }
        if !next_partial_solution.is_empty() {
            partial_solution = next_partial_solution;
        }
    }
    Some(partial_solution)
}

/// returns None for no value
/// 
/// returns Some(usize) where there is a value
pub fn first_value_nonstrict<'a>(
    mut constraints: impl Iterator<Item = impl AsRef<[usize]>>,
) -> Option<usize> {
    let Some(first_constraint) = constraints.next() else {
        return Some(0);
    };
    let first_nonempty_constraint = if first_constraint.as_ref().is_empty() {
        if let Some(possible_files) = constraints
            .find(|token_associated_files| !token_associated_files.as_ref().is_empty())
        {
            possible_files
        } else {
            return None;
        }
    } else {
        first_constraint
    };
    let mut partial_solution = Vec::from(first_nonempty_constraint.as_ref());
    while let Some(constraint) = constraints.next() {
        let constraint = constraint.as_ref();
        if partial_solution.len() == 1 {
            break;
        }
        if constraint.is_empty() {
            continue;
        }
        if partial_solution[partial_solution.len() - 1] < constraint[0] {
            continue;
        }
        if partial_solution[0] > constraint[constraint.len() - 1] {
            continue;
        }
        let mut i = 0;
        let mut j = 0;
        if partial_solution.first().unwrap() > constraint.first().unwrap() {
            let x = partial_solution[0];
            let mut b = constraint.len() / 2;
            while b > 0 {
                while j + b < constraint.len() && constraint[j + b] <= x {
                    j += b;
                }
                b /= 2;
            }
        } else
        // if possible_files.first().unwrap() < token_associated_files.first().unwrap()
        {
            let x = constraint[0];
            let mut b = partial_solution.len() / 2;
            while b > 0 {
                while i + b < partial_solution.len() && partial_solution[i + b] <= x {
                    i += b;
                }
                b /= 2;
            }
        }
        let mut next_partial_solution = Vec::with_capacity(partial_solution.len());
        // let mut next_partial_solution = Vec::new();
        while i < partial_solution.len() && j < constraint.len() {
            if partial_solution[i] == constraint[j] {
                next_partial_solution.push(partial_solution[i]);
                i += 1;
                j += 1;
            } else if partial_solution[i] < constraint[j] {
                i += 1;
            } else {
                j += 1;
            }
        }
        if !next_partial_solution.is_empty() {
            partial_solution = next_partial_solution;
        }
    }
    Some(partial_solution[0])
}


/// returns None for unconstrained
/// 
/// returns Some(Vec<usize>) where the all the values satisfy all the cosntraints
pub fn solve_constraints_strict<'a>(
    mut constraints: impl Iterator<Item = impl AsRef<[usize]>>,
) -> Option<Vec<usize>> {
    let Some(first_constraint) = constraints.next() else {
        return None;
    };
    let mut partial_solution = Vec::from(first_constraint.as_ref());
    while let Some(constraint) = constraints.next() {
        if partial_solution.is_empty() {
            break;
        }
        let constraint = constraint.as_ref();
        let mut i = 0;
        let mut j = 0;
        if partial_solution.first().unwrap() > constraint.first().unwrap() {
            let x = partial_solution[0];
            let mut b = constraint.len() / 2;
            while b > 0 {
                while j + b < constraint.len() && constraint[j + b] <= x {
                    j += b;
                }
                b /= 2;
            }
        } else
        // if possible_files.first().unwrap() < token_associated_files.first().unwrap()
        {
            let x = constraint[0];
            let mut b = partial_solution.len() / 2;
            while b > 0 {
                while i + b < partial_solution.len() && partial_solution[i + b] <= x {
                    i += b;
                }
                b /= 2;
            }
        }
        let mut next_partial_solution = Vec::with_capacity(partial_solution.len());
        // let mut next_partial_solution = Vec::new();
        while i < partial_solution.len() && j < constraint.len() {
            if partial_solution[i] == constraint[j] {
                next_partial_solution.push(partial_solution[i]);
                i += 1;
                j += 1;
            } else if partial_solution[i] < constraint[j] {
                i += 1;
            } else {
                j += 1;
            }
        }
        partial_solution = next_partial_solution;
    }
    Some(partial_solution)
}

/// returns None no value satisfies
/// 
/// returns Some(usize) when there is a value
pub fn first_value_strict<'a>(
    mut constraints: impl Iterator<Item = impl AsRef<[usize]>>,
) -> Option<usize> {
    let Some(first_constraint) = constraints.next() else {
        return Some(0);
    };
    let mut partial_solution = Vec::from(first_constraint.as_ref());
    while let Some(constraint) = constraints.next() {
        if partial_solution.is_empty() {
            break;
        }
        let constraint = constraint.as_ref();
        let mut i = 0;
        let mut j = 0;
        if partial_solution.first().unwrap() > constraint.first().unwrap() {
            let x = partial_solution[0];
            let mut b = constraint.len() / 2;
            while b > 0 {
                while j + b < constraint.len() && constraint[j + b] <= x {
                    j += b;
                }
                b /= 2;
            }
        } else
        // if possible_files.first().unwrap() < token_associated_files.first().unwrap()
        {
            let x = constraint[0];
            let mut b = partial_solution.len() / 2;
            while b > 0 {
                while i + b < partial_solution.len() && partial_solution[i + b] <= x {
                    i += b;
                }
                b /= 2;
            }
        }
        let mut next_partial_solution = Vec::with_capacity(partial_solution.len());
        // let mut next_partial_solution = Vec::new();
        while i < partial_solution.len() && j < constraint.len() {
            if partial_solution[i] == constraint[j] {
                next_partial_solution.push(partial_solution[i]);
                i += 1;
                j += 1;
            } else if partial_solution[i] < constraint[j] {
                i += 1;
            } else {
                j += 1;
            }
        }
        partial_solution = next_partial_solution;
    }
    partial_solution.first().map(|x| *x)
}