pub fn front(&self) -> Option<&EntryData> {
        let index = self.head()?;

        match &self.entries[index] {
            Entry::Occupied(entry) => Some(&entry.value),
            _ => None,
        }
    }
/// Returns an immutable reference to the value at the front of the list, if it exists.
///
/// Complexity: O(1)
///
/// # Examples
///
/// ```
/// use dlv_list::VecList;
///
/// let mut list = VecList::new();
/// assert_eq!(list.front(), None);
///
/// list.push_front(0);
/// list.push_front(5);
/// assert_eq!(list.front(), Some(&5));
/// ```
Returns an immutable reference to the value at the front of the list, if it exists.
Returns an immutable reference to the value at the front of the list if it exists .
pub fn front(&self) -> Option<&EntryData> {
        let index = self.head()?;
        match &self.entries[index] {
            Entry::Occupied(entry) => Some(&entry.value),
            _ => None,
        }
    }
pub fn front ( & self ) -> Option < & EntryData > { let index = self . head ( ) ? ; match & self . entries [ index ] { Entry :: Occupied ( entry ) => Some ( & entry . value ) , _ => None , } }
Returns an immutable reference to the value at the front of the list, if it exists.
Returns an immutable reference to the value at the front of the list if it exists .
&self
&self
examples
```
use dlv_list::VecList.

let mut list = VecList::new();
assert_eq!(list.front(), None).


` ` ` use dlv_list :: VecList . let mut list = VecList :: new () ; assert_eq! ( list . front () None ) .