|
1 | 1 | use anyhow::{anyhow, Error}; |
2 | | -use regex::Regex; |
3 | 2 |
|
4 | 3 | pub struct KeyFinder { |
5 | | - keys: Option<(usize, usize, Vec<bool>)>, |
6 | | - sep: Regex, |
| 4 | + keys: Option<Vec<bool>>, |
7 | 5 | } |
8 | 6 |
|
9 | 7 | impl KeyFinder { |
10 | | - pub fn new(keys: Option<Vec<usize>>, sep: Regex) -> Result<Self, Error> { |
| 8 | + pub fn new(keys: Option<Vec<usize>>) -> Self { |
11 | 9 | let keys = keys.map(|mut keys| { |
12 | 10 | keys.sort(); |
13 | 11 |
|
14 | 12 | let last = *keys.last().unwrap(); |
15 | | - ( |
16 | | - keys.len(), |
17 | | - last, |
18 | | - (0..=last) |
19 | | - .map(|i| keys.contains(&(i + 1))) |
20 | | - .collect::<Vec<_>>(), |
21 | | - ) |
| 13 | + (0..=last) |
| 14 | + .map(|i| keys.contains(&(i + 1))) |
| 15 | + .collect::<Vec<_>>() |
22 | 16 | }); |
23 | | - Ok(KeyFinder { keys, sep }) |
| 17 | + KeyFinder { keys } |
24 | 18 | } |
25 | 19 |
|
26 | 20 | pub fn key<'a>(&self, record: &'a str, s: &'a mut String) -> Result<&'a str, Error> { |
27 | | - let (num, last, keep) = match &self.keys { |
| 21 | + let keep = match &self.keys { |
28 | 22 | None => return Ok(record), |
29 | | - Some((num, _, _)) if *num == 0 => return Ok(record), |
30 | | - Some((num, last, keep)) => (num, last, keep), |
| 23 | + Some(keep) if keep.len() == 0 => return Ok(record), |
| 24 | + Some(keep) => keep, |
31 | 25 | }; |
32 | 26 |
|
33 | | - let mut fields = keep |
34 | | - .iter() |
35 | | - .zip(self.sep.splitn(record, last + 2)) |
36 | | - .filter_map(|(keep, field)| if *keep { Some(field) } else { None }); |
37 | | - |
38 | | - if *num == 1 { |
39 | | - return match fields.next() { |
40 | | - Some(f) => Ok(f), |
41 | | - None => Err(anyhow!("not enough fields to make key")), |
42 | | - }; |
43 | | - } |
44 | | - |
45 | | - let mut found = 0; |
46 | | - for f in fields { |
47 | | - s.push(' '); |
48 | | - s.push_str(f); |
49 | | - found += 1; |
| 27 | + let mut current = 0; |
| 28 | + for c in record.chars() { |
| 29 | + if c == ' ' || c == '\t' { |
| 30 | + current += 1; |
| 31 | + } else if current < keep.len() && keep[current] { |
| 32 | + s.push(c); |
| 33 | + } else if current >= keep.len() { |
| 34 | + break; |
| 35 | + } |
50 | 36 | } |
51 | 37 |
|
52 | | - if found == *num { |
| 38 | + if current >= keep.len() { |
53 | 39 | Ok(s) |
54 | 40 | } else { |
55 | 41 | Err(anyhow!("not enough fields to make key")) |
56 | 42 | } |
57 | 43 | } |
58 | 44 | } |
| 45 | + |
| 46 | +#[cfg(test)] |
| 47 | +mod tests { |
| 48 | + use super::*; |
| 49 | + |
| 50 | + #[test] |
| 51 | + fn key() { |
| 52 | + let kf = KeyFinder::new(Some(vec![1])); |
| 53 | + let mut s = String::new(); |
| 54 | + assert_eq!(kf.key(TEST, &mut s).unwrap(), "92.109.155.34"); |
| 55 | + |
| 56 | + s.clear(); |
| 57 | + let kf = KeyFinder::new(Some(vec![7])); |
| 58 | + assert_eq!(kf.key(TEST, &mut s).unwrap(), "/"); |
| 59 | + } |
| 60 | + |
| 61 | + const TEST: &str = "92.109.155.34 - - [09/Aug/2018:11:53:26 +0200] \"GET / HTTP/2.0\" 200 3219 \"https://www.facebook.com/\" \"Mozilla/5.0 (Macintosh; Intel Mac OS X 10_13_4) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/67.0.3396.99 Safari/537.36\""; |
| 62 | +} |
0 commit comments