Completed ring_buffer class

Author: exploratum

ring_buffer/ring_buffer.py

@@ -4,8 +4,11 @@ def __init__(self, capacity):
     self.current = 0
     self.storage = [None]*capacity
 
+  # when full always append by replacing the oldest information - not full replace the first preset None seen
   def append(self, item):
-    pass
+    self.storage[self.current % self.capacity] = item
+    self.current = (self.current + 1) % self.capacity
 
+  # return everything from buffer, in order, ignoring None values
   def get(self):
-    pass
+    return [item for item in self.storage if item is not None]