struct Node<T> {
element: T,
next: Link<T>,
}
type Link<T> = Option<Box<Node<T>>>;
struct List<T> {
head: Link<T>,
tail: *mut Node<T>,
}
impl<T> List<T> {
pub fn new() -> Self {
List {
head: None,
tail: std::ptr::null_mut(),
}
}
pub fn push(&mut self, element: T) {
let mut new_tail = Box::new(Node {
element,
next: None,
});
let raw_new_tail: *mut Node<T> = &mut *new_tail;
if self.tail.is_null() {
self.head = Some(new_tail);
} else {
unsafe {
let node = &mut *self.tail;
node.next = Some(new_tail);
}
}
self.tail = raw_new_tail;
}
pub fn pop(&mut self) -> Option<T> {
self.head.take().map(|old_head| {
self.head = old_head.next;
if self.head.is_none() {
self.tail = std::ptr::null_mut();
}
old_head.element
})
}
}
#[cfg(test)]
mod test {
use super::List;
#[test]
fn basics() {
let mut list = List::new();
assert_eq!(list.pop(), None);
list.push(1);
list.push(2);
list.push(3);
assert_eq!(list.pop(), Some(1));
assert_eq!(list.pop(), Some(2));
list.push(4);
list.push(5);
assert_eq!(list.pop(), Some(3));
assert_eq!(list.pop(), Some(4));
assert_eq!(list.pop(), Some(5));
assert_eq!(list.pop(), None);
list.push(6);
list.push(7);
assert_eq!(list.pop(), Some(6));
assert_eq!(list.pop(), Some(7));
assert_eq!(list.pop(), None);
}
}