Identical children

[jmmcd]

I was thinking of using asciitree to represent arithmetic expressions as trees, eg (2 * 2):

*
 +-- 2
 +-- 2

But this seems not to work, because one 2 overwrites the other, in the OrderedDict.

Here is my code:

from asciitree import LeftAligned
from collections import OrderedDict as OD
tree = {
    '*': OD([
        ('2', {}),
        ('2', {})
        ])
    }
tr = LeftAligned()
print(tr(tree))

and output:

*
 +-- 2

I guess the workaround would be to invent unique names for each 2?

[chrispy-snps]

I was able to define my own traversal class to process a tree made of name/child-list tuples:

# Define a tree of tuples, where each tuple is:
#
#   node_tuple = (
#     label: str,
#     children: list[node_tuple]
#   )
tree_tuple = (
    "asciitree",
    [
        (
            "sometimes",
            [
                ("you", []),
            ],
        ),
        (
            "just",
            [
                (
                    "want",
                    [
                        ("to", []),
                        ("draw", []),
                    ],
                ),
            ],
        ),
        ("trees", []),
        (
            "in",
            [
                (
                    "your",
                    [
                        ("terminal", []),
                    ],
                ),
            ],
        ),
    ],
)

# Define a custom traversal class
class MyTupleTraversal(asciitree.Traversal):
    def get_children(self, node):
        return node[1]

    def get_root(self, tree):
        return tree

    def get_text(self, node):
        return node[0]

# Define the tree renderer
box_tr = LeftAligned(
    draw=BoxStyle(
        gfx=asciitree.drawing.BOX_LIGHT,
    ),
    traverse=MyTupleTraversal(),
)

# Render the tree
print(box_tr(tree_tuple))