1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
use {OverError, OverResult};
use std::cell::RefCell;
use std::rc::Rc;
use types::Type;
use value::Value;
#[derive(Clone, Debug)]
struct TupInner {
vec: Vec<Value>,
tvec: Vec<Type>,
}
#[derive(Clone, Debug)]
pub struct Tup {
inner: Rc<RefCell<TupInner>>,
}
impl Tup {
pub fn from_vec(values: Vec<Value>) -> Tup {
let tvec: Vec<Type> = values.iter().map(|val| val.get_type()).collect();
let vec = values;
Tup { inner: Rc::new(RefCell::new(TupInner { vec, tvec })) }
}
pub fn get_type(&self) -> Vec<Type> {
self.inner.borrow().tvec.clone()
}
pub fn get(&self, index: usize) -> OverResult<Value> {
let inner = self.inner.borrow();
if index >= inner.vec.len() {
Err(OverError::TupOutOfBounds(index))
} else {
Ok(inner.vec[index].clone())
}
}
pub fn len(&self) -> usize {
self.inner.borrow().vec.len()
}
pub fn is_empty(&self) -> bool {
self.inner.borrow().vec.is_empty()
}
pub fn ptr_eq(&self, other: &Self) -> bool {
Rc::ptr_eq(&self.inner, &other.inner)
}
pub fn set(&mut self, index: usize, value: Value) -> OverResult<()> {
let mut inner = self.inner.borrow_mut();
if index >= inner.vec.len() {
Err(OverError::TupOutOfBounds(index))
} else {
inner.vec[index] = value;
Ok(())
}
}
}
impl PartialEq for Tup {
fn eq(&self, other: &Self) -> bool {
let inner = self.inner.borrow();
let other_inner = other.inner.borrow();
if inner.tvec != other_inner.tvec {
return false;
}
inner.vec == other_inner.vec
}
}