#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'd say double entries should be possible, a DLL should really be able to
store any sequence.
How is `remove' currently implemented? I really do not see how it can take
O(1) time right now. To remove in O(1) time you must take away the trouble
of finding the node (or at least the pointers to next\previous object).
Just passing the object still leaves you with that work.
This doubly linked list has hide/unhide, which in my book means that there
should be two doubly linked lists in there, one storing a subsequence of
the other.
But perhaps it's not all cast in stone and there are more schools of
thought on this. I was brought up with the c++ STL implementation of a
list, as here http://www.cplusplus.com/reference/list/list/
--
Ticket URL: <http://trac.sagemath.org/ticket/16467#comment:7>
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.
