linked_list_setter.rs

// setter methods
impl<T> LinkedList<T> {
    /// Appends element to the back.
    #[inline]
    pub fn push_back(&mut self, val: T) {
        self.push_back_node(Box::new(Node::new(val)))
    }

    /// Appends element to the front
    #[inline]
    pub fn push_front(&mut self, val: T) {
        self.push_front_node(Box::new(Node::new(val)))
    }

    /// Appends the given node to the back of LinkedList
    #[inline]
    fn push_back_node(&mut self, node: Box<Node<T>>) {
        unsafe {
            let node = Some(NonNull::new_unchecked(Box::into_raw(node)));
            match self.tail {
                None => self.head = node,
                Some(mut tail) => tail.as_mut().next = node,
            }

            self.tail = node;
            self.length += 1;
        }
    }

    /// Appends the given node to the front of LinkedList
    #[inline]
    fn push_front_node(&mut self, node: Box<Node<T>>) {
        unsafe {
            let mut node = Some(NonNull::new_unchecked(Box::into_raw(node)));
            match self.head {
                None => self.tail = node,
                Some(head) => node.as_mut().unwrap().as_mut().next = Some(head),
            }

            self.head = node;
            self.length += 1;
        }
    }
}