Struct avltree::SearchTree

pub struct SearchTree<T: PartialEq + PartialOrd> { /* private fields */ }

A simple AVL tree.

Implementations

impl<'a, T> SearchTree<T>where
    T: PartialEq + PartialOrd + Clone,

pub fn new() -> SearchTree<T>

Creates an empty search tree.

Example

use avltree::SearchTree;
let tree: SearchTree<String> = SearchTree::new();
assert!(tree.is_empty());

pub fn is_empty(&self) -> bool

Test if this tree is empty.

Example

use avltree::SearchTree;
let mut tree: SearchTree<String> = SearchTree::new();
assert!(tree.is_empty());
tree.insert(String::from("foo"));
assert!(!tree.is_empty());

pub fn contains(&self, value: &T) -> bool

Test if this contains a given value.

Example

use avltree::SearchTree;
let mut tree: SearchTree<String> = SearchTree::new();
tree.insert(String::from("hello"));
tree.insert(String::from("world!"));
assert!(tree.contains(&String::from("hello")));
assert!(!tree.contains(&String::from("cruel")));

pub fn insert(&mut self, value: T)

Add the specified value to this tree.

Example

use avltree::SearchTree;
let mut tree: SearchTree<String> = SearchTree::new();
tree.insert(String::from("hello"));
tree.insert(String::from("world!"));
assert!(tree.contains(&String::from("hello")));
assert!(tree.contains(&String::from("world!")));

pub fn iter(&'a self) -> SearchTreeIter<'a, T>

Return an iterator over the values in this tree.

Example

use avltree::SearchTree;
let mut tree: SearchTree<u64> = SearchTree::new();
tree.insert(5);
tree.insert(2);
tree.insert(1);
assert!(tree.iter().zip(vec![1, 2, 5]).all(|(x, y)| *x == y));

Trait Implementations

impl<T: Debug + PartialEq + PartialOrd> Debug for SearchTree<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T: Default + PartialEq + PartialOrd> Default for SearchTree<T>

fn default() -> SearchTree<T>

Returns the “default value” for a type.

impl<T: PartialEq + PartialEq + PartialOrd> PartialEq<SearchTree<T>> for SearchTree<T>

fn eq(&self, other: &SearchTree<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: PartialEq + PartialOrd> StructuralPartialEq for SearchTree<T>