pub fn push_back(&mut self, value: EntryData) -> Index<EntryData> {
        let tail_index = match self.tail() {
            Some(index) => index,
            None => return self.insert_empty(value),
        };
        let index = self.insert_new(value, Some(tail_index), None);
        self.entries[tail_index].occupied_mut().next = Some(index);
        self.set_tail(index);
        Index::new(index, self.generation)
    }
/// Inserts the given value to the back of the list.
///
/// The index of the newly inserted value will be returned.
///
/// Complexity: amortized O(1)
///
/// # Panics
///
/// Panics if the new capacity overflows `usize`.
///
/// # Examples
///
/// ```
/// use dlv_list::VecList;
///
/// let mut list = VecList::new();
/// let index = list.push_back(0);
/// assert_eq!(list.get(index), Some(&0));
/// ```
Inserts the given value to the back of the list.
The index of the newly inserted value will be returned.


Inserts the given value to the back of the list . The index of the newly inserted value will be returned .
pub fn push_back(&mut self, value: EntryData) -> Index<EntryData> {
        let tail_index = match self.tail() {
            Some(index) => index,
            None => return self.insert_empty(value),
        };
        let index = self.insert_new(value, Some(tail_index), None);
        self.entries[tail_index].occupied_mut().next = Some(index);
        self.set_tail(index);
        Index::new(index, self.generation)
    }
pub fn push_back ( & mut self , value : EntryData ) -> Index < EntryData > { let tail_index = match self . tail ( ) { Some ( index ) => index , None => return self . insert_empty ( value ) , } ; let index = self . insert_new ( value , Some ( tail_index ) , None ) ; self . entries [ tail_index ] . occupied_mut ( ) . next = Some ( index ) ; self . set_tail ( index ) ; Index :: new ( index , self . generation ) }
Inserts the given value to the back of the list.
Inserts the given value to the back of the list .
&mut self
value
EntryData
&mut self
value
EntryData
panics
Panics if the new capacity overflows `usize`.
Panics if the new capacity overflows ` usize ` .
examples
```
use dlv_list::VecList.

let mut list = VecList::new();
let index = list.push_back(0);
assert_eq!(list.get(index), Some(&0));
```
` ` ` use dlv_list :: VecList . let mut list = VecList :: new () ; let index = list . push_back ( 0 ) ; assert_eq! ( list . get ( index ) Some ( &0 )) ; ` ` `