Struct polygraph::example::tree::Tree

pub struct Tree {
    pub surname: Vec<SurnameQuery>,
    pub dog: Vec<DogQuery>,
    pub person: Vec<PersonQuery>,
    pub hash_surname: HashMap<Surname, usize>,
    pub hash_dog: HashMap<Dog, usize>,
}

Fields

surname: Vec<SurnameQuery>

dog: Vec<DogQuery>

person: Vec<PersonQuery>

hash_surname: HashMap<Surname, usize>

hash_dog: HashMap<Dog, usize>

Implementations

impl Tree

pub fn new() -> Self

Create an empty #name database.

impl Tree

pub fn insert_surname(&mut self, datum: Surname) -> Key<Surname>

pub fn insert_dog(&mut self, datum: Dog) -> Key<Dog>

pub fn insert_person(&mut self, datum: Person) -> Key<Person>

pub fn set_person(&mut self, k: Key<Person>, datum: Person)

pub fn lookup_surname(&self, datum: &Surname) -> Option<Key<Surname>>

pub fn lookup_dog(&self, datum: &Dog) -> Option<Key<Dog>>

Trait Implementations

impl Index<Key<Dog>> for Tree

type Output = DogQuery

The returned type after indexing.

fn index(&self, index: Key<Dog>) -> &Self::Output

Performs the indexing (container[index]) operation.

impl Index<Key<Person>> for Tree

type Output = PersonQuery

The returned type after indexing.

fn index(&self, index: Key<Person>) -> &Self::Output

Performs the indexing (container[index]) operation.

impl Index<Key<Surname>> for Tree

type Output = SurnameQuery

The returned type after indexing.

fn index(&self, index: Key<Surname>) -> &Self::Output

Performs the indexing (container[index]) operation.