Crates.io | genestring |
lib.rs | genestring |
version | 0.1.0 |
source | src |
created_at | 2018-10-28 04:25:28.056145 |
updated_at | 2018-10-28 04:25:28.056145 |
description | Treat big strings of bits like integer slices! |
homepage | |
repository | https://github.com/Skrylar/genestrings |
max_upload_size | |
id | 93041 |
size | 19,325 |
Doing genetic programming work in Rust? Need a more compact representation of your genome than vectors of integers? Enter the Genestring.
Genestrings are a container that allow you to define a set number of bits, then slice in to those bits like they were plain old integers all along. This means your moderator genes can truly be one bit, and the level of precision needed for each field can be adjusted to only what is absolutely necessary.
When your genetic fuzzy trees or cartesian genetic programming starts using up too much memory, consider migrating to genestrings for a more compact representation of bits.
Genestrings know only of bits and ranges of bits, they do not know anything of your underlying genotypes or phenotypes. You will have to mantain those abstractions above a gene string, should you require things like phenotype-aware mutation functions.
Genestrings are thoroughly tested with the proptest
framework, using nightly Rust compilers.
Genestrings are available under the BSD-3 License
, provided under the LICENSE.bsd
file in this repository.