| Crates.io | benchfun |
| lib.rs | benchfun |
| version | 0.1.3 |
| created_at | 2020-08-01 19:04:06.144049+00 |
| updated_at | 2020-08-10 16:54:00.624997+00 |
| description | Benchmarking functions to use for optimization algorithms |
| homepage | https://github.com/cmccomb/benchfun |
| repository | https://github.com/cmccomb/benchfun |
| max_upload_size | |
| id | 271992 |
| size | 29,529 |
This crate provides functionality for several functions that are commonly used to benchmark new optimization algorithms. More specifically, function is part of a struct that contains the objective function as well as other important information (bounds of the canonical problem, the known minimum value, and a function that returns the global minimizer.
This crate provides access to several single- and multi-objective funtions. For exhaustive lists, check here and here, respectively.
Using this crate is easy! Simply add this crate as a dependency and then use it:
use benchfun::*;
fn main() {
// Print some info about the ackley function
println!("Minmimum: {:?}", Ackley::MINIMUM);
println!("Minmizer: {:?}", Ackley::minimizer(5));
println!("Minmizer: {:?}", single::Ackley::BOUNDS);
}
You can also use a use statement that looks more like use benchfun::{SingleObjective} but that's just messy!