-
Notifications
You must be signed in to change notification settings - Fork 3
Implementations of various linear and cyclic list data-structures for Go
License
feyeleanor/lists
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
== About == Lists provide several implementations of classic linked-list data structures. Currently the following datatypes are provided: LinearList is a standard singly-linked list without any protections to guard against cyclic links between nodes; CycList is a generalised circular list where the terminating node links back to the first node. Both CycList and LinearList use a common ListHeader allowing them to be interchanged as necessary. This ListHeader has a chain.Node type associated with it which specifies the type of node used by a given instance of a list, and provides access caching to speed operations in frequently accessed portions of the list.
About
Implementations of various linear and cyclic list data-structures for Go
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published