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
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.
The text was updated successfully, but these errors were encountered:
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.
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.
The text was updated successfully, but these errors were encountered: