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.
This is an Erlang NIF for the Rust crate a-tree.
To be able to build this library, the following dependencies are required:
rustccargorebar3
rebar3 compile