- More optimization on fennec::sequence. There are areas that could be improved, but the running time is now within margin. It can be revisited later if this data-structure becomes the focus of a performance critical task.

gdb/fennec/containers.py

@@ -490,8 +490,8 @@ class BinTreePrinter:
             self.visit.popleft()
 
             value = self.tree[node]['value']
-            left  = self.tree[node]['left']
-            right = self.tree[node]['right']
+            left  = self.tree[node]['child'][0]
+            right = self.tree[node]['child'][1]
 
             if right < self.capacity:
                 self.visit.appendleft((right, 1, depth + 1))