Reimplement day 4 2022 with ranges instead of ints

2022/benches/days.rs

@@ -8,7 +8,7 @@ use criterion::BenchmarkId;
 use criterion::Criterion;
 
 /// Number of days we have an implementation to benchmark
-const DAYS_IMPLEMENTED: u8 = 7;
+const DAYS_IMPLEMENTED: u8 = 4;
 
 fn read_input(day: u8) -> Vec<u8> {
     let input_path = format!("inputs/{:02}.txt", day);

2022/inputs/05.txt

@@ -1,514 +0,0 @@
-        [G]         [D]     [Q]    
-[P]     [T]         [L] [M] [Z]    
-[Z] [Z] [C]         [Z] [G] [W]    
-[M] [B] [F]         [P] [C] [H] [N]
-[T] [S] [R]     [H] [W] [R] [L] [W]
-[R] [T] [Q] [Z] [R] [S] [Z] [F] [P]
-[C] [N] [H] [R] [N] [H] [D] [J] [Q]
-[N] [D] [M] [G] [Z] [F] [W] [S] [S]
- 1   2   3   4   5   6   7   8   9 
-
-move 7 from 6 to 8
-move 5 from 2 to 6
-move 2 from 4 to 1
-move 1 from 4 to 5
-move 5 from 7 to 6
-move 7 from 6 to 3
-move 5 from 9 to 2
-move 6 from 2 to 3
-move 2 from 7 to 9
-move 20 from 3 to 1
-move 11 from 1 to 6
-move 1 from 9 to 8
-move 3 from 8 to 2
-move 8 from 1 to 5
-move 10 from 8 to 4
-move 7 from 6 to 4
-move 1 from 8 to 3
-move 8 from 1 to 7
-move 16 from 4 to 8
-move 1 from 9 to 8
-move 1 from 5 to 2
-move 4 from 7 to 4
-move 5 from 6 to 7
-move 1 from 6 to 1
-move 8 from 7 to 4
-move 1 from 6 to 9
-move 12 from 4 to 5
-move 3 from 2 to 5
-move 1 from 6 to 2
-move 1 from 3 to 7
-move 1 from 3 to 2
-move 1 from 9 to 3
-move 1 from 7 to 8
-move 1 from 7 to 5
-move 1 from 3 to 2
-move 4 from 5 to 7
-move 5 from 5 to 7
-move 1 from 4 to 3
-move 1 from 3 to 9
-move 3 from 1 to 8
-move 1 from 9 to 1
-move 2 from 2 to 1
-move 2 from 2 to 7
-move 8 from 8 to 1
-move 3 from 5 to 2
-move 8 from 7 to 5
-move 7 from 1 to 3
-move 3 from 1 to 7
-move 1 from 1 to 5
-move 1 from 3 to 7
-move 7 from 5 to 8
-move 2 from 2 to 8
-move 1 from 3 to 2
-move 1 from 2 to 4
-move 1 from 4 to 8
-move 13 from 8 to 1
-move 13 from 5 to 9
-move 2 from 5 to 2
-move 7 from 9 to 3
-move 12 from 8 to 3
-move 4 from 9 to 3
-move 1 from 3 to 4
-move 2 from 2 to 3
-move 1 from 1 to 6
-move 1 from 2 to 3
-move 1 from 5 to 9
-move 7 from 7 to 4
-move 10 from 1 to 8
-move 1 from 1 to 4
-move 1 from 9 to 5
-move 2 from 5 to 1
-move 1 from 6 to 5
-move 3 from 8 to 9
-move 5 from 4 to 3
-move 4 from 4 to 1
-move 7 from 1 to 6
-move 2 from 5 to 7
-move 35 from 3 to 4
-move 4 from 9 to 1
-move 19 from 4 to 8
-move 1 from 7 to 6
-move 1 from 9 to 2
-move 10 from 4 to 5
-move 2 from 4 to 7
-move 3 from 4 to 3
-move 1 from 2 to 8
-move 1 from 1 to 9
-move 3 from 3 to 6
-move 4 from 8 to 6
-move 4 from 5 to 2
-move 2 from 8 to 3
-move 3 from 5 to 9
-move 12 from 6 to 1
-move 8 from 8 to 6
-move 2 from 9 to 1
-move 1 from 4 to 1
-move 1 from 3 to 8
-move 3 from 7 to 8
-move 2 from 9 to 7
-move 1 from 6 to 7
-move 10 from 6 to 8
-move 4 from 2 to 5
-move 1 from 3 to 7
-move 7 from 5 to 7
-move 13 from 8 to 1
-move 29 from 1 to 4
-move 8 from 7 to 8
-move 1 from 1 to 3
-move 3 from 7 to 6
-move 1 from 1 to 9
-move 15 from 4 to 1
-move 1 from 3 to 6
-move 10 from 1 to 6
-move 10 from 6 to 7
-move 1 from 4 to 9
-move 1 from 9 to 1
-move 1 from 9 to 7
-move 6 from 7 to 8
-move 1 from 1 to 6
-move 5 from 6 to 5
-move 21 from 8 to 9
-move 5 from 1 to 9
-move 2 from 9 to 5
-move 3 from 5 to 6
-move 3 from 7 to 9
-move 4 from 4 to 6
-move 6 from 8 to 7
-move 6 from 6 to 3
-move 2 from 7 to 9
-move 1 from 7 to 2
-move 6 from 3 to 2
-move 1 from 6 to 4
-move 4 from 5 to 9
-move 1 from 4 to 5
-move 9 from 4 to 6
-move 7 from 6 to 4
-move 10 from 9 to 2
-move 5 from 7 to 5
-move 10 from 2 to 7
-move 2 from 5 to 4
-move 2 from 5 to 9
-move 4 from 9 to 4
-move 1 from 8 to 6
-move 7 from 7 to 2
-move 1 from 5 to 4
-move 2 from 7 to 1
-move 1 from 5 to 7
-move 3 from 6 to 2
-move 4 from 4 to 5
-move 1 from 2 to 7
-move 10 from 4 to 7
-move 3 from 7 to 3
-move 17 from 9 to 4
-move 1 from 1 to 4
-move 1 from 1 to 5
-move 5 from 2 to 7
-move 1 from 9 to 2
-move 5 from 4 to 8
-move 2 from 9 to 7
-move 4 from 8 to 1
-move 3 from 4 to 8
-move 1 from 2 to 5
-move 1 from 9 to 2
-move 6 from 4 to 8
-move 3 from 7 to 5
-move 1 from 4 to 9
-move 1 from 9 to 1
-move 3 from 1 to 9
-move 4 from 8 to 5
-move 2 from 9 to 8
-move 4 from 2 to 5
-move 8 from 7 to 2
-move 5 from 8 to 5
-move 2 from 7 to 8
-move 1 from 3 to 5
-move 1 from 1 to 2
-move 1 from 1 to 6
-move 2 from 3 to 6
-move 5 from 2 to 8
-move 4 from 7 to 1
-move 7 from 8 to 5
-move 1 from 1 to 5
-move 3 from 8 to 3
-move 1 from 9 to 3
-move 7 from 2 to 3
-move 2 from 2 to 8
-move 2 from 4 to 8
-move 1 from 8 to 5
-move 1 from 1 to 4
-move 2 from 4 to 7
-move 2 from 7 to 1
-move 3 from 2 to 3
-move 3 from 5 to 2
-move 1 from 8 to 3
-move 3 from 3 to 2
-move 5 from 2 to 1
-move 17 from 5 to 8
-move 9 from 8 to 1
-move 11 from 3 to 5
-move 8 from 8 to 5
-move 2 from 8 to 5
-move 16 from 1 to 4
-move 13 from 4 to 7
-move 6 from 5 to 2
-move 2 from 4 to 8
-move 5 from 7 to 9
-move 2 from 1 to 2
-move 7 from 7 to 1
-move 1 from 1 to 4
-move 1 from 9 to 8
-move 7 from 2 to 8
-move 1 from 4 to 7
-move 2 from 9 to 4
-move 1 from 4 to 1
-move 1 from 3 to 5
-move 2 from 9 to 8
-move 11 from 8 to 7
-move 2 from 6 to 5
-move 1 from 6 to 9
-move 1 from 1 to 9
-move 1 from 9 to 1
-move 4 from 1 to 4
-move 2 from 1 to 8
-move 1 from 1 to 2
-move 1 from 9 to 5
-move 2 from 4 to 3
-move 2 from 2 to 7
-move 2 from 3 to 9
-move 1 from 9 to 1
-move 1 from 9 to 1
-move 5 from 5 to 1
-move 19 from 5 to 6
-move 5 from 1 to 4
-move 1 from 2 to 9
-move 1 from 1 to 3
-move 7 from 5 to 8
-move 1 from 3 to 6
-move 8 from 7 to 3
-move 7 from 4 to 8
-move 3 from 8 to 5
-move 1 from 4 to 1
-move 1 from 9 to 4
-move 1 from 4 to 9
-move 1 from 5 to 2
-move 2 from 5 to 6
-move 2 from 8 to 2
-move 7 from 8 to 1
-move 1 from 1 to 7
-move 3 from 6 to 9
-move 2 from 3 to 2
-move 1 from 2 to 1
-move 1 from 8 to 7
-move 2 from 9 to 6
-move 2 from 9 to 5
-move 1 from 5 to 6
-move 1 from 2 to 8
-move 2 from 1 to 7
-move 1 from 4 to 3
-move 3 from 2 to 5
-move 7 from 1 to 3
-move 10 from 3 to 4
-move 3 from 5 to 4
-move 1 from 3 to 8
-move 3 from 3 to 2
-move 1 from 8 to 1
-move 1 from 1 to 3
-move 3 from 8 to 3
-move 5 from 4 to 6
-move 1 from 2 to 3
-move 4 from 6 to 4
-move 1 from 5 to 7
-move 4 from 3 to 4
-move 1 from 2 to 8
-move 12 from 7 to 6
-move 1 from 8 to 2
-move 2 from 2 to 7
-move 1 from 8 to 4
-move 23 from 6 to 3
-move 14 from 3 to 6
-move 15 from 4 to 6
-move 1 from 8 to 6
-move 10 from 3 to 7
-move 2 from 4 to 2
-move 11 from 7 to 8
-move 2 from 2 to 6
-move 44 from 6 to 9
-move 21 from 9 to 3
-move 12 from 3 to 6
-move 1 from 7 to 4
-move 1 from 4 to 7
-move 9 from 3 to 2
-move 2 from 8 to 6
-move 3 from 2 to 4
-move 17 from 9 to 1
-move 3 from 4 to 6
-move 2 from 2 to 9
-move 4 from 9 to 2
-move 10 from 6 to 9
-move 1 from 7 to 6
-move 4 from 9 to 5
-move 4 from 2 to 4
-move 14 from 1 to 5
-move 4 from 4 to 3
-move 3 from 2 to 9
-move 9 from 9 to 7
-move 1 from 2 to 5
-move 9 from 8 to 5
-move 8 from 7 to 2
-move 4 from 3 to 8
-move 5 from 6 to 2
-move 3 from 1 to 6
-move 1 from 7 to 1
-move 4 from 2 to 4
-move 3 from 6 to 4
-move 3 from 8 to 3
-move 13 from 5 to 2
-move 2 from 3 to 5
-move 12 from 5 to 9
-move 1 from 3 to 5
-move 1 from 5 to 9
-move 1 from 8 to 3
-move 4 from 9 to 5
-move 6 from 4 to 5
-move 12 from 9 to 7
-move 1 from 9 to 3
-move 1 from 3 to 2
-move 12 from 5 to 6
-move 12 from 7 to 2
-move 1 from 3 to 7
-move 1 from 4 to 8
-move 33 from 2 to 8
-move 1 from 7 to 5
-move 1 from 1 to 2
-move 4 from 5 to 4
-move 3 from 2 to 5
-move 34 from 8 to 6
-move 1 from 4 to 3
-move 1 from 5 to 7
-move 1 from 7 to 5
-move 3 from 4 to 9
-move 2 from 9 to 7
-move 1 from 9 to 4
-move 1 from 3 to 7
-move 1 from 5 to 8
-move 1 from 5 to 1
-move 1 from 5 to 7
-move 1 from 4 to 8
-move 1 from 1 to 4
-move 1 from 4 to 2
-move 3 from 7 to 5
-move 2 from 8 to 5
-move 1 from 2 to 8
-move 4 from 6 to 2
-move 1 from 8 to 6
-move 1 from 7 to 9
-move 29 from 6 to 7
-move 4 from 2 to 3
-move 2 from 5 to 8
-move 1 from 9 to 5
-move 2 from 8 to 1
-move 23 from 7 to 5
-move 2 from 6 to 1
-move 23 from 5 to 6
-move 1 from 3 to 6
-move 4 from 5 to 9
-move 2 from 1 to 3
-move 5 from 3 to 8
-move 2 from 6 to 5
-move 2 from 1 to 4
-move 1 from 9 to 8
-move 1 from 9 to 1
-move 1 from 4 to 6
-move 2 from 5 to 6
-move 6 from 7 to 8
-move 2 from 9 to 2
-move 18 from 6 to 5
-move 21 from 6 to 4
-move 1 from 1 to 6
-move 2 from 6 to 7
-move 2 from 7 to 9
-move 2 from 2 to 8
-move 7 from 4 to 3
-move 12 from 5 to 3
-move 1 from 9 to 5
-move 1 from 9 to 4
-move 6 from 5 to 2
-move 17 from 3 to 4
-move 3 from 4 to 3
-move 1 from 2 to 4
-move 5 from 2 to 8
-move 1 from 5 to 8
-move 19 from 8 to 7
-move 1 from 3 to 6
-move 1 from 8 to 4
-move 1 from 6 to 1
-move 15 from 4 to 6
-move 1 from 1 to 4
-move 3 from 3 to 5
-move 4 from 6 to 7
-move 1 from 4 to 7
-move 10 from 6 to 7
-move 16 from 4 to 5
-move 24 from 7 to 2
-move 8 from 7 to 8
-move 1 from 4 to 2
-move 6 from 8 to 7
-move 1 from 8 to 7
-move 1 from 6 to 9
-move 14 from 5 to 4
-move 9 from 7 to 8
-move 4 from 5 to 1
-move 2 from 1 to 5
-move 3 from 8 to 6
-move 2 from 6 to 9
-move 2 from 2 to 8
-move 6 from 2 to 7
-move 3 from 4 to 6
-move 1 from 3 to 4
-move 3 from 5 to 7
-move 1 from 6 to 9
-move 5 from 7 to 2
-move 4 from 9 to 1
-move 1 from 7 to 9
-move 9 from 8 to 4
-move 5 from 1 to 2
-move 2 from 6 to 1
-move 6 from 4 to 7
-move 1 from 7 to 3
-move 1 from 3 to 9
-move 1 from 9 to 7
-move 1 from 6 to 7
-move 9 from 4 to 5
-move 7 from 7 to 9
-move 3 from 7 to 5
-move 1 from 9 to 2
-move 6 from 9 to 8
-move 4 from 4 to 5
-move 1 from 4 to 2
-move 1 from 4 to 2
-move 2 from 1 to 2
-move 1 from 9 to 8
-move 10 from 2 to 4
-move 8 from 2 to 7
-move 12 from 2 to 9
-move 6 from 7 to 4
-move 1 from 1 to 2
-move 8 from 9 to 8
-move 7 from 5 to 1
-move 9 from 4 to 3
-move 14 from 8 to 4
-move 1 from 8 to 4
-move 1 from 1 to 5
-move 1 from 5 to 2
-move 3 from 2 to 4
-move 1 from 7 to 1
-move 1 from 7 to 3
-move 2 from 1 to 7
-move 3 from 5 to 7
-move 2 from 7 to 6
-move 1 from 6 to 5
-move 3 from 7 to 1
-move 1 from 6 to 8
-move 1 from 8 to 7
-move 1 from 3 to 6
-move 1 from 7 to 1
-move 4 from 1 to 4
-move 6 from 3 to 2
-move 3 from 1 to 2
-move 3 from 3 to 6
-move 3 from 2 to 6
-move 6 from 6 to 5
-move 1 from 1 to 4
-move 1 from 9 to 6
-move 5 from 2 to 1
-move 3 from 1 to 2
-move 2 from 9 to 8
-move 3 from 1 to 5
-move 1 from 9 to 7
-move 25 from 4 to 1
-move 1 from 1 to 7
-move 2 from 8 to 3
-move 13 from 1 to 9
-move 2 from 3 to 5
-move 8 from 5 to 9
-move 4 from 2 to 1
-move 2 from 6 to 7
-move 10 from 5 to 9
-move 4 from 7 to 2
-move 2 from 2 to 3
-move 9 from 9 to 2
-move 4 from 4 to 5
-move 4 from 5 to 4
-move 5 from 1 to 4
-move 10 from 4 to 5
-move 22 from 9 to 1
-move 2 from 2 to 7
-move 3 from 2 to 1
-move 6 from 2 to 6
-move 1 from 7 to 1
-move 10 from 5 to 7
-move 15 from 1 to 4
-move 13 from 1 to 5
-move 3 from 6 to 8
-move 1 from 8 to 9

2022/inputs/06.txt

@@ -1 +0,0 @@
-grvrnvrnnjljbjqjpqjjvhhzwwrbwwbblrltrrpbbbbqnnqbbbbsvbvmbvmbbrsrqrzrllwbbbqzqrqnqrnrjnnjccdggwqqhrrjcjmjmllgrlglhlclmlvlvsshwwsggmfmdfddgdfftrrczrcczhzppgdgrdggghmmdwwqgggslglfgfcgccmjcjwjrwjrjcrjjsgjjvddpwpgpbbgwbgwwhnhfftbffhpfphhfqfrqfrfnfpprvrsrhrfrllfhhrsrhssvfsvsnvsnsswtwtlthllrjjwddtggzczgcchwcwppfbbdvdrdzrdrvrwwsbsfbssqfsfjsjcscttlztllgjjlbbdsdtssvvvwlvlqqnhqqtdqtddjcdcjjpbphhgtgtqtzqqzhqqtgtvtmvtvrvqrvvfmfmppzzbwwnddzttfpfrrlddbppfqppnwnswwdhwdwjjqljqqthtnhnddgmgcmgcmgcmmfmfttrzzfdzztllmjlllgcgbbcqcvccpnndbdjbjmmzbztzptzpprpddptpprhhvlvmlmpmmljjnnjsjfjjvgjjvzzfgfzfbftbftttgstgstgtpggflfcfqqtctltgltldlzdlzzmmlddnvddzfddppmnpptzptpvttwstwswvwrvvbfbjjjbmjjdvdvrvdddrwrhrzrqqhghhrwhwhrrmppsgpsgszzdfdfwwmtwtvwvgvffmqqqtqntqnnjcncbnbwnnzggrdrqqjbqjjwjqqqwlqwlwzlljhhfsfsqsrqqhwqqwbbqbvvlflrrlglbbjhhjmhjjcmcjcgczcfcgcqqczcnnvjnnlddmpmcppgvgjgddvrrnsnmnqmqgmmnppwgwcgwgssbddgtdgdgmdgmgvvmjmvmjmvvsfssdgdghdggbfbqbdbjbsbmmrpmrprggbllwrwpwtppzvppzsssdnsdnnvnhvvvzvfzfqqnnmlnltldtdvdbdblddsmmlccmlmvlmvmmcsctctrtsrstsbsrshsddlmddmppgsscttnrtrqqcvcwwlnlznnnvcnvvtnvnbnmbmvmppjgjdjtddmpdmdvvmgvvdqdlqlhhzccsggjdjsdsttctjctjtfjttppdzpzzbjbwwmwbblslzslzszlzrrcbrrfggvcczjjtbbdnnggbwblwlbwlwqqfvfqfddrrfccvlllhmhhhrthrthrrnbnzbbpzplphprrrnbbghhnshnhbblqqqvwwffnmnmhhtccpqpvqvbvnvvfnfsnffdjdllwffcddgcgrgjrggchcpcddtbbdtdmtdmmhhtphtpppclcpcvcjvcjjfqfzqqphpnhnrnhhpdhhtfhhbbmqmfmsmvssgqqfssqgglnnqmnmbnmbbllrdrgdrdvrdvdsvvnddgtgddcdqdsqdqbqqlhhwdhdgdcgcdchchrchhpvvpgvgrrfggwfwgmpddbhfngtrwswfszgsggnpsntjpslrpjqsffzrlnbnzdtqpqtjzwlhhgrsrbvnccnsjmzcbqgcbtbqlzhnpnhhrrvqwjwzzvrlcrmjhcscrqhpqmfzbnvcwwqhcjjlnggmpbwztzfswmsbjshnsgfmdlzvzczhrdwgwbghszpnbfpctrshbfhspsczcqcrrqcpwwpfzhjqtpqgjbztrpzrlgfdjbmlwdvlvnfmdzbwsbbhlbszvwcpztlchjrqbmsftltmqpfgdpmdgjvwqqtjsqlfqrwmsnlqgsbqfwsdnfvzthmbplvszfcmlptlcjpnfpjsphsmmjplwjqphgvzbtbjtpttqhlwtgnrjvmvsfsztmsqszzlhqqhfslsvhzgtsssfctzgsqbgdzlpwbsmpcnjqshhhcwqdsdzdhnjfqzqnqdlrpddcgrgldgqbjmdtwgppdczzrjvmcfqjbpjzbtjmgdphlbwnsnpfdqlhwvvmpwzsrztnwvtlbphljmjwsgbphgmwhdmfhpvsmvsjccjhfvqtvfmmlnggncltvtrgmbtfqsvfnlvcmjnjwzcrpjnsgntvhjbtdlptshbhhchqmsprhqzdnfpjqccdfvnzjtlbsmmwvzlwlvmsbrnhqctvtvbfhntdctjnrbcrrlmsnwbbjbcbbgrrhfqwzwwfgvsvgbwnttghtgpspzwzfhffsqjvwwttntnvlwftsfvtttgnprzrzsghvjrdtsfdvzswhmrfcdqsgvrlhzbnvbmjlqrftnnbtwqtvlvwznfbslhdqjbntdgpprfqchjvgvzjssdztjlzwfljjmfvzrbbtczggzqwrnqqgzzcbqjcpfqfrbwtdjrrvbszsjdjcpdfjscsvnltcgwvqsgnhbfgnfnddnpmbzbptrmvqzpvbdpfdvtlmgnnjwflgdbfnmvsdnmlvgcpwflwvdbtbfwtfpsmqsplnzwlwgvbjrhghwrnrswsggbqpdjcjrgbgnsqdvwzzwftvjqgjzzcdvpbbjzpphmbcqmrjvgqwfgrsnqvhwflmhgrlvbpwdcsrlqwfrwppqbrdhwqtvczpclpsbsjcptgblbbsqmbhjjgzwvlcnhnzcttmpjsgchmppgphqlzlcsqcgbbjgtjjvmttdztfdptzgvmpnqrcmpmcdlpnbztllvqbggqbqhlqvdwsrwzsjwfrqvcbvsgfdptmrzpvdfblmhlzrvpmsljlqqzrhlnmwncpfhvqlsbtrjbfcrnfvjvddrhdbbczjdsrdvzlbqrccssdzcpmdsqbprjppfzdwfdswptgzcmjqfhcwsqfqhvrslffqfbcvhdzljzrmtwmfdwzdhhjcmbjtvjhzzwfqhrcslztdbnlwmmhbbbgdscjcdzftnchqfnflnsdqjscfrqpnfbftpzvtmrwncqfqqflschpfnjsjlqcjdjgtwpqhgcnjdmnnvmmpwdspmnrgqrptqwcvbtdwpqlbtwpqgwgfrzlrhtvrvzhmhmwhfdsrhpcczqfltsgtgrfwcvlcvtlhqqwnrqgzpnzbfmzbdwqwbsfvbshrgzqdbgvrhzhzlbqsfzttmsnmrqmwgtzbvdqdrbgcpclzjrhdbjtpcdbbznjgtbwbqrnpvffdmwtrbhhstcmnjcwbbnmpbvmjprtzgcptmtrffwhvfgdljnrbbrblbfbgdwtjrtgqgrpvpgjqrjzczvvlspgdbzftqgqvgdqlglbgvgjdcztznszcwfqhmwbrbjcfstzdcmdsssqfhtzpdgmzjscvbdzgbhhgdqgvfwrzmhdrhlsvlzjjzbzdljcbhncppwrtptjgszlqsrqpzqcsgvdvzmgvwgsncnbffttslphcstqvfwbwzbflmshcbnhpljgqwmmwwzlgpbcqnrtqlwcjcrclfdrnnmvtbfdztdfvtqrsgdptfcfpzpsldhzmrngggfvdqggtlfqqwsldprcffsstnnpmsbbvghdbpprqbssnprdbqclzqtgsrczwcvqwrrfmmfwsndvtvqljwwglrgbphdvvwgctbbmtrbpzqtspgrlhmnhjcdwhwvssgspzjbcfjttjqbdpdmptfzzjcfqljpqddfssmffqprvbptfvdshsdmfmdtmlbnmbmjjjsgmlmwmgcwhbrbgchrstptvdlqgddfzddlzhwjmsvvcjwvqtzjtsctfmzchlbrvlgdzbvdlbfpvhptpltrdmcgjghcpwvwqqnrzdtnmgdncplhdpsgpnbprbgshffwwsdhpgqsbmwdtpnhhltlcqfrjtswcchzvlhdgrmjwhgwppdjqlgmdhwbllqvzrchgclmqdlghjsvmwlflmhhmdzbfjhjnvwphnjbclmdpgflqgtfsmsjslntfcmtbphnrgpdcqtjzjttdtgjmvhzsrfnrjqssvwpcslpfstbpfsrsntmftmdgsqrrsnddqfmchrhtlhmqndvvllnvltdzfphjqnvmcdsgfpcmjftgdpntjzplqljhtthvnbzbzwvfnqsjvnfwhmtbsspjslgfjvdgfjpwrsgqwntntjcqtdgnhnsfwhhqfwbwhdrftj

2022/inputs/07.txt

@@ -1,983 +0,0 @@
-$ cd /
-$ ls
-dir gqcclj
-dir lmtpm
-dir nhqwt
-dir qcq
-dir vwqwlqrt
-$ cd gqcclj
-$ ls
-62425 dqp.gjm
-174181 hrtw.qsd
-273712 pflp.mdw
-169404 zlthnlhf.mtn
-180878 zprprf
-$ cd ..
-$ cd lmtpm
-$ ls
-dir clffsvcw
-163587 cvcl.jqh
-dir dcqnblb
-dir dtpwln
-dir fvt
-dir hrcrw
-dir jdqzmqn
-236754 nrdmlj
-205959 pflp.mdw
-dir qcq
-dir rsn
-129926 vdgcqdn.sqd
-dir zprprf
-$ cd clffsvcw
-$ ls
-6997 dcqnblb.wbh
-145711 dqp
-159225 pflp.mdw
-$ cd ..
-$ cd dcqnblb
-$ ls
-dir dcqnblb
-dir gfn
-dir lpswsp
-dir lvt
-dir zprprf
-$ cd dcqnblb
-$ ls
-2020 grpdmd.ggz
-dir zpswzfvg
-$ cd zpswzfvg
-$ ls
-206998 zprprf.gnw
-$ cd ..
-$ cd ..
-$ cd gfn
-$ ls
-277530 rhbvtblc.mvw
-$ cd ..
-$ cd lpswsp
-$ ls
-173180 dcqnblb
-$ cd ..
-$ cd lvt
-$ ls
-dir hjllwsvl
-dir ptbt
-$ cd hjllwsvl
-$ ls
-dir wqnc
-$ cd wqnc
-$ ls
-64695 grpdmd.ggz
-$ cd ..
-$ cd ..
-$ cd ptbt
-$ ls
-150880 vvbt.gtp
-$ cd ..
-$ cd ..
-$ cd zprprf
-$ ls
-dir ldzslndn
-dir qftt
-$ cd ldzslndn
-$ ls
-dir bwqqsbhg
-129454 vbn
-$ cd bwqqsbhg
-$ ls
-108701 zprprf.gss
-$ cd ..
-$ cd ..
-$ cd qftt
-$ ls
-64268 cvcl.jqh
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd dtpwln
-$ ls
-196215 cvcl.jqh
-dir dpwg
-dir ldzslndn
-dir znnsqqh
-$ cd dpwg
-$ ls
-192388 gmh
-47754 grgzh.qdl
-99449 hqsh
-dir pbmf
-50061 pflp.mdw
-192902 qcq.pgg
-dir rmpvj
-dir scgc
-$ cd pbmf
-$ ls
-210083 wpfnwbl.mgf
-$ cd ..
-$ cd rmpvj
-$ ls
-125738 nmlnbvrd
-226214 zprprf.jnp
-114257 zprprf.srs
-$ cd ..
-$ cd scgc
-$ ls
-182115 rrc.rcc
-$ cd ..
-$ cd ..
-$ cd ldzslndn
-$ ls
-201992 qcrm.cpd
-$ cd ..
-$ cd znnsqqh
-$ ls
-85635 cvcl.jqh
-$ cd ..
-$ cd ..
-$ cd fvt
-$ ls
-dir dcqnblb
-dir gnc
-75864 vfn
-$ cd dcqnblb
-$ ls
-dir dcqnblb
-dir lbnflwsh
-$ cd dcqnblb
-$ ls
-269901 cvcl.jqh
-$ cd ..
-$ cd lbnflwsh
-$ ls
-33336 grpdmd.ggz
-42861 phg.wmc
-$ cd ..
-$ cd ..
-$ cd gnc
-$ ls
-dir jhjbjsp
-dir jjppr
-$ cd jhjbjsp
-$ ls
-96177 ldzslndn
-$ cd ..
-$ cd jjppr
-$ ls
-181016 dqp
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd hrcrw
-$ ls
-261376 dtjfpppr.dww
-54658 vsrgvw.pfn
-$ cd ..
-$ cd jdqzmqn
-$ ls
-52342 dcpndc.vlg
-171946 gggpchh.tbb
-dir ldzslndn
-11156 nbfrfvv.gzw
-$ cd ldzslndn
-$ ls
-107873 cvcl.jqh
-216034 gfdjrbz
-68844 pqllfrrh.jcf
-$ cd ..
-$ cd ..
-$ cd qcq
-$ ls
-152886 ldzslndn.ltn
-105125 vwplh.vbf
-$ cd ..
-$ cd rsn
-$ ls
-15385 hqcmjdgv.jjv
-105735 qcq.bzg
-58805 snczcsp
-26668 vbn
-$ cd ..
-$ cd zprprf
-$ ls
-dir chbmq
-dir dcqnblb
-dir dqp
-dir nfspb
-89506 zprprf.hnt
-$ cd chbmq
-$ ls
-dir cnjvw
-dir dqp
-151434 frsvrdnt
-dir msztjvcb
-240689 qcq.jlh
-dir sjzrcg
-97312 vnr.zfr
-dir zprprf
-$ cd cnjvw
-$ ls
-dir bpbs
-252403 cqhtshc
-dir djmjhn
-10935 fhqmswr
-6582 pdwml.ldd
-dir qcq
-219282 rfmd
-$ cd bpbs
-$ ls
-147582 bnhwsnsj.gdm
-61362 cvcl.jqh
-152857 vdgcqdn.sqd
-$ cd ..
-$ cd djmjhn
-$ ls
-dir bjdbcjbb
-dir dcqnblb
-dir dqp
-dir lgdwtt
-$ cd bjdbcjbb
-$ ls
-110710 cvcl.jqh
-252792 hmshctr.lgz
-dir mjhtmbj
-189745 shsswcgr
-dir tfnhp
-194940 vbn
-dir zprprf
-$ cd mjhtmbj
-$ ls
-dir dqp
-dir hbthpcmb
-$ cd dqp
-$ ls
-200832 sbcrz.qgw
-$ cd ..
-$ cd hbthpcmb
-$ ls
-55191 ffcntg
-$ cd ..
-$ cd ..
-$ cd tfnhp
-$ ls
-276825 dqp
-161538 gqmr.wgb
-$ cd ..
-$ cd zprprf
-$ ls
-287638 dcqnblb.ssp
-41274 hgmrvj.mwf
-249118 sbb.gsf
-105141 wwrg.gqz
-$ cd ..
-$ cd ..
-$ cd dcqnblb
-$ ls
-1957 btmmc
-32386 dtzbzg.dhm
-dir mmrbj
-98283 ntmhfgtl.pmf
-dir zprprf
-$ cd mmrbj
-$ ls
-273194 wnsq
-251527 zprprf
-$ cd ..
-$ cd zprprf
-$ ls
-27678 ldzslndn.rrl
-62866 ljf.fdj
-148502 qcq.dlg
-dir rvgqvm
-179231 tllnmhn.pjp
-64033 vbn
-dir zcdrj
-$ cd rvgqvm
-$ ls
-dir ntbv
-262324 prhgj.szz
-dir qbvdh
-$ cd ntbv
-$ ls
-116608 cgv.fvj
-175200 swpswq.twt
-$ cd ..
-$ cd qbvdh
-$ ls
-160353 sdhfrb.wjn
-$ cd ..
-$ cd ..
-$ cd zcdrj
-$ ls
-283262 ctl
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd dqp
-$ ls
-dir jfzm
-111438 rdrgb.mjf
-64194 wgtmqrq
-dir zprprf
-$ cd jfzm
-$ ls
-158774 pflp.mdw
-$ cd ..
-$ cd zprprf
-$ ls
-215264 sgsstcp
-$ cd ..
-$ cd ..
-$ cd lgdwtt
-$ ls
-dir qcq
-$ cd qcq
-$ ls
-165461 ldzslndn.vvb
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd qcq
-$ ls
-dir dpd
-165044 grpdmd.ggz
-82343 ldzslndn
-dir mwg
-176689 psjcwp.wct
-44404 qcq.zwd
-$ cd dpd
-$ ls
-84087 dqp
-227386 zprprf.gfs
-$ cd ..
-$ cd mwg
-$ ls
-214086 pflp.mdw
-dir sjjsdn
-225859 wcdt
-158892 zprprf.frs
-$ cd sjjsdn
-$ ls
-260121 gplgp.dfn
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd dqp
-$ ls
-dir hcrwclpg
-dir zphd
-$ cd hcrwclpg
-$ ls
-dir cmqntjj
-16393 ldzslndn.qbm
-91152 qqdtc.zdq
-$ cd cmqntjj
-$ ls
-272266 ldzslndn.pll
-$ cd ..
-$ cd ..
-$ cd zphd
-$ ls
-165711 chftwcsw.fqw
-256871 cvcl.jqh
-251168 zprprf.gfv
-$ cd ..
-$ cd ..
-$ cd msztjvcb
-$ ls
-206231 brzn.lmn
-dir dcqnblb
-21571 dqp
-dir fmn
-45779 mlfctz.cjr
-288827 pflp.mdw
-220578 qcq.fqf
-$ cd dcqnblb
-$ ls
-198121 ghbwgs
-93681 nmqhl.vpq
-$ cd ..
-$ cd fmn
-$ ls
-29407 mdfws.qvs
-$ cd ..
-$ cd ..
-$ cd sjzrcg
-$ ls
-155120 ddclvsjr.rpq
-136029 ldzslndn.dcm
-dir vhzh
-$ cd vhzh
-$ ls
-212446 vbn
-$ cd ..
-$ cd ..
-$ cd zprprf
-$ ls
-240335 crt.gqh
-185363 gnmm.qgh
-dir ldzslndn
-dir nwl
-dir qll
-277043 vbn
-217796 vtvgpdl.vtm
-$ cd ldzslndn
-$ ls
-273570 cvcl.jqh
-68510 fgdmz.hrc
-dir npq
-dir swjrzzrm
-$ cd npq
-$ ls
-97923 dzcjsqwt
-$ cd ..
-$ cd swjrzzrm
-$ ls
-180599 tmpgn.bjf
-$ cd ..
-$ cd ..
-$ cd nwl
-$ ls
-171833 dlwrfhh.qgn
-$ cd ..
-$ cd qll
-$ ls
-219926 dcqnblb.bvn
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd dcqnblb
-$ ls
-dir lvpb
-276198 tbgcm.qct
-$ cd lvpb
-$ ls
-142590 bvhjlld
-268259 gnjfg.sgb
-dir qcq
-206220 qcq.zsg
-258137 rrsw.dnb
-dir tmr
-215549 vbn
-$ cd qcq
-$ ls
-dir mmpgd
-dir tdsz
-dir tmfvsjwc
-$ cd mmpgd
-$ ls
-70793 jwbnpwnn
-$ cd ..
-$ cd tdsz
-$ ls
-246310 tdvrhhg.bzq
-$ cd ..
-$ cd tmfvsjwc
-$ ls
-103899 grpdmd.ggz
-287850 ldzslndn
-125930 llhr
-$ cd ..
-$ cd ..
-$ cd tmr
-$ ls
-83344 fbtfcg.hqp
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd dqp
-$ ls
-dir lbgmcbv
-dir nbg
-$ cd lbgmcbv
-$ ls
-81776 wzdzzdp
-$ cd ..
-$ cd nbg
-$ ls
-dir mfsgjp
-155574 pflp.mdw
-$ cd mfsgjp
-$ ls
-199400 vdgcqdn.sqd
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd nfspb
-$ ls
-262412 csrdtbs
-73867 vbn
-136389 zqps.hjt
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd nhqwt
-$ ls
-123766 cvcl.jqh
-dir dhrtvctp
-222086 grpdmd.ggz
-dir gzg
-26005 lhpmz.tgz
-dir mcnjwwfr
-117122 msn.gst
-$ cd dhrtvctp
-$ ls
-224079 vdgcqdn.sqd
-$ cd ..
-$ cd gzg
-$ ls
-124395 dqp
-dir wqdbtqm
-$ cd wqdbtqm
-$ ls
-237354 pflp.mdw
-212019 vdgcqdn.sqd
-$ cd ..
-$ cd ..
-$ cd mcnjwwfr
-$ ls
-92504 cshdztf
-dir dctl
-dir dqp
-dir flcrmhlj
-161879 grpdmd.ggz
-dir gtt
-dir hlbnhchz
-220093 mdtdsgvm.zgg
-dir twntr
-287192 vbn
-$ cd dctl
-$ ls
-dir bbhch
-155396 hrrj.jzm
-164971 pblqmwj.vdb
-dir wnlgfpvf
-$ cd bbhch
-$ ls
-dir dpqtp
-dir jvdrcw
-$ cd dpqtp
-$ ls
-174135 gwb.qrb
-$ cd ..
-$ cd jvdrcw
-$ ls
-215993 dcqnblb.cqp
-200800 stjttf.ngc
-$ cd ..
-$ cd ..
-$ cd wnlgfpvf
-$ ls
-135978 cvcl.jqh
-dir dqp
-54018 lbrfmt
-$ cd dqp
-$ ls
-270516 dcqnblb.jqw
-dir dqp
-144626 grpdmd.ggz
-157731 hvcv.rhp
-133773 lnnt
-76250 vdgcqdn.sqd
-$ cd dqp
-$ ls
-41504 zprprf.cmc
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd dqp
-$ ls
-dir dqp
-dir ldzslndn
-236737 mqzcvm.fjh
-239746 nhcdz.ncj
-dir rpchqq
-248824 vdgcqdn.sqd
-250937 zrchht.mwg
-$ cd dqp
-$ ls
-203381 qcq.djm
-$ cd ..
-$ cd ldzslndn
-$ ls
-dir dqp
-dir fptnzlv
-dir gmbnpm
-dir vhvblt
-$ cd dqp
-$ ls
-19579 qcq.lhg
-$ cd ..
-$ cd fptnzlv
-$ ls
-209930 dcqnblb
-$ cd ..
-$ cd gmbnpm
-$ ls
-dir ldzslndn
-dir qcq
-$ cd ldzslndn
-$ ls
-11075 pflp.mdw
-$ cd ..
-$ cd qcq
-$ ls
-dir tdp
-$ cd tdp
-$ ls
-40741 vdgcqdn.sqd
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd vhvblt
-$ ls
-dir lzr
-$ cd lzr
-$ ls
-62245 gbnj.llg
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd rpchqq
-$ ls
-dir bcs
-dir dcqnblb
-dir fvjzn
-dir lrphzrv
-$ cd bcs
-$ ls
-179794 bbn.dzb
-242069 cmjdmzjf.zgf
-1703 cvcl.jqh
-dir gnmhwj
-dir ldzslndn
-152520 qltpsz.jsj
-dir sqqjfps
-$ cd gnmhwj
-$ ls
-dir gvs
-201600 hptn.ftf
-dir hzrnb
-dir qcq
-dir sqhl
-$ cd gvs
-$ ls
-152358 zprprf.mlh
-$ cd ..
-$ cd hzrnb
-$ ls
-94290 gplsfd
-$ cd ..
-$ cd qcq
-$ ls
-91909 vmqd.bmg
-$ cd ..
-$ cd sqhl
-$ ls
-238673 vdgcqdn.sqd
-262885 zmdvr.nfg
-$ cd ..
-$ cd ..
-$ cd ldzslndn
-$ ls
-240461 mdz
-84303 qtj
-$ cd ..
-$ cd sqqjfps
-$ ls
-88753 fwn.tff
-$ cd ..
-$ cd ..
-$ cd dcqnblb
-$ ls
-dir dqp
-189996 dqp.pvp
-$ cd dqp
-$ ls
-dir qvfjz
-196506 vbn
-$ cd qvfjz
-$ ls
-209316 pflp.mdw
-107459 rwpbh.vpt
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd fvjzn
-$ ls
-241464 cvcl.jqh
-dir dqp
-dir ldzslndn
-dir msp
-125 pflp.mdw
-131895 vbn
-$ cd dqp
-$ ls
-34019 pflp.mdw
-202957 vbn
-$ cd ..
-$ cd ldzslndn
-$ ls
-147492 cvcl.jqh
-248719 spc.rfv
-$ cd ..
-$ cd msp
-$ ls
-184407 cvcl.jqh
-$ cd ..
-$ cd ..
-$ cd lrphzrv
-$ ls
-dir bbwqmbg
-81858 cvcl.jqh
-dir dqp
-248670 gqqsww.tsn
-199141 grpdmd.ggz
-dir ldzslndn
-34514 ldzslndn.ctw
-dir tln
-214615 zprprf.fwm
-$ cd bbwqmbg
-$ ls
-129750 flf
-dir pvlw
-dir qcq
-126 sqcqphz.tbm
-$ cd pvlw
-$ ls
-198005 jfvj.hdv
-$ cd ..
-$ cd qcq
-$ ls
-dir wgdzws
-$ cd wgdzws
-$ ls
-253522 ldzslndn.qwt
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd dqp
-$ ls
-281993 cvcl.jqh
-dir hwqjlwcb
-50532 msccz.qgm
-102187 trv.tnq
-111 wplnmj.bfl
-$ cd hwqjlwcb
-$ ls
-267580 dhjqb.dsb
-153195 ldzslndn.jqv
-41526 mvwcwc.zsc
-$ cd ..
-$ cd ..
-$ cd ldzslndn
-$ ls
-58666 cvcl.jqh
-79950 dqp.tmc
-242217 hns.lrb
-dir njswzh
-240692 vdgcqdn.sqd
-dir zvmjvcdm
-52909 zzh
-$ cd njswzh
-$ ls
-149732 cvcl.jqh
-dir rnmfd
-$ cd rnmfd
-$ ls
-75368 dqp.hmv
-14350 vbn
-$ cd ..
-$ cd ..
-$ cd zvmjvcdm
-$ ls
-dir jgczt
-$ cd jgczt
-$ ls
-dir qcq
-95941 qzvvwshv.jwc
-$ cd qcq
-$ ls
-273942 pflp.mdw
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd tln
-$ ls
-dir bmcng
-1518 lrg
-dir vnjfrhp
-$ cd bmcng
-$ ls
-38917 fqcrt
-$ cd ..
-$ cd vnjfrhp
-$ ls
-dir dcqnblb
-dir dqp
-247186 grpdmd.ggz
-dir ldzslndn
-169216 pflp.mdw
-206487 vdgcqdn.sqd
-16976 vlsrzjmb.mmc
-257938 wjl
-$ cd dcqnblb
-$ ls
-dir dqp
-$ cd dqp
-$ ls
-184133 qcq
-$ cd ..
-$ cd ..
-$ cd dqp
-$ ls
-dir dcqnblb
-31612 dqp.pnt
-212283 ldzslndn
-61600 vdbfc.ddj
-197189 wpv.wff
-$ cd dcqnblb
-$ ls
-62412 tfzllmrj
-dir zprprf
-$ cd zprprf
-$ ls
-dir bqnpsl
-dir dszrvpzc
-$ cd bqnpsl
-$ ls
-261548 spbsbbsw.cmn
-$ cd ..
-$ cd dszrvpzc
-$ ls
-188232 sggpqslr.smn
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd ldzslndn
-$ ls
-dir bgnhd
-dir pgvcdzwz
-dir qgzhm
-$ cd bgnhd
-$ ls
-56989 cvcl.jqh
-$ cd ..
-$ cd pgvcdzwz
-$ ls
-110034 qhgnndv
-$ cd ..
-$ cd qgzhm
-$ ls
-247232 grpdmd.ggz
-269292 ldzslndn
-153843 tpz
-dir vnschqwr
-162392 wnq.btb
-$ cd vnschqwr
-$ ls
-43005 fvtvzfqm.jvc
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd flcrmhlj
-$ ls
-245668 dcqnblb.sdj
-dir lffj
-229909 pflp.mdw
-280176 vbn
-$ cd lffj
-$ ls
-116451 jmzz.jdd
-dir pjlwb
-162815 pmhlqq.snr
-226183 zffth
-$ cd pjlwb
-$ ls
-67518 qcq.hjq
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd gtt
-$ ls
-52105 grpdmd.ggz
-126869 zprprf.fgj
-$ cd ..
-$ cd hlbnhchz
-$ ls
-3064 dqp.lrw
-278756 grpdmd.ggz
-177208 ldzslndn.wlv
-141685 vbn
-$ cd ..
-$ cd twntr
-$ ls
-63747 cvcl.jqh
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd qcq
-$ ls
-226858 cwblp.zgp
-dir jjqsmfhr
-dir rjbqtrq
-dir vwmpnbts
-141715 wdbhdch
-286381 zprprf
-$ cd jjqsmfhr
-$ ls
-dir btmm
-dir fqndtlgq
-$ cd btmm
-$ ls
-4031 dqp.lrr
-dir fzdd
-$ cd fzdd
-$ ls
-dir vnwpn
-$ cd vnwpn
-$ ls
-dir bzlgsl
-dir ztvzrrbv
-$ cd bzlgsl
-$ ls
-9294 ldzslndn.sqr
-$ cd ..
-$ cd ztvzrrbv
-$ ls
-256017 cvcl.jqh
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd ..
-$ cd fqndtlgq
-$ ls
-271528 ccbmgp.bwd
-$ cd ..
-$ cd ..
-$ cd rjbqtrq
-$ ls
-122150 ldzslndn
-46467 tpdvp.pjf
-$ cd ..
-$ cd vwmpnbts
-$ ls
-47518 fcrwfzvm
-263343 gmc.lrt
-212764 qcq
-$ cd ..
-$ cd ..
-$ cd vwqwlqrt
-$ ls
-dir psrs
-$ cd psrs
-$ ls
-281998 zprprf.hml

2022/src/common.rs

@@ -1,7 +1,6 @@
 //! Common helper utilities to all days
 
 use anyhow::Result;
-use nom::combinator::map;
 use nom::error::ErrorKind;
 use nom::error::ParseError;
 use nom::Finish;
@@ -94,17 +93,6 @@ where
     }
 }
 
-/// Add an index to repeated successful invocations of the embedded parser.
-pub fn enumerate<I, O, E>(f: impl Parser<I, O, E>) -> impl FnMut(I) -> IResult<I, (usize, O), E> {
-    let mut index = 0usize;
-
-    map(f, move |v| {
-        let res = (index, v);
-        index += 1;
-        res
-    })
-}
-
 /// Return the minimum and maximum of two unordered variables
 pub fn minmax<T>(a: T, b: T) -> (T, T)
 where

2022/src/day04.rs

@@ -1,3 +1,5 @@
+use std::ops::RangeInclusive;
+
 use anyhow::Result;
 use nom::bytes::complete::tag;
 use nom::character::complete::newline;
@@ -7,40 +9,18 @@ use nom::sequence::separated_pair;
 use nom::sequence::terminated;
 use nom::IResult;
 
-use crate::common::minmax;
 use crate::common::parse_input;
 
-#[derive(Copy, Clone, PartialOrd, PartialEq)]
+type Assignment = RangeInclusive<u32>;
-struct Assignment(u32, u32);
 
-impl Assignment {
+fn parse_assignments(
-    fn one_contains(self, other: Self) -> bool {
+    input: &[u8],
-        let (first, second) = minmax(self, other);
+) -> IResult<&[u8], Vec<(RangeInclusive<u32>, RangeInclusive<u32>)>> {
-
-        if second.0 == first.0 {
-            first.1 <= second.1
-        } else {
-            second.0 <= first.1 && second.1 <= first.1
-        }
-    }
-
-    fn one_overlaps(self, other: Self) -> bool {
-        let (first, second) = minmax(self, other);
-
-        if second.0 == first.0 {
-            first.1 <= second.1
-        } else {
-            second.0 <= first.1
-        }
-    }
-}
-
-fn parse_assignments(input: &[u8]) -> IResult<&[u8], Vec<(Assignment, Assignment)>> {
     use nom::character::complete::u32;
 
     fn parse_single(input: &[u8]) -> IResult<&[u8], Assignment> {
         map(separated_pair(u32, tag("-"), u32), |(start, end)| {
-            Assignment(start, end)
+            start..=end
         })(input)
     }
 
@@ -49,23 +29,32 @@ fn parse_assignments(input: &[u8]) -> IResult<&[u8], Vec<(Assignment, Assignment
     many0(terminated(parse_line, newline))(input)
 }
 
-fn parts_common(input: &[u8], filter: impl Fn(Assignment, Assignment) -> bool) -> Result<String> {
+fn is_contained(a: &Assignment, b: &Assignment) -> bool {
+    if a.size_hint().0 > b.size_hint().0 {
+        a.contains(b.start()) && a.contains(b.end())
+    } else {
+        b.contains(a.start()) && b.contains(a.end())
+    }
+}
+
+fn is_overlapping(a: &Assignment, b: &Assignment) -> bool {
+    b.end() >= a.start() && b.start() <= a.end() || a.end() >= b.start() && a.start() <= b.end()
+}
+
+fn parts_common(input: &[u8], filter: impl Fn(&Assignment, &Assignment) -> bool) -> Result<String> {
     let assigments = parse_input(input, parse_assignments)?;
 
-    let overlapping = assigments
+    let overlapping = assigments.into_iter().filter(|(a, b)| filter(a, b)).count();
-        .into_iter()
-        .filter(|&(a, b)| filter(a, b))
-        .count();
 
     Ok(overlapping.to_string())
 }
 
 pub fn part1(input: &[u8]) -> Result<String> {
-    parts_common(input, Assignment::one_contains)
+    parts_common(input, is_contained)
 }
 
 pub fn part2(input: &[u8]) -> Result<String> {
-    parts_common(input, Assignment::one_overlaps)
+    parts_common(input, is_overlapping)
 }
 
 #[cfg(test)]

2022/src/day05.rs

@@ -1,166 +1,9 @@
-use std::cmp::Ordering;
-
 use anyhow::Result;
-use nom::branch::alt;
-use nom::bytes::complete::tag;
-use nom::bytes::complete::take;
-use nom::bytes::complete::take_until;
-use nom::character::complete::newline;
-use nom::combinator::map;
-use nom::combinator::opt;
-use nom::multi::fold_many1;
-use nom::multi::many1;
-use nom::sequence::delimited;
-use nom::sequence::preceded;
-use nom::sequence::terminated;
-use nom::sequence::tuple;
-use nom::IResult;
 
-use crate::common::enumerate;
+pub fn part1(_input: &[u8]) -> Result<String> {
-use crate::common::parse_input;
+    todo!()
-
-type Move = (usize, usize, usize);
-type OwnedStacks = Vec<Vec<u8>>;
-
-fn parse_row<'a>(input: &'a [u8], stacks: &mut OwnedStacks) -> IResult<&'a [u8], ()> {
-    // Forgive me for this crime
-    fold_many1(
-        enumerate(terminated(
-            alt((
-                // Parse a delimited value into a Some(content)
-                map(delimited(tag("["), take(1usize), tag("]")), |v: &[u8]| {
-                    Some(v[0])
-                }),
-                // Or an empty stack into a None
-                map(tag("   "), |_| None),
-            )),
-            opt(tag(" ")),
-        )),
-        || (),
-        move |_, (index, c)| {
-            if let Some(b) = c {
-                if stacks.len() <= index {
-                    stacks.resize_with(index + 1, Vec::new);
 }
 
-                stacks[index].push(b)
+pub fn part2(_input: &[u8]) -> Result<String> {
-            }
+    todo!()
-        },
-    )(input)
-}
-
-fn parse_stacks(input: &[u8]) -> IResult<&[u8], OwnedStacks> {
-    let mut stacks = Vec::new();
-
-    let (input, _) = terminated(
-        fold_many1(
-            terminated(|input| parse_row(input, &mut stacks), newline),
-            || (),
-            |_, _| (),
-        ),
-        // Skip the line with the numbers
-        take_until("\n\n"),
-    )(input)?;
-
-    // Reverse the stacks since we parsed them top-down
-    for stack in &mut stacks {
-        stack.reverse();
-    }
-
-    Ok((input, stacks))
-}
-
-fn parse_task(input: &[u8]) -> IResult<&[u8], (OwnedStacks, Vec<Move>)> {
-    fn parse_usize(input: &[u8]) -> IResult<&[u8], usize> {
-        map(nom::character::complete::u32, |v| v as usize)(input)
-    }
-    let (input, stacks) = parse_stacks(input)?;
-
-    // Consume the double newline
-    let (input, _) = tag("\n\n")(input)?;
-
-    let (input, moves) = many1(terminated(
-        tuple((
-            preceded(tag("move "), parse_usize),
-            preceded(tag(" from "), parse_usize),
-            preceded(tag(" to "), parse_usize),
-        )),
-        newline,
-    ))(input)?;
-
-    Ok((input, (stacks, moves)))
-}
-
-/// Some magic to get two mutable references into the same slice
-fn get_both(stacks: &mut [Vec<u8>], from: usize, to: usize) -> (&mut Vec<u8>, &mut Vec<u8>) {
-    match from.cmp(&to) {
-        Ordering::Greater => {
-            let (begin, end) = stacks.split_at_mut(from);
-            (&mut end[0], &mut begin[to])
-        }
-        Ordering::Less => {
-            let (begin, end) = stacks.split_at_mut(to);
-            (&mut begin[from], &mut end[0])
-        }
-        Ordering::Equal => panic!("Tried to stack from and to {from}"),
-    }
-}
-
-fn compute_answer(stacks: &mut [Vec<u8>]) -> Result<String> {
-    let mut result = String::with_capacity(stacks.len());
-
-    for stack in stacks {
-        result.push(
-            *stack
-                .last()
-                .ok_or_else(|| anyhow::anyhow!("Encountered empty stack"))? as char,
-        );
-    }
-
-    Ok(result)
-}
-
-pub fn part1(input: &[u8]) -> Result<String> {
-    let (mut stacks, moves) = parse_input(input, parse_task)?;
-
-    for (count, from, to) in moves {
-        let (from, to) = get_both(&mut stacks, from - 1, to - 1);
-
-        let drain_start = from.len() - count;
-
-        to.extend(from.drain(drain_start..).rev());
-    }
-
-    compute_answer(&mut stacks)
-}
-
-pub fn part2(input: &[u8]) -> Result<String> {
-    let (mut stacks, moves) = parse_input(input, parse_task)?;
-
-    for (count, from, to) in moves {
-        let (from, to) = get_both(&mut stacks, from - 1, to - 1);
-
-        let drain_start = from.len() - count;
-
-        to.extend(from.drain(drain_start..));
-    }
-
-    compute_answer(&mut stacks)
-}
-
-#[cfg(test)]
-mod tests {
-    use super::*;
-
-    const SAMPLE: &[u8] = include_bytes!("samples/05.txt");
-
-    #[test]
-    fn sample_part1() {
-        assert_eq!(part1(SAMPLE).unwrap(), "CMZ");
-    }
-
-    #[test]
-    fn sample_part2() {
-        assert_eq!(part2(SAMPLE).unwrap(), "MCD");
-    }
 }

2022/src/day06.rs

@@ -1,68 +1,9 @@
 use anyhow::Result;
 
-fn find_first(input: &[u8], unique: usize) -> Result<usize> {
+pub fn part1(_input: &[u8]) -> Result<String> {
-    let mut seen = [false; 256];
+    todo!()
-
-    let mut tail_it = input.iter();
-
-    let mut first = 0;
-
-    // Loop invariant: input[first..last] contains only unique characters
-    for (last, &c) in input.iter().enumerate() {
-        if seen[c as usize] {
-            first += (&mut tail_it)
-                .take_while(|&&b| b != c)
-                .map(|&b| seen[b as usize] = false)
-                .count()
-                + 1; // +1 because take_while doesn't return the first element that didn't satisfy the condition, while we do need to count it
-        } else {
-            // New unique character found: input[first..=last] contains unique characters
-            if last - first + 1 == unique {
-                return Ok(last + 1);
 }
 
-            seen[c as usize] = true;
+pub fn part2(_input: &[u8]) -> Result<String> {
-        }
+    todo!()
-    }
-
-    anyhow::bail!("Did not find unique sequence of length {unique}");
-}
-
-pub fn part1(input: &[u8]) -> Result<String> {
-    Ok(find_first(input, 4)?.to_string())
-}
-
-pub fn part2(input: &[u8]) -> Result<String> {
-    Ok(find_first(input, 14)?.to_string())
-}
-
-#[cfg(test)]
-mod tests {
-    use super::*;
-
-    const SAMPLES: &[&[u8]] = &[
-        b"mjqjpqmgbljsphdztnvjfqwrcgsmlb",
-        b"bvwbjplbgvbhsrlpgdmjqwftvncz",
-        b"nppdvjthqldpwncqszvftbrmjlhg",
-        b"nznrnfrfntjfmvfwmzdfjlvtqnbhcprsg",
-        b"zcfzfwzzqfrljwzlrfnpqdbhtmscgvjw",
-    ];
-
-    #[test]
-    fn sample_part1() {
-        const CORRECT: &[usize] = &[7, 5, 6, 10, 11];
-
-        for (&sample, &correct) in SAMPLES.iter().zip(CORRECT) {
-            assert_eq!(find_first(sample, 4).unwrap(), correct);
-        }
-    }
-
-    #[test]
-    fn sample_part2() {
-        const CORRECT: &[usize] = &[19, 23, 23, 29, 26];
-
-        for (&sample, &correct) in SAMPLES.iter().zip(CORRECT) {
-            assert_eq!(find_first(sample, 14).unwrap(), correct);
-        }
-    }
 }

2022/src/day07.rs

@@ -1,144 +1,9 @@
-use std::fmt::Debug;
-
-use anyhow::Context;
 use anyhow::Result;
-use nom::branch::alt;
-use nom::bytes::complete::tag;
-use nom::bytes::complete::take_until;
-use nom::character::complete::newline;
-use nom::combinator::map;
-use nom::combinator::opt;
-use nom::multi::many0;
-use nom::sequence::delimited;
-use nom::sequence::preceded;
-use nom::sequence::separated_pair;
-use nom::sequence::terminated;
-use nom::sequence::tuple;
-use nom::IResult;
 
-use crate::common::parse_input;
+pub fn part1(_input: &[u8]) -> Result<String> {
-
+    todo!()
-type Listing<'a> = Vec<(&'a [u8], ListEntry<'a>)>;
-type Slicing<'a> = &'a [(&'a [u8], ListEntry<'a>)];
-
-#[derive(Debug)]
-enum ListEntry<'a> {
-    File(u32),
-    Dir(Listing<'a>),
 }
 
-fn parse_dir(input: &[u8]) -> IResult<&[u8], Listing> {
+pub fn part2(_input: &[u8]) -> Result<String> {
-    use nom::character::complete::u32;
+    todo!()
-
-    let (mut input, mut entries) = preceded(
-        tag("$ ls\n"),
-        many0(
-            // Map many newline-terminated entries
-            terminated(
-                // of either
-                alt((
-                    // A size followed by a name
-                    map(
-                        separated_pair(u32, tag(" "), take_until("\n")),
-                        |(size, name)| (name, ListEntry::File(size)),
-                    ),
-                    // Or the word "dir" followed by a name
-                    map(preceded(tag("dir "), take_until("\n")), |name| {
-                        (name, ListEntry::Dir(Vec::new()))
-                    }),
-                )),
-                newline,
-            ),
-        ),
-    )(input)?;
-
-    // Assumption: directory entries are queried in the order they are listed
-    //
-    // This assumption appears to hold for my input so it's fine
-    for (name, entry) in &mut entries {
-        if let ListEntry::Dir(placeholder) = entry {
-            let (new_input, contents) = delimited(
-                tuple((tag("$ cd "), tag(*name), newline)),
-                parse_dir,
-                // Optional cd'ing out because the last directory is never exited.
-                opt(tag("$ cd ..\n")),
-            )(input)?;
-
-            input = new_input;
-            *placeholder = contents;
-        }
-    }
-
-    Ok((input, entries))
-}
-
-fn parse_program(input: &[u8]) -> IResult<&[u8], Listing> {
-    preceded(tag("$ cd /\n"), parse_dir)(input)
-}
-
-fn sum_sizes(listing: Slicing<'_>, acc: &mut impl FnMut(u32)) -> u32 {
-    let mut total_size = 0;
-
-    for (_, entry) in listing {
-        match entry {
-            ListEntry::File(size) => total_size += size,
-            ListEntry::Dir(listing) => total_size += sum_sizes(listing, acc),
-        }
-    }
-
-    acc(total_size);
-
-    total_size
-}
-
-pub fn part1(input: &[u8]) -> Result<String> {
-    let root = parse_input(input, parse_program)?;
-
-    let mut searched_size = 0;
-
-    sum_sizes(&root, &mut |size| {
-        if size <= 100000 {
-            searched_size += size
-        }
-    });
-
-    Ok(searched_size.to_string())
-}
-
-pub fn part2(input: &[u8]) -> Result<String> {
-    const TARGET: u32 = 30000000;
-    const TOTAL: u32 = 70000000;
-
-    let root = parse_input(input, parse_program)?;
-
-    let mut sizes = Vec::new();
-
-    let used = sum_sizes(&root, &mut |size| sizes.push(size));
-
-    let required = TARGET - (TOTAL - used);
-
-    let min = sizes
-        .into_iter()
-        .filter(|&size| size >= required)
-        .min()
-        .context("Did not find dir large enough to delete")?;
-
-    Ok(min.to_string())
-}
-
-#[cfg(test)]
-mod tests {
-    use super::*;
-
-    const SAMPLE: &[u8] = include_bytes!("samples/07.txt");
-
-    #[test]
-    fn sample_part1() {
-        assert_eq!(part1(SAMPLE).unwrap(), "95437");
-    }
-
-    #[test]
-    fn sample_part2() {
-        assert_eq!(part2(SAMPLE).unwrap(), "24933642");
-    }
 }

2022/src/samples/05.txt

@@ -1,9 +0,0 @@
-    [D]    
-[N] [C]    
-[Z] [M] [P]
- 1   2   3 
-
-move 1 from 2 to 1
-move 3 from 1 to 3
-move 2 from 2 to 1
-move 1 from 1 to 2

2022/src/samples/07.txt

@@ -1,23 +0,0 @@
-$ cd /
-$ ls
-dir a
-14848514 b.txt
-8504156 c.dat
-dir d
-$ cd a
-$ ls
-dir e
-29116 f
-2557 g
-62596 h.lst
-$ cd e
-$ ls
-584 i
-$ cd ..
-$ cd ..
-$ cd d
-$ ls
-4060174 j
-8033020 d.log
-5626152 d.ext
-7214296 k