Starting a new iteration implementation.

This implementation will reduce the use of heap by elimininating Box<> from the individual iterators but it will still need heap for maintaining a vector of iterators from nodes.

src/iter/ast_node.rs

@@ -0,0 +1 @@
+

src/iter/ast_node_iter.rs

@@ -0,0 +1,5 @@
+use crate::types::Object;
+
+pub struct BoldIter<'s> {
+    next: std::slice::Iter<'s, Object<'s>>,
+}

src/iter/mod.rs

@@ -0,0 +1,2 @@
+mod ast_node;
+mod ast_node_iter;

src/lib.rs

@@ -8,6 +8,7 @@ pub mod compare;
 
 mod context;
 mod error;
+mod iter;
 pub mod parser;
 pub mod types;