https://github.com/antoinegagne/a-tree

A dynamic data structure for efficiently indexing arbitrary boolean expressions
https://github.com/antoinegagne/a-tree

a-tree boolean-algebra boolean-expression boolean-logic data-structures event-filtering rust-crate rust-lang rust-library scientific-paper tree-structure

Last synced: 6 months ago
JSON representation

A dynamic data structure for efficiently indexing arbitrary boolean expressions

• Host: GitHub
• URL: https://github.com/antoinegagne/a-tree
• Owner: AntoineGagne
• License: apache-2.0
• Created: 2024-11-28T20:22:41.000Z (over 1 year ago)
• Default Branch: master
• Last Pushed: 2025-07-28T17:50:35.000Z (8 months ago)
• Last Synced: 2025-08-26T11:41:58.455Z (7 months ago)
• Topics: a-tree, boolean-algebra, boolean-expression, boolean-logic, data-structures, event-filtering, rust-crate, rust-lang, rust-library, scientific-paper, tree-structure
• Language: Rust
• Homepage: https://crates.io/crates/a-tree
• Size: 7.83 MB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 7
• Metadata Files:
  • Readme: README.md
  • License: LICENSE-APACHE

Awesome Lists containing this project

README

          
# a-tree

[![Rust](https://github.com/AntoineGagne/a-tree/actions/workflows/check.yml/badge.svg)](https://github.com/AntoineGagne/a-tree/actions/workflows/check.yml)

[![Latest version](https://img.shields.io/crates/v/a-tree.svg)](https://crates.io/crates/a-tree)

[![Documentation](https://docs.rs/a-tree/badge.svg)](https://docs.rs/a-tree)

[![Code Coverage](https://codecov.io/gh/AntoineGagne/a-tree/graph/badge.svg?token=JUKK1W5L2D)](https://codecov.io/gh/AntoineGagne/a-tree)

This is an implementation of the [A-Tree: A Dynamic Data Structure for Efficiently Indexing Arbitrary Boolean Expressions](https://dl.acm.org/doi/10.1145/3448016.3457266) 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](https://docs.rs/crate/a-tree/latest).

## License

This project is licensed under the [Apache 2.0](LICENSE-APACHE) and the [MIT License](LICENSE-MIT).