forked from VimPlug/jedi
Remove some more pytree methods.
This commit is contained in:
@@ -111,14 +111,6 @@ class Base(object):
|
|||||||
"""
|
"""
|
||||||
raise NotImplementedError
|
raise NotImplementedError
|
||||||
|
|
||||||
def clone(self):
|
|
||||||
"""
|
|
||||||
Return a cloned (deep) copy of self.
|
|
||||||
|
|
||||||
This must be implemented by the concrete subclass.
|
|
||||||
"""
|
|
||||||
raise NotImplementedError
|
|
||||||
|
|
||||||
def post_order(self):
|
def post_order(self):
|
||||||
"""
|
"""
|
||||||
Return a post-order iterator for the tree.
|
Return a post-order iterator for the tree.
|
||||||
@@ -135,29 +127,6 @@ class Base(object):
|
|||||||
"""
|
"""
|
||||||
raise NotImplementedError
|
raise NotImplementedError
|
||||||
|
|
||||||
def replace(self, new):
|
|
||||||
"""Replace this node with a new one in the parent."""
|
|
||||||
assert self.parent is not None, str(self)
|
|
||||||
assert new is not None
|
|
||||||
if not isinstance(new, list):
|
|
||||||
new = [new]
|
|
||||||
l_children = []
|
|
||||||
found = False
|
|
||||||
for ch in self.parent.children:
|
|
||||||
if ch is self:
|
|
||||||
assert not found, (self.parent.children, self, new)
|
|
||||||
if new is not None:
|
|
||||||
l_children.extend(new)
|
|
||||||
found = True
|
|
||||||
else:
|
|
||||||
l_children.append(ch)
|
|
||||||
assert found, (self.children, self, new)
|
|
||||||
self.parent.changed()
|
|
||||||
self.parent.children = l_children
|
|
||||||
for x in new:
|
|
||||||
x.parent = self.parent
|
|
||||||
self.parent = None
|
|
||||||
|
|
||||||
def get_lineno(self):
|
def get_lineno(self):
|
||||||
"""Return the line number which generated the invocant node."""
|
"""Return the line number which generated the invocant node."""
|
||||||
node = self
|
node = self
|
||||||
@@ -167,19 +136,6 @@ class Base(object):
|
|||||||
node = node.children[0]
|
node = node.children[0]
|
||||||
return node.lineno
|
return node.lineno
|
||||||
|
|
||||||
def remove(self):
|
|
||||||
"""
|
|
||||||
Remove the node from the tree. Returns the position of the node in its
|
|
||||||
parent's children before it was removed.
|
|
||||||
"""
|
|
||||||
if self.parent:
|
|
||||||
for i, node in enumerate(self.parent.children):
|
|
||||||
if node is self:
|
|
||||||
self.parent.changed()
|
|
||||||
del self.parent.children[i]
|
|
||||||
self.parent = None
|
|
||||||
return i
|
|
||||||
|
|
||||||
@property
|
@property
|
||||||
def next_sibling(self):
|
def next_sibling(self):
|
||||||
"""
|
"""
|
||||||
@@ -282,10 +238,6 @@ class Node(Base):
|
|||||||
"""Compare two nodes for equality."""
|
"""Compare two nodes for equality."""
|
||||||
return (self.type, self.children) == (other.type, other.children)
|
return (self.type, self.children) == (other.type, other.children)
|
||||||
|
|
||||||
def clone(self):
|
|
||||||
"""Return a cloned (deep) copy of self."""
|
|
||||||
return Node(self.type, [ch.clone() for ch in self.children])
|
|
||||||
|
|
||||||
def post_order(self):
|
def post_order(self):
|
||||||
"""Return a post-order iterator for the tree."""
|
"""Return a post-order iterator for the tree."""
|
||||||
for child in self.children:
|
for child in self.children:
|
||||||
@@ -388,10 +340,6 @@ class Leaf(Base):
|
|||||||
"""Compare two nodes for equality."""
|
"""Compare two nodes for equality."""
|
||||||
return (self.type, self.value) == (other.type, other.value)
|
return (self.type, self.value) == (other.type, other.value)
|
||||||
|
|
||||||
def clone(self):
|
|
||||||
"""Return a cloned (deep) copy of self."""
|
|
||||||
return Leaf(self.type, self.value, (self.prefix, (self.lineno, self.column)))
|
|
||||||
|
|
||||||
def leaves(self):
|
def leaves(self):
|
||||||
yield self
|
yield self
|
||||||
|
|
||||||
|
|||||||
Reference in New Issue
Block a user