pub fn add_from_vec(&mut self, mut vec: Vec<K>) {
        while !vec.is_empty() {
            self.insert(vec.pop().unwrap());
        }
    }
/// pops all elements from a vector, and adds to this LinkedHashSet
pops all elements from a vector, and adds to this LinkedHashSet
pops all elements from a vector and adds to this LinkedHashSet
pub fn add_from_vec(&mut self, mut vec: Vec<K>) {
        while !vec.is_empty() {
            self.insert(vec.pop().unwrap());
        }
    }
pub fn add_from_vec ( & mut self , mut vec : Vec < K > ) { while ! vec . is_empty ( ) { self . insert ( vec . pop ( ) . unwrap ( ) ) ; } }
pops all elements from a vector, and adds to this LinkedHashSet
pops all elements from a vector and adds to this LinkedHashSet
&mut self
vec
Vec<K>
&mut self
vec
Vec<K>