Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: dense_doubly_linked_list
Note: This documentation is automatically generated.
Specialized doubly-linked list that initially holds [0..n-1] in an arbitrary (user-specified) and fixed order. It then supports O(1) removal and access to the next and previous element of a given (non-removed) element.
It is very fast and compact: it uses exactly 8*n bytes of memory.
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-08-06 UTC."],[[["\u003cp\u003e\u003ccode\u003edense_doubly_linked_list\u003c/code\u003e is a specialized doubly-linked list in C++ that stores elements [0..n-1] in a fixed, user-defined order.\u003c/p\u003e\n"],["\u003cp\u003eIt provides constant time (O(1)) complexity for removing and accessing the next and previous elements.\u003c/p\u003e\n"],["\u003cp\u003eThis data structure is memory-efficient, using 8*n bytes of memory, making it both fast and compact.\u003c/p\u003e\n"]]],["This C++ `DenseDoublyLinkedList` is a specialized data structure representing a doubly-linked list. It starts with elements [0..n-1] in a user-defined order. The key actions it supports are constant-time (O(1)) removal of elements and retrieval of the next/previous element for any existing element. The structure is highly memory-efficient, consuming exactly 8\\*n bytes. The core class is `DenseDoublyLinkedList`.\n"],null,["# dense_doubly_linked_list\n\nC++ Reference: dense_doubly_linked_list\n=======================================\n\n\nNote: This documentation is automatically generated.\n\n\u003cbr /\u003e\n\nSpecialized doubly-linked list that initially holds \\[0..n-1\\] in an arbitrary (user-specified) and fixed order. It then supports O(1) removal and access to the next and previous element of a given (non-removed) element. \n\nIt is very fast and compact: it uses exactly 8\\*n bytes of memory.\n\n| Classes ------- ||\n|------------------------------------------------------------------------------------------------------------|---|\n| [DenseDoublyLinkedList](/optimization/reference/algorithms/dense_doubly_linked_list/DenseDoublyLinkedList) |"]]
