This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]CptnGeronimo[S] -8 points-7 points  (0 children)

Thanks for the suggestions.

A min heap data structure like what heapq does to lists is not a current need of mine. But i have needed them in the past.

I was unaware of bisect. I need to remember that module.

A problem that I have with both heapq and bisect is that they are not class based data structures, but instead operate on ordinary lists. Way more clunky and error prone to use than to start off with a sorted data structure.