static-mapset 0.1.0

Maps and sets based on ordered array or slice
Documentation
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
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
use core::{
	array,
	borrow::Borrow,
	iter::FusedIterator,
	ops::{Bound, RangeBounds}
};

use crate::{
	internal::ordered_set::{self as internal, order},
	ordered::Ordered
};

type Iter<'a, T> = internal::Iter<'a, T>;
type Cursor<'a, T> = internal::Cursor<'a, T>;

type Difference<'a, T, I1, I2> = internal::Difference<'a, T, I1, I2>;
type Intersection<'a, T, I1, I2> = internal::Intersection<'a, T, I1, I2>;
type Union<'a, T, I1, I2> = internal::Union<'a, T, I1, I2>;

#[derive(Debug)]
/// An owning iterator over the items of a `OrderedArraySet` in ascending order.
///
/// This `struct` is created by the [`into_iter`] method on [`OrderedArraySet`]
/// (provided by the [`IntoIterator`] trait). See its documentation for more.
///
/// [`into_iter`]: OrderedArraySet#method.into_iter
pub struct IntoIter<T, const S: usize>(array::IntoIter<T, S>);

impl<T, const S: usize> Iterator for IntoIter<T, S> {
	type Item = T;

	fn next(&mut self) -> Option<Self::Item> {
		self.0.next()
	}

	fn size_hint(&self) -> (usize, Option<usize>) {
		self.0.size_hint()
	}
}

impl<T, const S: usize> DoubleEndedIterator for IntoIter<T, S> {
	fn next_back(&mut self) -> Option<Self::Item> {
		self.0.next_back()
	}
}

impl<T, const S: usize> ExactSizeIterator for IntoIter<T, S> {}
impl<T, const S: usize> FusedIterator for IntoIter<T, S> {}

#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]
/// An ordered set based on an ordered array.
/// This structures provides a subset of the methods offered by the standard library's
/// `BTreeSet`.
///
/// # Examples
///
/// ```
/// use static_mapset::OrderedArraySet;
///
/// let books = OrderedArraySet::new([
///     "A Dance With Dragons",
///     "To Kill a Mockingbird",
///     "The Odyssey",
///     "The Great Gatsby"
/// ]);
///
/// // Check for a specific one.
/// if !books.contains("The Winds of Winter") {
///     println!("We have {} books, but The Winds of Winter ain't one.",
///              books.iter().count());
/// }
///
/// // Iterate over everything.
/// for book in &books {
///     println!("{book}");
/// }
/// ```
///
/// A `OrderedArraySet` with a known list of items can be initialized from an array:
///
/// ```
/// use static_mapset::OrderedArraySet;
///
/// let set = OrderedArraySet::from([1, 2, 3]);
/// ```
pub struct OrderedArraySet<T, const S: usize> {
	inner: [T; S],
	len: usize
}

impl<T, const S: usize> OrderedArraySet<T, S> {
	/// Sorts the array and creates an `OrderedArraySet`.
	/// Duplicate keys are removed, keeping the last occurrence.
	///
	/// The array is sorted. Duplicate elements are removed, keeping the last occurrence.
	///
	/// # Complexity
	///
	/// Linearithmic in `self.len()`.
	///
	/// # Examples
	///
	/// ```
	/// use static_mapset::OrderedArraySet;
	///
	/// let set = OrderedArraySet::new([3, 1, 2, 2]);
	/// assert_eq!(set.first(), Some(&1));
	/// ```
	pub fn new(mut items: [T; S]) -> Self
	where
		T: Ord
	{
		let len = order(&mut items);
		OrderedArraySet { inner: items, len }
	}

	/// Creates an `OrderedArraySet` from an owned array without sorting.
	///
	/// The array must be sorted in ascending order with no duplicate elements.
	///
	/// # Complexity
	///
	/// Constant.
	///
	/// # Examples
	///
	/// ```
	/// use static_mapset::OrderedArraySet;
	///
	/// static MAP: OrderedArraySet<i32, 2> = OrderedArraySet::new_unchecked([1, 2]);
	/// assert!(MAP.contains(&2));
	///
	/// // Incorrect key order or duplicates cause undefined behavior:
	/// // let map = OrderedArraySet::new_unchecked([3, 2]);
	/// // let map = OrderedArraySet::new_unchecked([2, 2]);
	/// ```
	pub const fn new_unchecked(ordered_items: [T; S]) -> Self {
		let len = ordered_items.len();
		OrderedArraySet {
			inner: ordered_items,
			len
		}
	}

	/// Returns `true` if the map is ordered correctly.
	///
	/// # Complexity
	///
	/// Linear in `self.len()`.
	///
	/// # Examples
	///
	/// ```
	/// use static_mapset::OrderedArraySet;
	///
	/// let map = OrderedArraySet::new_unchecked([1, 2, 3]);
	/// assert!(map.is_valid());
	///
	/// let map = OrderedArraySet::new_unchecked([1, 2, 2]);
	/// assert!(!map.is_valid());
	/// let map = OrderedArraySet::new_unchecked([1.0, 2.0, f64::NAN]);
	/// assert!(!map.is_valid());
	/// ```
	pub fn is_valid(&self) -> bool
	where
		T: PartialOrd
	{
		internal::is_valid(&self.inner[..self.len])
	}

	/// Returns `true` if the set contains an element equal to the value.
	///
	/// The value may be any borrowed form of the set's element type,
	/// but the ordering on the borrowed form *must* match the
	/// ordering on the element type.
	/// If equal elements are present, this returns `true` if any matching element exists.
	///
	/// # Complexity
	///
	/// Logarithmic in `self.len()`.
	///
	/// # Examples
	///
	/// ```
	/// use static_mapset::OrderedArraySet;
	///
	/// let set = OrderedArraySet::from([1, 2, 3]);
	/// assert_eq!(set.contains(&1), true);
	/// assert_eq!(set.contains(&4), false);
	///
	/// let set = OrderedArraySet::new_unchecked([1.0, 2.0, 3.0]);
	/// // f64::NAN is incomparable, so value lookups by NaN never match.
	/// assert_eq!(set.contains(&f64::NAN), false);
	/// ```
	pub fn contains<Q>(&self, value: &Q) -> bool
	where
		T: Borrow<Q>,
		Q: PartialOrd + ?Sized
	{
		internal::contains(&self.inner[..self.len], value)
	}

	/// Visits the elements representing the difference,
	/// i.e., the elements that are in `self` but not in `other`,
	/// in ascending order.
	///
	/// # Complexity
	///
	/// Linear in `self.len() + other.len()` to iterate all elements.
	///
	/// # Examples
	///
	/// ```
	/// use static_mapset::OrderedArraySet;
	///
	/// let a = OrderedArraySet::new([1, 2]);
	/// let b = OrderedArraySet::new([2, 3]);
	///
	/// let diff: Vec<_> = a.difference(&b).cloned().collect();
	/// assert_eq!(diff, [1]);
	/// ```
	pub fn difference<'a, O: Ordered<'a, T>>(&'a self, other: &'a O) -> Difference<'a, T, Iter<'a, T>, O::Iter>
	where
		T: PartialOrd
	{
		internal::difference(self, other)
	}

	/// Returns a reference to the first element in the set, if any.
	/// This element is always the minimum of all elements in the set.
	///
	/// # Complexity
	///
	/// Constant.
	///
	/// # Examples
	///
	/// Basic usage:
	///
	/// ```
	/// use static_mapset::OrderedArraySet;
	///
	/// let set: OrderedArraySet<i32, 0> = OrderedArraySet::new([]);
	/// assert_eq!(set.first(), None);
	///
	/// let set = OrderedArraySet::new([2, 1]);
	/// assert_eq!(set.first(), Some(&1));
	/// ```
	pub fn first(&self) -> Option<&T> {
		self.inner[..self.len].first()
	}

	/// Returns a reference to the element in the set, if any, that is equal to
	/// the value.
	///
	/// The value may be any borrowed form of the set's element type,
	/// but the ordering on the borrowed form *must* match the
	/// ordering on the element type.
	///
	/// # Complexity
	///
	/// Logarithmic in `self.len()`.
	///
	/// # Examples
	///
	/// ```
	/// use static_mapset::OrderedArraySet;
	///
	/// let set = OrderedArraySet::from([1, 2, 3]);
	/// assert_eq!(set.get(&2), Some(&2));
	/// assert_eq!(set.get(&4), None);
	///
	/// let set = OrderedArraySet::new_unchecked([1.0, 2.0, 3.0]);
	/// // f64::NAN is incomparable, so value lookups by NaN never match.
	/// assert_eq!(set.get(&f64::NAN), None);
	/// ```
	pub fn get<Q>(&self, value: &Q) -> Option<&T>
	where
		T: Borrow<Q>,
		Q: PartialOrd + ?Sized
	{
		internal::get(&self.inner[..self.len], value)
	}

	/// Visits the elements representing the intersection,
	/// i.e., the elements that are both in `self` and `other`,
	/// in ascending order.
	///
	/// # Complexity
	///
	/// Linear in `self.len() + other.len()` to iterate all elements.
	///
	/// # Examples
	///
	/// ```
	/// use static_mapset::OrderedArraySet;
	///
	/// let a = OrderedArraySet::new([1, 2]);
	/// let b = OrderedArraySet::new([2, 3]);
	///
	/// let intersection: Vec<_> = a.intersection(&b).cloned().collect();
	/// assert_eq!(intersection, [2]);
	/// ```
	pub fn intersection<'a, O: Ordered<'a, T>>(&'a self, other: &'a O) -> Intersection<'a, T, Iter<'a, T>, O::Iter>
	where
		T: PartialOrd
	{
		internal::intersection(self, other)
	}

	/// Returns `true` if `self` has no elements in common with `other`.
	/// This is equivalent to checking for an empty intersection.
	///
	/// # Complexity
	///
	/// Linear in `self.len() + other.len()`.
	///
	/// # Examples
	///
	/// ```
	/// use static_mapset::OrderedArraySet;
	///
	/// let a = OrderedArraySet::from([1, 2, 3]);
	/// let b = OrderedArraySet::from([4, 5]);
	/// let c = OrderedArraySet::from([1, 5]);
	///
	/// assert_eq!(a.is_disjoint(&b), true);
	/// assert_eq!(a.is_disjoint(&c), false);
	/// ```
	pub fn is_disjoint<'a, O: Ordered<'a, T>>(&'a self, other: &'a O) -> bool
	where
		T: PartialOrd
	{
		internal::is_disjoint(self, other)
	}

	/// Returns `true` if the set contains no elements.
	///
	/// # Complexity
	///
	/// Constant.
	///
	/// # Examples
	///
	/// ```
	/// use static_mapset::OrderedArraySet;
	///
	/// let set: OrderedArraySet<i32, 0> = OrderedArraySet::new([]);
	/// assert!(set.is_empty());
	/// let set = OrderedArraySet::new([1]);
	/// assert!(!set.is_empty());
	/// ```
	pub const fn is_empty(&self) -> bool {
		self.len == 0
	}

	/// Returns `true` if the set is a subset of another,
	/// i.e., `other` contains at least all the elements in `self`.
	///
	/// # Complexity
	///
	/// Linear in `self.len() + other.len()`.
	///
	/// # Examples
	///
	/// ```
	/// use static_mapset::OrderedArraySet;
	///
	/// let sup = OrderedArraySet::from([1, 2, 3]);
	/// let set = OrderedArraySet::from([2]);
	/// let not_subset = OrderedArraySet::from([2, 4]);
	///
	/// assert_eq!(set.is_subset(&sup), true);
	/// assert_eq!(not_subset.is_subset(&sup), false);
	/// ```
	pub fn is_subset<'a, O: Ordered<'a, T>>(&'a self, other: &'a O) -> bool
	where
		T: PartialOrd
	{
		internal::is_subset(self, other)
	}

	/// Returns `true` if the set is a superset of another,
	/// i.e., `self` contains at least all the elements in `other`.
	///
	/// # Complexity
	///
	/// Linear in `self.len() + other.len()`.
	///
	/// # Examples
	///
	/// ```
	/// use static_mapset::OrderedArraySet;
	///
	/// let sub = OrderedArraySet::from([1, 2]);
	/// let set = OrderedArraySet::from([0, 1, 2]);
	/// let not_superset = OrderedArraySet::from([0, 1]);
	///
	/// assert_eq!(set.is_superset(&sub), true);
	/// assert_eq!(not_superset.is_superset(&sub), false);
	/// ```
	pub fn is_superset<'a, O: Ordered<'a, T>>(&'a self, other: &'a O) -> bool
	where
		T: PartialOrd
	{
		internal::is_superset(self, other)
	}

	/// Gets an iterator that visits the elements in the set in ascending order.
	///
	/// # Complexity
	///
	/// Linear in `self.len()` to iterate all elements.
	///
	/// # Examples
	///
	/// ```
	/// use static_mapset::OrderedArraySet;
	///
	/// let set = OrderedArraySet::new([2, 1]);
	///
	/// let items: Vec<_> = set.iter().cloned().collect();
	/// assert_eq!(items, [1, 2]);
	/// ```
	pub fn iter(&self) -> Iter<'_, T> {
		internal::iter(&self.inner[..self.len])
	}

	/// Returns a reference to the last element in the set, if any.
	/// This element is always the maximum of all elements in the set.
	///
	/// # Complexity
	///
	/// Constant.
	///
	/// # Examples
	///
	/// Basic usage:
	///
	/// ```
	/// use static_mapset::OrderedArraySet;
	///
	/// let set: OrderedArraySet<i32, 0> = OrderedArraySet::new([]);
	/// assert_eq!(set.last(), None);
	///
	/// let set = OrderedArraySet::new([1]);
	/// assert_eq!(set.last(), Some(&1));
	///
	/// let set = OrderedArraySet::new([1, 2]);
	/// assert_eq!(set.last(), Some(&2));
	/// ```
	pub fn last(&self) -> Option<&T> {
		self.inner[..self.len].last()
	}

	/// Returns a [`Cursor`] pointing at the gap before the smallest element
	/// greater than the given bound.
	///
	/// Passing `Bound::Included(x)` will return a cursor pointing to the
	/// gap before the smallest element greater than or equal to `x`.
	///
	/// Passing `Bound::Excluded(x)` will return a cursor pointing to the
	/// gap before the smallest element greater than `x`.
	///
	/// Passing `Bound::Unbounded` will return a cursor pointing to the
	/// gap before the smallest element in the set.
	/// With equal elements, `Included` points before the first equal element and `Excluded` points after the last equal element.
	///
	/// # Complexity
	///
	/// Logarithmic in `self.len()` to find the bounds, and linear in the number of yielded elements to iterate them all.
	///
	/// # Examples
	///
	/// ```
	///
	/// use static_mapset::OrderedArraySet;
	/// use std::ops::Bound;
	///
	/// let set = OrderedArraySet::from([1, 2, 3, 4]);
	///
	/// let cursor = set.lower_bound(Bound::Included(&2));
	/// assert_eq!(cursor.peek_prev(), Some(&1));
	/// assert_eq!(cursor.peek_next(), Some(&2));
	///
	/// let cursor = set.lower_bound(Bound::Excluded(&2));
	/// assert_eq!(cursor.peek_prev(), Some(&2));
	/// assert_eq!(cursor.peek_next(), Some(&3));
	///
	/// let cursor = set.lower_bound(Bound::Unbounded);
	/// assert_eq!(cursor.peek_prev(), None);
	/// assert_eq!(cursor.peek_next(), Some(&1));
	///
	/// let set = OrderedArraySet::new_unchecked([1.0, 2.0, 3.0]);
	/// // f64::NAN is incomparable, so the cursor points to the gap after the last key.
	/// let cursor = set.lower_bound(Bound::Included(&f64::NAN));
	/// assert_eq!(cursor.peek_prev(), Some(&3.0));
	/// ```
	pub fn lower_bound<Q>(&self, bound: Bound<&Q>) -> Cursor<'_, T>
	where
		T: Borrow<Q>,
		Q: PartialOrd + ?Sized
	{
		internal::lower_bound(&self.inner[..self.len], bound)
	}

	/// Constructs a double-ended iterator over a sub-range of elements in the set.
	/// The simplest way is to use the range syntax `min..max`, thus `range(min..max)` will
	/// yield elements from min (inclusive) to max (exclusive).
	/// The range may also be entered as `(Bound<T>, Bound<T>)`, so for example
	/// `range((Excluded(4), Included(10)))` will yield a left-exclusive, right-inclusive
	/// range from 4 to 10.
	///
	/// # Panics
	///
	/// Panics if range `start > end`.
	/// Panics if range `start == end` and both bounds are `Excluded`.
	/// Panics if `start` (or `end`() is incomparable and `end` (or `start`) is bounded.
	///
	/// # Complexity
	///
	/// Logarithmic in `self.len()`.
	///
	/// # Examples
	///
	/// ```
	/// use static_mapset::OrderedArraySet;
	/// use std::ops::Bound::Included;
	///
	/// let set = OrderedArraySet::new([3, 5, 8]);
	/// for &elem in set.range((Included(&4), Included(&8))) {
	///     println!("{elem}");
	/// }
	/// assert_eq!(Some(&5), set.range(4..).next());
	/// ```
	pub fn range<Q, R>(&self, range: R) -> Iter<'_, T>
	where
		T: Borrow<Q>,
		Q: PartialOrd + ?Sized,
		R: RangeBounds<Q>
	{
		internal::range(&self.inner[..self.len], range)
	}

	/// Visits the elements representing the union,
	/// i.e., all the elements in `self` or `other`, without duplicates,
	/// in ascending order.
	///
	/// # Complexity
	///
	/// Linear in `self.len() + other.len()` to iterate all elements.
	///
	/// # Examples
	///
	/// ```
	/// use static_mapset::OrderedArraySet;
	///
	/// let a = OrderedArraySet::new([1]);
	/// let b = OrderedArraySet::new([2]);
	///
	/// let union: Vec<_> = a.union(&b).cloned().collect();
	/// assert_eq!(union, [1, 2]);
	/// ```
	pub fn union<'a, O: Ordered<'a, T>>(&'a self, other: &'a O) -> Union<'a, T, Iter<'a, T>, O::Iter>
	where
		T: PartialOrd
	{
		internal::union(self, other)
	}

	/// Returns a [`Cursor`] pointing at the gap after the greatest element
	/// smaller than the given bound.
	///
	/// Passing `Bound::Included(x)` will return a cursor pointing to the
	/// gap after the greatest element smaller than or equal to `x`.
	///
	/// Passing `Bound::Excluded(x)` will return a cursor pointing to the
	/// gap after the greatest element smaller than `x`.
	///
	/// Passing `Bound::Unbounded` will return a cursor pointing to the
	/// gap after the greatest element in the set.
	/// With equal elements, `Excluded` points before the first equal element and `Included` points after the last equal element.
	///
	/// # Complexity
	///
	/// Logarithmic in `self.len()`.
	///
	/// # Examples
	///
	/// ```
	///
	/// use static_mapset::OrderedArraySet;
	/// use std::ops::Bound;
	///
	/// let set = OrderedArraySet::from([1, 2, 3, 4]);
	///
	/// let cursor = set.upper_bound(Bound::Included(&3));
	/// assert_eq!(cursor.peek_prev(), Some(&3));
	/// assert_eq!(cursor.peek_next(), Some(&4));
	///
	/// let cursor = set.upper_bound(Bound::Excluded(&3));
	/// assert_eq!(cursor.peek_prev(), Some(&2));
	/// assert_eq!(cursor.peek_next(), Some(&3));
	///
	/// let cursor = set.upper_bound(Bound::Unbounded);
	/// assert_eq!(cursor.peek_prev(), Some(&4));
	/// assert_eq!(cursor.peek_next(), None);
	///
	/// let set = OrderedArraySet::new_unchecked([1.0, 2.0, 3.0]);
	/// // f64::NAN is incomparable, so the cursor points to the gap after the last key.
	/// let cursor = set.upper_bound(Bound::Included(&f64::NAN));
	/// assert_eq!(cursor.peek_prev(), Some(&3.0));
	/// ```
	pub fn upper_bound<Q>(&self, bound: Bound<&Q>) -> Cursor<'_, T>
	where
		T: Borrow<Q>,
		Q: PartialOrd + ?Sized
	{
		internal::upper_bound(&self.inner[..self.len], bound)
	}
}

impl<'a, T: 'a + PartialOrd, const S: usize> Ordered<'a, T> for OrderedArraySet<T, S> {
	type Iter = Iter<'a, T>;

	fn ordered_iter(&'a self) -> Iter<'a, T> {
		self.iter()
	}
}

impl<T, const S: usize> From<[T; S]> for OrderedArraySet<T, S>
where
	T: Ord
{
	fn from(value: [T; S]) -> Self {
		OrderedArraySet::new(value)
	}
}

impl<T, const S: usize> IntoIterator for OrderedArraySet<T, S> {
	type Item = T;
	type IntoIter = IntoIter<T, S>;

	fn into_iter(self) -> Self::IntoIter {
		let to_back = self.inner.len() - self.len;
		let mut inner = self.inner.into_iter();
		if to_back > 0 {
			inner.nth_back(to_back - 1);
		}
		IntoIter(inner)
	}
}

impl<'a, T, const S: usize> IntoIterator for &'a OrderedArraySet<T, S> {
	type Item = &'a T;
	type IntoIter = Iter<'a, T>;

	fn into_iter(self) -> Self::IntoIter {
		self.iter()
	}
}

#[cfg(test)]
mod tests {
	use core::ops::Bound;

	use super::*;

	#[test]
	fn test_new() {
		let set = OrderedArraySet::new([5, 1, 3, 1]);
		assert_eq!(set.into_iter().collect::<Vec<_>>(), vec![1, 3, 5]);
	}

	#[test]
	fn test_contains() {
		let set = OrderedArraySet::new_unchecked([1, 3, 5, 7]);
		assert!(set.contains(&1));
		assert!(set.contains(&5));
		assert!(!set.contains(&2));
		assert!(!set.contains(&8));
	}

	#[test]
	fn test_get() {
		let set = OrderedArraySet::new_unchecked([10, 20, 30]);
		assert_eq!(set.get(&20), Some(&20));
		assert_eq!(set.get(&15), None);
	}

	#[test]
	fn test_first_last() {
		let set = OrderedArraySet::new_unchecked([2, 4, 6, 8]);
		assert_eq!(set.first(), Some(&2));
		assert_eq!(set.last(), Some(&8));

		let empty: OrderedArraySet<i32, 0> = OrderedArraySet::new_unchecked([]);
		assert_eq!(empty.first(), None);
		assert_eq!(empty.last(), None);
	}

	#[test]
	fn test_iter() {
		let set = OrderedArraySet::new_unchecked([1, 2, 3]);
		let v: Vec<_> = set.iter().collect();
		assert_eq!(v, vec![&1, &2, &3]);
	}

	#[test]
	fn test_into_iter_consuming() {
		let set = OrderedArraySet::new_unchecked([10, 20, 30]);
		let v: Vec<_> = set.into_iter().collect();
		assert_eq!(v, vec![10, 20, 30]);
	}

	#[test]
	fn test_is_subset_superset_disjoint() {
		let a = OrderedArraySet::new_unchecked([1, 2, 3]);
		let b = OrderedArraySet::new_unchecked([1, 2, 3, 4, 5]);
		assert!(a.is_subset(&b));
		assert!(b.is_superset(&a));

		let c = OrderedArraySet::new_unchecked([6, 7, 8]);
		assert!(a.is_disjoint(&c));
		assert!(!a.is_disjoint(&b));
	}

	#[test]
	fn test_lower_bound() {
		let set = OrderedArraySet::new_unchecked([1, 3, 5, 7]);
		assert_eq!(set.lower_bound(Bound::Included(&3)).next(), Some(&3));
		assert_eq!(set.lower_bound(Bound::Excluded(&3)).next(), Some(&5));
		assert_eq!(set.lower_bound(Bound::Included(&4)).next(), Some(&5));
		assert_eq!(set.lower_bound(Bound::Unbounded).next(), Some(&1));
		assert_eq!(set.lower_bound(Bound::Included(&8)).next(), None);
	}

	#[test]
	fn test_upper_bound() {
		let set = OrderedArraySet::new_unchecked([1, 3, 5, 7]);
		assert_eq!(set.upper_bound(Bound::Included(&3)).next(), Some(&5));
		assert_eq!(set.upper_bound(Bound::Excluded(&3)).next(), Some(&3));
		assert_eq!(set.upper_bound(Bound::Unbounded).next(), None);
	}

	#[test]
	fn test_range() {
		let set = OrderedArraySet::new_unchecked([1, 2, 3, 4, 5]);
		assert_eq!(set.range(2..=4).collect::<Vec<_>>(), &[&2, &3, &4]);
		assert_eq!(set.range(2..4).collect::<Vec<_>>(), &[&2, &3]);
		assert_eq!(set.range(..3).collect::<Vec<_>>(), &[&1, &2]);
		assert_eq!(set.range(3..).collect::<Vec<_>>(), &[&3, &4, &5]);
	}

	#[test]
	fn test_difference() {
		let a = OrderedArraySet::new_unchecked([1, 2, 3, 4, 5]);
		let b = OrderedArraySet::new_unchecked([2, 4]);
		let diff: Vec<_> = a.difference(&b).collect();
		assert_eq!(diff, vec![&1, &3, &5]);
	}

	#[test]
	fn test_intersection() {
		let a = OrderedArraySet::new_unchecked([1, 2, 3, 4, 5]);
		let b = OrderedArraySet::new_unchecked([2, 4, 6]);
		let inter: Vec<_> = a.intersection(&b).collect();
		assert_eq!(inter, vec![&2, &4]);
	}

	#[test]
	fn test_union() {
		let a = OrderedArraySet::new_unchecked([1, 3, 5]);
		let b = OrderedArraySet::new_unchecked([2, 3, 4]);
		let uni: Vec<_> = a.union(&b).collect();
		assert_eq!(uni, vec![&1, &2, &3, &4, &5]);
	}

	#[test]
	fn test_new_sorts() {
		let set = OrderedArraySet::new([5, 1, 3, 2, 4]);
		assert!(set.iter().is_sorted());
		let v: Vec<_> = set.iter().copied().collect();
		assert_eq!(v, vec![1, 2, 3, 4, 5]);
	}

	#[test]
	fn test_is_valid() {
		assert!(OrderedArraySet::new_unchecked([1, 2, 3]).iter().is_sorted());
		assert!(!OrderedArraySet::new_unchecked([3, 1, 2]).iter().is_sorted());
	}
}