thruput-sdk 0.58.0

use super::deletable::Deletable;
use super::keypath::{FramedComponent, Keypath};
use super::map::Map;
use super::node::StorageType;
use super::slot::{SlotMut, SlotRef};
use super::value::Value;
use crate::exn::NoneIfMissing;
use core::fmt::Debug;

/// Element slots are keyed by the element index (`u32`); see [`Map`] for the
/// key-encoding injectivity invariant that governs the underlying derivation.
///
/// # Concurrency
///
/// `len` is a plain storage value that every structural mutation —
/// [`push_with`](Self::push_with), [`push_empty_slot`](Self::push_empty_slot),
/// [`pop`](Self::pop) — reads and rewrites under an exclusive lock. Of a set
/// of concurrent transactions that grow or shrink the same vector, only one
/// can be included in a block; the rest conflict at commit. A `Vector` is
/// therefore a poor fit for hot append paths (an event log every caller pushes
/// to, say) — prefer keying a [`Map`] by something caller-specific, or a
/// mergeable counter like [`NNInt`](super::NNInt), when concurrent writers
/// matter. Element reads and in-place element writes through
/// [`at`](Self::at)/[`at_mut`](Self::at_mut) read `len` for their bounds check
/// but never rewrite it; apart from that read they carry only the
/// per-element storage semantics.
pub struct Vector<S> {
    keypath: Keypath,
    len: Value<u32>,
    values: Map<u32, S>,
}

impl<S> Debug for Vector<S> {
    fn fmt(&self, f: &mut core::fmt::Formatter<'_>) -> core::fmt::Result {
        f.debug_struct("Vector")
            .field("keypath", &self.keypath)
            .field("len", &self.len)
            .finish_non_exhaustive()
    }
}

impl<S> From<Keypath> for Vector<S> {
    fn from(keypath: Keypath) -> Self {
        // Fixed layout slots (0 = len, 1 = values), pre-framed at const
        // time: state-load appends constant bytes instead of runtime-CXS-
        // encoding through the scratch buffer. Element slots stay runtime-
        // derived (indices are dynamic).
        const LEN_SLOT: FramedComponent = FramedComponent::from_u32(0);
        const VALUES_SLOT: FramedComponent = FramedComponent::from_u32(1);
        let len_kp = keypath.child_framed(&LEN_SLOT);
        let values_kp = keypath.child_framed(&VALUES_SLOT);

        Self {
            keypath,
            len: Value::from(len_kp),
            values: Map::from(values_kp),
        }
    }
}

impl<S> super::sealed::Sealed for Vector<S> {}
impl<S> super::node::StorageType for Vector<S> {}

impl<S> Vector<S> {
    pub fn keypath(&self) -> &Keypath {
        &self.keypath
    }
}

impl<S: StorageType> Vector<S> {
    /// Current logical extent (number of in-bounds indices).
    ///
    /// A missing len slot reads as 0 (a never-written vector is empty).
    /// Any other failure — a value at the slot that is not a `u32`, a
    /// wrong storage type, a host fault — aborts typed like every other
    /// storage accessor, instead of masquerading as an empty vector.
    ///
    /// Vector slots are sparse-capable: callers may delete element storage
    /// without shrinking len, so an in-bounds index does not guarantee that
    /// the slot currently has backing data.
    pub fn len(&self) -> u32 {
        self.len.try_get().none_if_missing().unwrap_or(0)
    }

    /// Returns true if the vector contains no elements.
    pub fn is_empty(&self) -> bool {
        self.len() == 0
    }

    /// Borrow element at `index` (bounds-checked).
    pub fn at(&self, index: u32) -> SlotRef<'_, Self, S> {
        self.bounds_check(index);
        let keypath = self.make_elem_keypath(index);
        let slot = S::from(keypath);
        SlotRef::new(self, slot)
    }

    /// Mutably borrow element at `index` (bounds-checked).
    ///
    /// For a `Deletable` element type the returned slot is itself
    /// [`Deletable`], and deleting it removes only that element's storage:
    /// `len` is unchanged, `index` stays in bounds, and the slot reads back
    /// as missing. Elements do not shift down and the hole is not reused by
    /// a later push. After any element delete, read with `try_get` +
    /// [`none_if_missing`](crate::exn::NoneIfMissing::none_if_missing) —
    /// `get` aborts on a hole — and treat [`len`](Self::len) as a high-water
    /// mark rather than a count of live elements. To reset the vector
    /// entirely, delete the `Vector` itself, which clears `len` too.
    pub fn at_mut(&mut self, index: u32) -> SlotMut<'_, Self, S> {
        self.bounds_check(index);
        let keypath = self.make_elem_keypath(index);
        let slot = S::from(keypath);
        SlotMut::new(self, slot)
    }

    /// Allocate a new sparse-capable slot at the end and return a mutable
    /// handle to it.
    ///
    /// This increments len before the returned slot is written, making the new
    /// index immediately in-bounds for the rest of the invocation.
    ///
    /// Writes `len` under an exclusive lock, so concurrent same-block pushes
    /// conflict at commit — see the Concurrency notes on [`Vector`].
    #[must_use = "push_empty_slot increments len immediately; dropping the slot leaves it uninitialized. Use push_with to initialize atomically, or bind with `let _ = ...` if an empty slot is intentional."]
    pub fn push_empty_slot(&mut self) -> SlotMut<'_, Self, S> {
        let idx = self.len();
        let new_len = idx.checked_add(1).unwrap();
        self.len.set_exclusive(&new_len);
        let keypath = self.make_elem_keypath(idx);
        let slot = S::from(keypath);
        SlotMut::new(self, slot)
    }

    /// Construct a new slot at the end, initialize it through `f`, then make
    /// the index visible by incrementing len.
    ///
    /// If `f` panics or traps, the entire invocation frame faults and reverts,
    /// so neither the slot data nor the len increment are committed.
    ///
    /// Writes `len` under an exclusive lock, so concurrent same-block pushes
    /// conflict at commit — see the Concurrency notes on [`Vector`].
    pub fn push_with<R>(&mut self, f: impl FnOnce(&mut S) -> R) -> R {
        let idx = self.len();
        let mut slot = S::from(self.make_elem_keypath(idx));
        let out = f(&mut slot);
        let new_len = idx.checked_add(1).unwrap();
        self.len.set_exclusive(&new_len);
        out
    }

    /// Iterate over all elements. Yields read-only `SlotRef` handles.
    /// Holds a shared borrow on the vector, preventing structural
    /// modifications (`push_with`/`push_empty_slot`/pop/at_mut) while the
    /// iterator is alive.
    pub fn iter(&self) -> VectorIter<'_, S> {
        VectorIter {
            vec: self,
            index: 0,
            len: self.len(),
        }
    }

    /// Iterate over all elements with mutable access. Yields owned
    /// storage handles that may be used for mutations. Holds an
    /// exclusive borrow on the vector.
    pub fn iter_mut(&mut self) -> VectorIterMut<'_, S> {
        let len = self.len();
        VectorIterMut {
            vec: self,
            index: 0,
            len,
        }
    }

    fn bounds_check(&self, index: u32) {
        let len = self.len();
        if index >= len {
            super::error::oob_throw(len as u64, index as u64);
        }
    }

    fn make_elem_keypath(&self, index: u32) -> Keypath {
        self.values.keypath().child(&index)
    }
}

impl<S: StorageType + Deletable> Vector<S> {
    /// Remove the last element, deleting its storage.
    /// Aborts if the vector is empty.
    ///
    /// Writes `len` under an exclusive lock, so concurrent same-block
    /// structural mutations conflict at commit — see the Concurrency notes on
    /// [`Vector`].
    pub fn pop(&mut self) {
        let len = self.len();
        if len == 0 {
            super::error::oob_throw(0, 0);
        }
        let new_len = len - 1;
        let mut elem = S::from(self.make_elem_keypath(new_len));
        elem.delete_exclusive();
        self.len.set_exclusive(&new_len);
    }

    /// Delete the storage of the element at `index` (bounds-checked).
    ///
    /// Shorthand for `at_mut(index).delete()`. This leaves a hole rather than
    /// removing the element: `len` is untouched and `index` stays in bounds.
    /// See [`at_mut`](Self::at_mut) for the full sparse-vector semantics, and
    /// [`pop`](Self::pop) to actually shrink the vector.
    #[inline(always)]
    pub fn delete_at(&mut self, index: u32) {
        self.at_mut(index).delete();
    }
}

impl<S: StorageType + Deletable> Deletable for Vector<S> {
    fn delete_internal(&mut self, exclusive: bool) {
        let len = self.len();
        for i in 0..len {
            let mut elem = S::from(self.make_elem_keypath(i));
            elem.delete_internal(exclusive);
        }
        self.len.delete_internal(exclusive);
    }
}

/// Iterator over vector elements (shared borrow, read-only).
pub struct VectorIter<'a, S> {
    vec: &'a Vector<S>,
    index: u32,
    len: u32,
}

impl<'a, S: StorageType> Iterator for VectorIter<'a, S> {
    type Item = SlotRef<'a, Vector<S>, S>;

    fn next(&mut self) -> Option<Self::Item> {
        if self.index >= self.len {
            return None;
        }
        let elem = S::from(self.vec.make_elem_keypath(self.index));
        self.index += 1;
        Some(SlotRef::new(self.vec, elem))
    }

    fn size_hint(&self) -> (usize, Option<usize>) {
        let remaining = (self.len - self.index) as usize;
        (remaining, Some(remaining))
    }
}

impl<S: StorageType> ExactSizeIterator for VectorIter<'_, S> {}

impl<'a, S: StorageType> DoubleEndedIterator for VectorIter<'a, S> {
    fn next_back(&mut self) -> Option<Self::Item> {
        if self.index >= self.len {
            return None;
        }
        self.len -= 1;
        let elem = S::from(self.vec.make_elem_keypath(self.len));
        Some(SlotRef::new(self.vec, elem))
    }
}

/// Iterator over vector elements (exclusive borrow).
pub struct VectorIterMut<'a, S> {
    vec: &'a mut Vector<S>,
    index: u32,
    len: u32,
}

impl<'a, S: StorageType> Iterator for VectorIterMut<'a, S> {
    type Item = SlotMut<'a, Vector<S>, S>;

    fn next(&mut self) -> Option<Self::Item> {
        if self.index >= self.len {
            return None;
        }
        let elem = S::from(self.vec.make_elem_keypath(self.index));
        self.index += 1;
        // SAFETY: the iterator holds &'a mut Vector<S>, ensuring
        // exclusive access to the vector for 'a.
        Some(SlotMut::new_detached(elem))
    }

    fn size_hint(&self) -> (usize, Option<usize>) {
        let remaining = (self.len - self.index) as usize;
        (remaining, Some(remaining))
    }
}

impl<S: StorageType> ExactSizeIterator for VectorIterMut<'_, S> {}

impl<'a, S: StorageType> DoubleEndedIterator for VectorIterMut<'a, S> {
    fn next_back(&mut self) -> Option<Self::Item> {
        if self.index >= self.len {
            return None;
        }
        self.len -= 1;
        let elem = S::from(self.vec.make_elem_keypath(self.len));
        Some(SlotMut::new_detached(elem))
    }
}

impl<'a, S: StorageType> IntoIterator for &'a Vector<S> {
    type Item = SlotRef<'a, Vector<S>, S>;
    type IntoIter = VectorIter<'a, S>;

    fn into_iter(self) -> Self::IntoIter {
        self.iter()
    }
}

impl<'a, S: StorageType> IntoIterator for &'a mut Vector<S> {
    type Item = SlotMut<'a, Vector<S>, S>;
    type IntoIter = VectorIterMut<'a, S>;

    fn into_iter(self) -> Self::IntoIter {
        self.iter_mut()
    }
}

#[cfg(test)]
mod test_vector_slots {
    use super::*;
    use crate::storage::Value;

    // Drift guard: the const-framed fixed slots (0 = len, 1 = values)
    // must address exactly what runtime child() derives.
    crate::contract_test!(fixed_slots_match_runtime_child {
        let root = Keypath::default().child("V");
        let v: Vector<Value<u32>> = Vector::from(root.clone());
        assert_eq!(*v.len.key(), root.child(&0u32).generate_key());
        assert!(v.values.keypath().addresses_same_slot(&root.child(&1u32)));
        assert!(v.keypath().addresses_same_slot(&root));
    });
}