Open the context
Choose the project folder and name the files or behavior involved.
Workflows
Coding workflows · Ring-buffer retention order
03
A concrete starting point
Retain only the latest entries of an iterable in a bounded ring buffer and return them in chronological order. Test overflow, repeated values and capacity one, rejecting non-positive or fractional capacities before consuming input.
Define the change
Describe the input, expected output and boundaries that must stay intact.
Inspect the work
Review the proposed edits and any commands before relying on their result.
Check the outcome
Compare actual behavior with the expected result. If a check fails, investigate it before applying more changes.
Ring-buffer retention order
A concrete starting point
from collections import deque
def keep_latest(items, capacity):
if type(capacity) is not int or capacity < 1:
raise ValueError("ring.capacity")
return tuple(deque(items, maxlen=capacity))The example is a starting point for a real project, not a claim that generated code is already tested. Adjust paths, dependencies and expected behavior to match your application.
