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
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
// Copyright (C) 2018  Project Tsukurou!
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program.  If not, see <https://www.gnu.org/licenses/>.

//! Structs and utilities offered by the List API.

use std::ops;

use value::Value;
use util::convert::{TryAsRef, TryAsMut};

mod iter;
pub use self::iter::{Iter, IterMut, IntoIter};

/// An ordered sequence of value elements.
#[derive(Debug, Clone, PartialEq)]
pub struct List<'a> {
    vec: Vec<Value<'a>>,
}

impl<'a> List<'a> {
    
    /// Constructs an empty list.
    ///
    /// # Examples
    ///
    /// ```
    /// use table::List;
    ///
    /// let list = List::new();
    /// assert!(list.is_empty());
    /// ```
    pub fn new() -> List<'a> {
        List {
            vec: Vec::new(),
        }
    }

    /// Constructs a list from an existing `Vec` of values.
    ///
    /// # Examples
    ///
    /// ```
    /// use table::{List, Value};
    ///
    /// let vec = vec![
    ///     Value::I64(8),
    ///     Value::Null,
    ///     Value::Bool(false)
    /// ];
    /// let list = List::with_vec(vec);
    /// assert_eq!(list.get(0), Some(&8));
    /// ```
    pub fn with_vec(vec: Vec<Value<'a>>) -> List<'a> {
        List {
            vec,
        }
    }
    
    /// Returns the number of elements in the list. Any indices in the range
    /// `0..list.len()` are guaranteed to be valid.
    ///
    /// # Examples
    ///
    /// ```
    /// use table::List;
    ///
    /// let mut list = List::new();
    /// assert_eq!(list.len(), 0);
    ///
    /// list.push("foo");
    /// assert_eq!(list.len(), 1);
    /// ```
    pub fn len(&self) -> usize {
        self.vec.len()
    }

    /// Returns `true` if and only if there are no elements in the list,
    /// meaning it is equivalent to `list.len() == 0`.
    /// 
    /// # Examples
    ///
    /// ```
    /// use table::List;
    ///
    /// let mut list = List::new();
    /// assert!(list.is_empty());
    ///
    /// list.push("bar");
    /// assert!(!list.is_empty());
    /// ```
    pub fn is_empty(&self) -> bool {
        self.len() == 0
    }

    /// Removes all elements in the list, resetting its length to zero.
    ///
    /// # Examples
    ///
    /// ```
    /// use table::List;
    ///
    /// let mut list = List::new();
    /// list.push(33);
    /// list.clear();
    /// assert!(list.is_empty());
    /// ```
    pub fn clear(&mut self) {
        self.vec.clear()
    }

    /// Attempts to retrieve a value and take reference to the inner value.
    /// Calling this method with the `T=Value` type parameter will not
    /// perform the conversion, instead returning a reference to the
    /// wrapping `Value` object.
    ///
    /// # Examples
    ///
    /// ```
    /// use table::{List, Value};
    ///
    /// let mut list = List::new();
    /// assert_eq!(list.get::<Value>(0), None);
    /// 
    /// list.push("spam");
    /// assert_eq!(list.get(0), Some("spam"))
    /// ```
    pub fn get<T>(&self, index: usize) -> Option<&T>
    where
        T: ?Sized,
        Value<'a>: TryAsRef<T>,
    {
        self.vec.get(index)
            .and_then(TryAsRef::try_as_ref)
    }

    /// Attempts to retrive a value and mutably reference the inner value.
    /// Calling this method with the `T=Value` type parameter will not perform
    /// the conversion, instead returning a reference to the wrapping `Value`
    /// object.
    ///
    /// # Examples
    ///
    /// ```
    /// use table::List;
    ///
    /// let mut list = List::new();
    /// list.push(33);
    /// *list.get_mut(0).unwrap() = 35;
    ///
    /// assert_eq!(list.get(0), Some(&35));
    /// ```
    pub fn get_mut<T>(&mut self, index: usize) -> Option<&mut T>
    where
        T: ?Sized,
        Value<'a>: TryAsMut<T>,
    {
        self.vec.get_mut(index)
            .and_then(TryAsMut::try_as_mut)
    }

    /// Inserts a value at the given index, moving all the elements after it
    /// forward one space.
    ///
    /// # Examples
    ///
    /// ```
    /// use table::List;
    ///
    /// let mut list = List::new();
    /// list.push(92);
    /// list.insert(0, "nay");
    /// assert_eq!(list.get(0), Some("nay"));
    /// ```
    pub fn insert<T>(&mut self, index: usize, value: T)
    where
        Value<'a>: From<T>,    
    {
        self.vec.insert(index, value.into());
    }

    /// Removes a value at the given index, moving all the elements after it
    /// backward one space.
    ///
    /// # Panics
    ///
    /// Panics if the given index is out of range.
    ///
    /// # Examples
    ///
    /// ```
    /// use table::{List, Value};
    ///
    /// let mut list = List::new();
    /// list.push(93);
    /// list.push(84);
    /// assert_eq!(list.remove(0), Value::I64(93));
    /// assert_eq!(list.get(0), Some(&84));
    /// ```
    pub fn remove(&mut self, index: usize) -> Value<'a> {
        self.vec.remove(index)
    }

    /// Appends a value to the end of the list.
    ///
    /// # Examples
    ///
    /// ```
    /// use table::List;
    ///
    /// let mut list = List::new();
    /// list.push("ok");
    /// assert_eq!(list.get(0), Some("ok"))
    /// ```
    pub fn push<T>(&mut self, value: T)
    where
        Value<'a>: From<T>,
    {
        self.vec.push(value.into())
    }

    /// Takes the value from the end of the list and returns it, or returns
    /// `None` if the list is empty.
    ///
    /// # Examples
    ///
    /// ```
    /// use table::{List, Value};
    ///
    /// let mut list = List::new();
    /// list.push(99);
    /// assert_eq!(list.pop(), Some(Value::I64(99)));
    /// assert_eq!(list.pop(), None);
    /// ```
    pub fn pop(&mut self) -> Option<Value<'a>> {
        self.vec.pop()
    }

    /// Returns a borrowing iterator over the elements in the list.
    ///
    /// # Examples
    ///
    /// ```
    /// use table::{List, Value};
    ///
    /// let mut list = List::new();
    /// list.push("a");
    /// list.push(6);
    ///
    /// let mut iter = list.iter();
    /// assert_eq!(iter.next(), Some(&Value::from("a")));
    /// assert_eq!(iter.next(), Some(&Value::I64(6)));
    /// assert_eq!(iter.next(), None);
    /// ```
    pub fn iter<'b>(&'b self) -> Iter<'a, 'b> {
        self.into_iter()
    }

    /// Returns a mutably borrowing iterator over the elements in the list.
    ///
    /// # Examples
    ///
    /// ```
    /// use table::{List, Value};
    ///
    /// let mut list = List::new();
    /// list.push("a");
    /// list.push(8);
    ///
    /// for (i, elem) in list.iter_mut().enumerate() {
    ///     *elem = Value::from(i);
    /// }
    ///
    /// assert_eq!(list.get(0), Some(&0));
    /// assert_eq!(list.get(1), Some(&1));
    /// ```
    pub fn iter_mut<'b>(&'b mut self) -> IterMut<'a, 'b> {
        self.into_iter()
    }
}

impl<'a> ops::Index<usize> for List<'a> {
    type Output = Value<'a>;

    fn index(&self, index: usize) -> &Self::Output {
        self.get(index).unwrap()
    }
}

impl<'a> ops::IndexMut<usize> for List<'a> {
    fn index_mut(&mut self, index: usize) -> &mut Self::Output {
        self.get_mut(index).unwrap()
    }
}

impl<'a> ops::Deref for List<'a> {
    type Target = [Value<'a>];

    fn deref(&self) -> &[Value<'a>] {
        self.vec.deref()
    }
}