point-nd 0.5.0

A simple and flexible no-std struct to model points on axes of any dimensions
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
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
use core::convert::TryFrom;
use core::array::TryFromSliceError;
use core::ops::{Deref, DerefMut};

#[cfg(any(feature = "x", feature = "y", feature = "z", feature = "w"))]
use core::ops::AddAssign;

#[cfg(any(feature = "appliers", feature = "var-dims"))]
use arrayvec::ArrayVec;
#[cfg(any(feature = "appliers", feature = "var-dims"))]
use crate::utils::ARRVEC_CAP;
#[cfg(any(feature = "appliers", feature = "var-dims"))]
use crate::utils::arrvec_into_inner;

#[cfg(feature = "appliers")]
use crate::utils::{ApplyFn, ApplyDimsFn, ApplyValsFn, ApplyPointFn};


// Note to Developers:
// - The docs have been written with the assumption that default features have been enabled
// - Running doctests without default features will result in test failures
// - Sorry about the mixed doc comment styles... we are slowly refactoring the /** block comments **/
//   to /// triple slashes and the ```triple_code_blocks``` to `singles`


/**
The whole _point_ of the crate.

The `PointND` struct is really just a smart pointer to an array of type `[T; N]`
with convenience methods for accessing, setting and transforming values.

As the struct dereferences to a slice, all methods implemented for slices are available with this.

# Making a Point

There are three `PointND` constructors (in order of usefulness): `from()`, `fill()`
and `from_slice()`.

The `from_slice()` and `fill()` functions can only be used if creating a point where the
items implement `Copy`

```
# use point_nd::PointND;
// Creating a 2D point from a given array
let arr = [0, 1];
let p = PointND::from(arr);

// Creating a 4D point with all values set to 5
let p: PointND<_, 4> = PointND::fill(5);

// Creating a 3D point from values of a given slice
let p: PointND<_, 3> = PointND::from_slice(&vec![0, 1, 2]);

// You can even construct a PointND with zero dimensions
let arr: [i32; 0] = [];
let p = PointND::from(arr);
```

The generic arg ```N``` in ```PointND<T, N>``` is a ```usize``` constant generic and for the ```fill()```
and ```from_slice()``` functions, specifying it is sometimes needed when the compiler cannot infer it itself.

See their documentation for cases when explicit generics are not necessary

Otherwise, if you don't like writing `PointND` twice for type annotation, it is recommended to
use FQS (_fully qualified syntax_) instead:

```
# use point_nd::PointND;
let p1 = PointND::<_, 4>::from_slice(&vec![5,5,5,5]);
let p2 = PointND::<_, 4>::fill(5);

assert_eq!(p1, p2);
```

# Getting Values

If the dimensions of the point are within **1..=4**, it is recommended to
use the convenience getters `x()`, `y()`, `z()` and `w()`

The above all return references to the value, regardless of whether they implement `Copy`

```
# use point_nd::PointND;
let p = PointND::from([0,1]);

// As the point has 2 dimensions, we can access
//  it's values with the x() and y() methods
let x: &i32 = p.x();
let y = p.y();
assert_eq!(*x, 0);
assert_eq!(*y, 1);

// If the point had 3 dimensions, we could use the above and:
//  let z = p.z();
// Or with 4 dimensions, the above and:
//  let w = p.w();
```

The above methods are not implemented for `PointND`'s with more than 4 dimensions.

Instead, we must use the native implementations of the contained array. See the [notes][notes-indexing]
below on how direct indexing can be made easier.

```
# use point_nd::PointND;
let p = PointND::from([0,1,2,3,4,5]);

// ERROR: Not implemented for PointND of 6 dimensions
//  let x = p.x();

let x = p[0];
let y = p.get(1);
let z_to_last = &p[2..];

assert_eq!(x, 0);
assert_eq!(*y.unwrap(), 1);
assert_eq!(z_to_last, &[2, 3, 4, 5]);
```

To get **all** the values contained by a point, use the `into_arr()` method

```
# use point_nd::PointND;
let p = PointND::from([-10, -2, 0, 2, 10]);
assert_eq!(p.into_arr(), [-10, -2, 0, 2, 10])
```

# Querying Size

The number of dimensions can be retrieved using the `dims()` method (short for _dimensions_).

```
# use point_nd::PointND;
let p = PointND::from([0,1]);
assert_eq!(p.dims(), 2);

// Alternatively, as PointND implements Deref, we can use len().
// It's not as descriptive however...
assert_eq!(p.len(), 2);
```

# Transforming Values

If the dimensions of the point are within **1..=4**, it is recommended to use the convenience
`set` and `shift` methods.

```
# use point_nd::PointND;
let mut p = PointND::from([0, 1]);

// As the point has 2 dimensions, we can set
//  it's values with the set_x() and set_y() methods
// There are set_z() and set_w() methods available for
//  points with 3 and 4 dimensions respectively
p.set_x(-10);
p.set_y(-20);
assert_eq!(*p.x(), -10);
assert_eq!(*p.y(), -20);

// We can AddAssign the values of a point with the
//  shift methods
// Like set, there are methods available for points
//  of 3 and 4 dimensions
p.shift_x(5);
p.shift_y(25);
assert_eq!(*p.x(), -5);
assert_eq!(*p.y(), 5);
```

The above methods are not implemented for `PointND`'s with more than 4 dimensions.

Instead, we must use the native implementations of the contained array. See the [notes][notes-indexing]
below on how direct indexing can be made easier.

```
# use point_nd::PointND;
let mut p = PointND::from([0, 1, 2, 3, 4, 5]);

// Sets x via indexing
p[0] = -100;
assert_eq!(p[0], -100);
```

### Appliers

The ```apply()```, ```apply_vals()```, ```apply_dims()``` and ```apply_point()``` methods all
consume self and return a new point after calling a function or closure on all contained values

Multiple applier methods can be chained together to make complex transformations to a `PointND`

This is probably best explained with an example:

```
# use point_nd::PointND;
// A trivial transformation more easily done other ways
//  ...but it gets the point across
let p = PointND
    ::from([0,1,2])            // Creates a new PointND
    .apply(|item| item + 2)    // Adds 2 to each item
    .apply(|item| item * 3);   // Multiplies each item by 3
assert_eq!(p.into_arr(), [6, 9, 12]);
```

Each applier has it's own subtle differences, it is recommended to read the documentation for
each of them

# Iterating

Iterating over a `PointND` is as easy as:

```
# use point_nd::PointND;
let mut p = PointND::from([0,1]);

for _ in p.iter()      { /* Do stuff     */ }
for _ in p.iter_mut()  { /* Change stuff */ }
for _ in p.into_iter() { /* Move stuff (unless items implement Copy) */ }
```

It must be noted that if the items implement `Copy`, using `into_iter()` will not actually
move the point out of scope.

If this behaviour is necessary, use the `into_arr()` method to consume the point and move the
contained array into the loop

```
# use point_nd::PointND;
# let mut p = PointND::from([0,1]);
for _ in p.into_arr().into_iter() { /* Move stuff */ }

// ERROR: Can't access moved value
// assert_eq!(p.dims(), 2);
```

# Things (not strictly necessary) to Note

### Convenience Methods

As stated earlier, certain methods for accessing and setting the values contained by a `PointND`
are only implemented for points within **1..=4** dimensions.

This was done to mirror the behaviour of arrays closely as possible, where out of bounds indexing
errors are caught at compile time.

### Direct Indexing

Indexing values can become cumbersome if using `usize` values. As of `v0.5.0`, `point-nd`'s indexing
macros have been moved to the [`axmac`][axmac] crate which provides macros to index the first
4 dimensions of a point by simply specifying _x_, _y_, _z_ or _w_.

The `axmac` crate is **highly recommended** when working with points above 4 dimensions

### Math Operations

Unlike structures in other crates, `PointND`'s (as of `v0.5.0`) do not implement mutating
and consuming math operations like `Neg`, `Add`, `SubAssign`, _etc_.

It was decided that these functionalities and others could provided by independent crates via
functions which could be imported and passed to the `apply` methods.

`Eq` and `PartialEq` are implemented though.

### Dimensional Capacity

This crate relies heavily on the [`arrayvec`][arrayvec] crate when applying
transformations to points. Due to the fact that `arrayvec::ArrayVec`'s lengths are capped at
`u32::MAX`, any `apply`, `extend` and `retain` methods will panic if used on `PointND`'s with
dimensions exceeding that limit.

This shouldn't be a problem in most use cases (who needs a `u32::MAX + 1` dimensional point
anyway?), but it is probably worth mentioning.

 [axmac]: https://crates.io/crates/axmac
 [arrayvec]: https://crates.io/crates/arrayvec

 [notes]: https://docs.rs/point-nd/0.5.0/point_nd/struct.PointND.html#things-not-strictly-necessary-to-note
 [notes-indexing]: https://docs.rs/point-nd/0.5.0/point_nd/struct.PointND.html#direct-indexing
 */
#[derive(Clone, Debug, Eq, PartialEq)]
pub struct PointND<T, const N: usize>([T; N]);

// From and Fill
impl<T, const N: usize> PointND<T, N>
    where T: Copy {

    /**
     Returns a new `PointND` with values from the specified slice

     If the compiler is not able to infer the dimensions (a.k.a - length)
     of the point, it needs to be explicitly specified

     ```
     # use point_nd::PointND;
     // Explicitly specifying dimensions
     let p = PointND::<_, 3>::from_slice(&vec![0,1,2]);

     // The generics don't always have to be specified though, for example
     let p1 = PointND::from([0,1]);       // Compiler knows this has 2 dimensions
     let p2 = PointND::from_slice(&vec![2,3]);

     // Later, p2 is applied to p1. The compiler is able to infer its dimensions
     let p3 = p1.apply_point(p2, |a, b| a + b);
     ```

     If the length of the slice being passed is uncertain, it is recommended to use the `try_from()`
     method for more graceful error handling.

     # Panics

     - If the slice passed cannot be converted into an array

    ```should_panic
    # use point_nd::PointND;
    let arr = [0,1,2];
    // ERROR: Cannot convert slice of [i32; 3] to [i32; 100]
    let p = PointND::<_, 100>::from_slice(&arr[..]);
    ```
     */
    pub fn from_slice(slice: &[T]) -> Self {
        let arr: [T; N] = slice.try_into().unwrap();
        PointND::from(arr)
    }

    ///
    /// Returns a new `PointND` with all values set as specified
    ///
    /// If the compiler is not able to infer the dimensions (a.k.a - length)
    /// of the point, it needs to be explicitly specified
    ///
    /// See the ```from_slice()``` function for cases when generics don't need to be explicitly specified
    ///
    /// ```
    /// # use point_nd::PointND;
    /// // A 10 dimensional point with all values set to 2
    /// let p = PointND::<_, 10>::fill(2);
    ///
    /// assert_eq!(p.dims(), 10);
    /// assert_eq!(p.into_arr(), [2; 10]);
    /// ```
    ///
    pub fn fill(value: T) -> Self {
        PointND::from([value; N])
    }

}

impl<T, const N: usize> PointND<T, N> {

    ///
    /// Returns the number of dimensions of the point (a 2D point will return 2, a 3D point 3, _etc_)
    ///
    /// Equivalent to calling ```len()```
    ///
    pub fn dims(&self) -> usize {
        self.0.len()
    }

    /// Consumes `self`, returning the contained array
    pub fn into_arr(self) -> [T; N] {
        self.0
    }


    ///
    /// Panics with customised error message if specified `cap` is greater than the max `ArrayVec` capacity (`u32::MAX`)
    ///
    #[cfg(any(feature = "appliers", feature = "var-dims"))]
    fn _check_arrvec_cap(&self, cap: usize, method_name: &str) {
        if cap > ARRVEC_CAP {
            panic!("Attempted to call {}() on PointND with more than u32::MAX dimensions",  method_name);
        }
    }


    ///
    /// Consumes `self` and calls the `modifier` on each item contained
    /// by `self` to create a new `PointND` of the same length.
    ///
    /// ```
    /// # use point_nd::PointND;
    /// let p = PointND
    ///     ::from([0,1,2])             // Creates a new PointND
    ///     .apply(|item| item + 2)     // Adds 2 to each item
    ///     .apply(|item| item * 3);    // Multiplies each item by 3
    /// assert_eq!(p.into_arr(), [6, 9, 12]);
    /// ```
    ///
    /// The return type of the `modifier` does not necessarily have to be
    /// the same as the type of the items passed to it. This means that ```apply```
    /// can create a new point with items of a different type, but the same length.
    ///
    /// ```
    /// # use point_nd::PointND;
    /// let p = PointND
    ///     ::from([0,1,2])                // Creates a new PointND
    ///     .apply(|item| item as f32);    // Converts items to float
    /// assert_eq!(p.into_arr(), [0.0, 1.0, 2.0]);
    /// ```
    ///
    /// # Enabled by features:
    ///
    /// - `default`
    ///
    /// - `appliers`
    ///
    /// # Panics
    ///
    /// - If the dimensions of `self` are greater than `u32::MAX`.
    ///
    #[cfg(feature = "appliers")]
    pub fn apply<U>(self, modifier: ApplyFn<T, U>) -> PointND<U, N> {
        self._check_arrvec_cap(N, "apply");

        let mut arr_v = ArrayVec::<U, N>::new();
        let mut this = ArrayVec::from(self.into_arr());

        for _ in 0..N {
            let item = this.pop_at(0).unwrap();
            arr_v.push(modifier(item));
        }

        PointND::from(
            arrvec_into_inner(arr_v, "apply")
        )
    }

    ///
    /// Consumes `self` and calls the `modifier` on the items at the
    /// specified `dims` to create a new `PointND` of the same length.
    ///
    /// Any items at dimensions not specified will be passed to the new point without change
    ///
    /// ```
    /// # use point_nd::PointND;
    /// let p = PointND
    ///     ::from([0,1,2,3,4])                       // Creates a PointND
    ///     .apply_dims(&[1,3], |item| item * 2)      // Multiplies items 1 and 3 by 2
    ///     .apply_dims(&[0,2], |item| item + 10);    // Adds 10 to items 0 and 2
    /// assert_eq!(p.into_arr(), [10, 2, 12, 6, 4]);
    /// ```
    ///
    /// Unlike some other apply methods, this ```apply_dims``` cannot return
    /// a `PointND` with items of a different type from the original.
    ///
    /// # Enabled by features:
    ///
    /// - `default`
    ///
    /// - `appliers`
    ///
    /// # Panics
    ///
    /// - If the dimensions of `self` are greater than `u32::MAX`.
    ///
    #[cfg(feature = "appliers")]
    pub fn apply_dims(self, dims: &[usize], modifier: ApplyDimsFn<T>) -> Self {
        self._check_arrvec_cap(N, "apply_dims");

        let mut arr_v = ArrayVec::<T, N>::new();
        let mut this = ArrayVec::from(self.into_arr());

        for i in 0..N {
            let item = this.pop_at(0).unwrap();
            if dims.contains(&i) {
                arr_v.push(modifier(item));
            } else {
                arr_v.push(item);
            }
        }

        PointND::from(
            arrvec_into_inner(arr_v, "apply_dims")
        )
    }

    /**
     Consumes `self` and calls the `modifier` on each item contained by
     `self` and ```values``` to create a new `PointND` of the same length.

     As this method may modify every value in the original point,
     the ```values``` array must be the same length as the point.

     When creating a modifier function to be used by this method, keep
     in mind that the items in `self` are passed to it through the
     **first arg**, and the items in ```values``` through the **second**.

     ```
     # use point_nd::PointND;
     let p = PointND
         ::from([0,1,2])                      // Creates a new PointND
         .apply_vals([1,3,5], |a, b| a + b)   // Adds items in point to items in array
         .apply_vals([2,4,6], |a, b| a * b);  // Multiplies items in point to items in array
     assert_eq!(p.into_arr(), [2, 16, 42]);
     ```

     Neither the return type of the `modifier` nor the type of the items contained
     by the ```values``` array necessarily have to be the same as the item type of the
     original point. This means that ```apply_vals``` can create a new point with items
     of a different type, but the same length.

     ```
     # use point_nd::PointND;
     enum Op {
        Add,
        Sub,
     }

    // Adds or subtracts 10 from 'a' depending on the
    //  operation specified in 'b', then converts to float
    let add_or_sub = |a, b| {
        match b {
            Op::Add => (a + 10) as f32,
            Op::Sub => (a - 10) as f32
        }
    };

     let p = PointND
         ::from([0,1,2])
         .apply_vals(
             [Op::Add, Op::Sub, Op::Add],
             add_or_sub
         );
     assert_eq!(p.into_arr(), [10.0, -9.0, 12.0]);
     ```

     # Enabled by features:

     - `default`

     - `appliers`

     # Panics

     - If the dimensions of `self` or ```values``` are greater than `u32::MAX`.
     */
    #[cfg(feature = "appliers")]
    pub fn apply_vals<U, V>(
        self,
        values: [V; N],
        modifier: ApplyValsFn<T, U, V>
    ) -> PointND<U, N> {
        self._check_arrvec_cap(N, "apply_vals");

        let mut arr_v = ArrayVec::<U, N>::new();
        let mut vals = ArrayVec::from(values);
        let mut this = ArrayVec::from(self.into_arr());

        for _ in 0..N {
            let a = this.pop_at(0).unwrap();
            let b = vals.pop_at(0).unwrap();
            arr_v.push(modifier(a, b));
        }

        PointND::from(
            // Had to put two method names here as this function is called from apply_point()
            arrvec_into_inner(arr_v, "apply_vals() or apply_point")
        )
    }

    ///
    /// Consumes `self` and calls the `modifier` on each item contained by
    /// `self` and another `PointND` to create a new point of the same length.
    ///
    /// When creating a modifier function to be used by this method, keep
    /// in mind that the items in `self` are passed to it through the
    /// **first arg**, and the items in `other` through the **second**.
    ///
    /// ```
    /// # use point_nd::PointND;
    /// let p1 = PointND::from([0,9,3,1]);
    /// let p2 = PointND::fill(10);
    /// let p3 = PointND
    ///     ::from([1,2,3,4])                // Creates a new PointND
    ///     .apply_point(p1, |a, b| a - b)   // Subtracts items in p3 with those in p1
    ///     .apply_point(p2, |a, b| a * b);  // Multiplies items in p3 with those in p2
    /// assert_eq!(p3.into_arr(), [10, -70, 0, 30]);
    /// ```
    ///
    /// Neither the return type of the `modifier` nor the type of the items
    /// contained by the `other` point necessarily have to be  the same as
    /// the type of the items in the original point. This means that ```apply_point```
    /// can create a new point with items of a different type, but the same length.
    ///
    /// # Enabled by features:
    ///
    /// - `default`
    ///
    /// - `appliers`
    ///
    /// # Panics
    ///
    /// - If the dimensions of `self` or `other` are greater than `u32::MAX`.
    ///
    #[cfg(feature = "appliers")]
    pub fn apply_point<U, V>(
        self,
        other: PointND<V, N>,
        modifier: ApplyPointFn<T, U, V>
    ) -> PointND<U, N> {
        self._check_arrvec_cap(N, "apply_point");

        self.apply_vals(other.into_arr(), modifier)
    }

    
    ///
    /// Consumes `self` and returns a new `PointND` with items from `values` appended to
    /// items from the original.
    /// 
    /// ```
    /// # use point_nd::PointND;
    /// let p = PointND
    ///     ::from([0,1])
    ///     .extend([2,3]);
    ///  assert_eq!(p.into_arr(), [0,1,2,3]);
    /// ```
    ///
    /// # **Warning!**
    ///
    /// Although we believe it has been tested against the most common use cases, no guarantees are
    /// made as to the stability of this method.
    ///
    /// # Enabled by features:
    ///
    /// - `var-dims`
    ///
    /// # Panics
    ///
    /// - If the combined length of `self` and `values` are greater than `u32::MAX`.
    ///
    /// ```should_panic
    /// # use point_nd::PointND;
    /// const N: usize = u32::MAX as usize;
    /// const L: usize = 1;
    /// const M: usize = N + L;
    ///
    /// let p: PointND<_, M> = PointND
    ///     ::from([0; N])
    ///     .extend([1; L]);
    /// ```
    ///
    #[cfg(feature = "var-dims")]
    pub fn extend<const L: usize, const M: usize>(self, values: [T; L]) -> PointND<T, M> {
        self._check_arrvec_cap(N, "extend");
        if N + L > ARRVEC_CAP {
            panic!("Attempted to extend() a PointND to more than u32::MAX dimensions");
        }

        let mut arr_v = ArrayVec::<T, M>::new();
        let mut this = ArrayVec::from(self.into_arr());
        let mut vals = ArrayVec::from(values);

        for _ in 0..N { arr_v.push(this.pop_at(0).unwrap()); }
        for _ in 0..L { arr_v.push(vals.pop_at(0).unwrap());  }

        PointND::from(
            arrvec_into_inner(arr_v, "extend")
        )
    }

    ///
    /// Consumes `self` and returns a new `PointND` which retains only the first `dims` items of the
    /// original.
    ///
    /// This method always removes the rearmost items first.
    ///
    /// ```
    /// # use point_nd::PointND;
    /// let p = PointND
    ///     ::from([0,1,2,3])
    ///     .retain(2);
    /// assert_eq!(p.dims(), 2);
    /// assert_eq!(p.into_arr(), [0,1]);
    /// ```
    ///
    /// # **Warning!**
    ///
    /// Although we believe it has been tested against the most common use cases, no guarantees are
    /// made as to the stability of this method.
    ///
    /// # Enabled by features:
    ///
    /// - `var-dims`
    ///
    /// # Panics
    ///
    /// - If `dims` is greater than the original dimensions of the point (_a.k.a_ - you cannot
    ///   shorten the dimensions of a point to more than it had originally).
    ///
    /// ```should_panic
    /// # use point_nd::PointND;
    /// let p = PointND
    ///     ::from([0,1,2])
    ///     .retain(1_000_000);
    /// # // Just to silence the type error
    /// # let _p2 = PointND::from([0,1,2]).apply_point(p, |a, b| a + b);
    /// ```
    ///
    /// - If the dimensions of `self` are greater than `u32::MAX`.
    ///
    #[cfg(feature = "var-dims")]
    pub fn retain<const M: usize>(self, dims: usize) -> PointND<T, M> {
        self._check_arrvec_cap(N, "retain");
        // This check allows us to safely unwrap the values in self
        if dims > N || M > N {
            panic!("Attempted to contract PointND to more dimensions than it had originally. Try \
                    passing a usize value that is less than the dimensions of the original point");
        }

        let mut arr_v = ArrayVec::<T, M>::new();
        let mut this = ArrayVec::from(self.into_arr());

        for _ in 0..dims {
            let item = this.pop_at(0).unwrap();
            arr_v.push(item);
        }

        PointND::from(
            arrvec_into_inner(arr_v, "retain")
        )
    }

}


// Deref
impl<T, const N: usize> Deref for PointND<T, N> {

    type Target = [T; N];
    fn deref(&self) -> &Self::Target {
        &self.0
    }

}

impl<T, const N: usize> DerefMut for PointND<T, N> {

    fn deref_mut(&mut self) -> &mut Self::Target {
        &mut self.0
    }

}


// Convenience Getters and Setters
///
/// Methods for safely getting and setting the value contained by a 1D `PointND`
///
/// # Enabled by features:
///
/// - `default`
///
/// - `conv_methods`
///
/// - `x`
///
#[cfg(feature = "x")]
impl<T> PointND<T, 1> {

    pub fn x(&self) -> &T { &self[0] }

    pub fn set_x(&mut self, new_value: T) { self[0] = new_value; }

}
///
/// Methods for safely getting and setting the values contained by a 2D `PointND`
///
/// # Enabled by features:
///
/// - `default`
///
/// - `conv_methods`
///
/// - `y`
///
#[cfg(feature = "y")]
impl<T> PointND<T, 2> {

    pub fn x(&self) -> &T { &self[0] }
    pub fn y(&self) -> &T { &self[1] }

    pub fn set_x(&mut self, new_value: T) { self[0] = new_value; }
    pub fn set_y(&mut self, new_value: T) { self[1] = new_value; }

}
///
/// Methods for safely getting and setting the values contained by a 3D `PointND`
///
/// # Enabled by features:
///
/// - `default`
///
/// - `conv_methods`
///
/// - `z`
///
#[cfg(feature = "z")]
impl<T> PointND<T, 3>  {

    pub fn x(&self) -> &T { &self[0] }
    pub fn y(&self) -> &T { &self[1] }
    pub fn z(&self) -> &T { &self[2] }

    pub fn set_x(&mut self, new_value: T) { self[0] = new_value; }
    pub fn set_y(&mut self, new_value: T) { self[1] = new_value; }
    pub fn set_z(&mut self, new_value: T) { self[2] = new_value; }

}
///
/// Methods for safely getting and setting the values contained by a 4D `PointND`
///
/// # Enabled by features:
///
/// - `default`
///
/// - `conv_methods`
///
/// - `w`
///
#[cfg(feature = "w")]
impl<T> PointND<T, 4>  {

    pub fn x(&self) -> &T { &self[0] }
    pub fn y(&self) -> &T { &self[1] }
    pub fn z(&self) -> &T { &self[2] }
    pub fn w(&self) -> &T { &self[3] }

    pub fn set_x(&mut self, new_value: T) { self[0] = new_value; }
    pub fn set_y(&mut self, new_value: T) { self[1] = new_value; }
    pub fn set_z(&mut self, new_value: T) { self[2] = new_value; }
    pub fn set_w(&mut self, new_value: T) { self[3] = new_value; }

}

// Convenience Shifters
///
/// Method for safely transforming the value contained by a 1D `PointND`
///
/// # Enabled by features:
///
/// - `default`
///
/// - `conv_methods`
///
/// - `x`
/// 
#[cfg(feature = "x")]
impl<T> PointND<T, 1>
    where T: AddAssign {

    pub fn shift_x(&mut self, delta: T) { self[0] += delta; }

}
///
/// Methods for safely transforming the values contained by a 2D `PointND`
///
/// # Enabled by features:
///
/// - `default`
///
/// - `conv_methods`
///
/// - `y`
///
#[cfg(feature = "y")]
impl<T> PointND<T, 2>
    where T: AddAssign {

    pub fn shift_x(&mut self, delta: T) { self[0] += delta; }
    pub fn shift_y(&mut self, delta: T) { self[1] += delta; }

}
///
/// Methods for safely transforming the values contained by a 3D `PointND`
///
/// # Enabled by features:
///
/// - `default`
///
/// - `conv_methods`
///
/// - `z`
///
#[cfg(feature = "z")]
impl<T> PointND<T, 3>
    where T: AddAssign {

    pub fn shift_x(&mut self, delta: T) { self[0] += delta; }
    pub fn shift_y(&mut self, delta: T) { self[1] += delta; }
    pub fn shift_z(&mut self, delta: T) { self[2] += delta; }

}
///
/// Methods for safely transforming the values contained by a 4D `PointND`
///
/// # Enabled by features:
///
/// - `default`
///
/// - `conv_methods`
///
/// - `w`
///
#[cfg(feature = "w")]
impl<T> PointND<T, 4>
    where T: AddAssign {

    pub fn shift_x(&mut self, delta: T) { self[0] += delta; }
    pub fn shift_y(&mut self, delta: T) { self[1] += delta; }
    pub fn shift_z(&mut self, delta: T) { self[2] += delta; }
    pub fn shift_w(&mut self, delta: T) { self[3] += delta; }

}


impl<T, const N: usize> From<[T; N]> for PointND<T, N> {

    fn from(array: [T; N]) -> Self {
        PointND(array)
    }

}

impl<T, const N: usize> From<PointND<T, N>> for [T; N] {

    fn from(point: PointND<T, N>) -> Self {
        point.into_arr()
    }

}

impl<T, const N: usize> TryFrom<&[T]> for PointND<T, N>
    where T: Copy {

    type Error = TryFromSliceError;
    fn try_from(slice: &[T]) -> Result<Self, Self::Error> {

        let res: Result<[T; N], _> = slice.try_into();
        match res {
            Ok(arr) => Ok( PointND(arr) ),
            Err(err) => Err( err )
        }
    }

}


#[cfg(test)]
mod tests {
    use super::*;

    #[cfg(test)]
    mod iterating {
        use super::*;

        #[test]
        fn can_iter() {

            let arr = [0, 1, 2, 3];

            let p = PointND::<u8, 4>::from_slice(&arr);
            for (i, item) in p.iter().enumerate() {
                assert_eq!(arr[i], *item);
            }

            let mut p = PointND::<u8, 4>::from_slice(&arr);
            for item in p.iter_mut() {
                *item = 10;
            }

            for i in p.into_iter() {
                assert_eq!(i, 10u8);
            }

        }

    }

    #[cfg(test)]
    mod constructors {
        use super::*;

        // The from() constructor is under tests::from_and_into

        #[test]
        fn from_slice_works() {
            let arr = [0.0, 0.1, 0.2];
            let p = PointND::<f64, 3>::from_slice(&arr);
            for i in 0..p.dims() {
                assert_eq!(arr[i], p[i]);
            }
        }

        #[test]
        fn fill_works() {
            let fill_val = 21u8;
            let p = PointND::<u8, 5>::fill(fill_val);
            for i in p.into_iter() {
                assert_eq!(i, fill_val);
            }
        }

    }

    #[cfg(test)]
    mod indexing {
        use super::*;

        #[test]
        fn can_get_slice_by_range_index() {
            let p = PointND::from([0,1,2,3,4]);
            let slice = &p[0..3];
            assert_eq!(slice, [0,1,2]);
        }

        #[test]
        #[should_panic]
        fn cannot_get_out_of_bounds_index() {
            let p = PointND::from([0,1,2]);
            let _x = p[p.dims() + 1];
        }

        #[test]
        fn can_set_value_by_index() {

            let mut p = PointND::from([0,1,2]);

            let new_val = 9999;
            p[1] = new_val;

            assert_eq!(p.into_arr(), [0, new_val, 2]);
        }

    }

    #[cfg(test)]
    #[cfg(feature = "appliers")]
    mod appliers {
        use super::*;

        #[test]
        fn can_apply() {

            let arr = [0,1,2,3];

            let p = PointND::<u8, 4>
                ::from(arr)
                .apply(|a| a * 2);

            assert_eq!(p.into_arr(), [0, 2, 4, 6]);
        }

        #[test]
        fn can_apply_dims() {

            let p = PointND::from([-2,-1,0,1,2])
                .apply_dims(&[0, 3], |item| item - 10);
            assert_eq!(p.into_arr(), [-12,-1, 0, -9, 2]);
        }

        #[test]
        fn can_apply_vals() {

            let p = PointND::from([0,1,2])
                .apply_vals([Some(10), None, Some(20)],
                            |a, b| {
                        if let Some(i) = b {
                            a + i
                        } else {
                            a
                        }
                    });
            assert_eq!(p.into_arr(), [10, 1, 22]);
        }

        #[test]
        fn can_apply_point() {

            let p1 = PointND::from([0, 1, 2, 3]);
            let p2 = PointND::from([0, -1, -2, -3]);
            let p3 = p1.apply_point(p2, |a, b| a - b );
            assert_eq!(p3.into_arr(), [0, 2, 4, 6]);
        }

        #[test]
        fn can_apply_noclone_items() {

            #[derive(Debug, Eq, PartialEq)]
            enum X { A, B, C }

            let p = PointND
                ::from([X::A, X::B, X::C])
                .apply(|x| {
                    match x {
                        X::A => X::B,
                        X::B => X::C,
                        X::C => X::A,
                    }
                });

            assert_eq!(p.into_arr(), [X::B, X::C, X::A]);
        }

    }

    #[cfg(test)]
    #[cfg(feature = "var-dims")]
    mod extenders {
        use super::*;

        #[test]
        fn can_extend() {

            let zero = PointND::<i32, 0>::from([]);
            assert_eq!(zero.dims(), 0);

            let two = zero.clone().extend([0,1]);
            assert_eq!(two.dims(), 2);
            assert_eq!(two.into_arr(), [0, 1]);

            let five = PointND
                ::from([0,1,2])
                .extend([3,4]);
            assert_eq!(five.dims(), 5);
            assert_eq!(five.clone().into_arr(), [0,1,2,3,4]);

            let sum = five.apply_point(PointND::from([0,1,2,3,4]), |a, b| a + b);
            assert_eq!(sum.into_arr(), [0,2,4,6,8]);

            let huge = PointND
                ::from([0; 100])
                .extend([1; 1_000]) as PointND<i32, 1_100>;
            assert_eq!(huge.dims(), 1_100);
        }

        #[test]
        fn can_extend_nothing() {
            let arr: [i32; 0] = [];
            let zero = PointND
                ::from(arr)
                .extend::<0, 0>(arr);
            assert_eq!(zero.dims(), 0);
        }

    }

    #[cfg(test)]
    #[cfg(feature = "var-dims")]
    mod retain {
        use super::*;

        #[test]
        fn can_retain_n() {
            let p = PointND
                ::from([0,1,2,3])
                .retain(3);

            assert_eq!(p.dims(), 3);
            assert_eq!(p.into_arr(), [0,1,2]);
        }

        #[test]
        fn can_retain_zero() {
            let p = PointND
                ::from([0,1,2,3])
                .retain(0);

            assert_eq!(p.dims(), 0);
            assert_eq!(p.into_arr(), []);
        }

        #[test]
        fn can_retain_same() {
            let p = PointND
                ::from([0,1,2,3])
                .retain(4);

            assert_eq!(p.dims(), 4);
            assert_eq!(p.into_arr(), [0,1,2,3]);
        }

        #[test]
        #[should_panic]
        #[allow(unused_variables)]
        fn cannot_retain_more_dimensions() {
            let p = PointND
                ::from([0,1,2,3])
                .retain::<1000>(1000);
        }

    }

    #[cfg(test)]
    #[cfg(any(feature = "x", feature = "y", feature = "z", feature = "w"))]
    mod conv_methods {
        use super::*;

        #[cfg(test)]
        #[cfg(any(feature = "x", feature = "y", feature = "z", feature = "w"))]
        mod get {
            use super::*;

            #[test]
            #[cfg(feature = "x")]
            fn getter_for_1d_points_work() {
                let arr = [0];
                let p = PointND::from(arr);
                assert_eq!(*p.x(), arr[0]);
            }

            #[test]
            #[cfg(feature = "y")]
            fn getters_for_2d_points_work() {
                let arr = [0,1];
                let p = PointND::from(arr);

                assert_eq!(*p.x(), arr[0]);
                assert_eq!(*p.y(), arr[1]);
            }

            #[test]
            #[cfg(feature = "z")]
            fn getters_for_3d_points_work() {
                let arr = [0,1,2];
                let p = PointND::from(arr);

                assert_eq!(*p.x(), arr[0]);
                assert_eq!(*p.y(), arr[1]);
                assert_eq!(*p.z(), arr[2]);
            }

            #[test]
            #[cfg(feature = "w")]
            fn getters_for_4d_points_work() {
                let arr = [0,1,2,3];
                let p = PointND::from(arr);

                assert_eq!(*p.x(), arr[0]);
                assert_eq!(*p.y(), arr[1]);
                assert_eq!(*p.z(), arr[2]);
                assert_eq!(*p.w(), arr[3]);
            }

        }

        #[cfg(test)]
        #[cfg(any(feature = "x", feature = "y", feature = "z", feature = "w"))]
        mod set {
            use super::*;

            #[test]
            #[cfg(feature = "x")]
            fn setter_for_1d_points_work() {

                let old_vals = [0];
                let new_val = 4;
                let mut p = PointND::from(old_vals);

                p.set_x(new_val);
                assert_eq!(*p.x(), new_val);
            }

            #[test]
            #[cfg(feature = "y")]
            fn setters_for_2d_points_work() {

                let old_vals = [0,1];
                let new_vals = [4,5];
                let mut p = PointND::from(old_vals);

                p.set_x(new_vals[0]);
                p.set_y(new_vals[1]);

                assert_eq!(*p.x(), new_vals[0]);
                assert_eq!(*p.y(), new_vals[1]);
            }

            #[test]
            #[cfg(feature = "z")]
            fn setters_for_3d_points_work() {

                let old_vals = [0,1,2];
                let new_vals = [4,5,6];
                let mut p = PointND::from(old_vals);

                p.set_x(new_vals[0]);
                p.set_y(new_vals[1]);
                p.set_z(new_vals[2]);

                assert_eq!(*p.x(), new_vals[0]);
                assert_eq!(*p.y(), new_vals[1]);
                assert_eq!(*p.z(), new_vals[2]);
            }

            #[test]
            #[cfg(feature = "w")]
            fn setters_for_4d_points_work() {

                let old_vals = [0,1,2,3];
                let new_vals = [4,5,6,7];
                let mut p = PointND::from(old_vals);

                p.set_x(new_vals[0]);
                p.set_y(new_vals[1]);
                p.set_z(new_vals[2]);
                p.set_w(new_vals[3]);

                assert_eq!(*p.x(), new_vals[0]);
                assert_eq!(*p.y(), new_vals[1]);
                assert_eq!(*p.z(), new_vals[2]);
                assert_eq!(*p.w(), new_vals[3]);
            }

        }

        #[cfg(test)]
        #[cfg(any(feature = "x", feature = "y", feature = "z", feature = "w"))]
        mod shift {
            use super::*;

            #[test]
            #[cfg(feature = "x")]
            fn can_shift_1d_points() {
                let mut p = PointND::from([0.1]);
                p.shift_x(1.23);

                assert_eq!(p.into_arr(), [1.33]);
            }

            #[test]
            #[cfg(feature = "y")]
            fn can_shift_2d_points() {
                let mut p = PointND::from([12, 345]);
                p.shift_x(-22);
                p.shift_y(-345);

                assert_eq!(p.into_arr(), [-10, 0]);
            }

            #[test]
            #[cfg(feature = "z")]
            fn can_shift_3d_points() {
                let mut p = PointND::from([42.4, 2.85, 75.01]);
                p.shift_x(40.6);
                p.shift_y(-2.85);
                p.shift_z(24.99);

                assert_eq!(p.into_arr(), [83.0, 0.0, 100.0]);
            }

            #[test]
            #[cfg(feature = "w")]
            fn can_shift_4d_points() {
                let mut p = PointND::from([0,1,2,3]);
                p.shift_x(10);
                p.shift_y(-2);
                p.shift_z(5);
                p.shift_w(0);

                assert_eq!(p.into_arr(), [10, -1, 7, 3]);
            }

        }

    }

    #[cfg(test)]
    mod from_and_into {
        use super::*;

        #[test]
        fn from_array_works() {
            let p = PointND::from([0,1,2]);
            assert_eq!(p.dims(), 3);

            let p: PointND<i32, 4> = [22; 4].into();
            assert_eq!(p.into_arr(), [22; 4]);
        }

        #[test]
        fn into_array_works() {
            let arr: [i32; 3] = PointND::fill(10).into();
            assert_eq!(arr, [10, 10, 10]);
        }

    }

    #[cfg(test)]
    mod try_from_and_try_into {
        use super::*;

        #[test]
        fn can_try_from_array() {
            let arr = [0,1,2,3,4,5];
            let p: Result<PointND<_, 6>, _> = arr.try_into();
            assert!(p.is_ok());
        }

        #[test]
        fn can_try_from_slice_of_same_len() {
            let slice = &[0,1,2,3,4][..];
            let p: Result<PointND<_, 5>, _> = slice.try_into();
            assert!(p.is_ok());
        }

        #[test]
        fn cannot_try_from_slice_of_different_length() {
            let slice = &[0,1,2,3,4][..];
            let p: Result<PointND<_, 10921>, _> = slice.try_into();
            assert!(p.is_err());
        }

    }

}