pub fn refresh<Q: ?Sized>(&mut self, value: &Q) -> bool
    where
        T: Borrow<Q>,
        Q: Hash + Eq,
    {
        self.map.get_refresh(value).is_some()
    }
/// If already present, moves a value to the end of the ordering.
///
/// If the set did have this value present, `true` is returned.
///
/// If the set did not have this value present, `false` is returned.
///
/// Similar to `LinkedHashMap::get_refresh`.
///
/// # Examples
///
/// ```
/// use linked_hash_set::LinkedHashSet;
///
/// let mut set: LinkedHashSet<_> = [1, 2, 3].iter().cloned().collect();
/// let was_refreshed = set.refresh(&2);
///
/// assert_eq!(was_refreshed, true);
/// assert_eq!(set.into_iter().collect::<Vec<_>>(), vec![1, 3, 2]);
/// ```
If already present, moves a value to the end of the ordering.
If the set did have this value present, `true` is returned.

If the set did not have this value present, `false` is returned.


If already present moves a value to the end of the ordering . If the set did have this value present ` true ` is returned . If the set did not have this value present ` false ` is returned .
pub fn refresh<Q: ?Sized>(&mut self, value: &Q) -> bool
    where
        T: Borrow<Q>,
        Q: Hash + Eq,
    {
        self.map.get_refresh(value).is_some()
    }
pub fn refresh < Q : ? Sized > ( & mut self , value : & Q ) -> bool where T : Borrow < Q > , Q : Hash + Eq , { self . map . get_refresh ( value ) . is_some ( ) }
If already present, moves a value to the end of the ordering.
If already present moves a value to the end of the ordering .
&mut self
value
&Q
&mut self
value
&Q
examples
```
use linked_hash_set::LinkedHashSet.

let mut set: LinkedHashSet<_> = [1, 2, 3].iter().cloned().collect();
let was_refreshed = set.refresh(&2).


` ` ` use linked_hash_set :: LinkedHashSet . let mut set : LinkedHashSet<_ > = [ 1 2 3 ] . iter () . cloned () . collect () ; let was_refreshed = set . refresh ( &2 ) .