forked from kib-courses/python_developer
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.py
More file actions
105 lines (82 loc) · 2.67 KB
/
main.py
File metadata and controls
105 lines (82 loc) · 2.67 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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
from array import array
class Arr:
def __init__(self, element_type, *elements):
self.el_type = element_type
self.data = array(element_type, elements)
def __getitem__(self, item):
if isinstance(item, slice):
return self.data[item]
else:
return self.data[item]
def __delitem__(self, key):
del self.data[key]
def __setitem__(self, key, value):
for i in range(len(self.data)):
if self.data[i] == key:
self.data[i] = value
def __len__(self):
return len(self.data)
def __contains__(self, item):
for i in range(len(self.data)):
if self.data[i] == item:
return True
return False
def __iter__(self):
return Iterator(self.data)
def __reversed__(self):
return Iterator(self.data, -1)
def index(self, item):
for i in range(len(self.data)):
if self.data[i] == item:
return i
return -1
def count(self, item):
counter = 0
for i in range(len(self.data)):
if self.data[i] == item:
counter += 1
return counter
def insert(self, position, item):
sec_array = [_ for _ in self.data[position::]]
second_part = Arr(self.rtype, *sec_array)
fir_array = [_ for _ in self.data[:position:]]
first_part = Arr(self.rtype, *fir_array)
new_array = Arr(self.rtype, *first_part, *item, *second_part)
self.data = new_array
@property
def rtype(self):
return self.el_type
def append(self, item):
new_array = Arr(self.rtype, *self.data, item)
self.data = new_array
def extend(self, item):
new_array = Arr(self.rtype, *self.data, *item)
self.data = new_array
def clear(self):
for i in range(len(self.data) - 1, -1, -1):
del self.data[i]
def pop(self, item):
last = self.data[item]
del self.data[item]
return last
def remove(self, item):
del self.data[item]
def isEmpty(self):
return self.data == []
class Iterator:
def __iter__(self):
return self
def __init__(self, collection, cursor=1):
self.collection = collection
self.cursor = cursor
if cursor == 1:
self._cursor = -1
self.step = 1
if cursor == -1:
self._cursor = len(self.collection)
self.step = -1
def __next__(self):
self._cursor += self.step
if self._cursor < 0 or self._cursor >= len(self.collection):
raise StopIteration()
return self.collection[self._cursor]