pub fn remove<Q: ?Sized>(&mut self, value: &Q) -> bool
    where
        T: Borrow<Q>,
        Q: Hash + Eq,
    {
        self.map.remove(value).is_some()
    }
/// Removes a value from the set. Returns `true` if the value was
/// present in the set.
///
/// 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.
///
/// This operation will not affect the ordering of the other elements.
///
/// # Examples
///
/// ```
/// use linked_hash_set::LinkedHashSet;
///
/// let mut set = LinkedHashSet::new();
///
/// set.insert(2);
/// assert_eq!(set.remove(&2), true);
/// assert_eq!(set.remove(&2), false);
/// ```
Removes a value from the set. Returns `true` if the value was
present in the set.

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.

This operation will not affect the ordering of the other elements.
Removes a value from the set . Returns ` true ` if the value was present in the set . 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 . This operation will not affect the ordering of the other elements .
pub fn remove<Q: ?Sized>(&mut self, value: &Q) -> bool
    where
        T: Borrow<Q>,
        Q: Hash + Eq,
    {
        self.map.remove(value).is_some()
    }
pub fn remove < Q : ? Sized > ( & mut self , value : & Q ) -> bool where T : Borrow < Q > , Q : Hash + Eq , { self . map . remove ( value ) . is_some ( ) }
Removes a value from the set.
Removes a value from the set .
&mut self
value
&Q
&mut self
value
&Q
examples
```
use linked_hash_set::LinkedHashSet.

let mut set = LinkedHashSet::new().


` ` ` use linked_hash_set :: LinkedHashSet . let mut set = LinkedHashSet :: new () .