computer: fix stateful

crates/brk_vec/src/traits/generic.rs

@@ -1,5 +1,6 @@
 use std::{
     borrow::Cow,
+    cmp::Ordering,
     collections::{BTreeMap, BTreeSet},
     fs::{self, File, OpenOptions},
     io::{self, Seek, SeekFrom, Write},
@@ -85,20 +86,68 @@ where
         self.mut_pushed().push(value)
     }
 
+    #[inline]
+    fn update_or_push(&mut self, index: I, value: T) -> Result<()> {
+        let len = self.len();
+        match len.cmp(&index.to_usize()?) {
+            Ordering::Less => {
+                dbg!(index, value, len, self.header());
+                Err(Error::IndexTooHigh)
+            }
+            Ordering::Equal => {
+                self.push(value);
+                Ok(())
+            }
+            Ordering::Greater => self.update(index, value),
+        }
+    }
+
+    fn get_first_empty_index(&self) -> I {
+        self.holes()
+            .first()
+            .cloned()
+            .unwrap_or_else(|| self.len_())
+            .into()
+    }
+
+    #[inline]
+    fn fill_first_hole_or_push(&mut self, value: T) -> Result<I> {
+        Ok(
+            if let Some(hole) = self.mut_holes().pop_first().map(I::from) {
+                self.update(hole, value)?;
+                hole
+            } else {
+                self.push(value);
+                I::from(self.len() - 1)
+            },
+        )
+    }
+
     fn holes(&self) -> &BTreeSet<usize>;
     fn mut_holes(&mut self) -> &mut BTreeSet<usize>;
     fn take(&mut self, index: I, mmap: &Mmap) -> Result<Option<T>> {
         let opt = self.get_or_read(index, mmap)?.map(|v| v.into_owned());
         if opt.is_some() {
-            let uindex = index.unwrap_to_usize();
-            let updated = self.mut_updated();
-            if !updated.is_empty() {
-                updated.remove(&uindex);
-            }
-            self.mut_holes().insert(uindex);
+            self.unchecked_delete(index);
         }
         Ok(opt)
     }
+    #[inline]
+    fn delete(&mut self, index: I) {
+        if index.unwrap_to_usize() < self.len() {
+            self.unchecked_delete(index);
+        }
+    }
+    #[inline]
+    #[doc(hidden)]
+    fn unchecked_delete(&mut self, index: I) {
+        let uindex = index.unwrap_to_usize();
+        let updated = self.mut_updated();
+        if !updated.is_empty() {
+            updated.remove(&uindex);
+        }
+        self.mut_holes().insert(uindex);
+    }
 
     fn updated(&self) -> &BTreeMap<usize, T>;
     fn mut_updated(&mut self) -> &mut BTreeMap<usize, T>;

crates/brk_vec/src/variants/indexed.rs

@@ -38,6 +38,30 @@ where
         self.0.get_or_read(index, mmap)
     }
 
+    #[inline]
+    pub fn update_or_push(&mut self, index: I, value: T) -> Result<()> {
+        self.0.update_or_push(index, value)
+    }
+
+    #[inline]
+    pub fn checked_push(&mut self, index: I, value: T) -> Result<()> {
+        let len = self.0.len();
+        match len.cmp(&index.to_usize()?) {
+            Ordering::Greater => {
+                dbg!(index, value, len, self.0.header());
+                Err(Error::IndexTooLow)
+            }
+            Ordering::Equal => {
+                self.0.push(value);
+                Ok(())
+            }
+            Ordering::Less => {
+                dbg!(index, value, len, self.0.header());
+                Err(Error::IndexTooHigh)
+            }
+        }
+    }
+
     #[inline]
     pub fn push_if_needed(&mut self, index: I, value: T) -> Result<()> {
         let len = self.0.len();
@@ -58,6 +82,23 @@ where
         }
     }
 
+    #[inline]
+    pub fn fill_first_hole_or_push(&mut self, value: T) -> Result<I> {
+        self.0.fill_first_hole_or_push(value)
+    }
+
+    pub fn update(&mut self, index: I, value: T) -> Result<()> {
+        self.0.update(index, value)
+    }
+
+    pub fn take(&mut self, index: I, mmap: &Mmap) -> Result<Option<T>> {
+        self.0.take(index, mmap)
+    }
+
+    pub fn delete(&mut self, index: I) {
+        self.0.delete(index)
+    }
+
     fn update_height(&mut self, height: Height) {
         self.0.mut_header().update_height(height);
     }