本文整理汇总了Python中node.Node.prev方法的典型用法代码示例。如果您正苦于以下问题:Python Node.prev方法的具体用法?Python Node.prev怎么用?Python Node.prev使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类node.Node
的用法示例。
在下文中一共展示了Node.prev方法的5个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Python代码示例。
示例1: insert_tail
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import prev [as 别名]
def insert_tail(self , data):
if self.tail == None:
node_obj = Node(data)
self.head = self.tail = node_obj
else:
old_tail = self.tail
new_tail = Node(data)
old_tail.next = new_tail
new_tail.prev = old_tail
self.tail = new_tail
示例2: make_node
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import prev [as 别名]
def make_node(s, parent, name, events=None, streams=None):
n = s.get_node_by_hash("#" + name + "#")
if n is None:
n = Node(name, "#" + name + "#")
s.add_node(n)
if parent:
p = s.get_node_by_hash("#" + parent + "#")
p.add_arc(Arc(n, events, streams))
n.prev = p
else:
s.initial_node = n
return n
示例3: append
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import prev [as 别名]
def append(self, val):
'''Append 'val' at the end of the list.'''
node = Node(val)
try:
node.prev = self.end
self.end = node
self.end.prev.post = node
except AttributeError:
self.List = node
self.end = node
self.length += 1
示例4: enqueue
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import prev [as 别名]
def enqueue(self, val):
'''Add 'val' to the queue.'''
node = Node(val)
if self.Queue:
node.prev = self.end
self.end = node
self.end.prev.post = node
else:
self.Queue = node
self.end = node
self.length += 1
示例5: insert_to_index
# 需要导入模块: from node import Node [as 别名]
# 或者: from node.Node import prev [as 别名]
def insert_to_index(self , index , data):
if self.get_list_length() < int(index):
print "You cannot break this code. Try again :P"
elif int(index) == 0:
self.insert_head(data)
elif int(index) == self.get_list_length():
self.insert_tail(data)
else:
to_be_next_node = self.get_to_be_next_node(index)
prev_node = to_be_next_node.prev
node_obj = Node(data)
node_obj.next = to_be_next_node
node_obj.prev = prev_node
prev_node.next = node_obj
to_be_next_node.prev = node_obj
print "item inserted at index - "+str(index)