ka 0.1.3

Ka benchmarking functions to use for optimization algorithms
Documentation
  • Coverage
  • 97.96%
    48 out of 49 items documented0 out of 33 items with examples
  • Size
  • Source code size: 29.12 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 5.38 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Ø build duration
  • this release: 12s Average build duration of successful builds.
  • all releases: 12s Average build duration of successful builds in releases after 2024-10-23.
  • Links
  • Homepage
  • Documentation
  • yuulive/ka
    0 0 0
  • crates.io
  • Dependencies
  • Versions
  • Owners
  • yuulive

Build Status Crates.io docs.rs

About

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.

Example Usage

Using this crate is easy! Simply add this crate as a dependency and then use it:

use ka::*;

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 ka::{SingleObjective} but that's just messy!