/// # Example
///
/// ```rust
- /// use std::collections::{DList, Deque};
+ /// use std::collections::DList;
///
/// let mut dl = DList::new();
- /// dl.push_back(1i);
- /// dl.push_back(2);
- /// dl.push_back(3);
+ /// dl.push(1i);
+ /// dl.push(2);
+ /// dl.push(3);
///
/// dl.rotate_forward();
///
/// # Example
///
/// ```rust
- /// use std::collections::{DList, Deque};
+ /// use std::collections::DList;
///
/// let mut dl = DList::new();
- /// dl.push_back(1i);
- /// dl.push_back(2);
- /// dl.push_back(3);
+ /// dl.push(1i);
+ /// dl.push(2);
+ /// dl.push(3);
///
/// dl.rotate_backward();
///
/// # Example
///
/// ```rust
- /// use std::collections::{DList, Deque};
+ /// use std::collections::DList;
///
/// let mut a = DList::new();
/// let mut b = DList::new();
- /// a.push_back(1i);
- /// a.push_back(2);
- /// b.push_back(3i);
- /// b.push_back(4);
+ /// a.push(1i);
+ /// a.push(2);
+ /// b.push(3i);
+ /// b.push(4);
///
/// a.append(b);
///
/// # Example
///
/// ```rust
- /// use std::collections::{DList, Deque};
+ /// use std::collections::DList;
///
/// let mut a = DList::new();
/// let mut b = DList::new();
- /// a.push_back(1i);
- /// a.push_back(2);
- /// b.push_back(3i);
- /// b.push_back(4);
+ /// a.push(1i);
+ /// a.push(2);
+ /// b.push(3i);
+ /// b.push(4);
///
/// a.prepend(b);
///
/// # Example
///
/// ```rust
- /// use std::collections::{DList, Deque};
+ /// use std::collections::DList;
///
/// let mut a: DList<int> = DList::new();
- /// a.push_back(2i);
- /// a.push_back(4);
- /// a.push_back(7);
- /// a.push_back(8);
+ /// a.push(2i);
+ /// a.push(4);
+ /// a.push(7);
+ /// a.push(8);
///
/// // insert 11 before the first odd number in the list
/// a.insert_when(11, |&e, _| e % 2 == 1);
/// use std::collections::{RingBuf, Deque};
///
/// let mut queue = RingBuf::new();
-/// queue.push_back(1i);
-/// queue.push_back(2i);
-/// queue.push_back(3i);
+/// queue.push(1i);
+/// queue.push(2i);
+/// queue.push(3i);
///
/// // Will print 1, 2, 3
/// while !queue.is_empty() {
/// // Init deque with 1, 2, 3, 4
/// deque.push_front(2i);
/// deque.push_front(1i);
-/// deque.push_back(3i);
-/// deque.push_back(4i);
+/// deque.push(3i);
+/// deque.push(4i);
///
/// // Will print (1, 4) and (2, 3)
/// while !deque.is_empty() {
/// let f = deque.pop_front().unwrap();
-/// let b = deque.pop_back().unwrap();
+/// let b = deque.pop().unwrap();
/// println!("{}", (f, b));
/// }
/// ```
/// let mut d = RingBuf::new();
/// assert_eq!(d.front(), None);
///
- /// d.push_back(1i);
- /// d.push_back(2i);
+ /// d.push(1i);
+ /// d.push(2i);
/// assert_eq!(d.front(), Some(&1i));
/// ```
fn front<'a>(&'a self) -> Option<&'a T>;
/// let mut d = RingBuf::new();
/// assert_eq!(d.front_mut(), None);
///
- /// d.push_back(1i);
- /// d.push_back(2i);
+ /// d.push(1i);
+ /// d.push(2i);
/// match d.front_mut() {
/// Some(x) => *x = 9i,
/// None => (),
/// let mut d = DList::new();
/// assert_eq!(d.back(), None);
///
- /// d.push_back(1i);
- /// d.push_back(2i);
+ /// d.push(1i);
+ /// d.push(2i);
/// assert_eq!(d.back(), Some(&2i));
/// ```
fn back<'a>(&'a self) -> Option<&'a T>;
/// let mut d = DList::new();
/// assert_eq!(d.back(), None);
///
- /// d.push_back(1i);
- /// d.push_back(2i);
+ /// d.push(1i);
+ /// d.push(2i);
/// match d.back_mut() {
/// Some(x) => *x = 9i,
/// None => (),
///
/// # Example
///
- /// ```
+ /// ```ignore
/// use std::collections::{DList, Deque};
///
/// let mut d = DList::new();
///
/// # Example
///
- /// ```
+ /// ```ignore
/// use std::collections::{RingBuf, Deque};
///
/// let mut d = RingBuf::new();
/// use std::collections::{RingBuf, Deque};
///
/// let mut d = RingBuf::new();
- /// d.push_back(1i);
- /// d.push_back(2i);
+ /// d.push(1i);
+ /// d.push(2i);
///
/// assert_eq!(d.pop_front(), Some(1i));
/// assert_eq!(d.pop_front(), Some(2i));