！UNAVAILABLE NOW !
I do not recommend that you use the project directly, it may have a lot of unknown problems, because the project itself is implemented quickly, and it has not gone through a complete design phase and testing phase. Most of the realizations are my own imagination. The library will be refactored later. I will mark the unavailable status until the project has a complete development process and credible test results.
The element packing in the node. Any value must be packing the sortable.
For different usage, it has different implementations.
The skip link with different sortable implement, cloud be a stack, queue, single-link and so on.
The Sortable is a interface, and this repo already provide some common implements in implements.
For any sortable, it has example in the test file.
Common usage, without packing func. Alse see SkipLink_Test.go.
var is int64 = 1
f := func(x interface{}) {
fmt.Println(float64(x.(int64)))
}
f(is)
// if value packing func is nil, is dangerous
s := InitSkipLink(8, nil, GeneratorDefaultHasNextLevelFunc())
v0 := IntegerSortable{value: 0}
v1 := IntegerSortable{value: 1}
v2 := IntegerSortable{value: 2}
v8 := IntegerSortable{value: 8}
v9 := IntegerSortable{value: 9}
v7 := IntegerSortable{value: 7}
v6 := IntegerSortable{value: 6}
v0s := Sortable(&v0)
v1s := Sortable(&v1)
v2s := Sortable(&v2)
v8s := Sortable(&v8)
v9s := Sortable(&v9)
v7s := Sortable(&v7)
v6s := Sortable(&v6)
s.AddSortable(&v1s)
s.AddSortable(&v2s)
s.AddSortable(&v0s)
s.AddSortable(&v1s)
s.AddSortable(&v1s)
s.AddSortable(&v1s)
s.AddSortable(&v1s)
s.AddSortable(&v1s)
s.AddSortable(&v1s)
s.AddSortable(&v1s)
s.AddSortable(&v1s)
s.AddSortable(&v1s)
s.AddSortable(&v8s)
s.AddSortable(&v9s)
s.AddSortable(&v7s)
s.AddSortable(&v6s)
allNode := s.GetAllSortable()
for _, item := range allNode {
for _, value := range item {
fmt.Print("", value.Value(), " ")
}
fmt.Println()
}
fmt.Println(s.ToArray())
fmt.Println(s.AllDataCount(), s.Length())
s.DeleteSortable(&v0s)
fmt.Println(s.ToArray())
fmt.Println(s.AllDataCount(), s.Length())
s.DeleteSortable(&v1s)
fmt.Println(s.ToArray())
fmt.Println(s.AllDataCount(), s.Length())
s.DeleteSortable(&v9s)
fmt.Println(s.ToArray())
fmt.Println(s.AllDataCount(), s.Length())
s.DeleteSortable(&v0s)
fmt.Println(s.ToArray())
fmt.Println(s.AllDataCount(), s.Length())
fmt.Println((s.Get(0)).Value())
fmt.Println((s.Get(3)).Value())
fmt.Println((s.Remove(3)).Value())
fmt.Println(s.Remove(0).Value())
fmt.Println(s.ToArray())
fmt.Println(s.AllDataCount(), s.Length())
s.DeleteSortable(&v2s)
s.DeleteSortable(&v6s)
s.DeleteSortable(&v7s)
s.DeleteSortable(&v8s)
fmt.Println(s.ToArray())
fmt.Println(s.AllDataCount(), s.Length())