Documentation ¶
Index ¶
- type LinkedList
- func (l *LinkedList) Backwards() (it types.KIterator)
- func (l *LinkedList) DequeBack() (item types.Hashable, err error)
- func (l *LinkedList) DequeFront() (item types.Hashable, err error)
- func (l *LinkedList) EnqueBack(item types.Hashable) (err error)
- func (l *LinkedList) EnqueFront(item types.Hashable) (err error)
- func (l *LinkedList) Equals(b types.Equatable) bool
- func (l *LinkedList) First() (item types.Hashable)
- func (l *LinkedList) Has(item types.Hashable) bool
- func (l *LinkedList) Hash() int
- func (l *LinkedList) Items() (it types.KIterator)
- func (l *LinkedList) Last() (item types.Hashable)
- func (l *LinkedList) Less(b types.Sortable) bool
- func (l *LinkedList) Pop() (item types.Hashable, err error)
- func (l *LinkedList) Push(item types.Hashable) (err error)
- func (l *LinkedList) Size() int
- func (l *LinkedList) String() string
- type Node
- type UniqueDeque
- func (l *UniqueDeque) Backwards() (it types.KIterator)
- func (l *UniqueDeque) DequeBack() (item types.Hashable, err error)
- func (l *UniqueDeque) DequeFront() (item types.Hashable, err error)
- func (l *UniqueDeque) EnqueBack(item types.Hashable) (err error)
- func (l *UniqueDeque) EnqueFront(item types.Hashable) (err error)
- func (l *UniqueDeque) Equals(b types.Equatable) bool
- func (l *UniqueDeque) First() (item types.Hashable)
- func (l *UniqueDeque) Has(item types.Hashable) bool
- func (l *UniqueDeque) Hash() int
- func (l *UniqueDeque) Items() (it types.KIterator)
- func (l *UniqueDeque) Last() (item types.Hashable)
- func (l *UniqueDeque) Less(b types.Sortable) bool
- func (l *UniqueDeque) Pop() (item types.Hashable, err error)
- func (l *UniqueDeque) Push(item types.Hashable) (err error)
- func (l *UniqueDeque) Size() int
- func (l *UniqueDeque) String() string
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type LinkedList ¶
A doubly linked list. There is no synchronization. The fields are publically accessible to allow for easy customization.
func New ¶
func New() *LinkedList
func (*LinkedList) Backwards ¶
func (l *LinkedList) Backwards() (it types.KIterator)
func (*LinkedList) DequeFront ¶
func (l *LinkedList) DequeFront() (item types.Hashable, err error)
func (*LinkedList) EnqueFront ¶
func (l *LinkedList) EnqueFront(item types.Hashable) (err error)
func (*LinkedList) Equals ¶
func (l *LinkedList) Equals(b types.Equatable) bool
Can be compared to any types.IterableContainer
func (*LinkedList) First ¶
func (l *LinkedList) First() (item types.Hashable)
func (*LinkedList) Hash ¶
func (l *LinkedList) Hash() int
func (*LinkedList) Items ¶
func (l *LinkedList) Items() (it types.KIterator)
func (*LinkedList) Last ¶
func (l *LinkedList) Last() (item types.Hashable)
func (*LinkedList) Less ¶
func (l *LinkedList) Less(b types.Sortable) bool
Can be compared to any types.IterableContainer
func (*LinkedList) Size ¶
func (l *LinkedList) Size() int
func (*LinkedList) String ¶
func (l *LinkedList) String() string
type Node ¶
A doubly linked list node.
type UniqueDeque ¶
type UniqueDeque struct {
// contains filtered or unexported fields
}
func NewUniqueDeque ¶
func NewUniqueDeque() *UniqueDeque
A double ended queue that only allows unique items inside. Constructed from a doubly linked list and a linear hash table.
func (*UniqueDeque) Backwards ¶
func (l *UniqueDeque) Backwards() (it types.KIterator)
func (*UniqueDeque) DequeFront ¶
func (l *UniqueDeque) DequeFront() (item types.Hashable, err error)
func (*UniqueDeque) EnqueFront ¶
func (l *UniqueDeque) EnqueFront(item types.Hashable) (err error)
func (*UniqueDeque) Equals ¶
func (l *UniqueDeque) Equals(b types.Equatable) bool
Can be compared to any types.IterableContainer
func (*UniqueDeque) First ¶
func (l *UniqueDeque) First() (item types.Hashable)
func (*UniqueDeque) Hash ¶
func (l *UniqueDeque) Hash() int
func (*UniqueDeque) Items ¶
func (l *UniqueDeque) Items() (it types.KIterator)
func (*UniqueDeque) Last ¶
func (l *UniqueDeque) Last() (item types.Hashable)
func (*UniqueDeque) Less ¶
func (l *UniqueDeque) Less(b types.Sortable) bool
Can be compared to any types.IterableContainer
func (*UniqueDeque) Size ¶
func (l *UniqueDeque) Size() int
func (*UniqueDeque) String ¶
func (l *UniqueDeque) String() string
Click to show internal directories.
Click to hide internal directories.