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.
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2024-08-06 UTC.
[null,null,["Last updated 2024-08-06 UTC."],[],["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,[]]
