cranelift-bforest
| Crates.io | cranelift-bforest |
| lib.rs | cranelift-bforest |
| version | |
| source | src |
| created_at | 2018-08-14 19:55:48.797407 |
| updated_at | 2025-01-14 23:21:46.911116 |
| description | A forest of B+-trees |
| homepage | |
| repository | https://github.com/bytecodealliance/wasmtime |
| max_upload_size | |
| id | 79459 |
| Cargo.toml error: | TOML parse error at line 19, column 1 | 19 | 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 |
wasmtime-publish (github:bytecodealliance:wasmtime-publish)
documentation
https://docs.rs/cranelift-bforest
README
This crate contains array-based data structures used by the core Cranelift code generator which represent a set of small ordered sets or maps.
These are not general purpose data structures that are somehow magically faster that the
standard library's BTreeSet and BTreeMap types.
The tradeoffs are different:
- Keys and values are expected to be small and copyable. We optimize for 32-bit types.
- A comparator object is used to compare keys, allowing smaller "context free" keys.
- Empty trees have a very small 32-bit footprint.
- All the trees in a forest can be cleared in constant time.