no_proto 0.9.60

Flexible, Fast & Compact Serialization with RPC
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
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
//! Top level abstraction for buffer objects

use alloc::prelude::v1::Box;
use crate::{json_decode, json_flex::JSMAP, pointer::NP_Cursor_Parent, schema::{NP_Bytes_Data, NP_Map_List_Data, NP_String_Data, NP_Struct_Data, NP_Tuple_Data}};
use alloc::string::String;
use crate::{NP_Size_Data, schema::NP_TypeKeys};
use crate::{memory::NP_Memory, utils::opt_err};
use crate::collection::tuple::NP_Tuple;

use crate::{pointer::{NP_Scalar}};
use crate::{collection::map::NP_Map};
use crate::{pointer::NP_Value};
use crate::pointer::NP_Cursor;
use crate::{schema::NP_Parsed_Schema, collection::struc::NP_Struct};
use alloc::vec::Vec;
use crate::{collection::{list::NP_List}};
use crate::error::NP_Error;
use crate::{json_flex::NP_JSON};
use crate::alloc::borrow::ToOwned;

/// The address location of the root pointer.
#[doc(hidden)]
pub const DEFAULT_ROOT_PTR_ADDR: usize = 2;
/// Maximum size of list collections
#[doc(hidden)]
pub const LIST_MAX_SIZE: usize = core::u16::MAX as usize;
#[doc(hidden)]
pub const VTABLE_SIZE: usize = 4;
#[doc(hidden)]
pub const VTABLE_BYTES: usize = 20;


/// Buffers contain the bytes of each object and allow you to perform reads, updates, deletes and compaction.
/// 
/// 
#[derive(Debug, Clone)]
pub struct NP_Buffer {
    /// Memory object used by this buffer
    memory: NP_Memory,
    /// Is this buffer mutable?
    pub mutable: bool,
    cursor: NP_Cursor
}

unsafe impl Send for NP_Buffer {}

/// Finished buffer, can't be edited.  Just exported.
/// 
#[derive(Debug)]
pub struct NP_Finished_Buffer {
    memory: NP_Memory
}

impl NP_Finished_Buffer {
    /// How large the buffer is
    /// 
    pub fn buffer_len(self) -> usize {
        self.memory.read_bytes().len()
    }

    /// How many bytes the data is using in the buffer
    /// 
    pub fn data_len(self) -> usize {
        self.memory.length()
    }

    /// Get an owned copy of the bytes in the buffer
    /// If the buffer was a `ref` or `ref_mut` this creates a copy of the underlying bytes.
    /// If the buffer was an owned type, this moves the bytes out of the buffer
    /// 
    pub fn bytes(self) -> Vec<u8> {
        self.memory.dump()
    }
}

impl NP_Buffer {

    #[doc(hidden)]
    pub fn _new(memory: NP_Memory) -> Self { // make new buffer

        NP_Buffer {
            cursor: NP_Cursor::new(memory.root, 0, 0),
            mutable: memory.is_mutable,
            memory: memory
        }
    }

    /// Copy an object at the provided path and all it's children into JSON.
    /// 
    /// ```
    /// use no_proto::error::NP_Error;
    /// use no_proto::NP_Factory;
    /// use no_proto::NP_Size_Data;
    /// 
    /// let factory: NP_Factory = NP_Factory::new(r#"
    ///     struct({fields: {
    ///         age: u8(),
    ///         name: string()
    ///     }})
    /// "#)?;
    /// 
    /// let mut new_buffer = factory.new_buffer(None);
    /// new_buffer.set(&["name"], "Jeb Kermin");
    /// new_buffer.set(&["age"], 30u8);
    /// 
    /// assert_eq!(r#"{"value":{"age":30,"name":"Jeb Kermin"}}"#, new_buffer.json_encode(&[])?.stringify());
    /// assert_eq!(r#"{"value":"Jeb Kermin"}"#, new_buffer.json_encode(&["name"])?.stringify());
    /// 
    /// # Ok::<(), NP_Error>(()) 
    /// ```
    /// 
    pub fn json_encode(&self, path: &[&str]) -> Result<NP_JSON, NP_Error> {

        let value_cursor = NP_Cursor::select(&self.memory, self.cursor.clone(), false, false, path)?;

        if let Some(x) = value_cursor {

            let mut json_map = JSMAP::new();

            json_map.insert(String::from("value"), NP_Cursor::json_encode(0, &x, &self.memory));
    
            Ok(NP_JSON::Dictionary(json_map))
        } else {
            Ok(NP_JSON::Null)
        }

    }

    /// Finish the buffer.
    /// 
    /// If the buffer is an onwed type typically opened with `.open_buffer` or created with `.new_empty` you will get the bytes of the buffer returned from this method.
    /// 
    /// If the buffer is a ref type typically opened with `.open_buffer_ref` or `.open_buffer_ref_mut` this method returns an empty `Vec<u8>`.
    /// 
    /// ```
    /// use no_proto::error::NP_Error;
    /// use no_proto::NP_Factory;
    /// use no_proto::NP_Size_Data;
    /// 
    /// let factory: NP_Factory = NP_Factory::new("string()")?;
    /// 
    /// let mut new_buffer = factory.new_buffer(None);
    /// // set initial value
    /// new_buffer.set(&[], "hello")?;
    /// // close buffer and get bytes
    /// let bytes: Vec<u8> = new_buffer.finish().bytes();
    /// assert_eq!([0, 0, 0, 0, 0, 6, 0, 0, 0, 5, 104, 101, 108, 108, 111].to_vec(), bytes);
    /// 
    /// # Ok::<(), NP_Error>(()) 
    /// ```
    /// 
    pub fn finish(self) -> NP_Finished_Buffer {
        NP_Finished_Buffer { memory: self.memory }
    }

    /// Read the bytes of the buffer immutably.  No touching!
    /// 
    pub fn read_bytes(&self) -> &[u8] {
        self.memory.read_bytes()
    }

    /// Move buffer cursor to new location.  Cursors can only be moved into children.  If you need to move up reset the cursor to root, then move back down to the desired level.
    /// 
    /// This also creates objects/collections along the path as needed.  If you attempt to move into a path that doesn't exist, this method will return `false`.  Otherwise it will return `true` of the path requested exists or is something that can be made to exist.
    /// 
    pub fn move_cursor(&mut self, path: &[&str]) -> Result<bool, NP_Error> {

        let value_cursor = NP_Cursor::select(&self.memory, self.cursor.clone(), self.mutable, false, path)?;

        let cursor = if let Some(x) = value_cursor {
            x
        } else {
            return Ok(false);
        };

        self.cursor = cursor;

        Ok(true)
    }

    /// Moves cursor position to root of buffer, the default.
    /// 
    pub fn cursor_to_root(&mut self) {
        self.cursor = NP_Cursor::new(self.memory.root, 0, 0);
    }

    /// Set the max value allowed for the specific data type at the given key.
    /// 
    /// String & Byte types only work if a `size` property is set in the schema.
    /// 
    /// Will return `true` if a value was found and succesfully set, `false` otherwise.
    /// 
    /// *WARNING* If you call this on a collection (Map, Tuple, List, or Table) ALL children will be overwritten/set.  The method is recursive, so this will hit *all* children, including nested children.
    /// 
    /// When this is applied to a `string` data type, only ascii values are supported.
    /// 
    /// ```
    /// use no_proto::error::NP_Error;
    /// use no_proto::NP_Factory;
    /// 
    /// let factory: NP_Factory = NP_Factory::new(r#"
    ///     tuple({
    ///         sorted: true,
    ///         values: [string({size: 10}), u32()]
    ///     })
    /// "#)?;
    /// 
    /// let mut low_buffer = factory.new_buffer(None);
    /// // set all types to minimum value
    /// low_buffer.set_min(&[])?;
    /// // get bytes
    /// let low_bytes: Vec<u8> = low_buffer.finish().bytes();
    /// 
    /// let mut high_buffer = factory.new_buffer(None);
    /// // set all types to max value
    /// high_buffer.set_max(&[])?;
    /// // get bytes
    /// let high_bytes: Vec<u8> = high_buffer.finish().bytes();
    /// 
    /// let mut middle_buffer = factory.new_buffer(None);
    /// middle_buffer.set(&["0"], "Light This Candle!");
    /// middle_buffer.set(&["1"], 22938u32);
    /// let middle_bytes: Vec<u8> = middle_buffer.finish().bytes();
    /// 
    /// assert!(low_bytes < middle_bytes);
    /// assert!(middle_bytes < high_bytes);
    /// assert!(low_bytes < high_bytes);
    /// 
    /// 
    /// # Ok::<(), NP_Error>(()) 
    /// ```
    /// 
    pub fn set_max(&mut self, path: &[&str]) -> Result<bool, NP_Error> {
        if self.mutable == false {
            return Err(NP_Error::MemoryReadOnly)
        }

        let value_cursor = NP_Cursor::select(&self.memory, self.cursor.clone(), self.mutable, false, path)?;
        match value_cursor {
            Some(x) => {
                Ok(NP_Cursor::set_max(x, &self.memory)?)
            }
            None => Ok(false)
        }
    }

    /// Set the min value allowed for the specific data type at the given key.
    /// 
    /// String & Byte types only work if a `size` property is set in the schema.
    /// 
    /// Will return `true` if a value was found and succesfully set, `false` otherwise.
    /// 
    /// *WARNING* If you call this on a collection (Map, Tuple, List, or Table) ALL children will be overwritten/set.  The method is recursive, so this will hit *all* children, including nested children.
    /// 
    /// When this is applied to a `string` data type, only ascii values are supported.
    /// 
    /// ```
    /// use no_proto::error::NP_Error;
    /// use no_proto::NP_Factory;
    /// 
    /// let factory: NP_Factory = NP_Factory::new(r#"
    ///     tuple({
    ///         sorted: true,
    ///         values: [string({size: 10}), u32()]
    ///     })
    /// "#)?;
    /// 
    /// let mut low_buffer = factory.new_buffer(None);
    /// // set all types to minimum value
    /// low_buffer.set_min(&[])?;
    /// // get bytes
    /// let low_bytes: Vec<u8> = low_buffer.finish().bytes();
    /// 
    /// let mut high_buffer = factory.new_buffer(None);
    /// // set all types to max value
    /// high_buffer.set_max(&[])?;
    /// // get bytes
    /// let high_bytes: Vec<u8> = high_buffer.finish().bytes();
    /// 
    /// let mut middle_buffer = factory.new_buffer(None);
    /// middle_buffer.set(&["0"], "Light This Candle!");
    /// middle_buffer.set(&["1"], 22938u32);
    /// let middle_bytes: Vec<u8> = middle_buffer.finish().bytes();
    /// 
    /// assert!(low_bytes < middle_bytes);
    /// assert!(middle_bytes < high_bytes);
    /// assert!(low_bytes < high_bytes);
    /// 
    /// 
    /// # Ok::<(), NP_Error>(()) 
    /// ```
    /// 
    pub fn set_min(&mut self, path: &[&str]) -> Result<bool, NP_Error> {

        if self.mutable == false {
            return Err(NP_Error::MemoryReadOnly)
        }

        let value_cursor = NP_Cursor::select(&self.memory, self.cursor.clone(), self.mutable, false, path)?;
        match value_cursor {
            Some(x) => {
                Ok(NP_Cursor::set_min(x, &self.memory)?)
            }
            None => Ok(false)
        }
    }

    /// Used to set scalar values inside the buffer.
    /// 
    /// The type that you set with will be compared to the schema, if it doesn't match the schema the request will fail.
    /// 
    /// ```
    /// use no_proto::error::NP_Error;
    /// use no_proto::NP_Factory;
    /// use no_proto::NP_Size_Data;
    /// 
    /// // a list where each item is a map where each key has a value containing a list of strings
    /// let factory: NP_Factory = NP_Factory::new(r#"list({of: map({ value: list({ of: string() })})})"#)?;
    /// 
    /// let mut new_buffer = factory.new_buffer(None);
    /// // third item in the top level list -> key "alpha" of map at 3rd element -> 9th element of list at "alpha" key
    /// // 
    /// new_buffer.set(&["3", "alpha", "9"], "look at all this nesting madness")?;
    /// 
    /// // get the same item we just set
    /// let message = new_buffer.get::<&str>(&["3", "alpha", "9"])?;
    /// 
    /// assert_eq!(message, Some("look at all this nesting madness"));
    /// 
    /// # Ok::<(), NP_Error>(()) 
    /// ```
    /// 
    pub fn set<'set, X: 'set>(&mut self, path: &[&str], value: X) -> Result<bool, NP_Error> where X: NP_Value<'set> + NP_Scalar<'set> {

        if self.mutable == false {
            return Err(NP_Error::MemoryReadOnly);
        }

        let value_cursor = NP_Cursor::select(&self.memory, self.cursor.clone(), self.mutable, false, path)?;
        match value_cursor {
            Some(x) => {

                // type does not match schema
                if X::type_idx().1 != self.memory.get_schema(x.schema_addr).i {
                    let mut err = "TypeError: Attempted to set value for type (".to_owned();
                    err.push_str(X::type_idx().0);
                    err.push_str(") into schema of type (");
                    err.push_str(self.memory.get_schema(x.schema_addr).i.into_type_idx().0);
                    err.push_str(")\n");
                    return Err(NP_Error::new(err));
                }

                if x.parent_type == NP_Cursor_Parent::Tuple {
                    self.memory.write_bytes()[x.buff_addr - 1] = 1;
                }

                X::set_value(x, &self.memory, value)?;
                Ok(true)
            }
            None => Ok(false)
        }
    }

    /// Set value with JSON
    /// 
    /// This works with all types including portals.
    /// 
    /// Data that doesn't align with the schema will be ignored.  `Null` and `undefined` values will be ignored.
    /// 
    /// Partial updates just merge the provided values into the buffer, you only need to provide the values you'd like changed.  This method cannot be used to delete values.
    /// 
    /// Using the `.set()` method is far more performant.  I recommend only using this on the client side of your application.
    /// 
    /// ```
    /// use no_proto::error::NP_Error;
    /// use no_proto::NP_Factory;
    /// use no_proto::NP_Size_Data;
    /// 
    /// let factory: NP_Factory = NP_Factory::new("list({of: string()})")?;
    /// 
    /// let mut new_buffer = factory.new_buffer(None);
    /// new_buffer.set_with_json(&[], r#"{"value": ["foo", "bar", null, "baz"]}"#)?;
    ///    
    /// assert_eq!(new_buffer.get_length(&[])?, Some(4));
    /// assert_eq!(new_buffer.get::<&str>(&["0"])?, Some("foo"));
    /// assert_eq!(new_buffer.get::<&str>(&["1"])?, Some("bar"));
    /// assert_eq!(new_buffer.get::<&str>(&["2"])?, None);
    /// assert_eq!(new_buffer.get::<&str>(&["3"])?, Some("baz"));
    /// 
    /// new_buffer.set_with_json(&["2"], r#"{"value": "bazzy"}"#)?;
    /// assert_eq!(new_buffer.get::<&str>(&["2"])?, Some("bazzy"));
    /// 
    /// 
    /// # Ok::<(), NP_Error>(()) 
    /// ```
    /// 
    pub fn set_with_json<S: Into<String>>(&mut self, path: &[&str], json_value: S) -> Result<bool, NP_Error> {

        if self.mutable == false {
            return Err(NP_Error::MemoryReadOnly)
        }

        let value_cursor = NP_Cursor::select(&self.memory, self.cursor.clone(), self.mutable, false, path)?;
        match value_cursor {
            Some(x) => {
                let parsed = json_decode(json_value.into())?;

                match parsed["value"] {
                    NP_JSON::Null => {
                        return Err(NP_Error::new(".set_with_json requires `value` property!"))
                    },
                    _ => {
                        NP_Cursor::set_from_json(0, false, x, &self.memory, &Box::new(parsed["value"].clone()))?;
                    }
                }
                
                Ok(true)
            }
            None => Ok(false)
        }
    }

    
    /// Get an iterator for a collection
    /// 
    /// 
    /// ## List Example
    /// ```
    /// use no_proto::error::NP_Error;
    /// use no_proto::NP_Factory;
    /// use no_proto::NP_Size_Data;
    /// 
    /// let factory: NP_Factory = NP_Factory::new("list({of: string()})")?;
    /// 
    /// let mut new_buffer = factory.new_buffer(None);
    /// // set value at 1 index
    /// new_buffer.set(&["1"], "hello")?;
    /// // set value at 4 index
    /// new_buffer.set(&["4"], "world")?;
    /// // push value onto the end
    /// new_buffer.list_push(&[], "!")?;
    /// 
    /// // get iterator of root (list item)
    /// new_buffer.get_collection(&[])?.unwrap().into_iter().for_each(|item| {
    ///     match item.index {
    ///         0 => assert_eq!(item.get::<&str>().unwrap(), None),
    ///         1 => assert_eq!(item.get::<&str>().unwrap(), Some("hello")),
    ///         2 => assert_eq!(item.get::<&str>().unwrap(), None),
    ///         3 => assert_eq!(item.get::<&str>().unwrap(), None),
    ///         4 => assert_eq!(item.get::<&str>().unwrap(), Some("world")),
    ///         5 => assert_eq!(item.get::<&str>().unwrap(), Some("!")),
    ///         _ => panic!()
    ///     };
    /// });
    /// 
    /// # Ok::<(), NP_Error>(()) 
    /// ```
    /// 
    /// ## Struct Example
    /// ```
    /// use no_proto::error::NP_Error;
    /// use no_proto::NP_Factory;
    /// use no_proto::NP_Size_Data;
    /// 
    /// let factory: NP_Factory = NP_Factory::new_json(r#"{
    ///    "type": "struct",
    ///    "fields": [
    ///         ["age", {"type": "uint8"}],
    ///         ["name", {"type": "string"}],
    ///         ["job", {"type": "string"}],
    ///         ["tags", {"type": "list", "of": {"type": "string"}}]
    ///     ]
    /// }"#)?;
    /// 
    /// let mut new_buffer = factory.new_buffer(None);
    /// // set value of age
    /// new_buffer.set(&["age"], 20u8)?;
    /// // set value of name
    /// new_buffer.set(&["name"], "Bill Kerman")?;
    /// // push value onto tags list
    /// new_buffer.list_push(&["tags"], "rocket")?;
    /// 
    /// // get iterator of root (table)
    /// new_buffer.get_collection(&[])?.unwrap().into_iter().for_each(|item| {
    ///     
    ///     match item.key {
    ///         "name" => assert_eq!(item.get::<&str>().unwrap(), Some("Bill Kerman")),
    ///         "age" =>  assert_eq!(item.get::<u8>().unwrap(), Some(20)),
    ///         "job" => assert_eq!(item.get::<&str>().unwrap(), None),
    ///         "tags" => { /* tags field is list, can't do anything with it here */ },
    ///         _ => { panic!() }
    ///     };
    /// });
    /// 
    /// // we can also loop through items of the tags list
    /// new_buffer.get_collection(&["tags"])?.unwrap().into_iter().for_each(|item| {
    ///     assert_eq!(item.index, 0);
    ///     assert_eq!(item.get::<&str>().unwrap(), Some("rocket"));
    /// });
    /// 
    /// # Ok::<(), NP_Error>(()) 
    /// ```
    /// 
    /// ## Map Example
    /// ```
    /// use no_proto::error::NP_Error;
    /// use no_proto::NP_Factory;
    /// use no_proto::NP_Size_Data;
    /// 
    /// let factory: NP_Factory = NP_Factory::new_json(r#"{
    ///    "type": "map",
    ///    "value": {"type": "string"}
    /// }"#)?;
    /// 
    /// let mut new_buffer = factory.new_buffer(None);
    /// // set value of color key
    /// new_buffer.set(&["color"], "blue")?;
    /// // set value of sport key
    /// new_buffer.set(&["sport"], "soccor")?;
    /// 
    /// // get iterator of root (map)
    /// new_buffer.get_collection(&[])?.unwrap().into_iter().for_each(|item| {
    ///     
    ///     match item.key {
    ///         "color" => assert_eq!(item.get::<&str>().unwrap(), Some("blue")),
    ///         "sport" => assert_eq!(item.get::<&str>().unwrap(), Some("soccor")),
    ///         _ => panic!()
    ///     }
    /// });
    /// 
    /// # Ok::<(), NP_Error>(()) 
    /// ```
    /// 
    /// ## Tuple Example
    /// ```
    /// use no_proto::error::NP_Error;
    /// use no_proto::NP_Factory;
    /// use no_proto::NP_Size_Data;
    /// 
    /// let factory: NP_Factory = NP_Factory::new_json(r#"{
    ///    "type": "tuple",
    ///     "values": [
    ///         {"type": "string"},
    ///         {"type": "u8"},
    ///         {"type": "bool"}
    ///     ]
    /// }"#)?;
    /// 
    /// let mut new_buffer = factory.new_buffer(None);
    /// // set value at 0 index
    /// new_buffer.set(&["0"], "hello")?;
    /// // set value at 2 index
    /// new_buffer.set(&["2"], false)?;
    /// 
    /// // get iterator of root (tuple item)
    /// new_buffer.get_collection(&[])?.unwrap().into_iter().for_each(|item| {
    ///     match item.index {
    ///         0 => assert_eq!(item.get::<&str>().unwrap(), Some("hello")),
    ///         1 => assert_eq!(item.get::<u8>().unwrap(), None),
    ///         2 => assert_eq!(item.get::<bool>().unwrap(), Some(false)),
    ///         _ => panic!()
    ///     };
    /// });
    /// 
    /// # Ok::<(), NP_Error>(()) 
    /// ```
    /// 
    pub fn get_collection<'iter>(&'iter self, path: &'iter [&str]) -> Result<Option<NP_Generic_Iterator<'iter>>, NP_Error> {

        let value = NP_Cursor::select(&self.memory, self.cursor.clone(), false, false, path)?;

        let value = if let Some(x) = value {
            x
        } else {
            return Ok(None);
        };

        let value_data = value.get_value(&self.memory);

        // value doesn't exist
        if value_data.get_addr_value() == 0 {
            return Ok(None);
        }

        Ok(Some(NP_Generic_Iterator::new(value, &self.memory)?))
    }

    /// Push a value onto the end of a list.
    /// The path provided must resolve to a list type, and the type being pushed must match the schema
    /// 
    /// This is the most efficient way to add values to a list type.
    /// 
    /// ```
    /// use no_proto::error::NP_Error;
    /// use no_proto::NP_Factory;
    /// use no_proto::NP_Size_Data;
    /// 
    /// let factory: NP_Factory = NP_Factory::new_json(r#"{
    ///    "type": "list",
    ///     "of": {"type": "string"}
    /// }"#)?;
    /// 
    /// let mut new_buffer = factory.new_buffer(None);
    /// new_buffer.set(&["3"], "launch")?;
    /// new_buffer.list_push(&[], "this")?;
    /// new_buffer.list_push(&[], "rocket")?;
    /// 
    /// // get iterator of root (list item)
    /// new_buffer.get_collection(&[])?.unwrap().into_iter().for_each(|item| {
    ///     match item.index {
    ///         0 => assert_eq!(item.get::<&str>().unwrap(), None),
    ///         1 => assert_eq!(item.get::<&str>().unwrap(), None),
    ///         2 => assert_eq!(item.get::<&str>().unwrap(), None),
    ///         3 => assert_eq!(item.get::<&str>().unwrap(), Some("launch")),
    ///         4 => assert_eq!(item.get::<&str>().unwrap(), Some("this")),
    ///         5 => assert_eq!(item.get::<&str>().unwrap(), Some("rocket")),
    ///         _ => panic!()
    ///     };
    /// });
    /// 
    /// let mut new_buffer = factory.new_buffer(None);
    /// new_buffer.list_push(&[], "launch")?;
    /// new_buffer.list_push(&[], "this")?;
    /// new_buffer.list_push(&[], "rocket")?;
    /// 
    /// // get iterator of root (list item)
    /// new_buffer.get_collection(&[])?.unwrap().into_iter().for_each(|item| {
    ///     match item.index {
    ///         0 => assert_eq!(item.get::<&str>().unwrap(), Some("launch")),
    ///         1 => assert_eq!(item.get::<&str>().unwrap(), Some("this")),
    ///         2 => assert_eq!(item.get::<&str>().unwrap(), Some("rocket")),
    ///         _ => panic!()
    ///     };
    /// });
    /// 
    /// # Ok::<(), NP_Error>(()) 
    /// ```
    /// 
    pub fn list_push<'push, X: 'push>(&mut self, path: &[&str], value: X) -> Result<Option<u16>, NP_Error> where X: NP_Value<'push> + NP_Scalar<'push> {

        if self.mutable == false {
            return Err(NP_Error::MemoryReadOnly)
        }

        let list_cursor = if path.len() == 0 { self.cursor.clone() } else { match NP_Cursor::select(&self.memory, self.cursor.clone(), true, false, path)? {
            Some(x) => x,
            None => return Ok(None)
        }};

        let schema = self.memory.get_schema(list_cursor.schema_addr);

        match schema.i {
            NP_TypeKeys::List => {

                let data = unsafe { &*(*schema.data as *const NP_Map_List_Data) };

                let of = data.child;
                    
                let of_schema = &self.memory.get_schema(of);

                // type does not match schema
                if X::type_idx().1 != of_schema.i {
                    let mut err = "TypeError: Attempted to set value for type (".to_owned();
                    err.push_str(X::type_idx().0);
                    err.push_str(") into schema of type (");
                    err.push_str(of_schema.i.into_type_idx().0);
                    err.push_str(")\n");
                    return Err(NP_Error::new(err));
                }
            },
            _ => return Err(NP_Error::new("Trying to push onto non list item!"))
        }

        match NP_List::push(&list_cursor, &self.memory, None)? {
            Some((index, new_item_addr)) => {
                X::set_value(new_item_addr, &self.memory, value)?;
                Ok(Some(index))
            },
            None => Ok(None)
        }
    }


    /// Get length of String, Bytes, Table, Tuple, List or Map Type
    /// 
    /// If the type found at the path provided does not support length operations, you'll get `None`.
    /// 
    /// If there is no value at the path provodid, you will get `None`.
    /// 
    /// If an item is found and it's length is zero, you can expect `Some(0)`.
    /// 
    /// ## String Example
    /// ```
    /// use no_proto::error::NP_Error;
    /// use no_proto::NP_Factory;
    /// use no_proto::NP_Size_Data;
    /// 
    /// let factory: NP_Factory = NP_Factory::new("string()")?;
    /// 
    /// let mut new_buffer = factory.new_buffer(None);
    /// // set initial value
    /// new_buffer.set(&[], "hello")?;
    /// // get length of value at root (String)
    /// assert_eq!(new_buffer.get_length(&[])?, Some(5));
    /// 
    /// # Ok::<(), NP_Error>(()) 
    /// ```
    /// 
    /// ## Collection (List) Example
    /// ```
    /// use no_proto::error::NP_Error;
    /// use no_proto::NP_Factory;
    /// use no_proto::NP_Size_Data;
    /// 
    /// let factory: NP_Factory = NP_Factory::new("list({ of: string() })")?;
    /// 
    /// let mut new_buffer = factory.new_buffer(None);
    /// // set value at 9th index
    /// new_buffer.set(&["9"], "hello")?;
    /// // get length of value at root (List)
    /// assert_eq!(new_buffer.get_length(&[])?, Some(10));
    /// 
    /// # Ok::<(), NP_Error>(()) 
    /// ```
    /// 
    /// ## Collection (Table) Example
    /// ```
    /// use no_proto::error::NP_Error;
    /// use no_proto::NP_Factory;
    /// use no_proto::NP_Size_Data;
    /// 
    /// let factory: NP_Factory = NP_Factory::new(r#"
    ///     struct({fields: {
    ///         age: u8(),
    ///         name: string()
    ///     }})
    /// "#)?;
    /// 
    /// let mut new_buffer = factory.new_buffer(None);
    /// // get length of value at root (Table)
    /// assert_eq!(new_buffer.get_length(&[])?, Some(2));
    /// 
    /// # Ok::<(), NP_Error>(()) 
    /// ```
    /// 
    /// ## Collection (Map) Example
    /// ```
    /// use no_proto::error::NP_Error;
    /// use no_proto::NP_Factory;
    /// use no_proto::NP_Size_Data;
    /// 
    /// let factory: NP_Factory = NP_Factory::new("map({value: string() })")?;
    /// 
    /// let mut new_buffer = factory.new_buffer(None);
    /// // set values
    /// new_buffer.set(&["foo"], "bar")?;
    /// new_buffer.set(&["foo2"], "bar2")?;
    /// // get length of value at root (Map)
    /// assert_eq!(new_buffer.get_length(&[])?, Some(2));
    /// 
    /// # Ok::<(), NP_Error>(()) 
    /// ```
    /// 
    /// ## Collection (Tuple) Example
    /// ```
    /// use no_proto::error::NP_Error;
    /// use no_proto::NP_Factory;
    /// use no_proto::NP_Size_Data;
    /// 
    /// let factory: NP_Factory = NP_Factory::new("tuple({values: [string(), string()]})")?;
    /// 
    /// let mut new_buffer = factory.new_buffer(None);
    /// // get length of value at root (Tuple)
    /// assert_eq!(new_buffer.get_length(&[])?, Some(2));
    /// 
    /// # Ok::<(), NP_Error>(()) 
    /// ```
    /// 
    pub fn get_length(&self, path: &[&str]) -> Result<Option<usize>, NP_Error> {
        let value_cursor = NP_Cursor::select(&self.memory, self.cursor.clone(), false, false, path)?;

        let found_cursor = if let Some(x) = value_cursor {
            x
        } else {
            return Ok(None);
        };

        let addr_value = found_cursor.get_value(&self.memory).get_addr_value();

        let schema = self.memory.get_schema(found_cursor.schema_addr);

        match schema.i {
            NP_TypeKeys::List => {
                if addr_value == 0 {
                    return Ok(None);
                }

                let data = unsafe { &*(*schema.data as *const NP_Map_List_Data) };

                let of = data.child;

                let list_data = NP_List::get_list(addr_value as usize, &self.memory);
                let tail_addr = list_data.get_tail() as usize;
                if tail_addr == 0 {
                    Ok(Some(0))
                } else {
                    let tail_cursor = NP_Cursor::new(tail_addr, of, found_cursor.schema_addr);
                    let cursor_data = tail_cursor.get_value(&self.memory);
                    Ok(Some(cursor_data.get_index() as usize + 1))
                }
            },
            NP_TypeKeys::Map => {
                if addr_value == 0 {
                    return Ok(None);
                }
                let mut count = 0usize;
                {
                    let mut map_iter = NP_Map::new_iter(&found_cursor, &self.memory);

                    while let Some((_ikey, _item)) = map_iter.step_iter(&self.memory) {
                        count += 1;
                    }
                }

                Ok(Some(count))
            },
            NP_TypeKeys::Struct => {
                let data = unsafe { &*(*schema.data as *const NP_Struct_Data) };
                Ok(Some(data.fields.len()))
            },
            NP_TypeKeys::Tuple => {
                let data = unsafe { &*(*schema.data as *const NP_Tuple_Data) };
                Ok(Some(data.values.len()))
            },
            NP_TypeKeys::Bytes => {

                let data = unsafe { &*(*schema.data as *const NP_Bytes_Data) };

                let size = data.size;
         
                if size > 0 {
                    Ok(Some(size as usize))
                } else {
                    let length_bytes = self.memory.get_4_bytes(addr_value as usize).unwrap_or(&[0u8; 4]);
                    Ok(Some(u32::from_be_bytes(*length_bytes) as usize))
                }
               
            },
            NP_TypeKeys::UTF8String => {

                let data = unsafe { &*(*schema.data as *const NP_String_Data) };

                let size = data.size;
            
                if size > 0 {
                    Ok(Some(size as usize))
                } else {
                    let length_bytes = self.memory.get_4_bytes(addr_value as usize).unwrap_or(&[0u8; 4]);
                    Ok(Some(u32::from_be_bytes(*length_bytes) as usize))
                }
    
            },
            _ => {
                Ok(None)
            }
        }
  
    }

    /// Clear an inner value from the buffer.
    /// This can also be used to clear deeply nested collection objects or scalar objects.
    /// 
    /// Returns `true` if it found a value to delete (and deleted it), `false` otherwise.
    /// 
    /// ```
    /// use no_proto::error::NP_Error;
    /// use no_proto::NP_Factory;
    /// use no_proto::NP_Size_Data;
    /// 
    /// let factory: NP_Factory = NP_Factory::new("list({ of: string() })")?;
    /// 
    /// let mut new_buffer = factory.new_buffer(None);
    /// // set index 0
    /// new_buffer.set(&["0"], "hello")?;
    /// // del index 0
    /// new_buffer.del(&["0"])?;
    /// // value is gone now!
    /// assert_eq!(None, new_buffer.get::<&str>(&["0"])?);
    /// 
    /// # Ok::<(), NP_Error>(()) 
    /// ```
    /// 
    pub fn del(&mut self, path: &[&str]) -> Result<bool, NP_Error> {

        if self.mutable == false {
            return Err(NP_Error::MemoryReadOnly)
        }

        let value_cursor = NP_Cursor::select(&self.memory, self.cursor.clone(), false, false, path)?;
        
        match value_cursor {
            Some(x) => {
                NP_Cursor::delete(x, &self.memory)
            }
            None => Ok(false)
        }
    }

    /// Retrieve the schema type at a given path.
    /// 
    /// 
    /// ```
    /// use no_proto::error::NP_Error;
    /// use no_proto::NP_Factory;
    /// use no_proto::schema::NP_TypeKeys;
    /// 
    /// let factory: NP_Factory = NP_Factory::new("tuple({values: [ geo8(), dec({exp: 2}), string() ]})")?;
    /// 
    /// let mut new_buffer = factory.new_buffer(None);
    /// 
    /// assert_eq!(new_buffer.get_schema_type(&[])?.unwrap(), NP_TypeKeys::Tuple);
    /// assert_eq!(new_buffer.get_schema_type(&["0"])?.unwrap(), NP_TypeKeys::Geo);
    /// assert_eq!(new_buffer.get_schema_type(&["1"])?.unwrap(), NP_TypeKeys::Decimal);
    /// assert_eq!(new_buffer.get_schema_type(&["2"])?.unwrap(), NP_TypeKeys::UTF8String);
    /// 
    /// # Ok::<(), NP_Error>(()) 
    /// ```
    /// 
    pub fn get_schema_type(&self, path: &[&str]) -> Result<Option<NP_TypeKeys>, NP_Error> {

        match NP_Cursor::select(&self.memory, self.cursor.clone(), false, true, path)? {
            Some(x) => {
                Ok(Some(self.memory.get_schema(x.schema_addr).i))
            }
            None => Ok(None)
        }
    }

    /// Retrieve the schema default at a given path.
    /// 
    /// This is useful for `geo` and `dec` data types where there is information about the value in the schema.
    /// 
    /// For example, when you create an `NP_Geo` type to put into a `geo` field, you must know the resolution (4/8/16).  If you use this method you can get an empty `NP_Geo` type that already has the correct resolution set based on the schema.
    /// 
    /// The type that you cast the request to will be compared to the schema, if it doesn't match the schema the request will fail.
    /// 
    /// ```
    /// use no_proto::error::NP_Error;
    /// use no_proto::NP_Factory;
    /// use no_proto::pointer::dec::NP_Dec;
    /// use no_proto::pointer::geo::NP_Geo;
    /// 
    /// // a list where each item is a map where each key has a value containing a list of strings
    /// let factory: NP_Factory = NP_Factory::new(r#"
    ///     tuple({values: [
    ///         geo8(),
    ///         dec({exp: 2})
    ///     ]})
    /// "#)?;
    /// 
    /// let mut new_buffer = factory.new_buffer(None);
    /// // Get an empty NP_Geo type that has the correct resolution for the schema
    /// // 
    /// let geo_default: NP_Geo = new_buffer.get_schema_default::<NP_Geo>(&["0"])?.unwrap();
    /// assert_eq!(geo_default.size, 8); // geo is size 8 in schema
    /// 
    /// // Get an empty NP_Dec type that has the correct exp for the schema
    /// // 
    /// let dec_default: NP_Dec = new_buffer.get_schema_default::<NP_Dec>(&["1"])?.unwrap();
    /// assert_eq!(dec_default.exp, 2); // exponent is 2 in schema
    /// 
    /// # Ok::<(), NP_Error>(()) 
    /// ```
    /// 
    pub fn get_schema_default<'get, X: 'get>(&'get self, path: &[&str]) -> Result<Option<X>, NP_Error> where X: NP_Value<'get> + NP_Scalar<'get> {

        match NP_Cursor::select(&self.memory, self.cursor.clone(), false, true, path)? {
            Some(x) => {
                                
                // type does not match schema
                if X::type_idx().1 != self.memory.get_schema(x.schema_addr).i {
                    let mut err = "TypeError: Attempted to get schema for type (".to_owned();
                    err.push_str(X::type_idx().0);
                    err.push_str(") for schema of type (");
                    err.push_str(self.memory.get_schema(x.schema_addr).i.into_type_idx().0);
                    err.push_str(")\n");
                    return Err(NP_Error::new(err));
                }

                Ok(X::schema_default(&self.memory.get_schema(x.schema_addr)))
            }
            None => Ok(None)
        }
    }
  
    /// Retrieve an inner value from the buffer. 
    /// 
    /// The type that you cast the request to will be compared to the schema, if it doesn't match the schema the request will fail.
    /// 
    /// ```
    /// use no_proto::error::NP_Error;
    /// use no_proto::NP_Factory;
    /// use no_proto::NP_Size_Data;
    /// 
    /// // a list where each item is a map where each key has a value containing a list of strings
    /// let factory: NP_Factory = NP_Factory::new(r#"list({of: map({ value: list({of: string() }) })})"#)?;
    /// 
    /// let mut new_buffer = factory.new_buffer(None);
    /// // third item in the top level list -> key "alpha" of map at 3rd element -> 9th element of list at "alpha" key
    /// // 
    /// new_buffer.set(&["3", "alpha", "9"], "who would build a schema like this")?;
    /// 
    /// // get the same item we just set
    /// let message = new_buffer.get::<&str>(&["3", "alpha", "9"])?;
    /// 
    /// assert_eq!(message, Some("who would build a schema like this"));
    /// 
    /// # Ok::<(), NP_Error>(()) 
    /// ```
    /// 
    pub fn get<'get, X: 'get>(&'get self, path: &[&str]) -> Result<Option<X>, NP_Error> where X: NP_Value<'get> + NP_Scalar<'get> {
        let value_cursor = NP_Cursor::select(&self.memory, self.cursor.clone(), false, false, path)?;

        match value_cursor {
            Some(x) => {
                                
                // type does not match schema
                if X::type_idx().1 != self.memory.get_schema(x.schema_addr).i {
                    let mut err = "TypeError: Attempted to get value for type (".to_owned();
                    err.push_str(X::type_idx().0);
                    err.push_str(") for schema of type (");
                    err.push_str(self.memory.get_schema(x.schema_addr).i.into_type_idx().0);
                    err.push_str(")\n");
                    return Err(NP_Error::new(err));
                }

                match X::into_value(&x, &self.memory)? {
                    Some(x) => {
                        Ok(Some(x))
                    },
                    None => { // no value found here, return default from schema
                        match X::default_value(0, x.schema_addr, &self.memory.get_schemas()) {
                            Some(y) => {
                                Ok(Some(y))
                            },
                            None => { // no default in schema, no value to provide
                                Ok(None)
                            }
                        }                        
                    }
                }
            }
            None => Ok(None)
        }
    }


    /// This performs a compaction if the closure provided as the second argument returns `true`.
    /// Compaction is a pretty expensive operation (requires full copy of the whole buffer) so should be done sparingly.
    /// The closure is provided an argument that contains the original size of the buffer, how many bytes could be saved by compaction, and how large the new buffer would be after compaction.  The closure should return `true` to perform compaction, `false` otherwise.
    /// 
    /// The first argument, new_capacity, is the capacity of the underlying Vec<u8> that we'll be copying the data into.  The default is the size of the old buffer.
    /// 
    /// **WARNING** Your cursor location will be reset to the root.
    /// 
    /// ```
    /// use no_proto::error::NP_Error;
    /// use no_proto::NP_Factory;
    /// use no_proto::NP_Size_Data;
    /// 
    /// let factory: NP_Factory = NP_Factory::new("string()")?;
    /// 
    /// let mut new_buffer = factory.new_buffer(None);
    /// // set initial value
    /// new_buffer.set(&[], "hello")?;
    /// // using 15 bytes
    /// assert_eq!(NP_Size_Data {
    ///     current_buffer: 15,
    ///     after_compaction: 15,
    ///     wasted_bytes: 0
    /// }, new_buffer.calc_bytes()?);
    /// // update the value
    /// new_buffer.set(&[], "hello, world")?;
    /// // now using 31 bytes, with 9 bytes of wasted space
    /// assert_eq!(NP_Size_Data {
    ///     current_buffer: 31,
    ///     after_compaction: 22,
    ///     wasted_bytes: 9
    /// }, new_buffer.calc_bytes()?);
    /// // compact to save space
    /// new_buffer.maybe_compact(None, |compact_data| {
    ///     // only compact if wasted bytes are greater than 5
    ///     if compact_data.wasted_bytes > 5 {
    ///         true
    ///     } else {
    ///         false
    ///     }
    /// })?;
    /// // back down to 18 bytes with no wasted bytes
    /// assert_eq!(NP_Size_Data {
    ///     current_buffer: 22,
    ///     after_compaction: 22,
    ///     wasted_bytes: 0
    /// }, new_buffer.calc_bytes()?);
    /// 
    /// # Ok::<(), NP_Error>(()) 
    /// ```
    /// 
    pub fn maybe_compact<F>(&mut self, new_capacity: Option<usize>, mut callback: F) -> Result<(), NP_Error> where F: FnMut(NP_Size_Data) -> bool {

        if self.mutable == false {
            return Err(NP_Error::MemoryReadOnly)
        }

        let bytes_data = self.calc_bytes()?;

        if callback(bytes_data) {
            self.compact(new_capacity)?;
        }

        return Ok(());
    }

    /// Compacts a buffer to remove an unused bytes or free space after a mutation.
    /// This is a pretty expensive operation (requires full copy of the whole buffer) so should be done sparingly.
    /// 
    /// The first argument, new_capacity, is the capacity of the underlying Vec<u8> that we'll be copying the data into.  The default is the size of the old buffer.
    /// 
    /// - If this buffer is an owned type typically created with `new_buffer` or opened with `open_buffer` the comapction will occur into the existing buffer. 
    /// - If this buffer is a ref type typically opened with `open_buffer_ref` the compaction will fail.  Use `compact_into` instead.
    /// - If this buffer is a mutable ref type typically opened with `open_buffer_ref_mut` the compaction will ocurr into the existing buffer and the length will be updated.
    /// 
    /// **WARNING** Your cursor location will be reset to the root.
    /// 
    /// ```
    /// use no_proto::error::NP_Error;
    /// use no_proto::NP_Factory;
    /// use no_proto::NP_Size_Data;
    /// 
    /// let factory: NP_Factory = NP_Factory::new("string()")?;
    /// 
    /// let mut new_buffer = factory.new_buffer(None);
    /// // set initial value
    /// new_buffer.set(&[], "hello")?;
    /// // using 15 bytes
    /// assert_eq!(NP_Size_Data {
    ///     current_buffer: 15,
    ///     after_compaction: 15,
    ///     wasted_bytes: 0
    /// }, new_buffer.calc_bytes()?);
    /// // update the value
    /// new_buffer.set(&[], "hello, world")?;
    /// // now using 31 bytes, with 9 bytes of wasted space
    /// assert_eq!(NP_Size_Data {
    ///     current_buffer: 31,
    ///     after_compaction: 22,
    ///     wasted_bytes: 9
    /// }, new_buffer.calc_bytes()?);
    /// // compact to save space
    /// new_buffer.compact(None)?;
    /// // back down to 18 bytes with no wasted bytes
    /// assert_eq!(NP_Size_Data {
    ///     current_buffer: 22,
    ///     after_compaction: 22,
    ///     wasted_bytes: 0
    /// }, new_buffer.calc_bytes()?);
    /// 
    /// # Ok::<(), NP_Error>(()) 
    /// ```
    /// 
    pub fn compact<'compact>(&mut self, new_capacity: Option<usize>) -> Result<(), NP_Error> {

        if self.mutable == false {
            return Err(NP_Error::MemoryReadOnly)
        }

        let capacity = Some(match new_capacity {
            Some(x) => { x as usize },
            None => self.memory.read_bytes().len()
        });

        let old_root = NP_Cursor::new(self.memory.root, 0, 0);
        let new_root  = NP_Cursor::new(self.memory.root, 0, 0);

        // comapcting a RefMut buffer, we have to compact into a Vec<u8>, then write it back into the RefMut
        if self.memory.is_ref_mut() {
            let new_bytes = NP_Memory::new(capacity, self.memory.get_schemas() as *const Vec<NP_Parsed_Schema>, self.memory.root);
            NP_Cursor::compact(0, old_root, &self.memory, new_root, &new_bytes)?;

            let new_length = new_bytes.length();
            let read_bytes = new_bytes.read_bytes();
            let memory = self.memory.write_bytes();

            for x in 0..memory.len() {
                if x < new_length {
                    memory[x] = read_bytes[x];
                } else {
                    memory[x] = 0;
                }
            }

            self.memory.set_length(new_length)?;

        // compacting from one owned buffer into itself
        } else {
            let new_bytes = self.memory.new_empty(capacity)?;
            NP_Cursor::compact(0, old_root, &self.memory, new_root, &new_bytes)?;
            self.memory = new_bytes;
        }

        self.cursor = NP_Cursor::new(self.memory.root, 0, 0);

        Ok(())
    }

    /// Compact the current buffer into a new owned buffer.
    /// Returns an owned buffer of the compacted result.
    /// 
    /// This works identically to `.compact` except compaction happens into a new buffer, instead of into the existing buffer.
    /// 
    /// If the buffer was opened as read only with `.open_buffer_ref` this is the only way to do compaction.
    /// 
    pub fn compact_into(&mut self, new_capacity: Option<usize>) -> Result<NP_Buffer, NP_Error> {

        let capacity = Some(match new_capacity {
            Some(x) => { x as usize },
            None => self.memory.read_bytes().len()
        });

        let old_root = NP_Cursor::new(self.memory.root, 0, 0);

        let new_bytes = NP_Memory::new(capacity, self.memory.get_schemas() as *const Vec<NP_Parsed_Schema>, self.memory.root);
        let new_root  = NP_Cursor::new(self.memory.root, 0, 0);

        NP_Cursor::compact(0, old_root, &self.memory, new_root, &new_bytes)?;

        self.cursor = NP_Cursor::new(self.memory.root, 0, 0);

        Ok(NP_Buffer::_new(new_bytes))
    }

    /// Copy the current buffer into a new owned buffer.
    /// 
    pub fn copy_buffer(&self) -> NP_Buffer {
        let copy_bytes = self.memory.read_bytes().to_vec();
        let new_memory = NP_Memory::existing_owned(copy_bytes, self.memory.get_schemas() as *const Vec<NP_Parsed_Schema>, self.memory.root);
        NP_Buffer::_new(new_memory)
    }

    /// Recursively measures how many bytes each element in the buffer is using.
    /// This will let you know how many bytes can be saved from a compaction.
    /// 
    /// ```
    /// use no_proto::error::NP_Error;
    /// use no_proto::NP_Factory;
    /// use no_proto::NP_Size_Data;
    /// 
    /// let factory: NP_Factory = NP_Factory::new("string()")?;
    /// 
    /// let mut new_buffer = factory.new_buffer(None);
    /// new_buffer.set(&[], "hello")?;
    /// assert_eq!(NP_Size_Data {
    ///     current_buffer: 15,
    ///     after_compaction: 15,
    ///     wasted_bytes: 0
    /// }, new_buffer.calc_bytes()?);
    /// 
    /// # Ok::<(), NP_Error>(()) 
    /// ```
    /// 
    pub fn calc_bytes<'bytes>(&self) -> Result<NP_Size_Data, NP_Error> {

        let root = NP_Cursor::new(self.memory.root, 0, 0);
        let real_bytes = NP_Cursor::calc_size(0, &root, &self.memory)? + self.memory.root;
        let total_size = self.memory.length();

        if total_size >= real_bytes {
            return Ok(NP_Size_Data {
                current_buffer: total_size,
                after_compaction: real_bytes,
                wasted_bytes: total_size - real_bytes
            });
        } else {
            return Err(NP_Error::new("Error calculating bytes!"));
        }
    }


    /// Set the maximum allowed of size of this buffer, in bytes.
    /// 
    /// Once this value is set, the buffer will not be allowed to grow beyond this size.
    /// 
    /// This doesn't cause any mutations, if the buffer is already larger than this value nothing will happen.  
    /// 
    pub fn set_max_data_length(&mut self, len: usize) {
        self.memory.set_max_length(len);
    }

    /// Get the number of bytes used by the data in this buffer.
    /// 
    /// This will be identical to `buffer.read_bytes().len()` unless you're using a RefMut buffer.
    /// 
    pub fn data_length(&self) -> usize {
        self.memory.length()
    }
}

/// NP Item
pub struct NP_Item<'item> {
    /// index of this value
    pub index: usize,
    /// Key at this index
    pub key: &'item str,
    /// Field at this index
    pub field: &'item str,
    /// Cursor value
    cursor: Option<NP_Cursor>,
    parent: NP_Cursor,
    memory: &'item NP_Memory
}

impl<'item> NP_Item<'item> {

    /// If this item has a value
    pub fn has_value(&self) -> bool {
        if let Some(x) = self.cursor {
            let value = x.get_value(self.memory);
            value.get_addr_value() != 0
        } else {
            false
        }
    }
    /// Get value at this pointer
    pub fn get<X>(&'item self) -> Result<Option<X>, NP_Error> where X: NP_Value<'item> + NP_Scalar<'item> {
        if let Some(cursor) = self.cursor {
            match X::into_value(&cursor, self.memory)? {
                Some(x) => {
                    Ok(Some(x))
                },
                None => {
                    match X::default_value(0, cursor.schema_addr, &self.memory.get_schemas()) {
                        Some(y) => {
                            Ok(Some(y))
                        },
                        None => {
                            Ok(None)
                        }
                    }
                }
            }
        } else {
            Ok(None)
        }
    }

    /// Set value at this pointer
    pub fn set<X>(&'item mut self, value: X) -> Result<(), NP_Error> where X: NP_Value<'item> + NP_Scalar<'item> {

        if self.memory.is_mutable == false {
            return Err(NP_Error::MemoryReadOnly)
        }

        if let Some(cursor) = self.cursor {
            X::set_value(cursor.clone(), self.memory, value)?;
        } else {
            let schema = self.memory.get_schema(self.parent.schema_addr);
            match schema.i {
                // maps don't let you select values that don't exist in the buffer yet
                NP_TypeKeys::List => {
                    let item = opt_err(opt_err(NP_List::select(self.parent.clone(), self.index, true, false, self.memory)?)?.1)?;
                    X::set_value(item, self.memory, value)?;
                }
                NP_TypeKeys::Struct => {
                    let item = opt_err(NP_Struct::select(self.parent.clone(), schema, &self.key, true, false, self.memory)?)?;
                    X::set_value(item, self.memory, value)?;
                },
                NP_TypeKeys::Tuple => {
                    let item = opt_err(NP_Tuple::select(self.parent.clone(), schema, self.index, true, false, self.memory)?)?;
                    X::set_value(item, self.memory, value)?;
                }
                _ => { }
            }
        }

        Ok(())
    }

    /// Clear the value at this pointer
    pub fn del(&'item mut self) -> bool {

        if self.memory.is_mutable == false {
            return false
        }
         
        if let Some(cursor) = self.cursor {
            
            match NP_Cursor::delete(cursor, self.memory) {
                Ok(result) => result,
                Err(_e) => false
            }
        } else {
            false
        }
    }
}



/// Iterator Enum
#[derive(Debug)]
#[doc(hidden)]
pub enum NP_Iterator_Collection<'col> {
    /// None
    None,
    /// Map
    Map(NP_Map<'col>),
    /// List
    List(NP_List),
    /// Struct
    Struct(NP_Struct<'col>),
    /// Tuple
    Tuple(NP_Tuple)
}

#[allow(missing_docs)]
impl<'col> NP_Iterator_Collection<'col> {
    pub fn new(cursor: NP_Cursor, memory: &'col NP_Memory) -> Result<Self, NP_Error> {
        match memory.get_schema(cursor.schema_addr).i {
            NP_TypeKeys::Struct  => {
                let struc = NP_Struct::new_iter(&cursor, memory);
                Ok(NP_Iterator_Collection::Struct(struc))
            },
            NP_TypeKeys::List    => {
                let list = NP_List::new_iter(&cursor, memory, false, 0);
                Ok(NP_Iterator_Collection::List(list))
            },
            NP_TypeKeys::Tuple   => {
                let tuple = NP_Tuple::new_iter(&cursor, memory);
                Ok(NP_Iterator_Collection::Tuple(tuple))
            },
            NP_TypeKeys::Map     => {
                let map = NP_Map::new_iter(&cursor, memory);
                Ok(NP_Iterator_Collection::Map(map))
            },
            _ => Err(NP_Error::new("Tried to create iterator on non collection item!"))
        }
    }
}

#[allow(missing_docs)]
pub struct NP_Generic_Iterator<'it> {
    root: NP_Cursor,
    value: NP_Iterator_Collection<'it>,
    memory: &'it NP_Memory,
    index: usize
}

#[allow(missing_docs)]
impl<'it> NP_Generic_Iterator<'it> {
    pub fn new(cursor: NP_Cursor, memory: &'it NP_Memory) -> Result<Self, NP_Error> {
        Ok(Self { 
            root: cursor.clone(),
            value: NP_Iterator_Collection::new(cursor.clone(), memory)?,
            memory: memory,
            index: 0
        })
    }
}


impl<'it> Iterator for NP_Generic_Iterator<'it> {
    type Item = NP_Item<'it>;

    fn next(&mut self) -> Option<Self::Item> {
        match &mut self.value {
            NP_Iterator_Collection::Map(x) => {
                if let Some(next_item) = x.step_iter(self.memory) {
                    self.index += 1;
                    Some(NP_Item { memory: self.memory, key: next_item.0, field: next_item.0, index: self.index - 1, cursor: Some(next_item.1), parent: self.root.clone() })
                } else {
                    None
                }
            },
            NP_Iterator_Collection::List(x) => {
                if let Some(next_item) = x.step_iter(self.memory) {
                    Some(NP_Item { memory: self.memory, key: "", field: "", index: next_item.0, cursor: next_item.1, parent: self.root.clone() })
                } else {
                    None
                }
            },
            NP_Iterator_Collection::Struct(x) => {
                if let Some(next_item) = x.step_iter(self.memory) {
                    Some(NP_Item { memory: self.memory, key: next_item.1, field: next_item.1, index: next_item.0, cursor: next_item.2, parent: self.root.clone() })
                } else {
                    None
                }
            },
            NP_Iterator_Collection::Tuple(x) => {
                if let Some(next_item) = x.step_iter(self.memory, true) {
                    Some(NP_Item { memory: self.memory, key: "", field: "", index: next_item.0, cursor: next_item.1, parent: self.root.clone() })
                } else {
                    None
                }
            },
            _ => { None }
        }
    }
}