Sprint-Challenge--Data-Structures-Python/ring_buffer/ring_buffer.py at c6f8bf2753f7ba7f7822d6550dc34c61a2d4c8a4 · bloominstituteoftechnology/Sprint-Challenge--Data-Structures-Python · GitHub

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
class RingBuffer:
    def __init__(self, capacity):
        self.q = list()
        self.capacity = capacity
        self.head = 0
        self.tail = 0
        self.index = 0

    def iterate_head(self):
        if self.head >= self.capacity -1:
            self.head = 0
        else:
            self.head += 1

    def iterate_tail(self):
        if self.tail >= self.capacity -1:
            self.tail = 0
        else:
            self.tail += 1

    def size(self):
        return len(self.q)

    def append(self, item):
        if self.size() == self.capacity:
            self.q[self.tail] = item
            self.iterate_tail()
        else:
            self.q.append(item)
            self.iterate_tail()

    def get(self):
        return self.q