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
|
# (C) Copyright 2005-2025 Enthought, Inc., Austin, TX
# All rights reserved.
#
# This software is provided without warranty under the terms of the BSD
# license included in LICENSE.txt and may be redistributed only under
# the conditions described in the aforementioned license. The license
# is also available online at http://www.enthought.com/licenses/BSD.txt
#
# Thanks for using Enthought open source!
"""
Copied from Python Cookbook.
"""
class RingBuffer:
def __init__(self, size_max):
self.max = size_max
self.data = []
def append(self, x):
"""append an element at the end of the buffer"""
self.data.append(x)
if len(self.data) == self.max:
self.cur = 0
self.__class__ = RingBufferFull
def get(self):
""" return a list of elements from the oldest to the newest"""
return self.data
class RingBufferFull:
def __init__(self, n):
raise Exception("you should use RingBuffer")
def append(self, x):
self.data[self.cur] = x
self.cur = (self.cur + 1) % self.max
def get(self):
return self.data[self.cur:] + self.data[: self.cur]
# sample of use
"""x=RingBuffer(5)
x.append(1); x.append(2); x.append(3); x.append(4)
print(x.__class__,x.get())
x.append(5)
print(x.__class__,x.get())
x.append(6)
print(x.data,x.get())
x.append(7); x.append(8); x.append(9); x.append(10)
print(x.data,x.get())"""
|
