This repo contains code to mirror other repos. It also contains the code that is getting mirrored.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 

101 lines
2.8 KiB

  1. from copy import deepcopy
  2. from utils import inline_args
  3. class Tree(object):
  4. def __init__(self, data, children):
  5. self.data = data
  6. self.children = list(children)
  7. def __repr__(self):
  8. return 'Tree(%s, %s)' % (self.data, self.children)
  9. def _pretty(self, level, indent_str):
  10. if len(self.children) == 1 and not isinstance(self.children[0], Tree):
  11. return [ indent_str*level, self.data, '\t', '%s' % self.children[0], '\n']
  12. l = [ indent_str*level, self.data, '\n' ]
  13. for n in self.children:
  14. if isinstance(n, Tree):
  15. l += n._pretty(level+1, indent_str)
  16. else:
  17. l += [ indent_str*(level+1), '%s' % n, '\n' ]
  18. return l
  19. def pretty(self, indent_str=' '):
  20. return ''.join(self._pretty(0, indent_str))
  21. def expand_kids_by_index(self, *indices):
  22. for i in sorted(indices, reverse=True): # reverse so that changing tail won't affect indices
  23. kid = self.children[i]
  24. self.children[i:i+1] = kid.children
  25. def __eq__(self, other):
  26. return self.data == other.data and self.children == other.children
  27. # def find_path(self, pred):
  28. # if pred(self):
  29. # yield []
  30. # else:
  31. # for i, c in enumerate(self.children):
  32. # if isinstance(c, Tree):
  33. # for path in c.find_path(pred):
  34. # yield [i] + path
  35. # def follow_path(self, path):
  36. # x = self
  37. # for step in path:
  38. # x = x.children[step]
  39. # return x
  40. # def set_at_path(self, path, value):
  41. # x = self.follow_path(path[:-1])
  42. # x.children[path[-1]] = value
  43. # def clone(self):
  44. # return Tree(self.data, [c.clone() if isinstance(c, Tree) else c for c in self.children])
  45. def __deepcopy__(self, memo):
  46. return type(self)(self.data, deepcopy(self.children, memo))
  47. class Transformer(object):
  48. def _get_func(self, name):
  49. return getattr(self, name)
  50. def transform(self, tree):
  51. items = [self.transform(c) if isinstance(c, Tree) else c for c in tree.children]
  52. try:
  53. f = self._get_func(tree.data)
  54. except AttributeError:
  55. return self.__default__(tree.data, items)
  56. else:
  57. return f(items)
  58. def __default__(self, data, children):
  59. return Tree(data, children)
  60. class InlineTransformer(Transformer):
  61. def _get_func(self, name):
  62. return inline_args(getattr(self, name)).__get__(self)
  63. class Visitor(object):
  64. def visit(self, tree):
  65. for child in tree.children:
  66. if isinstance(child, Tree):
  67. self.visit(child)
  68. f = getattr(self, tree.data, self.__default__)
  69. f(tree)
  70. return tree
  71. def __default__(self, tree):
  72. pass