Crate llist

A Lisp-style singly linked list implementation with a bump allocator for efficient memory management.

Macros

• dolist
  The dolist! macro provides a convenient way to iterate over a singly-linked list.
• list
  The list! macro provides a convenient way to construct a singly-linked list.
• push
  The push! macro prepend item to stored in place by creating a new cons cell using the llist. Please note that, unlike Common Lisp, push! does not return the list.

Structs

• Cons
  A cons cell representing a node in the linked list.
• ConsRef
  A reference to a cons cell within a specific marker to arena
• LList
  This LList structure provides a simple interface for creating and manipulating cons cells in a linked lst fashion. It utilizes a bump allocator to allocate memory for cons cells avoiding the overhead of system memory allocation.

Functions

• append_2
  append_2 appends two lists non-destructively
• list_len
  Count elements of a list
• list_to_vec
  Create a vector from a list
• reverse
  reverse function creates new list with reverse order