-
Notifications
You must be signed in to change notification settings - Fork 11
/
Copy pathasymlist.py
77 lines (66 loc) · 2.16 KB
/
asymlist.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
class TransitionBackError(Exception):
def __init__(self, message):
self.message = message
class Node:
def __init__(self, node_id, is_bidirect, **kwargs):
self.id=node_id
self.prev=None
self.next=None
self.is_bidirect=is_bidirect
def __str__(self):
return str(self.id)
def __repr__(self):
return "Node:{} Prev:{} Next:{}".format(self.id,self.prev,self.next)
class AsymLList:
def __init__(self,node_id, is_bidirect=True, nodeClass=Node, **kwargs):
self.nodeClass=nodeClass
firstNode=self.nodeClass(node_id,is_bidirect, **kwargs)
if firstNode.is_bidirect:
self.back=firstNode
else:
self.back=None
self.begin=firstNode
self.last=firstNode
self.current=None
def append(self,node_id,is_bidirect=True, **kwargs):
newNode = self.nodeClass(node_id,is_bidirect, **kwargs)
newNode.prev = self.back
self.last.next = newNode
if newNode.is_bidirect:
self.back = newNode
self.last = newNode
return self.last
def forward(self):
result = []
ptr = self.begin
while ptr is not None:
result.append(ptr)
ptr = ptr.next
return result
def backward(self):
if self.back is None:
return None
result = []
ptr = self.back
while ptr is not None:
result.append(ptr)
ptr = ptr.prev
return result
def fwd(self):
if self.current is None:
self.current=self.begin
else:
self.current=self.current.next
if self.current is None:
self.current=self.begin
return self.current
def rwd(self):
if self.back is None:
raise TransitionBackError("No way back")
if self.current is None:
self.current = self.back
else:
self.current = self.current.prev
if self.current is None:
self.current = self.back
return self.current