61 lines
1.4 KiB
Rust
61 lines
1.4 KiB
Rust
use std::{
|
|
cmp::Ordering,
|
|
sync::{Arc, RwLock, RwLockReadGuard, RwLockWriteGuard},
|
|
};
|
|
|
|
use crate::Value;
|
|
|
|
#[derive(Debug, Clone)]
|
|
pub struct List(Arc<RwLock<Vec<Value>>>);
|
|
|
|
impl List {
|
|
pub fn new() -> Self {
|
|
List(Arc::new(RwLock::new(Vec::new())))
|
|
}
|
|
|
|
pub fn with_capacity(capacity: usize) -> Self {
|
|
List(Arc::new(RwLock::new(Vec::with_capacity(capacity))))
|
|
}
|
|
|
|
pub fn with_items(items: Vec<Value>) -> Self {
|
|
List(Arc::new(RwLock::new(items)))
|
|
}
|
|
|
|
pub fn items(&self) -> RwLockReadGuard<'_, Vec<Value>> {
|
|
self.0.read().unwrap()
|
|
}
|
|
|
|
pub fn items_mut(&self) -> RwLockWriteGuard<'_, Vec<Value>> {
|
|
self.0.write().unwrap()
|
|
}
|
|
}
|
|
|
|
impl Eq for List {}
|
|
|
|
impl PartialEq for List {
|
|
fn eq(&self, other: &Self) -> bool {
|
|
let left = self.0.read().unwrap().clone().into_iter();
|
|
let right = other.0.read().unwrap().clone().into_iter();
|
|
|
|
left.eq(right)
|
|
}
|
|
}
|
|
|
|
impl Ord for List {
|
|
fn cmp(&self, other: &Self) -> Ordering {
|
|
let left = self.0.read().unwrap().clone().into_iter();
|
|
let right = other.0.read().unwrap().clone().into_iter();
|
|
|
|
left.cmp(right)
|
|
}
|
|
}
|
|
|
|
impl PartialOrd for List {
|
|
fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
|
|
let left = self.0.read().unwrap().clone().into_iter();
|
|
let right = other.0.read().unwrap().clone().into_iter();
|
|
|
|
left.partial_cmp(right)
|
|
}
|
|
}
|