CircularList.jl
CircularList.List
CircularList.Node
Base.delete!
Base.eltype
Base.insert!
Base.iterate
Base.length
Base.show
Base.show
Base.size
CircularList.allocate!
CircularList.backward!
CircularList.circularlist
CircularList.circularlist
CircularList.current
CircularList.forward!
CircularList.head
CircularList.next
CircularList.previous
CircularList.shift!
CircularList.tail
Base.delete!
— Method.Delete current node and return the previous node.
Warning: removed nodes are not reclaimed from memory for simplicity reasons
Base.eltype
— Method.Return the element type of the list
Base.insert!
— Method.Insert a new node after the current node and return the new node.
Base.iterate
— Function.Iteration protocol implementation.
Base.length
— Method.Returns the length of the circular list
Base.show
— Method.Show list.
Base.show
— Method.Show node
Base.size
— Method.Return the size of the list.
CircularList.backward!
— Method.Shift the current pointer backward.
CircularList.circularlist
— Method.Create a circular list from any vector
CircularList.circularlist
— Method.Create a circular list with the specified data element.
CircularList.current
— Method.Return the current node.
CircularList.forward!
— Method.Shift the current pointer forward.
CircularList.head
— Method.Return the head of the list (current node).
CircularList.next
— Method.Return the ext node.
CircularList.previous
— Method.Return the previous node.
CircularList.shift!
— Method.Shift the current pointer forward or backward.
CircularList.tail
— Method.Return the tail of the list (last node)
CircularList.List
— Type.List is used to hold a pre-allocated vector of nodes.
CircularList.Node
— Type.Doubly linked list implementation
CircularList.allocate!
— Method.Allocates a new uninitialized node in the circular list