2 releases
0.1.1 | Nov 2, 2022 |
---|---|
0.1.0 | Nov 2, 2022 |
#1453 in Algorithms
3KB
memoires 🧠
The hardest way to implement memoization in Rust...
Usage
Lets imagine you have a function that implement Fibonacci sequence:
fn fib(n: usize) -> usize {
if n == 0 {
0
} else if n == 1 {
1
} else {
fib(n - 1) + fib(n - 2)
}
}
fn main() {
// long as f*ck
for i in 1..60 {
println!("{}", fib(i))
}
}
It gonna be change to:
use memoires::Memoire;
// The two generics of Memoire<usize, usize> must be change to the types
// your function will return.
//
// If you have a f(String) -> String, you gonna write Memoire<String, String>.
//
// IMPORTANT:
// - the input type must implement the Clone, Eq and Hash traits
// - the output type must implement the Clone trait
//
fn fib<I, O>(n: usize, m: &mut Memoire<usize, usize>) -> usize {
if n == 0 {
0
} else if n == 1 {
1
} else {
m.run(n - 1) + m.run(n - 2) // Replace the function name with m.run
}
}
fn main() {
let mut fib_mem = Memoire::new(fib::<isize, isize>);
for i in 1..60 {
println!("{}", fib_mem.run(i))
}
}