RDllist class

Circular doubly-linked list implementation.

This class implements a circular doubly-linked list using the Dllink template with size_t as the data type. It provides efficient node management and supports both forward and reverse ordering.

Constructors, destructors, conversion operators

RDllist(size_t num_nodes, bool reverse = false) explicit: Construct a new RDllist object.

Public variables

std::vector<Dllink<size_t>> cycle: Storage for all list nodes.

Function documentation

RDllist::RDllist(size_t num_nodes, bool reverse = false) explicit

Construct a new RDllist object.

Parameters
num_nodes in	The number of nodes to create in the list
reverse in	If true, creates the list in reverse order

Creates a circular doubly-linked list with the specified number of nodes. The nodes are linked together in a circular fashion, with the last node pointing back to the first.