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
90
91
92
93
94
95
|
//! This module implements Nix lists.
use std::ops::Index;
use std::rc::Rc;
use serde::Deserialize;
use super::thunk::ThunkSet;
use super::TotalDisplay;
use super::Value;
#[repr(transparent)]
#[derive(Clone, Debug, Deserialize)]
pub struct NixList(Rc<Vec<Value>>);
impl TotalDisplay for NixList {
fn total_fmt(&self, f: &mut std::fmt::Formatter<'_>, set: &mut ThunkSet) -> std::fmt::Result {
f.write_str("[ ")?;
for v in self {
v.total_fmt(f, set)?;
f.write_str(" ")?;
}
f.write_str("]")
}
}
impl From<Vec<Value>> for NixList {
fn from(vs: Vec<Value>) -> Self {
Self(Rc::new(vs))
}
}
impl NixList {
pub fn len(&self) -> usize {
self.0.len()
}
pub fn get(&self, i: usize) -> Option<&Value> {
self.0.get(i)
}
pub fn is_empty(&self) -> bool {
self.0.is_empty()
}
pub fn construct(count: usize, stack_slice: Vec<Value>) -> Self {
debug_assert!(
count == stack_slice.len(),
"NixList::construct called with count == {}, but slice.len() == {}",
count,
stack_slice.len(),
);
NixList(Rc::new(stack_slice))
}
pub fn iter(&self) -> std::slice::Iter<Value> {
self.0.iter()
}
pub fn ptr_eq(&self, other: &Self) -> bool {
Rc::ptr_eq(&self.0, &other.0)
}
pub fn into_inner(self) -> Vec<Value> {
Rc::try_unwrap(self.0).unwrap_or_else(|rc| (*rc).clone())
}
}
impl IntoIterator for NixList {
type Item = Value;
type IntoIter = std::vec::IntoIter<Value>;
fn into_iter(self) -> Self::IntoIter {
self.into_inner().into_iter()
}
}
impl<'a> IntoIterator for &'a NixList {
type Item = &'a Value;
type IntoIter = std::slice::Iter<'a, Value>;
fn into_iter(self) -> Self::IntoIter {
self.0.iter()
}
}
impl Index<usize> for NixList {
type Output = Value;
fn index(&self, index: usize) -> &Self::Output {
&self.0[index]
}
}
|
