pub fn contains<Q: ?Sized>(&self, value: &Q) -> bool
    where
        T: Borrow<Q>,
        Q: Hash + Eq,
    {
        self.map.contains_key(value)
    }
/// Returns `true` if the set contains a value.
///
/// The value may be any borrowed form of the set's value type, but
/// `Hash` and `Eq` on the borrowed form *must* match those for
/// the value type.
///
/// # Examples
///
/// ```
/// use linked_hash_set::LinkedHashSet;
///
/// let set: LinkedHashSet<_> = [1, 2, 3].iter().cloned().collect();
/// assert_eq!(set.contains(&1), true);
/// assert_eq!(set.contains(&4), false);
/// ```
Returns `true` if the set contains a value.
The value may be any borrowed form of the set's value type, but
`Hash` and `Eq` on the borrowed form *must* match those for
the value type.
Returns ` true ` if the set contains a value . The value may be any borrowed form of the set ' s value type but ` Hash ` and ` Eq ` on the borrowed form * must * match those for the value type .
pub fn contains<Q: ?Sized>(&self, value: &Q) -> bool
    where
        T: Borrow<Q>,
        Q: Hash + Eq,
    {
        self.map.contains_key(value)
    }
pub fn contains < Q : ? Sized > ( & self , value : & Q ) -> bool where T : Borrow < Q > , Q : Hash + Eq , { self . map . contains_key ( value ) }
Returns `true` if the set contains a value.
Returns ` true ` if the set contains a value .
&self
value
&Q
&self
value
&Q
examples
```
use linked_hash_set::LinkedHashSet.


` ` ` use linked_hash_set :: LinkedHashSet .