Add Circular Buffer and Priority Queue #106
Labels
No labels
bug
discussion
documentation
duplicate
ignore
new feature
question
No milestone
No project
No assignees
1 participant
Notifications
Due date
No due date set.
Dependencies
No dependencies set
Reference
golibs/gms-gods#106
Loading…
Reference in a new issue
No description provided.
Delete branch "%!s()"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
Would be nice to have a circular buffer where adding elements to the front and back take O(1). I see that there are no Queues or Deques and the circular buffer is perfect for both data structures. There can also be linked list queues or deques. Also an array based binary Heap? They are pretty easy to implement. These are just some ideas though.
Implemented in v1.18.0 by #203