pub fn insert(&mut self, element: T) {
        match self.vec.binary_search(&element) {
            Ok(_idx) => {
                panic!("Element already exists");
            }
            Err(idx) => {
                self.vec.insert(idx, element);
            }
        }
    }
/// Insert `element` into the sorted list.
///
/// Panics if an element with the same key (according to the Eq trait) already exists.
Insert `element` into the sorted list.
Panics if an element with the same key (according to the Eq trait) already exists.
Insert ` element ` into the sorted list . Panics if an element with the same key ( according to the Eq trait ) already exists .
pub fn insert(&mut self, element: T) {
        match self.vec.binary_search(&element) {
            Ok(_idx) => {
                panic!("Element already exists");
            }
            Err(idx) => {
                self.vec.insert(idx, element);
            }
        }
    }
pub fn insert ( & mut self , element : T ) { match self . vec . binary_search ( & element ) { Ok ( _idx ) => { panic ! ( " " ) ; } Err ( idx ) => { self . vec . insert ( idx , element ) ; } } }
Insert `element` into the sorted list.
Insert ` element ` into the sorted list .
&mut self
element
T
&mut self
element
T