It is not a new data structure, it is a sorted linked list implement in Golang. I implement this for study linked list part for Skip List.
go get github.com/kkdai/basiclist
// New a BasicList
bList := NewBasicList()
//Insert a search key 3, value is string3 (value could be any `interface{}`)
bList.Insert(3, "string3")
bList.Insert(4, "string4")
bList.Insert(2, "string2")
//Display all linked list.
bList.DisplayAll()
//head->[key:0][val:<nil>]->[key:2][val:string2]->[key:3][val:string3]->[key:4][val:string4]->nil
//Remove from list
bList.Remove(3)
bList.DisplayAll()
//head->[key:0][val:<nil>]->[key:2][val:string2]->[key:4][val:string4]->nil
It is one of my project 52.
This package is licensed under MIT license. See LICENSE for details.