Lines Matching refs:isNil
200 def isNil(self):
342 def isNil(self, tree):
352 and child isNil then you can decide it is ok to move children to t via
375 If oldRoot was null, it's ok, just return newRoot (even if isNil).
733 and child isNil then this routine moves children to t via
743 if childTree.isNil():
773 if t.isNil():
809 if newTree.isNil():
839 def isNil(self):
928 if not self.isNil():
938 if not self.isNil():
989 def isNil(self, tree):
990 return tree.isNil()
1024 and child isNil then you can decide it is ok to move children to t via
1051 If oldRoot was null, it's ok, just return newRoot (even if isNil).
1076 if newRoot.isNil():
1095 if root is not None and root.isNil():
1249 def isNil(self):
1367 if self.isNil():
1384 if not self.isNil():
1389 if not self.isNil():
1421 def isNil(self):
1868 Don't do DOWN, UP nodes if its a list (t is isNil).
1876 nil = self.adaptor.isNil(t)
2425 isNil = self.adaptor.isNil(t)
2426 if pre_action is not None and not isNil:
2436 if post_action is not None and not isNil:
2793 while self.adaptor.isNil(el) and self.adaptor.getChildCount(el) == 1:
