- Rough First Pass implementation for format.h

- Started 2D Transform Component and relevant math extensions
 - Switched sequence to use pointers instead of arrays

include/fennec/containers/bintree.h

@@ -38,6 +38,8 @@
 #include <fennec/math/exponential.h>
 #include <fennec/memory/allocator.h>
 
+// TODO: this should probably be refactored to use pointers over tables
+
 namespace fennec
 {
 
@@ -579,8 +581,8 @@ public:
 	};
 
 	struct in_order {
-		size_t       head;
 		list<size_t> visit;
+		size_t       head;
 
 		constexpr size_t operator()(const bintree& tree, size_t start) {
 			head = start;
@@ -683,8 +685,9 @@ public:
 
 		constexpr iterator(bintree* tree, size_t root, size_t node)
 			: _tree(tree)
-			, _order(root)
+			, _order()
 			, _n(node) {
+			_order.head = root;
 		}
 
 		size_t index() const {