Crate lists

Library containing various implementations of list-like data-structures such as Vectors, LinkedLists, and more. All data-structures follow a sequence-like structure and can be represented like an Array.

Lists

pub struct SinglyLinkedList<T> { .. } // One-directional `LinkedList`.
pub struct DoublyLinkedList<T> { .. } // Two-directional `LinkedList`.

Re-exports

pub use linked::singly::SinglyLinkedList;

pub use linked::doubly::DoublyLinkedList;

Modules

linked

Module containing data-structures that resemble LinkedLists. LinkedLists are widely unused in modern computing due the Vector data structure being more superior in just about every aspect now and days. Vectors are much more cache-optimized that LinkedLists and their lookup times resemble O(1) time complexity, making them better for most applications. Macros for shorthand construction of the various lists are availible within the library’s root.

Macros

dl_list

Shorthand syntax for creating a DoublyLinkedList. Time complexity is O(1).

sl_list

Shorthand syntax for creating a SinglyLinkedList. Time complexity is O(n).