This repository was archived by the owner on Jul 8, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 7
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
9 changed files
with
291 additions
and
230 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,96 @@ | ||
| package util | ||
|
|
||
| // List was adopted from https://gist.github.com/pje/90e727f80685c78a6c1cfff35f62155a. | ||
| // Replaec with container/list once it's generic. | ||
| type List[T any] struct { | ||
| root Element[T] | ||
| Len int | ||
| } | ||
|
|
||
| func (l *List[T]) First() *Element[T] { | ||
| if l.Len == 0 { | ||
| return nil | ||
| } | ||
| return l.root.next | ||
| } | ||
|
|
||
| func (l *List[T]) Last() *Element[T] { | ||
| if l.Len == 0 { | ||
| return nil | ||
| } | ||
| return l.root.prev | ||
| } | ||
|
|
||
| func (l *List[T]) PushFront(v T) *Element[T] { | ||
| if l.root.next == nil { | ||
| l.init() | ||
| } | ||
| return l.InsertAfter(v, &l.root) | ||
| } | ||
|
|
||
| func (l *List[T]) PushBack(v T) *Element[T] { | ||
| if l.root.next == nil { | ||
| l.init() | ||
| } | ||
| return l.InsertAfter(v, l.root.prev) | ||
| } | ||
|
|
||
| func (l *List[T]) Remove(e *Element[T]) T { | ||
| if e.list == l { | ||
| l.remove(e) | ||
| } | ||
| return e.Value | ||
| } | ||
|
|
||
| func (l *List[T]) init() { | ||
| l.root = *new(Element[T]) | ||
| l.root.next = &l.root | ||
| l.root.prev = &l.root | ||
| } | ||
|
|
||
| func (l *List[T]) insertAfter(e *Element[T], at *Element[T]) *Element[T] { | ||
| e.prev = at | ||
| e.next = at.next | ||
| e.prev.next = e | ||
| e.next.prev = e | ||
| e.list = l | ||
| l.Len++ | ||
| return e | ||
| } | ||
|
|
||
| func (l *List[T]) InsertAfter(v T, at *Element[T]) *Element[T] { | ||
| e := Element[T]{Value: v} | ||
| return l.insertAfter(&e, at) | ||
| } | ||
|
|
||
| func (l *List[T]) remove(e *Element[T]) { | ||
| e.prev.next = e.next | ||
| e.next.prev = e.prev | ||
| e.next = nil | ||
| e.prev = nil | ||
| e.list = nil | ||
| l.Len-- | ||
| } | ||
|
|
||
| type Element[T any] struct { | ||
| prev *Element[T] | ||
| next *Element[T] | ||
| list *List[T] | ||
| Value T | ||
| } | ||
|
|
||
| func (e *Element[T]) Next() *Element[T] { | ||
| n := e.next | ||
| if e.list == nil || n == &e.list.root { | ||
| return nil | ||
| } | ||
| return n | ||
| } | ||
|
|
||
| func (e *Element[T]) Prev() *Element[T] { | ||
| p := e.prev | ||
| if e.list == nil || p == &e.list.root { | ||
| return nil | ||
| } | ||
| return p | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.