Dane Sabo
3299181c70
M lazy-lock.json M lua/custom/configs/lspconfig.lua M lua/custom/init.lua A lua/custom/journal.lua A nvim_venv/bin/Activate.ps1 A nvim_venv/bin/activate A nvim_venv/bin/activate.csh A nvim_venv/bin/activate.fish
26 lines
799 B
Python
26 lines
799 B
Python
""" Branching Strategies to Traverse a Tree """
|
|
from itertools import product
|
|
from sympy.strategies.util import basic_fns
|
|
from .core import chain, identity, do_one
|
|
|
|
|
|
def top_down(brule, fns=basic_fns):
|
|
""" Apply a rule down a tree running it on the top nodes first """
|
|
return chain(do_one(brule, identity),
|
|
lambda expr: sall(top_down(brule, fns), fns)(expr))
|
|
|
|
|
|
def sall(brule, fns=basic_fns):
|
|
""" Strategic all - apply rule to args """
|
|
op, new, children, leaf = map(fns.get, ('op', 'new', 'children', 'leaf'))
|
|
|
|
def all_rl(expr):
|
|
if leaf(expr):
|
|
yield expr
|
|
else:
|
|
myop = op(expr)
|
|
argss = product(*map(brule, children(expr)))
|
|
for args in argss:
|
|
yield new(myop, *args)
|
|
return all_rl
|