You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
If you push/pop an element in a loop 1 million times, nodes will be empty, but node_map will have length 1 million. It is never emptied. I think there could be better design using a circular buffer that would only ever require node_map to be as long as the maximum size of the heap?
The text was updated successfully, but these errors were encountered:
ancapdev
added a commit
to ancapdev/DataStructures.jl
that referenced
this issue
Apr 23, 2022
If you push/pop an element in a loop 1 million times,
nodes
will be empty, butnode_map
will have length 1 million. It is never emptied. I think there could be better design using a circular buffer that would only ever requirenode_map
to be as long as the maximum size of the heap?The text was updated successfully, but these errors were encountered: