Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

try another IntTreeMap based on Haskell's Data.IntMap / 2-3 finger-trees #3

Open
blackdrag opened this issue Mar 20, 2014 · 0 comments
Open

try another IntTreeMap based on Haskell's Data.IntMap / 2-3 finger-trees #3

blackdrag opened this issue Mar 20, 2014 · 0 comments

Comments

@blackdrag
Copy link
Collaborator

From [email protected] on 2009-03-16T21:47:42Z

might be faster than current size-balanced-tree implementation (more optimized for integer keys)

might also lead to better PVector implementation? PQueue?

cf http://www.haskell.org/ghc/docs/latest/html/libraries/containers/Data-IntMap.html http://www.haskell.org/ghc/docs/latest/html/libraries/containers/Data-Sequence.html http://www.haskell.org/ghc/docs/latest/html/libraries/containers/

Original issue: http://code.google.com/p/pcollections/issues/detail?id=3
@blackdrag blackdrag added this to the backlog milestone Mar 20, 2014
@hrldcpr hrldcpr removed this from the backlog milestone Mar 28, 2018
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@blackdrag @hrldcpr