ksq
| Crates.io | ksq |
| lib.rs | ksq |
| version | |
| source | src |
| created_at | 2024-11-27 21:52:17.691534+00 |
| updated_at | 2025-02-24 17:30:02.93667+00 |
| description | implementation of a k-2 tree |
| homepage | https://github.com/paultag/ksq-rs |
| repository | |
| max_upload_size | |
| id | 1463675 |
| Cargo.toml error: | TOML parse error at line 17, column 1 | 17 | autolib = false | ^^^^^^^ unknown field `autolib`, expected one of `name`, `version`, `edition`, `authors`, `description`, `readme`, `license`, `repository`, `homepage`, `documentation`, `build`, `resolver`, `links`, `default-run`, `default_dash_run`, `rust-version`, `rust_dash_version`, `rust_version`, `license-file`, `license_dash_file`, `license_file`, `licenseFile`, `license_capital_file`, `forced-target`, `forced_dash_target`, `autobins`, `autotests`, `autoexamples`, `autobenches`, `publish`, `metadata`, `keywords`, `categories`, `exclude`, `include` |
| size | 0 |
Paul Tagliamonte (paultag)
documentation
README
ksq - k-2 tree library for rust
ksq is an implementation of a K2 tree (k²-tree), which, when storing sparse
bits, is a very space-effective matrix. This library implements the tree as a
flat 1-d array, rather than explicitly encoding dimensionality.
Unlike some other k2 trees, I've opted to use a u16, not a u8. This means
that the tree will grow by N<<4 each layer -- and each cell can represent a
maximum of 16 other cells, not 8. This may change in the future.