dsap.linkedlist.doubly_linked_base._DoublyLinkedBase

class documentation

class _DoublyLinkedBase:

Known subclasses: dsap.linkedlist.linked_deque.LinkedDeque, dsap.linkedlist.positional_list.PositionalList

View In Hierarchy

A base class providing a doubly linked list representation.

Method __init__ Create an empty list.
Method __len__ Return the number of elements in the list.
Method is_empty Return True if list is empty.
Class _Node Lightweight, nonpublic class for storing a doubly linked node.
Method _delete_node Delete nonsentinel node from the list and return its element.
Method _insert_between Add element e between two existing nodes and return new node.
Instance Variable _header Undocumented
Instance Variable _size Undocumented
Instance Variable _trailer Undocumented
def __init__(self):

Create an empty list.

def __len__(self):

Return the number of elements in the list.

def is_empty(self):

Return True if list is empty.

def _delete_node(self, node):

Delete nonsentinel node from the list and return its element.

def _insert_between(self, e, predecessor, successor):
overridden in dsap.linkedlist.positional_list.PositionalList

Add element e between two existing nodes and return new node.

_header =

Undocumented

_size: int =

Undocumented

_trailer =

Undocumented