Struct stemflow::Domain [−] [src]

pub struct Domain<A> where A: Access {
    pub name: String,
    pub acl: BTreeSet<A>,
    // some fields omitted
}

Fields

name
acl

Trait Implementations

impl<A> PartialEq for Domain<A> where A: Access

fn eq(&self, other: &Self) -> bool

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

impl<A> PartialOrd for Domain<A> where A: Access

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

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

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

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

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

impl<A> Ord for Domain<A> where A: Access

fn cmp(&self, other: &Self) -> Ordering

impl<A> Hash for Domain<A> where A: Access

Avoid recursive hashing by assuming the domain name is unique!

fn hash<H: Hasher>(&self, state: &mut H)

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher

impl<A> Display for Domain<A> where A: Access

fn fmt(&self, out: &mut Formatter) -> Result

Derived Implementations

impl<A: Debug> Debug for Domain<A> where A: Access

fn fmt(&self, __arg_0: &mut Formatter) -> Result

impl<A: Eq> Eq for Domain<A> where A: Access