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.

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

dlist enhancements #2917

Closed
bblum opened this issue Jul 14, 2012 · 3 comments
Closed

dlist enhancements #2917

bblum opened this issue Jul 14, 2012 · 3 comments
Labels
E-easy Call for participation: Easy difficulty. Experience needed to fix: Not much. Good first issue.

Comments

@bblum
Copy link
Contributor

bblum commented Jul 14, 2012

each_node: like each, but returns a node instead of the element.
insert_sorted: takes a comparison function
append: empties the second list; must be O(1). Currently can't be because of back-head-pointers - decide whether to get rid of them.

@ghost ghost assigned bblum Jul 14, 2012
@bblum
Copy link
Contributor Author

bblum commented Jul 14, 2012

maybe option::iterate too?

@eholk
Copy link
Contributor

eholk commented Jul 14, 2012

What is a node for a dlist?

@bblum
Copy link
Contributor Author

bblum commented Jul 16, 2012

Node is the handle that the user must use to e.g. remove from the dlist, or insert_before/insert_after. Doing each_node would allow a user to decide where to insert (e.g. for insert_sorted) without open-coding the iteration.

Found during ICFP (#2928).

@bblum bblum closed this as completed in 8e6d662 Jul 18, 2012
@bblum bblum removed their assignment Jun 16, 2014
celinval pushed a commit to celinval/rust-dev that referenced this issue Jun 4, 2024
celinval pushed a commit to celinval/rust-dev that referenced this issue Jun 4, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
E-easy Call for participation: Easy difficulty. Experience needed to fix: Not much. Good first issue.
Projects
None yet
Development

No branches or pull requests

2 participants