|
| 1 | +use std::{ |
| 2 | + fmt, |
| 3 | + sync::{Arc, RwLock}, |
| 4 | +}; |
| 5 | + |
| 6 | +#[derive(Debug, Clone)] |
| 7 | +pub struct Inner<T> { |
| 8 | + pub items: Vec<Option<Arc<RwLock<T>>>>, |
| 9 | + pub free_list: Vec<usize>, |
| 10 | +} |
| 11 | + |
| 12 | +impl<T> Default for Inner<T> { |
| 13 | + fn default() -> Self { |
| 14 | + Self { |
| 15 | + items: Default::default(), |
| 16 | + free_list: Default::default(), |
| 17 | + } |
| 18 | + } |
| 19 | +} |
| 20 | + |
| 21 | +#[derive(Debug)] |
| 22 | +pub(crate) struct ConcurrentSlabMut<T> { |
| 23 | + pub inner: RwLock<Inner<T>>, |
| 24 | +} |
| 25 | + |
| 26 | +impl<T> Clone for ConcurrentSlabMut<T> |
| 27 | +where |
| 28 | + T: Clone, |
| 29 | +{ |
| 30 | + fn clone(&self) -> Self { |
| 31 | + let inner = self.inner.read().unwrap(); |
| 32 | + Self { |
| 33 | + inner: RwLock::new(inner.clone()), |
| 34 | + } |
| 35 | + } |
| 36 | +} |
| 37 | + |
| 38 | +impl<T> Default for ConcurrentSlabMut<T> { |
| 39 | + fn default() -> Self { |
| 40 | + Self { |
| 41 | + inner: Default::default(), |
| 42 | + } |
| 43 | + } |
| 44 | +} |
| 45 | + |
| 46 | +pub struct ListDisplay<I> { |
| 47 | + pub list: I, |
| 48 | +} |
| 49 | + |
| 50 | +impl<I: IntoIterator + Clone> fmt::Display for ListDisplay<I> |
| 51 | +where |
| 52 | + I::Item: fmt::Display, |
| 53 | +{ |
| 54 | + fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { |
| 55 | + let fmt_elems = self |
| 56 | + .list |
| 57 | + .clone() |
| 58 | + .into_iter() |
| 59 | + .enumerate() |
| 60 | + .map(|(i, value)| format!("{i:<10}\t->\t{value}")) |
| 61 | + .collect::<Vec<_>>(); |
| 62 | + write!(f, "{}", fmt_elems.join("\n")) |
| 63 | + } |
| 64 | +} |
| 65 | + |
| 66 | +impl<T> ConcurrentSlabMut<T> |
| 67 | +where |
| 68 | + T: Clone, |
| 69 | +{ |
| 70 | + #[allow(dead_code)] |
| 71 | + pub fn len(&self) -> usize { |
| 72 | + let inner = self.inner.read().unwrap(); |
| 73 | + inner.items.len() |
| 74 | + } |
| 75 | + |
| 76 | + #[allow(dead_code)] |
| 77 | + pub fn values(&self) -> Vec<Arc<RwLock<T>>> { |
| 78 | + let inner = self.inner.read().unwrap(); |
| 79 | + inner.items.iter().filter_map(|x| x.clone()).collect() |
| 80 | + } |
| 81 | + |
| 82 | + pub fn insert(&self, value: T) -> usize { |
| 83 | + self.insert_arc(Arc::new(RwLock::new(value))) |
| 84 | + } |
| 85 | + |
| 86 | + pub fn insert_arc(&self, value: Arc<RwLock<T>>) -> usize { |
| 87 | + let mut inner = self.inner.write().unwrap(); |
| 88 | + |
| 89 | + if let Some(free) = inner.free_list.pop() { |
| 90 | + assert!(inner.items[free].is_none()); |
| 91 | + inner.items[free] = Some(value); |
| 92 | + free |
| 93 | + } else { |
| 94 | + inner.items.push(Some(value)); |
| 95 | + inner.items.len() - 1 |
| 96 | + } |
| 97 | + } |
| 98 | + |
| 99 | + pub fn get(&self, index: usize) -> Arc<RwLock<T>> { |
| 100 | + let inner = self.inner.read().unwrap(); |
| 101 | + inner.items[index] |
| 102 | + .as_ref() |
| 103 | + .expect("invalid slab index for ConcurrentSlab::get") |
| 104 | + .clone() |
| 105 | + } |
| 106 | + |
| 107 | + #[allow(dead_code)] |
| 108 | + pub fn retain(&self, predicate: impl Fn(&usize, &mut Arc<RwLock<T>>) -> bool) { |
| 109 | + let mut inner = self.inner.write().unwrap(); |
| 110 | + |
| 111 | + let Inner { items, free_list } = &mut *inner; |
| 112 | + for (idx, item) in items.iter_mut().enumerate() { |
| 113 | + if let Some(arc) = item { |
| 114 | + if !predicate(&idx, arc) { |
| 115 | + free_list.push(idx); |
| 116 | + item.take(); |
| 117 | + } |
| 118 | + } |
| 119 | + } |
| 120 | + } |
| 121 | + |
| 122 | + #[allow(dead_code)] |
| 123 | + pub fn clear(&self) { |
| 124 | + let mut inner = self.inner.write().unwrap(); |
| 125 | + inner.items.clear(); |
| 126 | + inner.items.shrink_to(0); |
| 127 | + |
| 128 | + inner.free_list.clear(); |
| 129 | + inner.free_list.shrink_to(0); |
| 130 | + } |
| 131 | +} |
0 commit comments