Setup initial days

Author: Alextopher

.gitignore

@@ -0,0 +1 @@
+target/

Cargo.lock

@@ -0,0 +1,30 @@
+[workspace]
+resolver = "2"
+members = [
+    "aoc",
+    "d01",
+    "d02",
+    "d03",
+    "d04",
+    "d05",
+    "d06",
+    "d07",
+    "d08",
+    "d09",
+    "d10",
+    "d11",
+    "d12",
+    "d13",
+    "d14",
+    "d15",
+    "d16",
+    "d17",
+    "d18",
+    "d19",
+    "d20",
+    "d21",
+    "d22",
+    "d23",
+    "d24",
+    "d25",
+]

Cargo.toml

@@ -5,3 +5,55 @@
 My first is to not give up. If start missing days I want to continue trying.
 
 My second is work on my writing skills. Maybe creating visualizations, writing about my solutions, or just writing about my thought process.
+
+## Tags
+
+### [Day 1](day1/README.md)
+
+### [Day 2](day2/README.md)
+
+### [Day 3](day3/README.md)
+
+### [Day 4](day4/README.md)
+
+### [Day 5](day5/README.md)
+
+### [Day 6](day6/README.md)
+
+### [Day 7](day7/README.md)
+
+### [Day 8](day8/README.md)
+
+### [Day 9](day9/README.md)
+
+### [Day 10](day10/README.md)
+
+### [Day 11](day11/README.md)
+
+### [Day 12](day12/README.md)
+
+### [Day 13](day13/README.md)
+
+### [Day 14](day14/README.md)
+
+### [Day 15](day15/README.md)
+
+### [Day 16](day16/README.md)
+
+### [Day 17](day17/README.md)
+
+### [Day 18](day18/README.md)
+
+### [Day 19](day19/README.md)
+
+### [Day 20](day20/README.md)
+
+### [Day 21](day21/README.md)
+
+### [Day 22](day22/README.md)
+
+### [Day 23](day23/README.md)
+
+### [Day 24](day24/README.md)
+
+### [Day 25](day25/README.md)

README.md

@@ -0,0 +1,11 @@
+[package]
+name = "aoc"
+version = "0.1.0"
+edition = "2021"
+
+# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
+
+[dependencies]
+binary-heap-plus = "0.5.0"
+itertools = "0.10.5"
+num-traits = "0.2.15"

aoc/Cargo.lock

@@ -0,0 +1,50 @@
+//! Module contains generic binary searching methods
+
+use num_traits::Num;
+use std::cmp::Ordering;
+
+/// Arbitrary binary search algorithm.
+///
+/// The index is generic over [`num_traits::Num`].
+///
+/// # Arguments
+/// t - target value
+/// f - function that returns value at "index" i
+/// start - start "index"
+/// end - end "index"
+///
+/// # Returns
+/// Ok(i) - if target value is found at "index" i
+/// Err(i) - if target value is not found, but it should be at "index" i
+///
+/// ```
+/// use aoc::algs::binary_search;
+///
+/// let v = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
+/// assert_eq!(binary_search(&5, |i: usize| v[i], 0, v.len() - 1), Ok(4));
+/// assert_eq!(binary_search(&0, |i: usize| v[i], 0, v.len() - 1), Err(0));
+/// assert_eq!(binary_search(&11, |i: usize| v[i], 0, v.len() - 1), Err(9));
+/// ```
+pub fn binary_search<N, T, F>(t: &T, f: F, mut start: N, mut end: N) -> Result<N, N>
+where
+    N: Num + PartialOrd + Copy,
+    T: std::cmp::PartialOrd,
+    F: Fn(N) -> T,
+{
+    let two = N::one() + N::one();
+
+    while start < end {
+        let mid = start + (end - start) / two;
+        let cmp = f(mid).partial_cmp(t).unwrap();
+
+        if cmp == Ordering::Less {
+            start = mid + N::one();
+        } else if cmp == Ordering::Greater {
+            end = mid;
+        } else {
+            return Ok(mid);
+        }
+    }
+
+    Err(start)
+}

aoc/Cargo.toml

@@ -0,0 +1,3 @@
+mod binary_search;
+
+pub use binary_search::binary_search;