Implementing python data queue buffer

Question

I need to implement a buffer / queue like storage with a given capacity of n that stores n objects and deletes the oldest one if it is full and stores the newest. I bet there must be a defined standard library for this?

Thanks, EL

palivek · Accepted Answer · 2018-03-15 21:03:03Z

3

I think you're looking for the collections module. More specifically the deque data structure, which allows you to set a maximum length and automatically drops elements from the end.

edited Mar 15, 2018 at 21:03

answered Mar 15, 2018 at 20:56

palivek

1157 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

Implementing python data queue buffer

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related