Adding a simple iterator to the Trie class, now the set operations
[treecutter.git] / src / tree-cutter.py
index 0ac7d9f3a3c408325727cd4bc7e6b0437e2022db..0b72e6b5a0d7e36b0f5295b704e49c2b917cc92f 100755 (executable)
@@ -193,6 +193,15 @@ class Trie():
     def __init__(self):
         self._root = []
 
+    def __iter__(self):
+        return self.inorder(self._root)
+
+    def inorder(self,t):
+        for l in t:
+            yield l.value()
+            for ch in l.children():
+                self.inorder(ch)
+
     def _add(self,trie, key, content):
         # is the key a leaf
         k = key.pop(0)
@@ -250,6 +259,9 @@ class Sitemap():
     def graph(self):
         self._tree.graph()
 
+    def gen_menu(self,lang,page):
+        return 'Generate menu from sitemap - To be implemented'
+
 def generateSitemap():
     sitemap = []
     try: