#16467: Unhiding in a fully hidden Doubly-Linked List
-------------------------------------+-------------------------------------
Reporter: foosterhof | Owner:
Type: defect | Status: needs_review
Priority: major | Milestone: sage-6.3
Component: combinatorics | Resolution:
Keywords: doubly linked | Merged in:
list unhide empty | Reviewers:
Authors: | Work issues:
Report Upstream: Reported | Commit:
upstream. No feedback yet. | f8a86c0d85e36603fb45024ff14acde049cb0903
Branch: | Stopgaps:
u/foosterhof/ticket/16467 |
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by Rudi):
I forgot for a moment that I could simply take a look at the code :) .
Anyway, the implementation of remove() takes O(log n) time, not O(1) as
advertised in the docstring, since next_value and prev_value are
dictionaries.
--
Ticket URL: <http://trac.sagemath.org/ticket/16467#comment:8>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
