Enum dtab::nametree::NameTree
[−]
[src]
pub enum NameTree<T> { Leaf(T), Union(Weighted<T>, Weighted<T>), Alt(Box<NameTree<T>>, Box<NameTree<T>>), Neg, Empty, Fail, }
Name trees represent a composite name whose interpretation is subject to Finagle's interpretation rules
Variants
Leaf(T)
Union(Weighted<T>, Weighted<T>)
Alt(Box<NameTree<T>>, Box<NameTree<T>>)
Neg
Empty
Fail
Methods
impl<T> NameTree<T>
[src]
Trait Implementations
impl<T: Clone> Clone for NameTree<T>
[src]
fn clone(&self) -> NameTree<T>
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0
Performs copy-assignment from source
. Read more
impl<T: PartialEq> PartialEq for NameTree<T>
[src]
fn eq(&self, __arg_0: &NameTree<T>) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, __arg_0: &NameTree<T>) -> bool
This method tests for !=
.
impl<T: Debug> Debug for NameTree<T>
[src]
impl<'a> From<&'a str> for NameTree<String>
[src]
impl<T> Display for NameTree<T> where
T: Display,
[src]
T: Display,
impl<T, R> BitAnd<R> for NameTree<T> where
R: Into<NameTree<T>>,
[src]
R: Into<NameTree<T>>,
type Output = Self
The resulting type after applying the &
operator
fn bitand(self, rhs: R) -> Self
The method for the &
operator
impl<T, R> BitOr<R> for NameTree<T> where
R: Into<NameTree<T>>,
[src]
R: Into<NameTree<T>>,
type Output = Self
The resulting type after applying the |
operator
fn bitor(self, rhs: R) -> Self
The method for the |
operator
impl<R> Shr<R> for NameTree<String> where
R: Into<NameTree<String>>,
[src]
R: Into<NameTree<String>>,