def ComputeSplitPenalties(tree):
  _TreePenaltyAssigner().Visit(tree)
Retrieves a Node that matches the longest prefix of the node that is
dataset/ETHPy150Open google/yapf/yapf/yapflib/split_penalty.py/ComputeSplitPenalties--crossover with--dataset/ETHPy150Open kdart/pycopia/SMI/pycopia/SMI/SMI.py/get_node_by_OID