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

Implement Finger Tree? #6

Open
vorce opened this issue Aug 6, 2018 · 0 comments
Open

Implement Finger Tree? #6

vorce opened this issue Aug 6, 2018 · 0 comments
Labels
datastructure New datastructure implementation enhancement New feature or request

Comments

@vorce
Copy link
Owner

vorce commented Aug 6, 2018

https://chrispenner.ca/posts/intro-to-finger-trees

A Finger Tree is an efficient purely functional data structure that can retrieve its leaves in constant time and perform concatenating and splitting in logarithmic time. One of its key features is that it accepts a split function which is used during search. Depending on the function given, the data structure can represent a sequence, a priority queue, a search tree and more.
@vorce vorce added the enhancement New feature or request label Aug 6, 2018
@vorce vorce added the datastructure New datastructure implementation label May 7, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
datastructure New datastructure implementation enhancement New feature or request
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@vorce