pub fn union<I>(iter: I) -> Address
    where I: IntoIterator,
          I::Item: AsRef<Address>,
{
    let mut set = HashSet::new();
    for child in iter {
        set.extend(child.as_ref().at(0).addresses());
    }
    return set.into_iter().collect();
}
/// Union `Address` values into another address
///
/// Currently we return an Address having only priority 0 with all addresses
/// contained in every input address's priority zero. Duplicates are removed.
/// All addresses will have same weight
Union `Address` values into another address
Currently we return an Address having only priority 0 with all addresses
contained in every input address's priority zero. Duplicates are removed.
All addresses will have same weight
Union ` Address ` values into another address Currently we return an Address having only priority 0 with all addresses contained in every input address ' s priority zero . Duplicates are removed . All addresses will have same weight
pub fn union<I>(iter: I) -> Address
    where I: IntoIterator,
          I::Item: AsRef<Address>,
{
    let mut set = HashSet::new();
    for child in iter {
        set.extend(child.as_ref().at(0).addresses());
    }
    return set.into_iter().collect();
}
pub fn union < I > ( iter : I ) -> Address where I : IntoIterator , I :: Item : AsRef < Address > , { let mut set = HashSet :: new ( ) ; for child in iter { set . extend ( child . as_ref ( ) . at ( 0 ) . addresses ( ) ) ; } return set . into_iter ( ) . collect ( ) ; }
Union `Address` values into another address
Currently we return an Address having only priority 0 with all addresses
contained in every input address's priority zero.
Union ` Address ` values into another address Currently we return an Address having only priority 0 with all addresses contained in every input address ' s priority zero .
iter
I
iter
I