extarray 1.1.2

//
// Copyright (c) 2025 Nathan Fiedler
//

//! An implemenation of extensible arrays as described in section 3 of the paper
//! "Immediate-Access Indexing Using Space-Efficient Extensible Arrays" by
//! Alistair Moffat and Joel Mackenzie, published in 2022.
//!
//! * ACM ISBN 979-8-4007-0021-7/22/12
//! * https://doi.org/10.1145/3572960.3572984
//!
//! # Memory Usage
//!
//! An empty resizable array is approximately 88 bytes in size, and while
//! holding elements it will have a space overhead on the order of O(√N). As
//! elements are added the array will grow by allocating additional data blocks.
//! Likewise, as elements are removed from the end of the array, data blocks
//! will be deallocated as they become empty. At most one empty data block will
//! be retained as an optimization.
//!
//! # Performance
//!
//! Most operations are either constant time, log2, or sqrt of the collection
//! size. However, the lookup operation involves several calculations and as
//! such the overall performance will be worse than `Vec`. The advantage is that
//! the memory overhead will be on the order of O(√N) vs O(N).
//!
//! # Safety
//!
//! Because this data structure is allocating memory, copying bytes using
//! pointers, and de-allocating memory as needed, there are many `unsafe` blocks
//! throughout the code.

use std::alloc::{Layout, alloc, dealloc, handle_alloc_error};
use std::fmt;
use std::ops::{Index, IndexMut};

/// The number of bits in a usize for computing the block size of segments.
const WORD_SIZE: u32 = (8 * std::mem::size_of::<usize>()) as u32;

/// The number of bits in a usize plus one to make the math in the mapping()
/// function easier.
const BEE_BASE: u32 = WORD_SIZE + 1;

/// Compute the largest segment number for which the segment length is 2^l.
///
/// From first paragraph of section 3 of the Moffat 2022 paper.
#[inline]
fn last_segment_for_l(l: usize) -> usize {
    // This is simply the Thabit number minus 1, while adjusting the one-based l
    // to a zero-based n (the l value is increased by 1 when the segment offset
    // matches a Thabit number).
    3 * (1 << (l - 1)) - 2
}

/// Compute the number of elements that data blocks in level l can hold.
///
/// From first paragraph of section 3 of the Moffat 2022 paper.
#[inline]
fn datablock_capacity(l: usize) -> usize {
    1 << l
}

/// Compute the number of segments of the same length for some l.
#[inline]
fn superblock_capacity(l: usize) -> usize {
    if l == 1 { 2 } else { 3 * (1 << (l - 2)) }
}

// Compute the total volume V(l) of all segments of length less than or equal to
// 2^l which is simplified to 2^(2*l)
//
// N.B. this does not account for the actual allocated segments, so the value is
// off by a bit since it only considers the l value.
#[inline]
fn capacity_for_l(l: usize) -> usize {
    1 << (l << 1)
}

/// Derive the l value for the given segment offset.
fn l_for_segment(segment: usize) -> usize {
    // While unstated in the paper, the first segment for each zero-based level
    // is a Thabit number (https://en.wikipedia.org/wiki/Thabit_number). Note
    // that in the paper, l is one-based hence the conversion to zero-based n
    // for the Thabit series.
    let j = (segment + 1).div_ceil(3);
    let k = (WORD_SIZE - j.leading_zeros() - 1) as usize;
    let thabit = 3 * (1 << k) - 1;
    if segment >= thabit { k + 2 } else { k + 1 }
}

/// Determine the number of slots in the given segment.
fn slots_in_segment(segment: usize) -> usize {
    datablock_capacity(l_for_segment(segment))
}

/// Compute the mapping from a one-dimensional array index to a two-dimensional
/// segment number and offset pair.
///
/// Algorithm 1 from the Moffat 2022 paper
fn mapping(v: usize) -> (usize, usize) {
    // inlining this function is indeed faster, but increases the code size
    // given the many call sites for this function; what's more, the other
    // resizable array implementations cannot simply inline the locate function,
    // so the performance comparisons become skewed
    let b = if v == 0 {
        1
    } else {
        (BEE_BASE - v.leading_zeros()) >> 1
    };
    let segment = (v >> b) + (1 << (b - 1)) - 1;
    let slot = v & ((1 << b) - 1);
    (segment, slot)
}

/// Compute the capacity for an extensible array for a given dope length.
///
/// # Time complexity
///
/// Constant time.
fn array_capacity(dope_len: usize) -> usize {
    if dope_len == 0 {
        0
    } else {
        let last_segment = dope_len - 1;
        let level = l_for_segment(last_segment);
        let level_capacity = capacity_for_l(level);
        let block_capacity = datablock_capacity(level);
        let most_segment = last_segment_for_l(level);
        let unalloc_capacity = block_capacity * (most_segment - last_segment);
        level_capacity - unalloc_capacity
    }
}

///
/// Growable array as described by Moffat and Mackenzie.
///
pub struct ExtensibleArray<T> {
    /// dope vector, holds pointers to allocated segments
    dope: Vec<*mut T>,
    /// number of elements stored in the array
    count: usize,
    /// the 'l' value from the Moffat 2022 paper
    level: usize,
    /// number of non-empty data blocks
    d: usize,
    /// number of empty data blocks (either 0 or 1)
    empty: usize,
    /// number of elements in last non-empty data block
    last_db_length: usize,
    /// capacity of the last non-empty data block
    last_db_capacity: usize,
    /// number of data blocks in last non-empty super block
    last_sb_length: usize,
    /// capacity of data blocks the last non-empty super block
    last_sb_capacity: usize,
}

impl<T> ExtensibleArray<T> {
    /// Return an empty extensible array with zero capacity.
    ///
    /// Note that pre-allocating capacity has no benefit with this data
    /// structure since append operations are always constant time and no
    /// reallocation and copy is ever performed.
    pub fn new() -> Self {
        Self {
            dope: vec![],
            count: 0,
            level: 1,
            d: 0,
            empty: 0,
            last_db_length: 0,
            last_db_capacity: 0,
            last_sb_length: 0,
            last_sb_capacity: 0,
        }
    }

    /// Appends an element to the back of a collection.
    ///
    /// # Panics
    ///
    /// Panics if a new segment is allocated that would exceed `isize::MAX` _bytes_.
    ///
    /// # Time complexity
    ///
    /// Constant time.
    pub fn push(&mut self, value: T) {
        // if the last non-empty data block is full...
        if self.last_db_capacity == self.last_db_length {
            // if the last superblock is full...
            if self.last_sb_capacity == self.last_sb_length {
                self.last_sb_capacity = superblock_capacity(self.level);
                self.last_db_capacity = datablock_capacity(self.level);
                self.last_sb_length = 0;
                self.level += 1;
            }
            // if there are no empty data blocks...
            if self.empty == 0 {
                // allocate new data block, add to dope vector
                let layout =
                    Layout::array::<T>(self.last_db_capacity).expect("unexpected overflow");
                unsafe {
                    let ptr = alloc(layout).cast::<T>();
                    if ptr.is_null() {
                        handle_alloc_error(layout);
                    }
                    self.dope.push(ptr);
                }
            } else {
                // reuse the previously allocated empty data block
                self.empty = 0;
            }
            self.d += 1;
            self.last_sb_length += 1;
            self.last_db_length = 0;
        }
        let (segment, slot) = mapping(self.count);
        unsafe {
            std::ptr::write(self.dope[segment].add(slot), value);
        }
        self.count += 1;
        self.last_db_length += 1;
    }

    /// Appends an element if there is sufficient spare capacity, otherwise an
    /// error is returned with the element.
    ///
    /// # Time complexity
    ///
    /// Constant time.
    pub fn push_within_capacity(&mut self, value: T) -> Result<(), T> {
        let (segment, _slot) = mapping(self.count);
        if self.dope.len() <= segment {
            Err(value)
        } else {
            self.push(value);
            Ok(())
        }
    }

    /// Deallocate segments as they become empty.
    fn shrink(&mut self) {
        self.count -= 1;
        self.last_db_length -= 1;
        // if last data block is empty...
        if self.last_db_length == 0 {
            // if there is another empty data block, Deallocate it
            if self.empty == 1 {
                let ptr = self.dope.pop().expect("programmer error");
                let block = self.dope.len();
                let block_len = slots_in_segment(block);
                let layout = Layout::array::<T>(block_len).expect("unexpected overflow");
                unsafe {
                    dealloc(ptr as *mut u8, layout);
                }
            }
            // leave this last empty data block in case more pushes occur and we
            // would soon be allocating the same sized block again
            self.empty = 1;
            // if the index block is quarter full, shrink to half
            if self.dope.len() * 4 <= self.dope.capacity() {
                self.dope.shrink_to(self.dope.capacity() / 2);
            }
            // decrement d and number of data blocks in last superblock
            self.d -= 1;
            self.last_sb_length -= 1;
            // if last superblock is empty...
            if self.last_sb_length == 0 {
                self.level -= 1;
                if self.level == 1 {
                    self.last_sb_capacity = 0;
                    self.last_db_capacity = 0;
                } else {
                    self.last_sb_capacity = superblock_capacity(self.level - 1);
                    self.last_db_capacity = datablock_capacity(self.level - 1);
                }
                // set occupancy of last superblock to full
                self.last_sb_length = self.last_sb_capacity;
            }
            // set occupancy of last data block to full
            self.last_db_length = self.last_db_capacity;
        }
    }

    /// Removes the last element from an array and returns it, or `None` if it
    /// is empty.
    ///
    /// # Time complexity
    ///
    /// Constant time.
    pub fn pop(&mut self) -> Option<T> {
        if self.count > 0 {
            let (segment, slot) = mapping(self.count - 1);
            let value = unsafe { Some((self.dope[segment].add(slot)).read()) };
            self.shrink();
            value
        } else {
            None
        }
    }

    /// Removes and returns the last element from a vector if the predicate
    /// returns true, or None if the predicate returns false or the vector is
    /// empty (the predicate will not be called in that case).
    ///
    /// # Time complexity
    ///
    /// Constant time.
    pub fn pop_if(&mut self, predicate: impl FnOnce(&mut T) -> bool) -> Option<T> {
        if self.count == 0 {
            None
        } else if let Some(last) = self.get_mut(self.count - 1) {
            if predicate(last) { self.pop() } else { None }
        } else {
            None
        }
    }

    /// Return the number of elements in the array.
    ///
    /// # Time complexity
    ///
    /// Constant time.
    pub fn len(&self) -> usize {
        self.count
    }

    /// Returns the total number of elements the extensible array can hold
    /// without reallocating.
    ///
    /// # Time complexity
    ///
    /// log2(count)/2
    pub fn capacity(&self) -> usize {
        array_capacity(self.dope.len())
    }

    /// Returns true if the array has a length of 0.
    ///
    /// # Time complexity
    ///
    /// Constant time.
    pub fn is_empty(&self) -> bool {
        self.count == 0
    }

    /// Retrieve a reference to the element at the given offset.
    ///
    /// # Time complexity
    ///
    /// Constant time.
    pub fn get(&self, index: usize) -> Option<&T> {
        if index >= self.count {
            None
        } else {
            let (segment, slot) = mapping(index);
            unsafe { (self.dope[segment].add(slot)).as_ref() }
        }
    }

    /// Returns a mutable reference to an element.
    ///
    /// # Time complexity
    ///
    /// Constant time.
    pub fn get_mut(&mut self, index: usize) -> Option<&mut T> {
        if index >= self.count {
            None
        } else {
            let (segment, slot) = mapping(index);
            unsafe { (self.dope[segment].add(slot)).as_mut() }
        }
    }

    /// Removes an element from the vector and returns it.
    ///
    /// The removed element is replaced by the last element of the vector.
    ///
    /// This does not preserve ordering of the remaining elements.
    ///
    /// # Time complexity
    ///
    /// Constant time.
    pub fn swap_remove(&mut self, index: usize) -> T {
        if index >= self.count {
            panic!(
                "swap_remove index (is {index}) should be < len (is {})",
                self.count
            );
        }
        // retreive the value at index before overwriting
        let (segment, slot) = mapping(index);
        unsafe {
            let index_ptr = self.dope[segment].add(slot);
            let value = index_ptr.read();
            // find the pointer of the last element and copy to index pointer
            let (segment, slot) = mapping(self.count - 1);
            let last_ptr = self.dope[segment].add(slot);
            std::ptr::copy(last_ptr, index_ptr, 1);
            self.shrink();
            value
        }
    }

    /// Returns an iterator over the extensible array.
    ///
    /// The iterator yields all items from start to end.
    pub fn iter(&self) -> ExtArrayIter<'_, T> {
        ExtArrayIter {
            array: self,
            index: 0,
        }
    }

    /// Clears the extensible array, removing and dropping all values and
    /// deallocating all previously allocated segments.
    ///
    /// # Time complexity
    ///
    /// O(n) if elements are droppable, otherwise O(sqrt(n))
    pub fn clear(&mut self) {
        use std::ptr::{drop_in_place, slice_from_raw_parts_mut};

        if self.count > 0 {
            if std::mem::needs_drop::<T>() {
                // find the last segment that contains values and drop them
                let (last_segment, last_slot) = mapping(self.count - 1);
                unsafe {
                    // last_slot is pointing at the last element, need to add
                    // one to include it in the slice
                    drop_in_place(slice_from_raw_parts_mut(
                        self.dope[last_segment],
                        last_slot + 1,
                    ));
                }

                // drop the values in all of the preceding segments
                let mut segment = 0;
                for level in 1..=self.level {
                    let level_limit = last_segment_for_l(level);
                    let segment_len = datablock_capacity(level);
                    while segment <= level_limit && segment < last_segment {
                        unsafe {
                            drop_in_place(slice_from_raw_parts_mut(
                                self.dope[segment],
                                segment_len,
                            ));
                        }
                        segment += 1;
                    }
                }
            }

            self.level = 1;
            self.count = 0;
            self.d = 0;
            self.empty = 0;
            self.last_db_length = 0;
            self.last_db_capacity = 0;
            self.last_sb_length = 0;
            self.last_sb_capacity = 0;
        }

        // deallocate all segments using the index as the source of truth
        for segment in 0..self.dope.len() {
            let segment_len = slots_in_segment(segment);
            let layout = Layout::array::<T>(segment_len).expect("unexpected overflow");
            unsafe {
                dealloc(self.dope[segment] as *mut u8, layout);
            }
        }
        self.dope.clear();
    }
}

impl<T> Default for ExtensibleArray<T> {
    fn default() -> Self {
        Self::new()
    }
}

impl<T> fmt::Display for ExtensibleArray<T> {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        write!(
            f,
            "ExtensibleArray(n: {}, s: {}, d: {}, e: {}, dl: {}, dc: {}, sl: {}, sc: {})",
            self.count,
            self.level,
            self.d,
            self.empty,
            self.last_db_length,
            self.last_db_capacity,
            self.last_sb_length,
            self.last_sb_capacity
        )
    }
}

impl<T> Drop for ExtensibleArray<T> {
    fn drop(&mut self) {
        self.clear();
    }
}

impl<T> Index<usize> for ExtensibleArray<T> {
    type Output = T;

    fn index(&self, index: usize) -> &Self::Output {
        let Some(item) = self.get(index) else {
            panic!("index out of bounds: {}", index);
        };
        item
    }
}

impl<T> IndexMut<usize> for ExtensibleArray<T> {
    fn index_mut(&mut self, index: usize) -> &mut Self::Output {
        let Some(item) = self.get_mut(index) else {
            panic!("index out of bounds: {}", index);
        };
        item
    }
}

impl<A> FromIterator<A> for ExtensibleArray<A> {
    fn from_iter<T: IntoIterator<Item = A>>(iter: T) -> Self {
        let mut arr: ExtensibleArray<A> = ExtensibleArray::new();
        for value in iter {
            arr.push(value)
        }
        arr
    }
}

/// Immutable extensible array iterator.
pub struct ExtArrayIter<'a, T> {
    array: &'a ExtensibleArray<T>,
    index: usize,
}

impl<'a, T> Iterator for ExtArrayIter<'a, T> {
    type Item = &'a T;

    fn next(&mut self) -> Option<Self::Item> {
        let value = self.array.get(self.index);
        self.index += 1;
        value
    }
}

/// An iterator that moves out of a extensible array.
pub struct ExtArrayIntoIter<T> {
    index: usize,
    count: usize,
    level: usize,
    dope: Vec<*mut T>,
}

impl<T> Iterator for ExtArrayIntoIter<T> {
    type Item = T;

    fn next(&mut self) -> Option<Self::Item> {
        if self.index < self.count {
            let (segment, slot) = mapping(self.index);
            self.index += 1;
            unsafe { Some((self.dope[segment].add(slot)).read()) }
        } else {
            None
        }
    }
}

impl<T> Drop for ExtArrayIntoIter<T> {
    fn drop(&mut self) {
        use std::ptr::{drop_in_place, slice_from_raw_parts_mut};

        if self.count > 0 && std::mem::needs_drop::<T>() {
            let (first_segment, first_slot) = mapping(self.index);
            let (last_segment, last_slot) = mapping(self.count - 1);
            if first_segment == last_segment {
                // special-case, remaining values are in only one segment
                if first_slot <= last_slot {
                    unsafe {
                        // last_slot is pointing at the last element, need to
                        // add one to include it in the slice
                        drop_in_place(slice_from_raw_parts_mut(
                            self.dope[first_segment].add(first_slot),
                            last_slot - first_slot + 1,
                        ));
                    }
                }
            } else if first_segment < last_segment {
                // drop the remaining values in the first segment
                let segment_len = slots_in_segment(first_segment);
                if segment_len < self.count {
                    unsafe {
                        drop_in_place(slice_from_raw_parts_mut(
                            self.dope[first_segment].add(first_slot),
                            segment_len - first_slot,
                        ));
                    }
                }

                // drop the values in the last segment
                unsafe {
                    drop_in_place(slice_from_raw_parts_mut(
                        self.dope[last_segment],
                        last_slot + 1,
                    ));
                }

                // drop the values in all of the other segments
                for segment in first_segment + 1..last_segment {
                    let segment_len = slots_in_segment(segment);
                    unsafe {
                        drop_in_place(slice_from_raw_parts_mut(self.dope[segment], segment_len));
                    }
                }
            }
        }

        // deallocate all of the segments
        for segment in 0..self.dope.len() {
            let segment_len = slots_in_segment(segment);
            let layout = Layout::array::<T>(segment_len).expect("unexpected overflow");
            unsafe {
                dealloc(self.dope[segment] as *mut u8, layout);
            }
        }

        self.dope.clear();
        self.index = 0;
        self.level = 1;
        self.count = 0;
    }
}

impl<T> IntoIterator for ExtensibleArray<T> {
    type Item = T;
    type IntoIter = ExtArrayIntoIter<Self::Item>;

    fn into_iter(self) -> Self::IntoIter {
        let mut me = std::mem::ManuallyDrop::new(self);
        let dope = std::mem::take(&mut me.dope);
        ExtArrayIntoIter {
            index: 0,
            count: me.count,
            level: me.level,
            dope,
        }
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_push_get_one_item() {
        let item = String::from("hello world");
        let mut sut: ExtensibleArray<String> = ExtensibleArray::new();
        assert_eq!(sut.len(), 0);
        assert!(sut.is_empty());
        sut.push(item);
        assert_eq!(sut.len(), 1);
        assert!(!sut.is_empty());
        let maybe = sut.get(0);
        assert!(maybe.is_some());
        let actual = maybe.unwrap();
        assert_eq!("hello world", actual);
        let missing = sut.get(10);
        assert!(missing.is_none());
    }

    #[test]
    fn test_push_get_several_strings() {
        let inputs = [
            "one", "two", "three", "four", "five", "six", "seven", "eight", "nine",
        ];
        let mut sut: ExtensibleArray<String> = ExtensibleArray::new();
        for item in inputs {
            sut.push(item.to_owned());
        }
        assert_eq!(sut.len(), 9);
        for (idx, item) in inputs.iter().enumerate() {
            let maybe = sut.get(idx);
            assert!(maybe.is_some(), "{idx} is none");
            let actual = maybe.unwrap();
            assert_eq!(item, actual);
        }
        let maybe = sut.get(10);
        assert!(maybe.is_none());
        assert_eq!(sut[3], "four");
    }

    #[test]
    fn test_push_get_hundred_ints() {
        let mut sut: ExtensibleArray<i32> = ExtensibleArray::new();
        for value in 0..100 {
            sut.push(value);
        }
        assert_eq!(sut.len(), 100);
        for idx in 0..100 {
            let maybe = sut.get(idx);
            assert!(maybe.is_some(), "{idx} is none");
            let actual = maybe.unwrap();
            assert_eq!(idx, *actual as usize);
        }
        assert_eq!(sut[99], 99);
    }

    #[test]
    fn test_len_and_capacity() {
        let mut sut: ExtensibleArray<i32> = ExtensibleArray::new();
        assert_eq!(sut.len(), 0);
        assert_eq!(sut.capacity(), 0);
        for value in 0..100 {
            sut.push(value);
        }
        assert_eq!(sut.len(), 100);
        // 2 * 2 + 4 * 3 + 8 * 6 + 16 * 3
        assert_eq!(sut.capacity(), 112);
    }

    #[test]
    fn test_pop_and_shrink() {
        let mut sut: ExtensibleArray<usize> = ExtensibleArray::new();
        for value in 0..8 {
            sut.push(value);
        }
        assert_eq!(sut.len(), 8);
        assert_eq!(sut.capacity(), 8);
        while !sut.is_empty() {
            sut.pop();
        }
        assert_eq!(sut.len(), 0);
        // empty block has size 2
        assert_eq!(sut.capacity(), 2);
    }

    #[test]
    fn test_push_within_capacity() {
        // empty array has no allocated space
        let mut sut: ExtensibleArray<u32> = ExtensibleArray::new();
        assert_eq!(sut.push_within_capacity(101), Err(101));
        sut.push(10);
        assert_eq!(sut.push_within_capacity(101), Ok(()));

        // edge case (first segment is 2 elements long)
        let mut sut: ExtensibleArray<u32> = ExtensibleArray::new();
        sut.push(1);
        assert_eq!(sut.push_within_capacity(2), Ok(()));
        assert_eq!(sut.push_within_capacity(3), Err(3));
    }

    #[test]
    fn test_get_mut_index_mut() {
        let mut sut: ExtensibleArray<String> = ExtensibleArray::new();
        sut.push(String::from("first"));
        sut.push(String::from("second"));
        sut.push(String::from("third"));
        if let Some(value) = sut.get_mut(1) {
            value.push_str(" place");
        } else {
            panic!("get_mut() returned None")
        }
        assert_eq!(sut[1], "second place");
        sut[2] = "third planet".into();
        assert_eq!(sut[2], "third planet");
    }

    #[test]
    #[should_panic(expected = "index out of bounds:")]
    fn test_index_out_of_bounds() {
        let mut sut: ExtensibleArray<i32> = ExtensibleArray::new();
        sut.push(10);
        sut.push(20);
        let _ = sut[2];
    }

    #[test]
    #[should_panic(expected = "index out of bounds:")]
    fn test_index_mut_out_of_bounds() {
        let mut sut: ExtensibleArray<i32> = ExtensibleArray::new();
        sut.push(10);
        sut.push(20);
        sut[2] = 30;
    }

    #[test]
    fn test_push_many_pop_all_verify() {
        // push many values, then pop all off and verify
        let mut sut: ExtensibleArray<usize> = ExtensibleArray::new();
        assert_eq!(sut.len(), 0);
        assert_eq!(sut.capacity(), 0);
        for value in 0..16384 {
            sut.push(value);
        }
        assert_eq!(sut.len(), 16384);
        assert_eq!(sut.capacity(), 16384);
        for value in (0..16384).rev() {
            assert_eq!(sut.pop(), Some(value));
        }
        assert_eq!(sut.len(), 0);
        // empty block has size 2
        assert_eq!(sut.capacity(), 2);
    }

    #[test]
    fn test_push_pop_grow_shrink_empty_block() {
        // test the handling of the extra empty data block when pushing and
        // popping values that cross over a level boundary and thereby the extra
        // empty data block is a different size than the newly emptied data
        // block (push enough to reach level 3, then pop enough to get to level
        // 2, then push again)
        let mut sut: ExtensibleArray<usize> = ExtensibleArray::new();
        assert_eq!(sut.len(), 0);
        assert_eq!(sut.capacity(), 0);
        for value in 0..20 {
            sut.push(value);
        }
        assert_eq!(sut.len(), 20);
        assert_eq!(sut.capacity(), 24);
        for _ in 0..5 {
            sut.pop();
        }
        assert_eq!(sut.len(), 15);
        assert_eq!(sut.capacity(), 24);
        for _ in 0..5 {
            sut.pop();
        }
        assert_eq!(sut.len(), 10);
        assert_eq!(sut.capacity(), 16);
        for value in 10..22 {
            sut.push(value);
        }
        assert_eq!(sut.len(), 22);
        assert_eq!(sut.capacity(), 24);
        for (idx, elem) in sut.iter().enumerate() {
            assert_eq!(idx, *elem);
        }

        // try to trigger any clear/drop logic
        sut.clear();
    }

    #[test]
    fn test_push_pop_iter() {
        let inputs = [
            "one", "two", "three", "four", "five", "six", "seven", "eight", "nine",
        ];
        let mut sut: ExtensibleArray<String> = ExtensibleArray::new();
        assert!(sut.pop().is_none());
        for item in inputs {
            sut.push(item.to_owned());
        }
        assert_eq!(sut.len(), 9);
        for (idx, elem) in sut.iter().enumerate() {
            assert_eq!(inputs[idx], elem);
        }
        let maybe = sut.pop();
        assert!(maybe.is_some());
        let value = maybe.unwrap();
        assert_eq!(value, "nine");
        assert_eq!(sut.len(), 8);
        sut.push(String::from("nine"));
        assert_eq!(sut.len(), 9);
        for (idx, elem) in sut.iter().enumerate() {
            assert_eq!(inputs[idx], elem);
        }

        // pop everything and add back again
        while !sut.is_empty() {
            sut.pop();
        }
        assert_eq!(sut.len(), 0);
        for item in inputs {
            sut.push(item.to_owned());
        }
        assert_eq!(sut.len(), 9);
        for (idx, elem) in sut.iter().enumerate() {
            assert_eq!(inputs[idx], elem);
        }
    }

    #[test]
    fn test_pop_if() {
        let mut sut: ExtensibleArray<u32> = ExtensibleArray::new();
        assert!(sut.pop_if(|_| panic!("should not be called")).is_none());
        for value in 0..10 {
            sut.push(value);
        }
        assert!(sut.pop_if(|_| false).is_none());
        let maybe = sut.pop_if(|v| *v == 9);
        assert_eq!(maybe.unwrap(), 9);
        assert!(sut.pop_if(|v| *v == 9).is_none());
    }

    #[test]
    fn test_swap_remove_single_segment() {
        let mut sut: ExtensibleArray<u32> = ExtensibleArray::new();
        sut.push(1);
        sut.push(2);
        assert_eq!(sut.len(), 2);
        let one = sut.swap_remove(0);
        assert_eq!(one, 1);
        assert_eq!(sut[0], 2);
    }

    #[test]
    fn test_swap_remove_multiple_segments() {
        let mut sut: ExtensibleArray<u32> = ExtensibleArray::new();
        for value in 0..512 {
            sut.push(value);
        }
        assert_eq!(sut.len(), 512);
        let eighty = sut.swap_remove(80);
        assert_eq!(eighty, 80);
        assert_eq!(sut.pop(), Some(510));
        assert_eq!(sut[80], 511);
    }

    #[test]
    #[should_panic(expected = "swap_remove index (is 0) should be < len (is 0)")]
    fn test_swap_remove_panic_empty() {
        let mut sut: ExtensibleArray<u32> = ExtensibleArray::new();
        sut.swap_remove(0);
    }

    #[test]
    #[should_panic(expected = "swap_remove index (is 1) should be < len (is 1)")]
    fn test_swap_remove_panic_range_edge() {
        let mut sut: ExtensibleArray<u32> = ExtensibleArray::new();
        sut.push(1);
        sut.swap_remove(1);
    }

    #[test]
    #[should_panic(expected = "swap_remove index (is 2) should be < len (is 1)")]
    fn test_swap_remove_panic_range_exceed() {
        let mut sut: ExtensibleArray<u32> = ExtensibleArray::new();
        sut.push(1);
        sut.swap_remove(2);
    }

    #[test]
    fn test_clear_and_reuse_tiny() {
        // clear an array that allocated only one segment
        let mut sut: ExtensibleArray<String> = ExtensibleArray::new();
        sut.push(String::from("one"));
        sut.push(String::from("two"));
        assert_eq!(sut.len(), 2);
        sut.clear();
        assert_eq!(sut.len(), 0);
        sut.push(String::from("one"));
        sut.push(String::from("two"));
        assert_eq!(sut.len(), 2);
        // implicitly drop()
    }

    #[test]
    fn test_clear_and_reuse_ints() {
        let mut sut: ExtensibleArray<i32> = ExtensibleArray::new();
        for value in 0..512 {
            sut.push(value);
        }
        assert_eq!(sut.len(), 512);
        sut.clear();
        assert_eq!(sut.len(), 0);
        for value in 0..512 {
            sut.push(value);
        }
        for idx in 0..512 {
            let maybe = sut.get(idx);
            assert!(maybe.is_some(), "{idx} is none");
            let actual = maybe.unwrap();
            assert_eq!(idx, *actual as usize);
        }
    }

    #[test]
    fn test_clear_and_reuse_strings() {
        let mut sut: ExtensibleArray<String> = ExtensibleArray::new();
        for _ in 0..512 {
            let value = ulid::Ulid::new().to_string();
            sut.push(value);
        }
        assert_eq!(sut.len(), 512);
        sut.clear();
        assert_eq!(sut.len(), 0);
        for _ in 0..512 {
            let value = ulid::Ulid::new().to_string();
            sut.push(value);
        }
        assert_eq!(sut.len(), 512);
        // implicitly drop()
    }

    #[test]
    fn test_push_get_thousands_structs() {
        struct MyData {
            a: u64,
            b: i32,
        }
        let mut sut: ExtensibleArray<MyData> = ExtensibleArray::new();
        for value in 0..88_888i32 {
            sut.push(MyData {
                a: value as u64,
                b: value,
            });
        }
        assert_eq!(sut.len(), 88_888);
        for idx in 0..88_888i32 {
            let maybe = sut.get(idx as usize);
            assert!(maybe.is_some(), "{idx} is none");
            let actual = maybe.unwrap();
            assert_eq!(idx as u64, actual.a);
            assert_eq!(idx, actual.b);
        }
    }

    #[test]
    fn test_from_iterator() {
        let mut inputs: Vec<i32> = Vec::new();
        for value in 0..10_000 {
            inputs.push(value);
        }
        let sut: ExtensibleArray<i32> = inputs.into_iter().collect();
        assert_eq!(sut.len(), 10_000);
        for idx in 0..10_000i32 {
            let maybe = sut.get(idx as usize);
            assert!(maybe.is_some(), "{idx} is none");
            let actual = maybe.unwrap();
            assert_eq!(idx, *actual);
        }
    }

    #[test]
    fn test_push_get_many_ints() {
        let mut sut: ExtensibleArray<i32> = ExtensibleArray::new();
        for value in 0..1_000_000 {
            sut.push(value);
        }
        assert_eq!(sut.len(), 1_000_000);
        for idx in 0..1_000_000 {
            let maybe = sut.get(idx);
            assert!(maybe.is_some(), "{idx} is none");
            let actual = maybe.unwrap();
            assert_eq!(idx, *actual as usize);
        }
        assert_eq!(sut[99_999], 99_999);
    }

    #[test]
    fn test_iterator() {
        let inputs = [
            "one", "two", "three", "four", "five", "six", "seven", "eight", "nine",
        ];
        let mut sut: ExtensibleArray<String> = ExtensibleArray::new();
        for item in inputs {
            sut.push(item.to_owned());
        }
        for (idx, elem) in sut.iter().enumerate() {
            assert_eq!(inputs[idx], elem);
        }
    }

    #[test]
    fn test_into_iterator() {
        // an array that only requires a single segment
        let inputs = [
            "one", "two", "three", "four", "five", "six", "seven", "eight", "nine",
        ];
        let mut sut: ExtensibleArray<String> = ExtensibleArray::new();
        for item in inputs {
            sut.push(item.to_owned());
        }
        for (idx, elem) in sut.into_iter().enumerate() {
            assert_eq!(inputs[idx], elem);
        }
        // sut.len(); // error: ownership of sut was moved
    }

    #[test]
    fn test_into_iterator_edge_case() {
        // iterate to the end (of the last data block)
        let inputs = [
            "one", "two", "three", "four", "five", "six", "seven", "eight",
        ];
        let mut sut: ExtensibleArray<String> = ExtensibleArray::new();
        for item in inputs {
            sut.push(item.to_owned());
        }
        for (idx, elem) in sut.into_iter().enumerate() {
            assert_eq!(inputs[idx], elem);
        }
        // sut.len(); // error: ownership of sut was moved
    }

    #[test]
    fn test_into_iterator_drop_empty() {
        let sut: ExtensibleArray<String> = ExtensibleArray::new();
        assert_eq!(sut.into_iter().count(), 0);
    }

    #[test]
    fn test_into_iterator_drop_tiny() {
        // an array that only requires a single segment and only some need to be
        // dropped after partially iterating the values
        let inputs = [
            "one", "two", "three", "four", "five", "six", "seven", "eight", "nine",
        ];
        let mut sut: ExtensibleArray<String> = ExtensibleArray::new();
        for item in inputs {
            sut.push(item.to_owned());
        }
        for (idx, _) in sut.into_iter().enumerate() {
            if idx > 2 {
                break;
            }
        }
        // implicitly drop()
    }

    #[test]
    fn test_into_iterator_drop_large() {
        // by adding 512 values and iterating less than 64 times, there will be
        // values in the first segment and some in the last segment, and two
        // segments inbetween that all need to be dropped
        let mut sut: ExtensibleArray<String> = ExtensibleArray::new();
        for _ in 0..512 {
            let value = ulid::Ulid::new().to_string();
            sut.push(value);
        }
        for (idx, _) in sut.into_iter().enumerate() {
            if idx >= 30 {
                break;
            }
        }
        // implicitly drop()
    }

    #[test]
    fn test_push_get_many_instances_ints() {
        // test allocating, filling, and then dropping many instances
        for _ in 0..1_000 {
            let mut sut: ExtensibleArray<usize> = ExtensibleArray::new();
            for value in 0..10_000 {
                sut.push(value);
            }
            assert_eq!(sut.len(), 10_000);
        }
    }

    #[test]
    fn test_push_get_many_instances_strings() {
        // test allocating, filling, and then dropping many instances
        for _ in 0..1_000 {
            let mut sut: ExtensibleArray<String> = ExtensibleArray::new();
            for _ in 0..1_000 {
                let value = ulid::Ulid::new().to_string();
                sut.push(value);
            }
            assert_eq!(sut.len(), 1_000);
        }
    }

    #[test]
    fn test_last_segment() {
        // l cannot be zero, but segment numbers are 0-based
        assert_eq!(last_segment_for_l(1), 1);
        assert_eq!(last_segment_for_l(2), 4);
        assert_eq!(last_segment_for_l(3), 10);
        assert_eq!(last_segment_for_l(4), 22);
        assert_eq!(last_segment_for_l(5), 46);
        assert_eq!(last_segment_for_l(6), 94);
        assert_eq!(last_segment_for_l(7), 190);
        assert_eq!(last_segment_for_l(8), 382);
        assert_eq!(last_segment_for_l(9), 766);
        assert_eq!(last_segment_for_l(10), 1534);
        assert_eq!(last_segment_for_l(11), 3070);
        assert_eq!(last_segment_for_l(12), 6142);
        assert_eq!(last_segment_for_l(13), 12286);
        assert_eq!(last_segment_for_l(14), 24574);
        assert_eq!(last_segment_for_l(15), 49150);
        assert_eq!(last_segment_for_l(16), 98302);
    }

    #[test]
    fn test_segment_len() {
        // l cannot be zero, but segment numbers are 0-based
        assert_eq!(datablock_capacity(1), 2);
        assert_eq!(datablock_capacity(2), 4);
        assert_eq!(datablock_capacity(3), 8);
        assert_eq!(datablock_capacity(4), 16);
        assert_eq!(datablock_capacity(5), 32);
        assert_eq!(datablock_capacity(6), 64);
        assert_eq!(datablock_capacity(7), 128);
        assert_eq!(datablock_capacity(8), 256);
        assert_eq!(datablock_capacity(9), 512);
        assert_eq!(datablock_capacity(10), 1024);
        assert_eq!(datablock_capacity(11), 2048);
        assert_eq!(datablock_capacity(12), 4096);
        assert_eq!(datablock_capacity(13), 8192);
        assert_eq!(datablock_capacity(14), 16384);
        assert_eq!(datablock_capacity(15), 32768);
        assert_eq!(datablock_capacity(16), 65536);
    }

    #[test]
    fn test_mapping() {
        assert_eq!(mapping(0), (0, 0));
        assert_eq!(mapping(1), (0, 1));
        assert_eq!(mapping(2), (1, 0));
        assert_eq!(mapping(3), (1, 1));
        assert_eq!(mapping(4), (2, 0));
        assert_eq!(mapping(5), (2, 1));
        assert_eq!(mapping(6), (2, 2));
        assert_eq!(mapping(7), (2, 3));
        assert_eq!(mapping(8), (3, 0));
        assert_eq!(mapping(9), (3, 1));
        assert_eq!(mapping(10), (3, 2));
        assert_eq!(mapping(11), (3, 3));
        assert_eq!(mapping(12), (4, 0));
        assert_eq!(mapping(72), (11, 8));
        assert_eq!(mapping(248), (22, 8));
        assert_eq!(mapping(4567), (98, 87)); // from the Moffat 2022 paper
        assert_eq!(mapping(1_048_576), (1535, 0));
        assert_eq!(mapping(2_000_000), (1999, 1152));
        assert_eq!(mapping(4_194_304), (3071, 0));
        assert_eq!(mapping(16_777_216), (6143, 0));
        assert_eq!(mapping(67_108_864), (12287, 0));
        assert_eq!(mapping(268_435_456), (24575, 0));
        assert_eq!(mapping(1_073_741_824), (49151, 0));
        assert_eq!(mapping(2_000_000_000), (63284, 37888));
        assert_eq!(mapping(2_147_483_647), (65534, 65535));
        assert_eq!(mapping(2_147_483_648), (65535, 0));
        assert_eq!(mapping(4_294_967_295), (98302, 65535));
    }

    #[test]
    fn test_capacity() {
        assert_eq!(array_capacity(0), 0);
        assert_eq!(array_capacity(1), 2);
        assert_eq!(array_capacity(2), 4);
        assert_eq!(array_capacity(3), 8);
        assert_eq!(array_capacity(4), 12);
        assert_eq!(array_capacity(5), 16);
        assert_eq!(array_capacity(8), 40);
        assert_eq!(array_capacity(12), 80);
    }

    #[test]
    fn test_l_for_segment() {
        assert_eq!(l_for_segment(0), 1);
        assert_eq!(l_for_segment(1), 1);
        assert_eq!(l_for_segment(2), 2);
        assert_eq!(l_for_segment(3), 2);
        assert_eq!(l_for_segment(4), 2);
        assert_eq!(l_for_segment(5), 3);
        assert_eq!(l_for_segment(6), 3);
        assert_eq!(l_for_segment(7), 3);
        assert_eq!(l_for_segment(8), 3);
        assert_eq!(l_for_segment(9), 3);
        assert_eq!(l_for_segment(10), 3);
        assert_eq!(l_for_segment(11), 4);
        assert_eq!(l_for_segment(12), 4);
        assert_eq!(l_for_segment(13), 4);
        assert_eq!(l_for_segment(14), 4);
        assert_eq!(l_for_segment(15), 4);
        assert_eq!(l_for_segment(16), 4);
        assert_eq!(l_for_segment(17), 4);
        assert_eq!(l_for_segment(18), 4);
        assert_eq!(l_for_segment(19), 4);
        assert_eq!(l_for_segment(20), 4);
        assert_eq!(l_for_segment(21), 4);
        assert_eq!(l_for_segment(22), 4);
        assert_eq!(l_for_segment(23), 5);
        assert_eq!(l_for_segment(47), 6);
        assert_eq!(l_for_segment(94), 6);
        assert_eq!(l_for_segment(95), 7);
        assert_eq!(l_for_segment(190), 7);
        assert_eq!(l_for_segment(191), 8);
        assert_eq!(l_for_segment(382), 8);
        assert_eq!(l_for_segment(383), 9);
        assert_eq!(l_for_segment(767), 10);
        assert_eq!(l_for_segment(1534), 10);
        assert_eq!(l_for_segment(1535), 11);
        assert_eq!(l_for_segment(3070), 11);
        assert_eq!(l_for_segment(3071), 12);
        assert_eq!(l_for_segment(6142), 12);
        assert_eq!(l_for_segment(6143), 13);
        assert_eq!(l_for_segment(12286), 13);
        assert_eq!(l_for_segment(12287), 14);
        assert_eq!(l_for_segment(24574), 14);
        assert_eq!(l_for_segment(24575), 15);
        assert_eq!(l_for_segment(49150), 15);
        assert_eq!(l_for_segment(49151), 16);
        assert_eq!(l_for_segment(98303), 17);
        assert_eq!(l_for_segment(196607), 18);
        assert_eq!(l_for_segment(393215), 19);
        assert_eq!(l_for_segment(786431), 20);
        assert_eq!(l_for_segment(1572863), 21);
    }

    #[test]
    fn test_slots_in_segment() {
        assert_eq!(slots_in_segment(0), 2);
        assert_eq!(slots_in_segment(1), 2);
        assert_eq!(slots_in_segment(2), 4);
        assert_eq!(slots_in_segment(3), 4);
        assert_eq!(slots_in_segment(4), 4);
        assert_eq!(slots_in_segment(5), 8);
        assert_eq!(slots_in_segment(6), 8);
        assert_eq!(slots_in_segment(7), 8);
        assert_eq!(slots_in_segment(8), 8);
        assert_eq!(slots_in_segment(9), 8);
        assert_eq!(slots_in_segment(10), 8);
        assert_eq!(slots_in_segment(11), 16);
        assert_eq!(slots_in_segment(30), 32);
        assert_eq!(slots_in_segment(80), 64);
        assert_eq!(slots_in_segment(170), 128);
        assert_eq!(slots_in_segment(350), 256);
        assert_eq!(slots_in_segment(707), 512);
        assert_eq!(slots_in_segment(1400), 1024);
        assert_eq!(slots_in_segment(3000), 2048);
        assert_eq!(slots_in_segment(6000), 4096);
        assert_eq!(slots_in_segment(12000), 8192);
        assert_eq!(slots_in_segment(24000), 16384);
        assert_eq!(slots_in_segment(49000), 32768);
        assert_eq!(slots_in_segment(98000), 65536);
    }

    #[test]
    #[should_panic(expected = "attempt to add with overflow")]
    fn test_slots_in_segment_bounds() {
        // not a practical test, but eventually the function will overflow
        slots_in_segment(usize::MAX);
    }

    #[test]
    fn test_capacity_for_l() {
        assert_eq!(capacity_for_l(1), 4);
        assert_eq!(capacity_for_l(2), 16);
        assert_eq!(capacity_for_l(3), 64);
        assert_eq!(capacity_for_l(4), 256);
        assert_eq!(capacity_for_l(5), 1024);
        assert_eq!(capacity_for_l(6), 4096);
        assert_eq!(capacity_for_l(7), 16384);
        assert_eq!(capacity_for_l(8), 65536);
        assert_eq!(capacity_for_l(9), 262_144);
        assert_eq!(capacity_for_l(10), 1_048_576);
        assert_eq!(capacity_for_l(11), 4_194_304);
        assert_eq!(capacity_for_l(12), 16_777_216);
        assert_eq!(capacity_for_l(13), 67_108_864);
        assert_eq!(capacity_for_l(14), 268_435_456);
        assert_eq!(capacity_for_l(15), 1_073_741_824);
        assert_eq!(capacity_for_l(16), 4_294_967_296);
    }

    #[test]
    fn test_superblock_capacity() {
        // l cannot be zero, but segment numbers are 0-based
        assert_eq!(superblock_capacity(1), 2);
        assert_eq!(superblock_capacity(2), 3);
        assert_eq!(superblock_capacity(3), 6);
        assert_eq!(superblock_capacity(4), 12);
        assert_eq!(superblock_capacity(5), 24);
        assert_eq!(superblock_capacity(6), 48);
        assert_eq!(superblock_capacity(7), 96);
        assert_eq!(superblock_capacity(8), 192);
        assert_eq!(superblock_capacity(9), 384);
        assert_eq!(superblock_capacity(10), 768);
        assert_eq!(superblock_capacity(11), 1536);
        assert_eq!(superblock_capacity(12), 3072);
        assert_eq!(superblock_capacity(13), 6144);
        assert_eq!(superblock_capacity(14), 12288);
        assert_eq!(superblock_capacity(15), 24576);
        assert_eq!(superblock_capacity(16), 49152);
    }
}