README
¶
List Package
English | 中文
A generic doubly-linked list implementation in Go, providing a flexible and efficient data structure for managing ordered collections.
Features
- Generic type support
- Doubly-linked list implementation
- Thread-safe operations
- Rich set of operations:
- PushFront/PushBack
- InsertBefore/InsertAfter
- MoveToFront/MoveToBack
- MoveBefore/MoveAfter
- Remove
- Iteration support
Installation
go get github.com/danielhookx/xcontainer/list
Usage
package main
import "github.com/danielhookx/xcontainer/list"
func main() {
// Create a new list
l := list.New[int]()
// Add elements
l.PushBack(1)
l.PushBack(2)
l.PushBack(3)
// Iterate over elements
for e := l.Front(); e != nil; e = e.Next() {
fmt.Println(e.Value)
}
// Use generic iteration
for item := range l.Iter() {
fmt.Println(item)
}
}
API Reference
NewT *List[T]
Creates a new empty list.
List Methods
PushFront(v T) *Element[T]PushBack(v T) *Element[T]InsertBefore(v T, mark *Element[T]) *Element[T]InsertAfter(v T, mark *Element[T]) *Element[T]MoveToFront(e *Element[T])MoveToBack(e *Element[T])MoveBefore(e, mark *Element[T])MoveAfter(e, mark *Element[T])Remove(e *Element[T]) TLen() intFront() *Element[T]Back() *Element[T]Iter() <-chan T
Element Methods
Next() *Element[T]Prev() *Element[T]Value T
License
This project is licensed under the BSD License - see the LICENSE file for details.
Documentation
¶
Index ¶
- type Element
- type List
- func (l *List[T]) Back() *Element[T]
- func (l *List[T]) Front() *Element[T]
- func (l *List[T]) Init() *List[T]
- func (l *List[T]) InsertAfter(v T, mark *Element[T]) *Element[T]
- func (l *List[T]) InsertBefore(v T, mark *Element[T]) *Element[T]
- func (l *List[T]) Iter() iter.Seq[T]
- func (l *List[T]) Len() int
- func (l *List[T]) MoveAfter(e, mark *Element[T])
- func (l *List[T]) MoveBefore(e, mark *Element[T])
- func (l *List[T]) MoveToBack(e *Element[T])
- func (l *List[T]) MoveToFront(e *Element[T])
- func (l *List[T]) PushBack(v T) *Element[T]
- func (l *List[T]) PushBackList(other *List[T])
- func (l *List[T]) PushFront(v T) *Element[T]
- func (l *List[T]) PushFrontList(other *List[T])
- func (l *List[T]) Remove(e *Element[T]) T
- type SetList
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Element ¶
type Element[T any] struct { Value T // contains filtered or unexported fields }
type List ¶
type List[T any] struct { // contains filtered or unexported fields }
List represents a doubly linked list. The zero value for List is an empty list ready to use.
func (*List[T]) InsertAfter ¶
InsertAfter inserts a new element e with value v immediately after mark and returns e. If mark is not an element of l, the list is not modified. The mark must not be nil.
func (*List[T]) InsertBefore ¶
InsertBefore inserts a new element e with value v immediately before mark and returns e. If mark is not an element of l, the list is not modified. The mark must not be nil.
func (*List[T]) MoveAfter ¶
MoveAfter moves element e to its new position after mark. If e or mark is not an element of l, or e == mark, the list is not modified. The element and mark must not be nil.
func (*List[T]) MoveBefore ¶
MoveBefore moves element e to its new position before mark. If e or mark is not an element of l, or e == mark, the list is not modified. The element and mark must not be nil.
func (*List[T]) MoveToBack ¶
MoveToBack moves element e to the back of list l. If e is not an element of l, the list is not modified. The element must not be nil.
func (*List[T]) MoveToFront ¶
MoveToFront moves element e to the front of list l. If e is not an element of l, the list is not modified. The element must not be nil.
func (*List[T]) PushBack ¶
PushBack inserts a new element e with value v at the back of list l and returns e.
func (*List[T]) PushBackList ¶
PushBackList inserts a copy of another list at the back of list l. The lists l and other may be the same. They must not be nil.
func (*List[T]) PushFront ¶
PushFront inserts a new element e with value v at the front of list l and returns e.
func (*List[T]) PushFrontList ¶
PushFrontList inserts a copy of another list at the front of list l. The lists l and other may be the same. They must not be nil.
type SetList ¶
type SetList[T comparable] struct { // contains filtered or unexported fields }
SetList 节点值不重复的单链表封装
func NewSetList ¶
func NewSetList[T comparable]() *SetList[T]
Source Files