fn pop(&mut self) -> i32 {
        let mut temp;
        let mut vt: VecDeque<i32> = VecDeque::new();
        let res;
        
        for i in 0..self.v.len()-1 {
            temp = self.v.pop_back();
            vt.push_back(temp.unwrap());
        }
        res = self.v.pop_back().unwrap();
        for i in 0..vt.len() {
            temp = vt.pop_back();
            self.v.push_back(temp.unwrap());
        }
        res
    }
/** Removes the element from in front of queue and returns that element. */
Removes the element from in front of queue and returns that element.
Removes the element from in front of queue and returns that element .
fn pop(&mut self) -> i32 {
        let mut temp;
        let mut vt: VecDeque<i32> = VecDeque::new();
        let res;
        for i in 0..self.v.len()-1 {
            temp = self.v.pop_back();
            vt.push_back(temp.unwrap());
        }
        res = self.v.pop_back().unwrap();
        for i in 0..vt.len() {
            temp = vt.pop_back();
            self.v.push_back(temp.unwrap());
        }
        res
    }
fn pop ( & mut self ) -> i32 { let mut temp ; let mut vt : VecDeque < i32 > = VecDeque :: new ( ) ; let res ; for i in 0 .. self . v . len ( ) - 1 { temp = self . v . pop_back ( ) ; vt . push_back ( temp . unwrap ( ) ) ; } res = self . v . pop_back ( ) . unwrap ( ) ; for i in 0 .. vt . len ( ) { temp = vt . pop_back ( ) ; self . v . push_back ( temp . unwrap ( ) ) ; } res }
Removes the element from in front of queue and returns that element.
Removes the element from in front of queue and returns that element .
&mut self