a-tree

This is an 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.

Features

This crate supports the following features:

• Insertion of arbitrary boolean expressions via a domain specific language;
• Deletion of subscriptions;
• Export to Graphviz format;
• Search with events for matching arbitrary boolean expressions.

Documentation

The documentation is available on doc.rs.

License

This project is licensed under the Apache 2.0 and the MIT License.