summaryrefslogtreecommitdiff
path: root/webapps/qooxdoo-0.6.3-sdk/frontend/framework/tool/modules/tree.py
diff options
context:
space:
mode:
authorDerrell Lipman <derrell@samba.org>2007-01-03 20:17:37 +0000
committerGerald (Jerry) Carter <jerry@samba.org>2007-10-10 14:36:09 -0500
commit626bb8efb0c825f332c937ffaaadc9b402079539 (patch)
tree1c95f69d157b24f64edff470143f5f55a09cfca6 /webapps/qooxdoo-0.6.3-sdk/frontend/framework/tool/modules/tree.py
parenteeddcf8cc8eb655d7c40f1fd5f7fd422529f4f98 (diff)
downloadsamba-626bb8efb0c825f332c937ffaaadc9b402079539.tar.gz
samba-626bb8efb0c825f332c937ffaaadc9b402079539.tar.bz2
samba-626bb8efb0c825f332c937ffaaadc9b402079539.zip
r20517: re-add cleaned-up webapps
(This used to be commit 5a3d6ad0b7cf0ecf8b57b4088b19f7d4291c990b)
Diffstat (limited to 'webapps/qooxdoo-0.6.3-sdk/frontend/framework/tool/modules/tree.py')
-rwxr-xr-xwebapps/qooxdoo-0.6.3-sdk/frontend/framework/tool/modules/tree.py563
1 files changed, 563 insertions, 0 deletions
diff --git a/webapps/qooxdoo-0.6.3-sdk/frontend/framework/tool/modules/tree.py b/webapps/qooxdoo-0.6.3-sdk/frontend/framework/tool/modules/tree.py
new file mode 100755
index 0000000000..c6147a18b3
--- /dev/null
+++ b/webapps/qooxdoo-0.6.3-sdk/frontend/framework/tool/modules/tree.py
@@ -0,0 +1,563 @@
+#!/usr/bin/env python
+
+class NodeAccessException (Exception):
+ def __init__ (self, msg, node):
+ Exception.__init__(self, msg)
+ self.node = node
+
+
+class Node:
+ def __init__ (self, type):
+ self.type = type
+
+
+
+
+
+ def hasAttributes(self):
+ return hasattr(self, "attributes")
+
+ def set(self, key, value):
+ """Sets an attribute"""
+ if not isinstance(value, (basestring, int, long, float, complex, bool)):
+ raise NodeAccessException("'value' is no string or number: " + str(value), self)
+ if not self.hasAttributes():
+ self.attributes = {}
+ self.attributes[key] = value
+ return self
+
+ def get(self, key, mandatory = True):
+ value = None
+ if hasattr(self, "attributes") and key in self.attributes:
+ value = self.attributes[key]
+
+ if value != None:
+ return value
+ elif mandatory:
+ raise NodeAccessException("Node " + self.type + " has no attribute " + key, self)
+
+ def remove(self, key):
+ del self.attributes[key]
+ if len(self.attributes) == 0:
+ del self.attributes
+
+
+
+
+
+
+
+ def hasParent(self):
+ return hasattr(self, "parent") and self.parent != None
+
+ def hasChildren(self, ignoreComments = False):
+ if not ignoreComments:
+ return hasattr(self, "children") and len(self.children) > 0
+ else:
+ if not hasattr(self, "children"):
+ return False
+
+ for child in self.children:
+ if child.type != "comment" and child.type != "commentsBefore" and child.type != "commentsAfter":
+ return True
+
+ def addChild(self, childNode, index = None):
+ if childNode:
+ if not self.hasChildren():
+ self.children = []
+
+ if childNode.hasParent():
+ childNode.parent.removeChild(childNode)
+
+ if index != None:
+ self.children.insert(index, childNode)
+ else:
+ self.children.append(childNode)
+ childNode.parent = self
+ return self
+
+ def removeChild(self, childNode):
+ if self.hasChildren():
+ self.children.remove(childNode)
+ childNode.parent = None
+ if len(self.children) == 0:
+ del self.children
+
+ def replaceChild(self, oldChild, newChild):
+ if self.hasChildren():
+ if newChild.hasParent():
+ newChild.parent.removeChild(newChild)
+
+ self.children.insert(self.children.index(oldChild), newChild)
+ newChild.parent = self
+ self.children.remove(oldChild)
+
+
+
+
+
+
+ def getChild(self, type, mandatory = True):
+ if self.hasChildren():
+ for child in self.children:
+ if child.type == type:
+ return child
+ if mandatory:
+ raise NodeAccessException("Node " + self.type + " has no child with type " + type, self)
+
+ def hasChildRecursive(self, type):
+ if isinstance(type, basestring):
+ if self.type == type:
+ return True
+ elif isinstance(type, list):
+ if self.type in type:
+ return True
+
+ if self.hasChildren():
+ for child in self.children:
+ if child.hasChildRecursive(type):
+ return True
+
+ return False
+
+ def hasChild(self, type):
+ if self.hasChildren():
+ for child in self.children:
+ if isinstance(type, basestring):
+ if child.type == type:
+ return True
+ elif isinstance(type, list):
+ if child.type in type:
+ return True
+
+ return False
+
+ def getChildrenLength(self, ignoreComments=False):
+ if self.hasChildren():
+ if ignoreComments:
+ counter = 0
+ for child in self.children:
+ if not child.type in [ "comment", "commentsBefore", "commentsAfter" ]:
+ counter += 1
+ return counter
+
+ else:
+ return len(self.children)
+
+ return 0
+
+
+
+ def makeComplex(self):
+ makeComplex = self.get("makeComplex", False)
+
+ if makeComplex != None:
+ return makeComplex
+
+ else:
+ makeComplex = False
+
+
+
+ if self.type == "comment":
+ makeComplex = True
+
+ elif self.type == "block":
+ if self.hasChildren():
+ counter = 0
+ for child in self.children:
+ if child.type != "commentsAfter":
+ counter += 1
+ if counter > 1:
+ makeComplex = True
+
+ elif self.type == "loop":
+ if self.get("loopType") == "IF" and self.hasParent() and self.parent.type == "elseStatement":
+ pass
+ else:
+ makeComplex = True
+
+ elif self.type == "function":
+ makeComplex = self.getChild("body").hasChild("block") and self.getChild("body").getChild("block").getChildrenLength() > 0
+
+ elif self.type in [ "loop", "switch" ]:
+ makeComplex = True
+
+ elif self.hasChild("commentsBefore"):
+ makeComplex = True
+
+
+
+ # Final test: Ask the children (slower)
+ if not makeComplex and not self.type in [ "comment", "commentsBefore", "commentsAfter" ]:
+ makeComplex = self.isComplex()
+
+
+ self.set("makeComplex", makeComplex)
+
+ # print "makeComplex: %s = %s" % (self.type, makeComplex)
+
+ return makeComplex
+
+
+
+ def isComplex(self):
+ isComplex = self.get("isComplex", False)
+
+ if isComplex != None:
+ return isComplex
+
+ else:
+ isComplex = False
+
+
+
+ if not self.hasChildren():
+ isComplex = False
+
+ elif self.type == "block":
+ counter = 0
+ if self.hasChildren():
+ for child in self.children:
+ if child.type != "commentsAfter":
+ counter += 1
+
+ if child.hasChild("commentsBefore"):
+ counter += 1
+
+ if counter > 1:
+ break
+
+ if counter > 1:
+ isComplex = True
+
+ else:
+ if self.getChildrenLength() == 0:
+ isComplex = False
+
+ # in else, try to find the mode of the previous if first
+ elif self.hasParent() and self.parent.type == "elseStatement":
+ isComplex = self.parent.parent.getChild("statement").hasComplexBlock()
+
+ # in if, try to find the mode of the parent if (if existent)
+ elif self.hasParent() and self.parent.type == "statement" and self.parent.parent.type == "loop" and self.parent.parent.get("loopType") == "IF":
+ if self.parent.parent.hasParent() and self.parent.parent.parent.hasParent():
+ if self.parent.parent.parent.parent.type == "loop":
+ isComplex = self.parent.parent.parent.parent.getChild("statement").hasComplexBlock()
+
+ # in catch/finally, try to find the mode of the try statement
+ elif self.hasParent() and self.parent.hasParent() and self.parent.parent.type in [ "catch", "finally" ]:
+ isComplex = self.parent.parent.parent.getChild("statement").hasComplexBlock()
+
+ elif self.type == "elseStatement":
+ if self.hasComplexBlock():
+ isComplex = True
+ elif self.hasChild("loop") and self.getChild("loop").getChild("statement").hasComplexBlock():
+ isComplex = True
+
+ elif self.type == "array" :
+ if self.getChildrenLength(True) > 5:
+ isComplex = True
+
+ elif self.type == "map" :
+ ml = self.getChildrenLength(True)
+ if ml > 1:
+ isComplex = True
+
+ # Final test: Ask the children (slower)
+ if not (self.type == "elseStatement" and self.hasChild("loop")):
+ if not isComplex and self.hasComplexChildren():
+ isComplex = True
+
+ # print self.type + " :: %s" % isComplex
+ self.set("isComplex", isComplex)
+
+ # print "isComplex: %s = %s" % (self.type, isComplex)
+
+ return isComplex
+
+
+
+ def hasComplexChildren(self):
+ if self.hasChildren():
+ for child in self.children:
+ if child.makeComplex():
+ return True
+
+ return False
+
+
+ def hasComplexBlock(self):
+ if self.hasChild("block"):
+ return self.getChild("block").isComplex()
+
+ return False
+
+
+ def hasBlockChildren(self):
+ if self.hasChild("block"):
+ return self.getChild("block").hasChildren()
+
+ return False
+
+
+ def getChildPosition(self, searchedChild, ignoreComments = False):
+ if self.hasChildren() and searchedChild in self.children:
+ if ignoreComments:
+ counter = 0
+ for child in self.children:
+ if child == searchedChild:
+ return counter
+
+ if not child.type in [ "comment", "commentsBefore", "commentsAfter" ]:
+ counter += 1
+
+ else:
+ return self.children.index(searchedChild)
+
+ return -1
+
+
+
+ def getChildByPosition(self, pos, mandatory = True, ignoreComments = False):
+ if self.hasChildren():
+ i = 0
+ for child in self.children:
+ if ignoreComments and child.type in [ "comment", "commentsBefore", "commentsAfter" ]:
+ continue
+
+ if i == pos:
+ return child
+
+ i += 1
+
+ if mandatory:
+ raise NodeAccessException("Node " + self.type + " has no child as position %s" % pos, self)
+
+
+
+ def getChildByAttribute(self, key, value, mandatory = True):
+ if self.hasChildren():
+ for child in self.children:
+ if child.get(key) == value:
+ return child
+
+ if mandatory:
+ raise NodeAccessException("Node " + self.type + " has no child with attribute " + key + " = " + value, self)
+
+ def getChildByTypeAndAttribute(self, type, key, value, mandatory = True):
+ if self.hasChildren():
+ for child in self.children:
+ if child.type == type and child.get(key) == value:
+ return child
+
+ if mandatory:
+ raise NodeAccessException("Node " + self.type + " has no child with type " + type + " and attribute " + key + " = " + value, self)
+
+ def getFirstChild(self, mandatory = True, ignoreComments = False):
+ if self.hasChildren():
+ for child in self.children:
+ if ignoreComments and child.type in [ "comment", "commentsBefore", "commentsAfter" ]:
+ continue
+
+ return child
+
+ if mandatory:
+ raise NodeAccessException("Node " + self.type + " has no children", self)
+
+ def getLastChild(self, mandatory = True, ignoreComments = False):
+ if self.hasChildren():
+ if not ignoreComments:
+ return self.children[-1]
+ else:
+ pos = len(self.children) - 1
+ while pos >= 0:
+ child = self.children[pos]
+
+ if ignoreComments and child.type in [ "comment", "commentsBefore", "commentsAfter" ]:
+ pos -= 1
+ continue
+
+ return child
+
+ if mandatory:
+ raise NodeAccessException("Node " + self.type + " has no children", self)
+
+ def getPreviousSibling(self, mandatory = True, ignoreComments = False):
+ if self.hasParent():
+ prev = None
+ for child in self.parent.children:
+
+ if ignoreComments and child.type in [ "comment", "commentsBefore", "commentsAfter" ]:
+ continue
+
+ if child == self:
+ if prev != None:
+ return prev
+ else:
+ break
+
+ prev = child
+
+ if mandatory:
+ raise NodeAccessException("Node " + self.type + " has no previous sibling", self)
+
+ def getFollowingSibling(self, mandatory = True, ignoreComments = False):
+ if self.hasParent():
+ prev = None
+
+ for child in self.parent.children:
+ if ignoreComments and child.type in [ "comment", "commentsBefore", "commentsAfter" ]:
+ continue
+
+ if prev != None:
+ return child
+
+ if child == self:
+ prev = child
+
+ if mandatory:
+ raise NodeAccessException("Node " + self.type + " has no following sibling", self)
+
+ def isFirstChild(self, ignoreComments = False):
+ if not self.hasParent():
+ return False
+
+ return self.parent.getFirstChild(False, ignoreComments) == self
+
+ def isLastChild(self, ignoreComments = False):
+ if not self.hasParent():
+ return False
+
+ return self.parent.getLastChild(False, ignoreComments) == self
+
+ def addListChild(self, listName, childNode):
+ listNode = self.getChild(listName, False)
+ if not listNode:
+ listNode = Node(listName)
+ self.addChild(listNode)
+ listNode.addChild(childNode)
+
+ def getListChildByAttribute(self, listName, key, value, mandatory = True):
+ listNode = self.getChild(listName, False)
+ if listNode:
+ return listNode.getChildByAttribute(key, value, mandatory)
+
+ if mandatory:
+ raise NodeAccessException("Node " + self.type + " has no child " + listName, self)
+
+ def getFirstListChild(self, listName, mandatory = True):
+ listNode = self.getChild(listName, False)
+ if listNode:
+ return listNode.getFirstChild(mandatory)
+
+ if mandatory:
+ raise NodeAccessException("Node " + self.type + " has no child " + listName, self)
+
+ def getAllChildrenOfType(self, type):
+ return self._getAllChildrenOfType(type, [])
+
+ def _getAllChildrenOfType(self, type, found=[]):
+ if self.hasChildren():
+ for child in self.children:
+ if child.type == type:
+ found.append(child)
+
+ child._getAllChildrenOfType(type, found)
+
+ return found
+
+
+
+
+def nodeToXmlString(node, prefix = "", childPrefix = " ", newLine="\n"):
+ hasText = False
+ asString = prefix + "<" + node.type
+ if node.hasAttributes():
+ for key in node.attributes:
+ if key == "text":
+ hasText = True
+ else:
+ asString += " " + key + "=\"" + escapeXmlChars(node.attributes[key], True) + "\""
+
+ if not node.hasChildren() and not hasText:
+ asString += "/>" + newLine
+ else:
+ asString += ">"
+
+ if hasText:
+ if node.hasChildren():
+ asString += newLine + prefix + childPrefix
+ else:
+ asString += newLine + prefix + childPrefix
+
+ asString += "<text>" + escapeXmlChars(node.attributes["text"], False) + "</text>" + newLine
+
+ if node.hasChildren():
+ asString += newLine
+ for child in node.children:
+ asString += nodeToXmlString(child, prefix + childPrefix, childPrefix, newLine)
+
+ asString += prefix + "</" + node.type + ">" + newLine
+
+ return asString
+
+
+
+def nodeToJsonString(node, prefix = "", childPrefix = " ", newLine="\n"):
+ asString = prefix + '{type:"' + escapeJsonChars(node.type) + '"'
+
+ if node.hasAttributes():
+ asString += ',attributes:{'
+ firstAttribute = True
+ for key in node.attributes:
+ if not firstAttribute:
+ asString += ','
+ asString += '"' + key + '":"' + escapeJsonChars(node.attributes[key]) + '"'
+ firstAttribute = False
+ asString += '}'
+
+ if node.hasChildren():
+ asString += ',children:[' + newLine
+
+ firstChild = True
+ prefix = prefix + childPrefix
+ for child in node.children:
+ asString += nodeToJsonString(child, prefix, childPrefix, newLine) + ',' + newLine
+ firstChild = False
+
+ # NOTE We remove the ',\n' of the last child
+ if newLine == "":
+ asString = asString[:-1] + prefix + ']'
+ else:
+ asString = asString[:-2] + newLine + prefix + ']'
+
+ asString += '}'
+
+ return asString
+
+
+
+def escapeXmlChars(text, inAttribute):
+ if isinstance(text, basestring):
+ text = text.replace("&", "&amp;").replace("<", "&lt;").replace(">", "&gt;")
+ if inAttribute:
+ text = text.replace("\"", "&quot;")
+ elif isinstance(text, bool):
+ text = str(text).lower()
+ else:
+ text = str(text)
+
+ return text
+
+
+
+def escapeJsonChars(text):
+ if isinstance(text, basestring):
+ text = text.replace('"', '\\"').replace('\n', '\\n').replace('\r', '\\r')
+ elif isinstance(text, bool):
+ text = str(text).lower()
+ else:
+ text = str(text)
+
+ return text