a-tree
| Crates.io | a-tree |
| lib.rs | a-tree |
| version | |
| source | src |
| created_at | 2024-12-16 07:53:35.622785 |
| updated_at | 2025-01-08 19:47:10.250951 |
| description | A dynamic data structure for efficiently indexing arbitrary boolean expressions |
| homepage | |
| repository | https://github.com/AntoineGagne/a-tree |
| max_upload_size | |
| id | 1484704 |
| Cargo.toml error: | TOML parse error at line 28, column 1 | 28 | 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 |
Antoine Gagné (AntoineGagne)
documentation
README
a-tree
This is a work-in-progress implementation of the A-Tree: A Dynamic Data Structure for Efficiently Indexing Arbitrary Boolean Expressions paper.
The A-Tree data structure is used to evaluate a large amount of boolean expressions as fast as possible. To achieve this, the data structure tries to reuse the intermediary nodes of the incoming expressions to minimize the amount of expressions that have to be evaluated.