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
314
315
316
317
// Copyright 2015-2017 Daniel P. Clark & array_tool Developers
//
// Licensed under the Apache License, Version 2.0, <LICENSE-APACHE or
// http://apache.org/licenses/LICENSE-2.0> or the MIT license <LICENSE-MIT or
// http://opensource.org/licenses/MIT>, at your option. This file may not be
// copied, modified, or distributed except according to those terms.

/// Several different methods for getting, or evaluating, uniqueness.
pub trait Uniq<T> {
  /// `uniq` returns a vector of unique values within itself as compared to
  /// the other vector which is provided as an input parameter.
  ///
  /// # Example
  /// ```
  /// use array_tool::vec::Uniq;
  ///
  /// vec![1,2,3,4,5,6].uniq( vec![1,2,5,7,9] );
  /// ```
  ///
  /// # Output
  /// ```text
  /// vec![3,4,6]
  /// ```
  fn uniq(&self, other: Self) -> Self;

  /// `unique` removes duplicates from within the vector and returns Self.
  ///
  /// # Example
  /// ```
  /// use array_tool::vec::Uniq;
  ///
  /// vec![1,2,1,3,2,3,4,5,6].unique();
  /// ```
  ///
  /// # Output
  /// ```text
  /// vec![1,2,3,4,5,6]
  /// ```
  fn unique(&self) -> Self;

  /// `is_unique` returns boolean value on whether all values within
  /// Self are unique.
  ///
  /// # Example
  /// ```
  /// use array_tool::vec::Uniq;
  ///
  /// vec![1,2,1,3,4,3,4,5,6].is_unique();
  /// ```
  ///
  /// # Output
  /// ```text
  /// false
  /// ```
  fn is_unique(&self) -> bool;

  /// `uniq_via` returns a vector of unique values within itself as compared to
  /// the other vector which is provided as an input parameter, as defined by a
  /// provided custom comparator.
  ///
  /// # Example
  /// ```
  /// use array_tool::vec::Uniq;
  ///
  /// vec![1,2,3,4,5,6].uniq_via( vec![1,2,5,7,9], |&l, r| l == r + 2 );
  /// ```
  ///
  /// # Output
  /// ```text
  /// vec![1,2,4,6]
  /// ```
  fn uniq_via<F: Fn(&T, &T) -> bool>(&self, other: Self, f: F) -> Self;

  /// `unique_via` removes duplicates, as defined by a provided custom comparator,
  /// from within the vector and returns Self.
  ///
  /// # Example
  /// ```
  /// use array_tool::vec::Uniq;
  ///
  /// vec![1.0,2.0,1.4,3.3,2.1,3.5,4.6,5.2,6.2].unique_via( |l: &f64, r: &f64| l.floor() == r.floor() );
  /// ```
  ///
  /// # Output
  /// ```text
  /// vec![1.0,2.0,3.3,4.6,5.2,6.2]
  /// ```
  fn unique_via<F: Fn(&T, &T) -> bool>(&self, f: F) -> Self;

  /// `is_unique_via` returns boolean value on whether all values within
  /// Self are unique, as defined by a provided custom comparator.
  ///
  /// # Example
  /// ```
  /// use array_tool::vec::Uniq;
  ///
  /// vec![1.0,2.0,1.4,3.3,2.1,3.5,4.6,5.2,6.2].is_unique_via( |l: &f64, r: &f64| l.floor() == r.floor() );
  /// ```
  ///
  /// # Output
  /// ```text
  /// false
  /// ```
  fn is_unique_via<F: Fn(&T, &T) -> bool>(&self, f: F) -> bool;
}

impl<T: Clone + PartialEq> Uniq<T> for Vec<T> {
  fn uniq(&self, other: Vec<T>) -> Vec<T> {
    self.uniq_via(other, |lhs, rhs| lhs == rhs)
  }
  fn unique(&self) -> Vec<T> {
    self.unique_via(|lhs, rhs| lhs == rhs)
  }
  fn is_unique(&self) -> bool {
    self.is_unique_via(|lhs, rhs| lhs == rhs)
  }

  fn uniq_via<F: Fn(&T, &T) -> bool>(&self, other: Vec<T>, f: F) -> Vec<T> {
    let mut out = self.unique();
    for x in other.unique() {
      for y in (0..out.len()).rev() {
        if f(&x, &out[y]) {
          out.remove(y);
        }
      }
    }
    out
  }
  fn unique_via<F: Fn(&T, &T) -> bool>(&self, f: F) -> Vec<T> {
    let mut a = self.clone();
    for x in (0..a.len()).rev() {
      for y in (x+1..a.len()).rev() {
        if f(&a[x], &a[y]) {
          a.remove(y);
        }
      }
    }
    a
  }
  fn is_unique_via<F: Fn(&T, &T) -> bool>(&self, f: F) -> bool {
    let mut a = true;
    for x in 0..self.len() {
      for y in x+1..self.len() {
        if f(&self[x], &self[y]) {
          a = false;
          break;
        }
      }
    }
    a
  }
}

/// Removes, or Adds, the first element of self.
pub trait Shift<T> {
  /// Removes and returns the first item from the vector
  ///
  /// # Example
  /// ```
  /// use array_tool::vec::Shift;
  ///
  /// let mut x = vec![0,1,2,3];
  /// assert_eq!(x.shift(), 0);
  /// assert_eq!(x, vec![1,2,3]);
  /// ```
  fn shift(&mut self) -> T;
  /// Insert item at the beginning of the vector.  No return value.
  ///
  /// # Example
  /// ```
  /// use array_tool::vec::Shift;
  ///
  /// let mut x = vec![1,2,3];
  /// x.unshift(0);
  /// assert_eq!(x, vec![0,1,2,3]);
  /// ```
  fn unshift(&mut self, other: T);
}
impl<T: PartialEq> Shift<T> for Vec<T> {
  fn shift(&mut self) -> T {
    self.remove(0)
  }
  fn unshift(&mut self, other: T) {
    &self.insert(0, other);
  }
}

/// Set Intersection — Returns a new array containing elements common to the two arrays,
/// excluding any duplicates. The order is preserved from the original array.
pub trait Intersect<T> {
  /// # Example
  /// ```
  /// use array_tool::vec::Intersect;
  ///
  /// vec![1,1,3,5].intersect(vec![1,2,3]);
  /// ```
  ///
  /// # Output
  /// ```text
  /// vec![1,3]
  /// ```
  fn intersect(&self, Self) -> Self;
  /// # Example
  /// ```
  /// # use std::ascii::AsciiExt;
  /// use array_tool::vec::Intersect;
  ///
  /// vec!['a','a','c','e'].intersect_if(vec!['A','B','C'], |l, r| l.eq_ignore_ascii_case(r));
  /// ```
  ///
  /// # Output
  /// ```text
  /// vec!['a','c']
  /// ```
  fn intersect_if<F: Fn(&T, &T) -> bool>(&self, Self, validator: F) -> Self;
}
impl<T: PartialEq + Clone> Intersect<T> for Vec<T> {
  fn intersect(&self, other: Vec<T>) -> Vec<T> {
    self.intersect_if(other, |l, r| l == r)
  }
  fn intersect_if<F: Fn(&T, &T) -> bool>(&self, other: Self, validator: F) -> Self {
    let mut out = vec![];
    let a = self.unique();
    let length = other.len();
    for x in a {
      for y in 0..length {
        if validator(&x, &other[y]) {
          out.push(x);
          break;
        }
      }
    }
    out
  }
}

/// Join vector of ToString capable things to a String with given delimiter.
pub trait Join {
  /// # Example
  /// ```
  /// use array_tool::vec::Join;
  ///
  /// vec![1,2,3].join(",");
  /// ```
  ///
  /// # Output
  /// ```text
  /// "1,2,3"
  /// ```
  fn join(&self, joiner: &'static str) -> String;
}
impl<T: ToString> Join for Vec<T> {
  fn join(&self, joiner: &'static str) -> String {
    let mut out = String::from("");
    for x in 0..self.len() {
      out.push_str(&self[x].to_string());
      if x < self.len()-1 {
        out.push_str(&joiner)
      }
    }
    out
  }
}

/// Expand and duplicate the vectors content `times` the integer given
pub trait Times {
  /// # Example
  /// ```
  /// use array_tool::vec::Times;
  ///
  /// vec![1,2,3].times(3);
  /// ```
  ///
  /// # Output
  /// ```text
  /// vec![1,2,3,1,2,3,1,2,3]
  /// ```
  fn times(&self, qty: i32) -> Self;
}
impl<T: Clone> Times for Vec<T> {
  fn times(&self, qty: i32) -> Vec<T> {
    if self.is_empty() { return vec![] };
    let mut out = vec![self[0].clone();self.len()*(qty as usize)];
    let mut cycle = self.iter().cycle();
    for x in 0..self.len()*(qty as usize) {
      out[x] = cycle.next().unwrap().clone();
    }
    out
  }
}

/// Create a `union` between two vectors.
/// Returns a new vector by joining with other, excluding any duplicates and preserving
/// the order from the original vector.
pub trait Union {
  /// # Example
  /// ```
  /// use array_tool::vec::Union;
  ///
  /// vec!["a","b","c"].union(vec!["c","d","a"]);
  /// ```
  ///
  /// # Output
  /// ```text
  /// vec![ "a", "b", "c", "d" ]
  /// ```
  fn union(&self, other: Self) -> Self;
}
impl<T: PartialEq + Clone> Union for Vec<T> {
  fn union(&self, other: Vec<T>) -> Vec<T> {
    let mut stack = self.clone();
    for x in other { // don't use append method as it's destructive
      stack.push(x)
    }
    stack.unique()
  }
}