pub struct ATree<T> { /* private fields */ }
Expand description
The A-Tree data structure as described by the paper
See the module documentation for more details.
Implementations§
Source§impl<T: Eq + Hash + Clone + Debug> ATree<T>
impl<T: Eq + Hash + Clone + Debug> ATree<T>
Sourcepub fn new(definitions: &[AttributeDefinition]) -> Result<Self, ATreeError<'_>>
pub fn new(definitions: &[AttributeDefinition]) -> Result<Self, ATreeError<'_>>
Create a new ATree
with the attributes that can be used by the inserted arbitrary
boolean expressions along with their types.
§Examples
use a_tree::{ATree, AttributeDefinition};
let definitions = [
AttributeDefinition::boolean("private"),
AttributeDefinition::integer("exchange_id")
];
let result = ATree::<u64>::new(&definitions);
assert!(result.is_ok());
Duplicate attributes are not allowed and the ATree::new()
function will return an error if there are some:
use a_tree::{ATree, AttributeDefinition};
let definitions = [
AttributeDefinition::boolean("private"),
AttributeDefinition::boolean("private"),
];
let result = ATree::<u64>::new(&definitions);
assert!(result.is_err());
Sourcepub fn insert<'a>(
&'a mut self,
subscription_id: &T,
expression: &'a str,
) -> Result<(), ATreeError<'a>>
pub fn insert<'a>( &'a mut self, subscription_id: &T, expression: &'a str, ) -> Result<(), ATreeError<'a>>
Insert an arbitrary boolean expression inside the ATree
.
§Examples
use a_tree::{ATree, AttributeDefinition};
let definitions = [
AttributeDefinition::boolean("private"),
AttributeDefinition::integer("exchange_id")
];
let mut atree = ATree::new(&definitions).unwrap();
assert!(atree.insert(&1u64, "exchange_id = 5").is_ok());
assert!(atree.insert(&2u64, "private").is_ok());
Sourcepub fn make_event(&self) -> EventBuilder<'_>
pub fn make_event(&self) -> EventBuilder<'_>
Create a new EventBuilder
to be able to generate an Event
that will be usable for
finding the matching arbitrary boolean expressions inside the ATree
via the
ATree::search()
function.
Sourcepub fn to_graphviz(&self) -> String
pub fn to_graphviz(&self) -> String
Export the ATree
to the Graphviz format.
Trait Implementations§
Auto Trait Implementations§
impl<T> Freeze for ATree<T>
impl<T> RefUnwindSafe for ATree<T>where
T: RefUnwindSafe,
impl<T> Send for ATree<T>where
T: Send,
impl<T> Sync for ATree<T>where
T: Sync,
impl<T> Unpin for ATree<T>where
T: Unpin,
impl<T> UnwindSafe for ATree<T>where
T: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more