-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbuffer.py
More file actions
83 lines (64 loc) · 1.6 KB
/
buffer.py
File metadata and controls
83 lines (64 loc) · 1.6 KB
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
import re
from tokenize import Token
class Buffer:
def __init__(self, buffer = []) -> None:
self.buffer = buffer
self.i = 0
def __iter__(self) -> 'Buffer':
return self
def __next__(self) -> Token:
if self.i < len(self.buffer):
self.i += 1
return self.buffer[self.i - 1]
else:
raise StopIteration
def __len__(self) -> int:
return len(self.buffer)
def __getitem__(self, index: int) -> Token:
return self.buffer[index]
def __setitem__(self, index: int, value: Token) -> None:
self.buffer[index] = value
def append(self, value: Token) -> None:
self.buffer.append(value)
def empty(self) -> bool:
return self.i >= len(self.buffer)
def pop(self) -> str:
if self.i < len(self.buffer):
token = self.current()
self.i += 1
return token
else:
return None
def current(self):
if self.i < len(self.buffer):
return self.buffer[self.i]
return None
def current_range(self):
if self.i < len(self.buffer):
return range(self.current().start, self.current().end)
return None
def clear(self) -> None:
self.buffer = []
self.i = 0
def empty(self) -> bool:
return self.i >= len(self.buffer)
def remainds(self) -> list:
remainds = self.buffer[self.i:]
self.clear()
return remainds
def __contains__(self, value: Token) -> bool:
return value in self.buffer
def __str__(self) -> str:
return f"Buffer({self.buffer})"
def __repr__(self) -> str:
return self.__str__()
if __name__ == "__main__":
b = Buffer(["a","b","c"])
print(b)
print(b.current())
b.append("d")
print(b)
try:
print(b[10])
except IndexError:
print("IndexError ok")