hierarchy.py 5.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188
  1. from django.core.urlresolvers import reverse
  2. class Node(object):
  3. def __init__(self, link=None, name=None, icon=None):
  4. self.parent = None
  5. self.link = link
  6. self.name = name
  7. self.icon = icon
  8. self._children = []
  9. self._children_dict = {}
  10. @property
  11. def namespace(self):
  12. try:
  13. return self._resolved_namespace
  14. except AttributeError:
  15. bits = self.link.split(':')
  16. self._resolved_namespace = ':'.join(bits[:-1])
  17. return self._resolved_namespace
  18. def children(self):
  19. return self._children
  20. def children_as_dicts(self):
  21. childrens = []
  22. for children in self._children:
  23. childrens.append({
  24. 'link': reverse(children.link),
  25. 'namespace': self.namespace,
  26. 'name': children.name,
  27. 'icon': children.icon,
  28. })
  29. return childrens
  30. def add_node(self, node, after=None, before=None):
  31. if after:
  32. return self.add_node_after(node, after)
  33. elif before:
  34. return self.add_node_before(node, before)
  35. else:
  36. node.parent = self
  37. self._children.append(node)
  38. self._children_dict[node.link] = node
  39. return True
  40. def add_node_after(self, node, after):
  41. success = False
  42. new_children_list = []
  43. for children in self._children:
  44. new_children_list.append(children)
  45. if children.link == after:
  46. new_children_list.append(node)
  47. success = True
  48. if success:
  49. node.parent = self
  50. self._children_dict[node.link] = node
  51. self._children = new_children_list
  52. return success
  53. def add_node_before(self, node, before):
  54. success = False
  55. new_children_list = []
  56. for children in self._children:
  57. if children.link == before:
  58. new_children_list.append(node)
  59. success = True
  60. new_children_list.append(children)
  61. if success:
  62. node.parent = self
  63. self._children_dict[node.link] = node
  64. self._children = new_children_list
  65. return success
  66. def child(self, namespace):
  67. try:
  68. return self._children_dict[namespace]
  69. except KeyError:
  70. raise ValueError(
  71. "Node %s is not a child of node %s" % (namespace, self.name))
  72. def is_root(self):
  73. return False
  74. class AdminHierarchyBuilder(object):
  75. def __init__(self):
  76. self.nodes_record = []
  77. self.nodes_dict = {}
  78. def build_nodes_dict(self):
  79. nodes_dict = {'misago:admin': Node(link='misago:admin:index')}
  80. iterations = 0
  81. while self.nodes_record:
  82. iterations += 1
  83. if iterations > 512:
  84. message = ("Misago Admin hierarchy is invalid or too complex "
  85. "to resolve. Nodes left: %s" % self.nodes_record)
  86. raise ValueError(message)
  87. for index, node in enumerate(self.nodes_record):
  88. if node['parent'] in nodes_dict:
  89. node_obj = Node(link=node['link'],
  90. name=node['name'],
  91. icon=node['icon'])
  92. parent = nodes_dict[node['parent']]
  93. if node['after']:
  94. node_added = parent.add_node(node_obj,
  95. after=node['after'])
  96. elif node['before']:
  97. node_added = parent.add_node(node_obj,
  98. before=node['before'])
  99. else:
  100. node_added = parent.add_node(node_obj)
  101. if node_added:
  102. namespace = node_obj.namespace
  103. if namespace not in nodes_dict:
  104. nodes_dict[namespace] = node_obj
  105. del self.nodes_record[index]
  106. break
  107. return nodes_dict
  108. def add_node(self, parent='misago:admin', after=None, before=None,
  109. namespace=None, link=None, name=None, icon=None):
  110. if self.nodes_dict:
  111. raise ValueError("Misago admin site has already been "
  112. "initialized. You can't add new nodes to it.")
  113. if after and before:
  114. raise ValueError("You cannot use both after and before kwargs.")
  115. self.nodes_record.append({
  116. 'parent': parent,
  117. 'namespace': namespace,
  118. 'after': after,
  119. 'before': before,
  120. 'link': link,
  121. 'name': name,
  122. 'icon': icon,
  123. })
  124. def visible_branches(self, request):
  125. if not self.nodes_dict:
  126. self.nodes_dict = self.build_nodes_dict()
  127. branches = []
  128. if request.resolver_match.namespace in self.nodes_dict:
  129. node = self.nodes_dict[request.resolver_match.namespace]
  130. while node:
  131. children = node.children_as_dicts()
  132. if children:
  133. branches.append(children)
  134. node = node.parent
  135. branches.reverse()
  136. # Lowest level branch, active link
  137. for node in branches[0]:
  138. node['is_active'] = node['link'] in request.path
  139. # Other levels branches
  140. for branch in branches[1:]:
  141. for node in branch:
  142. active = node['namespace'] in request.resolver_match.namespace
  143. node['is_active'] = active
  144. # Hack for index link
  145. full_url_name = '%s:%s' % (request.resolver_match.namespace,
  146. request.resolver_match.url_name)
  147. if full_url_name != 'misago:admin:index':
  148. branches[0][0]['is_active'] = False
  149. return branches
  150. site = AdminHierarchyBuilder()