github.com/basemax/OneWayLinkedListGo
This is a simple implementation of a one-way linked-list in Go. The one way linkedlist is a data structure that is made up of nodes. Each node contains a value and a pointer to the next node. The head of the list is the first node in the list. The tail of the list is the last node in the list. The tail of the list points to nil.
Ecosystem
proxy.golang.org
proxy.golang.org
Versions
0
0
Links
| Registry | proxy.golang.org |
| Source | Repository |
| Docs | Documentation |
| JSON API | View JSON |
| CodeMeta | codemeta.json |
Package Details
| PURL |
pkg:golang/github.com/basemax/%21one%21way%21linked%21list%21go
spec |
| License | GPL-3.0 |
| Namespace | github.com/basemax |
| Last Synced | 17 days ago |
Repository
| Stars | 0 on GitHub |
| Forks | 0 on GitHub |
Rankings on proxy.golang.org
Overall
Top 6.0%