The TafReader is more general and much nicer, and about to actually construct

nodes, that part will be exciting.  I also fixed some stuff and added some new
functions to List, it now has first() and last() which work just like std::list
front() and back(), I may add compatibility functions later...

1 files changed, 16 insertions, 1 deletions

diff --git a/src/tafnode.h b/src/tafnode.h
index 34f5289..e962e88 100644
--- a/src/tafnode.h
+++ b/src/tafnode.h
@@ -2,6 +2,9 @@
 #define BU_TAF_NODE_H
 
 #include <stdint.h>
+#include "bu/fstring.h"
+#include "bu/hash.h"
+#include "bu/list.h"
 
 namespace Bu
 {
@@ -11,11 +14,23 @@ namespace Bu
         class TafNode
         {
         public:
+                typedef Bu::List<Bu::FString> PropList;
+                typedef Bu::Hash<Bu::FString, PropList> PropHash;
+                typedef Bu::List<TafNode *> NodeList;
+                typedef Bu::Hash<Bu::FString, NodeList> NodeHash;
+
+        public:
                 TafNode();
                 virtual ~TafNode();
 
-        private:
+                void setProperty( Bu::FString sName, Bu::FString sValue );
+                const PropList &getProperty( const Bu::FString &sName );
 
+        private:
+                Bu::FString sName;
+                PropHash hProp;
+                NodeHash hChildren;
         };
 }
+
 #endif