array_linked_list/

lib.rs

#![no_std]
#![deny(missing_docs)]

/*!
The `ArrayLinkedList` data structure combines the benefit of an array and a linked list.

Every supported operation, which does not (re-)allocate the array, is done in *O*(1):

* inserting elements at the front and back
* popping element at the front or back
* getting the element count
* removing elements at an arbitrary index
* inserting elements at an arbitrary index
* replacing elements at an arbitrary index

It's stored like an array, but contains some additional information.

You would typically use it, where you need to be able to do multiple of the following tasks efficiently:

* accessing single elements by index
* adding and removing elements without changing order or indices
* sorting elements without changing indices or moving the content around.

# Order and indexing

You might also use it as a more convenient version of a `Vec<Option<T>>`.
When iterating over it, only the elements, which are `Some` are given to the user.
And even the checks for `Some` are optimized away.
So when it's likely, that most of the options of a large array are `None`, this might be a huge performance improvement.

Another advantage over a `LinkedList` is the cache locality.
Everything is laid out in a contiguous region of memory.
Compared to a `Vec` on the other hand, it might be bad.
The iteration does not necessarily take place in the same order.
That's mostly a problem for large arrays.
The iterator would jump back and forth in the array.

In order to understand this type, it's necessary to know about the iteration order.
There is a logical order, which is used by the iterators, or when doing anything with the first and last elements.
You can think of it as the order of a linked list, which is just packed into an array here.
And then there is indexing, which has nothing to do with the order of the linked list.
The indices just return the array elements.

## Index Example

So when adding an element to the linked array without specifying the index, you get the index, it was put to, as a result.
The results are always added to the array in order, so the indices increase, no matter if you add the indices to the front or to the back:

```
use array_linked_list::ArrayLinkedList;

let mut array = ArrayLinkedList::new();

assert_eq!(array.push_front(1), 0);
assert_eq!(array.push_back(2), 1);
assert_eq!(array.push_front(3), 2);
assert_eq!(array.push_front(4), 3);
assert_eq!(array.push_back(5), 4);
```

## Order example

When you just append elements from the front or back, the indices even correlate to the order:

```
use array_linked_list::ArrayLinkedList;

let mut array = ArrayLinkedList::new();

array.push_front(1);
array.push_front(2);
array.push_front(3);

for (i, element) in array.iter().rev().enumerate() {
    assert_eq!(*element, array[i].unwrap());
}
```

```
use array_linked_list::ArrayLinkedList;

let mut array = ArrayLinkedList::new();

array.push_back(1);
array.push_back(2);
array.push_back(3);

for (i, element) in array.iter().enumerate() {
    assert_eq!(*element, array[i].unwrap());
}
```

## Iteration over unsorted lists

In realistic cases, you need to store the indices somewhere else, if you need them.
Alternatively, you can also use

```
use array_linked_list::ArrayLinkedList;

let mut array = ArrayLinkedList::new();

array.push_back(1);
array.push_front(2);
array.push_front(3);
array.push_back(4);
array.push_front(5);

for (index, element) in array.indexed().rev() {
    assert_eq!(*element, array[index].unwrap());
}
```

## Conclusion

Just remember, that indices and order are two different things, which don't correlate, and you should be safe.

**/

extern crate alloc;

mod iter;

pub use iter::{IntoValues, Values, ValuesMut};

use alloc::vec::Vec;
use core::{
    mem,
    ops::{Index, IndexMut},
};

mod id {
    #[derive(Copy, Clone, Debug, PartialEq, Eq)]
    pub struct Id(usize);

    impl Default for Id {
        fn default() -> Self {
            Self(usize::MAX)
        }
    }

    impl Id {
        #[inline(always)]
        pub fn new(i: usize) -> Self {
            Self(i)
        }

        #[inline(always)]
        pub fn is_empty(self) -> bool {
            self.0 == usize::MAX
        }

        #[inline(always)]
        pub fn index(self) -> Option<usize> {
            if self.is_empty() { None } else { Some(self.0) }
        }

        #[inline(always)]
        pub fn valid_index(self) -> usize {
            self.0
        }
    }
}

use id::Id;

#[derive(Copy, Clone, Debug)]
struct LinkedListNode<T> {
    next_index: Id,
    prev_index: Id,
    data: Option<T>,
}

impl<T> LinkedListNode<T> {
    fn new(prev_index: Id, next_index: Id, data: T) -> Self {
        Self {
            next_index,
            prev_index,
            data: Some(data),
        }
    }

    fn front(first_index: Id, data: T) -> Self {
        Self {
            next_index: first_index,
            prev_index: Id::default(),
            data: Some(data),
        }
    }

    fn back(last_index: Id, data: T) -> Self {
        Self {
            next_index: Id::default(),
            prev_index: last_index,
            data: Some(data),
        }
    }

    fn deleted(free_index: Id) -> Self {
        Self {
            next_index: free_index,
            prev_index: Id::default(),
            data: None,
        }
    }
}

/// The `ArrayLinkedList` type, which combines the advantages of dynamic arrays and linked lists.
#[derive(Clone, Debug, Default)]
pub struct ArrayLinkedList<T> {
    count: usize,
    first_index: Id,
    last_index: Id,
    free_index: Id,
    end_index: Id,
    elements: Vec<LinkedListNode<T>>,
}

impl<T> ArrayLinkedList<T> {
    /// Constructs a new, empty `ArrayLinkedList`.
    ///
    /// The linked array will not allocate until elements are pushed onto it.
    pub fn new() -> Self {
        Self {
            count: 0,
            first_index: Id::default(),
            last_index: Id::default(),
            free_index: Id::default(),
            end_index: Id::default(),
            elements: Vec::new(),
        }
    }

    #[inline]
    fn fill_elements(&mut self, capacity: usize) {
        if capacity == 0 {
            return;
        }
        for i in 1..capacity {
            self.elements.push(LinkedListNode::deleted(Id::new(i)))
        }
        self.elements.push(LinkedListNode::deleted(Id::default()));

        self.free_index = Id::new(0);
        self.end_index = Id::new(capacity - 1);
    }

    /// Returns a reference to the element at the given index, or `None` if the index is out of bounds or the slot is empty.
    ///
    /// # Examples
    ///
    /// ```
    /// use array_linked_list::ArrayLinkedList;
    ///
    /// let mut array = ArrayLinkedList::new();
    /// let index = array.push_back(42);
    ///
    /// assert_eq!(array.get(index), Some(&42));
    /// assert_eq!(array.get(999), None);
    ///
    /// array.remove(index);
    /// assert_eq!(array.get(index), None);
    /// ```
    pub fn get(&self, index: usize) -> Option<&T> {
        self.elements.get(index)?.data.as_ref()
    }

    /// Returns a mutable reference to the element at the given index, or `None` if the index is out of bounds or the slot is empty.
    ///
    /// # Examples
    ///
    /// ```
    /// use array_linked_list::ArrayLinkedList;
    ///
    /// let mut array = ArrayLinkedList::new();
    /// let index = array.push_back(42);
    ///
    /// if let Some(elem) = array.get_mut(index) {
    ///     *elem = 100;
    /// }
    /// assert_eq!(array[index], Some(100));
    /// ```
    pub fn get_mut(&mut self, index: usize) -> Option<&mut T> {
        self.elements.get_mut(index)?.data.as_mut()
    }

    /// Constructs a new, empty `ArrayLinkedList<T>` with the specified capacity.
    ///
    /// The array will be able to hold exactly `capacity` elements without reallocating.
    // If `capacity` is 0, the vector will not allocate.
    pub fn with_capacity(capacity: usize) -> Self {
        let mut result = Self::new();
        result.elements = Vec::with_capacity(capacity);
        result.fill_elements(capacity);
        result
    }

    /// Reserves capacity for at least `additional` more elements to be inserted without reallocating.
    ///
    /// This only affects the underlying allocation. Existing indices stay valid.
    pub fn reserve(&mut self, additional: usize) {
        self.elements.reserve(additional);
    }

    /// Shrinks the underlying allocation as much as possible.
    ///
    /// Indices stay valid, since no slots are removed. Already used capacity (including empty slots) is preserved.
    pub fn shrink_to_fit(&mut self) {
        self.elements.shrink_to_fit();
    }

    fn insert_free_element(&mut self, element: LinkedListNode<T>) -> Id {
        Id::new(if let Some(free_index) = self.free_index.index() {
            let recycle_element = &mut self.elements[free_index];
            self.free_index = recycle_element.next_index;
            *recycle_element = element;
            free_index
        } else {
            let index = self.elements.len();
            self.elements.push(element);
            index
        })
    }

    /// Adds an element at the front of the array and returns its index.
    /// The indices are returned in an ascending order, starting with zero.
    /// See the module description for more information.
    ///
    /// This operation should compute in *O*(1) time.
    ///
    /// # Examples
    ///
    /// ```
    /// use array_linked_list::ArrayLinkedList;
    ///
    /// let mut array = ArrayLinkedList::new();
    ///
    /// assert_eq!(array.push_front(2), 0);
    /// assert_eq!(array.front().unwrap(), &2);
    ///
    /// assert_eq!(array.push_front(1), 1);
    /// assert_eq!(array.front().unwrap(), &1);
    /// ```
    pub fn push_front(&mut self, value: T) -> usize {
        let element = LinkedListNode::front(self.first_index, value);

        let next_index = self.insert_free_element(element);

        *self.prev_of_next(self.first_index, true) = next_index;

        self.first_index = next_index;
        self.count += 1;

        next_index.valid_index()
    }

    /// Adds an element at the back of the array and returns its index.
    /// The indices are returned in an ascending order, starting with zero.
    /// See the module description for more information.
    ///
    /// This operation should compute in *O*(1) time.
    ///
    /// # Examples
    ///
    /// ```
    /// use array_linked_list::ArrayLinkedList;
    ///
    /// let mut array = ArrayLinkedList::new();
    ///
    /// assert_eq!(array.push_back(1), 0);
    /// assert_eq!(array.push_back(3), 1);
    /// assert_eq!(3, *array.back().unwrap());
    /// ```
    pub fn push_back(&mut self, value: T) -> usize {
        let element = LinkedListNode::back(self.last_index, value);

        let prev_index = self.insert_free_element(element);

        *self.next_of_prev(self.last_index, true) = prev_index;

        self.last_index = prev_index;
        self.count += 1;

        prev_index.valid_index()
    }

    fn insert_between(&mut self, prev_index: Id, next_index: Id, value: T) -> usize {
        let element = LinkedListNode::new(prev_index, next_index, value);

        let index = self.insert_free_element(element);

        *self.next_of_prev(prev_index, true) = index;
        *self.prev_of_next(next_index, true) = index;

        self.count += 1;

        index.valid_index()
    }

    /// Inserts an element after the element at the specified index.
    /// Returns the index of the inserted element on success.
    /// If no element was found at the specified index, `None` is returned.
    ///
    /// # Panics
    ///
    /// Panics if `prev_index >= capacity`
    ///
    /// # Examples
    ///
    /// ```
    /// use array_linked_list::ArrayLinkedList;
    ///
    /// let mut array = ArrayLinkedList::new();
    ///
    /// let first = array.push_back(1);
    /// let second = array.push_back(2);
    /// let third = array.push_back(3);
    ///
    /// array.insert_after(second, 100);
    ///
    /// assert_eq!(array.pop_front(), Some(1));
    /// assert_eq!(array.pop_front(), Some(2));
    /// assert_eq!(array.pop_front(), Some(100));
    /// assert_eq!(array.pop_front(), Some(3));
    /// assert_eq!(array.pop_front(), None);
    /// ```
    pub fn insert_after(&mut self, prev_index: usize, value: T) -> Option<usize> {
        let LinkedListNode {
            next_index, data, ..
        } = &self.elements[prev_index];

        if data.is_some() {
            let next_index = *next_index;
            Some(self.insert_between(Id::new(prev_index), next_index, value))
        } else {
            None
        }
    }

    /// Inserts an element before the element at the specified index.
    /// Returns the index of the inserted element on success.
    /// If no element was found at the specified index, `None` is returned.
    ///
    /// # Panics
    ///
    /// Panics if `next_index >= capacity`
    ///
    /// # Examples
    ///
    /// ```
    /// use array_linked_list::ArrayLinkedList;
    ///
    /// let mut array = ArrayLinkedList::new();
    ///
    /// let first = array.push_back(1);
    /// let second = array.push_back(2);
    /// let third = array.push_back(3);
    ///
    /// array.insert_before(second, 100);
    ///
    /// assert_eq!(array.pop_front(), Some(1));
    /// assert_eq!(array.pop_front(), Some(100));
    /// assert_eq!(array.pop_front(), Some(2));
    /// assert_eq!(array.pop_front(), Some(3));
    /// assert_eq!(array.pop_front(), None);
    /// ```
    pub fn insert_before(&mut self, next_index: usize, value: T) -> Option<usize> {
        let LinkedListNode {
            prev_index, data, ..
        } = &self.elements[next_index];

        if data.is_some() {
            let prev_index = *prev_index;
            Some(self.insert_between(prev_index, Id::new(next_index), value))
        } else {
            None
        }
    }

    #[inline]
    fn prev_of_next(&mut self, index: Id, active: bool) -> &mut Id {
        if let Some(index) = index.index() {
            &mut self.elements[index].prev_index
        } else if active {
            &mut self.last_index
        } else {
            &mut self.end_index
        }
    }

    #[inline]
    fn next_of_prev(&mut self, index: Id, active: bool) -> &mut Id {
        if let Some(index) = index.index() {
            &mut self.elements[index].next_index
        } else if active {
            &mut self.first_index
        } else {
            &mut self.free_index
        }
    }

    fn connect_indices(&mut self, prev_index: Id, next_index: Id, active: bool) {
        *self.prev_of_next(next_index, active) = prev_index;
        *self.next_of_prev(prev_index, active) = next_index;
    }

    /// Removes the element at the given index and returns it, or `None` if it is empty.
    /// The indices of other items are not changed.
    /// Indices, which have never been used (see `capacity`), will not be available, but panic instead.
    ///
    /// Indices are not the position they appear in, when iterating over them.
    /// So you can't use enumerate to get the index to delete.
    /// But the iteration order of the elements (in both directions) is preserved.
    /// See the module description for more information.
    ///
    /// This operation should compute in *O*(1) time.
    ///
    /// # Panics
    ///
    /// Panics if index >= capacity
    ///
    /// # Examples
    ///
    /// ```
    /// use array_linked_list::ArrayLinkedList;
    ///
    /// let mut array = ArrayLinkedList::new();
    ///
    /// let first = array.push_front(1);
    /// let second = array.push_back(2);
    /// let third = array.push_front(3);
    ///
    /// assert_eq!(array.len(), 3);
    ///
    /// assert_eq!(array.remove(second).unwrap(), 2);
    /// assert_eq!(array[second], None);
    /// assert_eq!(array.len(), 2);
    /// assert_eq!(array.remove(second), None);
    /// assert_eq!(array.len(), 2);
    ///
    /// assert_eq!(array.remove(first).unwrap(), 1);
    /// assert_eq!(array.len(), 1);
    /// assert_eq!(array.remove(third).unwrap(), 3);
    /// assert_eq!(array.len(), 0);
    /// assert!(array.is_empty());
    /// ```
    pub fn remove(&mut self, index: usize) -> Option<T> {
        let LinkedListNode {
            next_index,
            prev_index,
            data,
        } = mem::replace(
            &mut self.elements[index],
            LinkedListNode::deleted(self.free_index),
        );

        let removed = data.is_some();
        self.connect_indices(prev_index, next_index, removed);

        if removed {
            self.count -= 1;
        }

        if let Some(free_index) = self.free_index.index() {
            self.elements[free_index].prev_index = Id::new(index);
        }

        self.free_index = Id::new(index);
        data
    }

    /// Adds element at specified index at the front of the list.
    /// Useful for updating contents.
    ///
    /// It basically does the same as `remove` and `push_front`, even if the specified index is already removed.
    ///
    /// # Panics
    ///
    /// Panics if index >= capacity
    ///
    /// # Examples
    ///
    /// ```
    /// use array_linked_list::ArrayLinkedList;
    ///
    /// let mut array = ArrayLinkedList::new();
    ///
    /// array.push_front(1);
    /// let first_index = array.push_back(2);
    /// array.push_front(3);
    /// let second_index = array.push_front(4);
    /// array.push_back(5);
    ///
    /// let mut array2 = array.clone();
    /// for (a, b) in array.iter().zip(&array2) {
    ///     assert_eq!(a, b)
    /// }
    ///
    /// let first_element = array.replace_front(first_index, 100);
    /// let first_element2 = array2.remove(first_index);
    /// array2.push_front(100);
    ///
    /// assert_eq!(first_element, first_element2);
    /// for (a, b) in array.iter().zip(&array2) {
    ///     assert_eq!(a, b)
    /// }
    ///
    /// let second_element = array.replace_front(first_index, 0);
    /// let second_element2 = array2.remove(first_index);
    /// array2.push_back(0);
    ///
    /// assert_eq!(second_element, second_element2);
    ///
    /// assert!(array.iter().zip(&array2).any(|(a, b)| a != b));
    ///
    /// assert_eq!(array.len(), 5);
    /// assert_eq!(array2.len(), 5);
    /// ```
    pub fn replace_front(&mut self, index: usize, value: T) -> Option<T> {
        let LinkedListNode {
            next_index,
            prev_index,
            data,
        } = mem::replace(
            &mut self.elements[index],
            LinkedListNode::front(self.first_index, value),
        );

        let removed = data.is_some();
        self.connect_indices(prev_index, next_index, removed);

        if !removed {
            self.count += 1;
        }

        if let Some(first_index) = self.first_index.index() {
            self.elements[first_index].prev_index = Id::new(index);
        }

        self.first_index = Id::new(index);
        data
    }

    /// Adds element at specified index at the back of the list.
    /// Useful for updating contents.
    ///
    /// It basically does the same as `remove` and `push_back`, even if the specified index is already removed.
    ///
    /// # Panics
    ///
    /// Panics if index >= capacity
    ///
    /// # Examples
    ///
    /// ```
    /// use array_linked_list::ArrayLinkedList;
    ///
    /// let mut array = ArrayLinkedList::new();
    ///
    /// array.push_front(1);
    /// array.push_back(2);
    /// let middle_index = array.push_back(3);
    /// array.push_front(4);
    /// array.push_back(5);
    ///
    /// let mut array2 = array.clone();
    /// for (a, b) in array.iter().zip(&array2) {
    ///     assert_eq!(a, b)
    /// }
    ///
    /// let element = array.replace_back(middle_index, 100);
    /// let element2 = array2.remove(middle_index);
    /// array2.push_back(100);
    ///
    /// assert_eq!(element, element2);
    /// for (a, b) in array.iter().zip(&array2) {
    ///     assert_eq!(a, b)
    /// }
    ///
    /// assert_eq!(array.len(), 5);
    /// assert_eq!(array2.len(), 5);
    /// ```
    pub fn replace_back(&mut self, index: usize, value: T) -> Option<T> {
        let LinkedListNode {
            next_index,
            prev_index,
            data,
        } = mem::replace(
            &mut self.elements[index],
            LinkedListNode::back(self.last_index, value),
        );

        let removed = data.is_some();
        self.connect_indices(prev_index, next_index, removed);

        if !removed {
            self.count += 1;
        }

        if let Some(last_index) = self.last_index.index() {
            self.elements[last_index].next_index = Id::new(index);
        }

        self.last_index = Id::new(index);
        data
    }

    /// Removes the first element from the array and returns it, or `None` if it is empty.
    ///
    /// This operation should compute in *O*(1) time.
    ///
    /// # Examples
    ///
    /// ```
    /// use array_linked_list::ArrayLinkedList;
    ///
    /// let mut array = ArrayLinkedList::new();
    /// assert_eq!(array.pop_front(), None);
    /// array.push_back(1);
    /// array.push_back(3);
    /// assert_eq!(array.pop_front(), Some(1));
    /// array.push_front(5);
    /// array.push_front(7);
    /// assert_eq!(array.pop_front(), Some(7));
    /// array.push_front(9);
    /// let mut array = array.into_iter();
    /// assert_eq!(array.next(), Some(9));
    /// assert_eq!(array.next_back(), Some(3));
    /// assert_eq!(array.next(), Some(5));
    /// ```
    pub fn pop_front(&mut self) -> Option<T> {
        let index = self.first_index.index()?;

        let LinkedListNode {
            next_index, data, ..
        } = mem::replace(
            &mut self.elements[index],
            LinkedListNode::deleted(self.free_index),
        );

        *self.prev_of_next(next_index, true) = Id::default();
        self.first_index = next_index;

        self.count -= 1;
        if let Some(free_index) = self.free_index.index() {
            self.elements[free_index].prev_index = Id::new(index);
        }

        self.free_index = Id::new(index);
        Some(unsafe { data.unwrap_unchecked() })
    }

    /// Removes the last element from the array and returns it, or `None` if it is empty.
    ///
    /// This operation should compute in *O*(1) time.
    ///
    /// # Examples
    ///
    /// ```
    /// use array_linked_list::ArrayLinkedList;
    ///
    /// let mut array = ArrayLinkedList::new();
    /// assert_eq!(array.pop_back(), None);
    /// array.push_back(1);
    /// array.push_back(3);
    /// assert_eq!(array.pop_back(), Some(3));
    /// array.push_back(5);
    /// array.push_back(7);
    /// let mut array = array.into_iter();
    /// assert_eq!(array.next_back(), Some(7));
    /// assert_eq!(array.next(), Some(1));
    /// assert_eq!(array.next_back(), Some(5));
    /// ```
    pub fn pop_back(&mut self) -> Option<T> {
        let index = self.last_index.index()?;

        let LinkedListNode {
            prev_index, data, ..
        } = mem::replace(
            &mut self.elements[index],
            LinkedListNode::deleted(self.free_index),
        );

        self.last_index = prev_index;
        *self.next_of_prev(prev_index, true) = Id::default();

        self.count -= 1;
        if let Some(free_index) = self.free_index.index() {
            self.elements[free_index].prev_index = Id::new(index);
        }

        self.free_index = Id::new(index);
        Some(unsafe { data.unwrap_unchecked() })
    }

    /// The index of the first list element.
    /// Returns `None` if array is empty.
    pub fn front_index(&self) -> Option<usize> {
        self.first_index.index()
    }

    /// The index of the last list element.
    /// Returns `None` if array is empty.
    pub fn back_index(&self) -> Option<usize> {
        self.last_index.index()
    }

    /// The first list element.
    /// Returns `None` if array is empty.
    pub fn front(&self) -> Option<&T> {
        let index = self.first_index.index()?;

        Some(unsafe { self.elements[index].data.as_ref().unwrap_unchecked() })
    }

    /// The last list element.
    /// Returns `None` if array is empty.
    pub fn back(&self) -> Option<&T> {
        let index = self.last_index.index()?;

        Some(unsafe { self.elements[index].data.as_ref().unwrap_unchecked() })
    }

    /// The first list element as a mutable reference.
    /// Returns `None` if array is empty.
    pub fn front_mut(&mut self) -> Option<&mut T> {
        let index = self.first_index.index()?;

        Some(unsafe { self.elements[index].data.as_mut().unwrap_unchecked() })
    }

    /// The last list element as a mutable reference.
    /// Returns `None` if array is empty.
    pub fn back_mut(&mut self) -> Option<&mut T> {
        let index = self.last_index.index()?;

        Some(unsafe { self.elements[index].data.as_mut().unwrap_unchecked() })
    }

    /// Checks if the list is empty.
    pub fn is_empty(&self) -> bool {
        self.count == 0
    }

    /// Clears the linked array, removing all values.
    ///
    /// Note that this method has no effect on the allocated capacity of the array.
    /// So all indices, which have already been used (see `capacity`), are still available.
    pub fn clear(&mut self) {
        self.count = 0;
        self.first_index = Id::default();
        self.last_index = Id::default();
        self.free_index = Id::default();
        self.end_index = Id::default();

        let capacity = self.elements.len();
        self.elements.clear();
        self.fill_elements(capacity);
    }

    /// Returns the number of elements in the linked array.
    pub fn len(&self) -> usize {
        self.count
    }

    /// Returns the number of elements the vector can hold without reallocating.
    ///
    /// Methods, which take indices, require the specified index to be below the capacity.
    ///
    /// All the following methods require indices:
    ///
    /// * `insert_before`
    /// * `insert_after`
    /// * `remove`
    /// * `replace_front`
    /// * `replace_back`
    ///
    /// Besides that, some of the iterators are constructed using indices in the same range.
    pub fn capacity(&self) -> usize {
        self.elements.len()
    }
}

impl<T> Index<usize> for ArrayLinkedList<T> {
    type Output = Option<T>;
    fn index(&self, index: usize) -> &Option<T> {
        &self.elements[index].data
    }
}

impl<T> IndexMut<usize> for ArrayLinkedList<T> {
    fn index_mut(&mut self, index: usize) -> &mut Option<T> {
        &mut self.elements[index].data
    }
}

impl<T> Extend<T> for ArrayLinkedList<T> {
    fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I) {
        let iter = iter.into_iter();
        self.elements.reserve(iter.size_hint().0);
        for value in iter {
            self.push_back(value);
        }
    }
}

impl<T> FromIterator<T> for ArrayLinkedList<T> {
    fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self {
        let mut result = Self::new();
        result.extend(iter);
        result
    }
}