blob: 5d4da07a32680c1ee901867f8c8ee056d8202bff (
plain) (
blame)
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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
|
# Copyright (C) 2009, 2010 Roman Zimbelmann <romanz@lavabit.com>
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see <http://www.gnu.org/licenses/>.
from collections import deque
class HistoryEmptyException(Exception):
pass
class History(object):
def __init__(self, maxlen = None):
self.history = deque(maxlen = maxlen)
self.history_forward = deque(maxlen = maxlen)
def add(self, item):
if len(self.history) == 0 or self.history[-1] != item:
self.history.append(item)
self.history_forward.clear()
def modify(self, item):
try:
self.history[-1] = item
except IndexError:
raise HistoryEmptyException
def __len__(self):
return len(self.history)
def current(self):
try:
return self.history[-1]
except IndexError:
raise HistoryEmptyException()
def top(self):
try:
return self.history_forward[-1]
except IndexError:
try:
return self.history[-1]
except IndexError:
raise HistoryEmptyException()
def bottom(self):
try:
return self.history[0]
except IndexError:
raise HistoryEmptyException()
def back(self):
if len(self.history) > 1:
self.history_forward.appendleft( self.history.pop() )
return self.current()
def move(self, n, pattern=None):
if n > 0:
return self.forward()
if n < 0:
return self.back()
def __iter__(self):
return self.history.__iter__()
def next(self):
return self.history.next()
def forward(self):
if len(self.history_forward) > 0:
self.history.append( self.history_forward.popleft() )
return self.current()
def fast_forward(self):
if self.history_forward:
self.history.extend(self.history_forward)
self.history_forward.clear()
def unique(self):
found = []
i = len(self.history)
while i:
i -= 1
item = self.history[i]
if item in found:
del self.history[i]
else:
found.append(item)
i = len(self.history_forward)
while i:
i -= 1
item = self.history_forward[i]
if item in found:
del self.history_forward[i]
else:
found.append(item)
|