new file: .gitignore
new file: LICENSE new file: README.md new file: compare/compare.go new file: for_test.go new file: heap/heap.go new file: heap/heap_test.go new file: interface.go new file: lastack/lastack.go new file: lastack/lastack_test.go new file: list/list.go new file: list/list_test.go new file: map/hashmap/hashmap.go new file: map/hashmap/hashmap_test.go new file: priority_list/iterator.go new file: priority_list/priority_list.go new file: priority_list/priority_list_test.go new file: priority_queue/iterator.go new file: priority_queue/priority_queue.go new file: priority_queue/priority_queue_test.go new file: priority_queue/vbt.go new file: priority_queue/vbt_test.go new file: priority_queuekey/iterator.go new file: priority_queuekey/priority_queuekey.go new file: priority_queuekey/priority_queuekey_test.go new file: priority_queuekey/vbt.go new file: priority_queuekey/vbt_test.go new file: set/hashset/hashset.go new file: set/hashset/hashset_test.go new file: set/treeset/treeset.go new file: set/treeset/treeset_test.go new file: sparse_array/array2/array2.go new file: sparse_array/array2/array2_test.go new file: sparse_array/array3/array3.go new file: sparse_array/array3/array3_test.go new file: sparse_array/arrayn/arrayn.go new file: sparse_array/arrayn/arrayn_test.go new file: stack/stack.go new file: stack/stack_test.go new file: tree/avl/avl.go new file: tree/avl/avl_test.go new file: tree/avl/iterator.go new file: tree/avldup/avldup.go new file: tree/avldup/avldup_test.go new file: tree/avldup/iterator.go new file: tree/avlkey/avlkey.go new file: tree/avlkey/avlkey_test.go new file: tree/avlkey/iterator.go new file: tree/avlkeydup/avlkeydup.go new file: tree/avlkeydup/avlkeydup_test.go new file: tree/avlkeydup/iterator.go new file: tree/vbt/iterator.go new file: tree/vbt/vbt.go new file: tree/vbt/vbt_test.go new file: tree/vbtkey/iterator.go new file: tree/vbtkey/vbtkey.go new file: tree/vbtkey/vbtkey_test.go
This commit is contained in:
232
sparse_array/array3/array3.go
Normal file
232
sparse_array/array3/array3.go
Normal file
@@ -0,0 +1,232 @@
|
||||
package array3
|
||||
|
||||
type Array3 struct {
|
||||
ysizes []int
|
||||
xsizes [][]int
|
||||
xyproduct int
|
||||
zsize int
|
||||
ysize int
|
||||
xsize int
|
||||
data [][][]interface{}
|
||||
|
||||
cap int
|
||||
}
|
||||
|
||||
func New() *Array3 {
|
||||
return NewWithCap(8, 8, 8)
|
||||
}
|
||||
|
||||
func NewWithCap(zsize, ysize, xsize int) *Array3 {
|
||||
arr := &Array3{zsize: zsize, ysize: ysize, xsize: xsize}
|
||||
|
||||
arr.ysizes = make([]int, arr.zsize, arr.zsize)
|
||||
|
||||
arr.xsizes = make([][]int, arr.zsize, arr.zsize)
|
||||
for i := 0; i < arr.zsize; i++ {
|
||||
arr.xsizes[i] = make([]int, arr.ysize, arr.ysize)
|
||||
}
|
||||
|
||||
arr.xyproduct = arr.ysize * arr.xsize
|
||||
arr.data = make([][][]interface{}, arr.zsize, arr.zsize)
|
||||
|
||||
arr.cap = arr.zsize * arr.xyproduct
|
||||
return arr
|
||||
}
|
||||
|
||||
func (arr *Array3) debugValues() []interface{} {
|
||||
var result []interface{}
|
||||
for _, z := range arr.data {
|
||||
if z != nil {
|
||||
for _, y := range z {
|
||||
if y == nil {
|
||||
for i := 0; i < arr.xsize; i++ {
|
||||
result = append(result, nil)
|
||||
}
|
||||
} else {
|
||||
for _, x := range y {
|
||||
if x == nil {
|
||||
result = append(result, struct{}{})
|
||||
} else {
|
||||
result = append(result, x)
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
} else {
|
||||
for i := 0; i < arr.ysize*arr.xsize; i++ {
|
||||
result = append(result, nil)
|
||||
}
|
||||
}
|
||||
}
|
||||
return result
|
||||
}
|
||||
|
||||
func (arr *Array3) Values() []interface{} {
|
||||
var result []interface{}
|
||||
for _, z := range arr.data {
|
||||
if z != nil {
|
||||
|
||||
for _, y := range z {
|
||||
if y == nil {
|
||||
for i := 0; i < arr.xsize; i++ {
|
||||
result = append(result, nil)
|
||||
}
|
||||
} else {
|
||||
for _, x := range y {
|
||||
if x == nil {
|
||||
result = append(result, nil)
|
||||
} else {
|
||||
result = append(result, x)
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
} else {
|
||||
for i := 0; i < arr.ysize*arr.xsize; i++ {
|
||||
result = append(result, nil)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return result
|
||||
}
|
||||
|
||||
func (arr *Array3) Cap() int {
|
||||
return arr.cap
|
||||
}
|
||||
|
||||
func (arr *Array3) Grow(size int) {
|
||||
zsize := arr.zsize + size
|
||||
temp := make([][][]interface{}, zsize, zsize)
|
||||
copy(temp, arr.data)
|
||||
arr.data = temp
|
||||
|
||||
tempysizes := make([]int, zsize, zsize)
|
||||
copy(tempysizes, arr.ysizes)
|
||||
arr.ysizes = tempysizes
|
||||
|
||||
tempxsizes := make([][]int, zsize, zsize)
|
||||
copy(tempxsizes, arr.xsizes)
|
||||
arr.xsizes = tempxsizes
|
||||
|
||||
for i := arr.zsize; i < zsize; i++ {
|
||||
arr.xsizes[i] = make([]int, arr.ysize, arr.ysize)
|
||||
}
|
||||
|
||||
arr.zsize += size
|
||||
arr.cap = arr.zsize * arr.xyproduct
|
||||
}
|
||||
|
||||
func (arr *Array3) Set(idx int, value interface{}) {
|
||||
zindex := idx / arr.xyproduct
|
||||
nidx := (idx % arr.xyproduct)
|
||||
yindex := nidx / arr.xsize
|
||||
xindex := nidx % arr.xsize
|
||||
|
||||
ydata := arr.data[zindex]
|
||||
if ydata == nil {
|
||||
ydata = make([][]interface{}, arr.ysize, arr.ysize)
|
||||
arr.data[zindex] = ydata
|
||||
}
|
||||
|
||||
xdata := ydata[yindex]
|
||||
if xdata == nil {
|
||||
xdata = make([]interface{}, arr.xsize, arr.xsize)
|
||||
ydata[yindex] = xdata
|
||||
arr.ysizes[zindex]++
|
||||
}
|
||||
|
||||
v := xdata[xindex]
|
||||
if v == nil {
|
||||
arr.xsizes[zindex][yindex]++
|
||||
}
|
||||
xdata[xindex] = value
|
||||
}
|
||||
|
||||
func (arr *Array3) Get(idx int) (interface{}, bool) {
|
||||
zindex := idx / arr.xyproduct
|
||||
nextsize := (idx % arr.xyproduct)
|
||||
yindex := nextsize / arr.xsize
|
||||
xindex := nextsize % arr.xsize
|
||||
|
||||
ydata := arr.data[zindex]
|
||||
if ydata == nil {
|
||||
return nil, false
|
||||
}
|
||||
|
||||
xdata := ydata[yindex]
|
||||
if xdata == nil {
|
||||
return nil, false
|
||||
}
|
||||
|
||||
v := xdata[xindex]
|
||||
return v, v != nil
|
||||
}
|
||||
|
||||
func (arr *Array3) GetOrSet(idx int, DoSetValue func([]interface{}, int)) (result interface{}, isSet bool) {
|
||||
zindex := idx / arr.xyproduct
|
||||
nidx := (idx % arr.xyproduct)
|
||||
yindex := nidx / arr.xsize
|
||||
xindex := nidx % arr.xsize
|
||||
|
||||
ydata := arr.data[zindex]
|
||||
if ydata == nil {
|
||||
ydata = make([][]interface{}, arr.ysize, arr.ysize)
|
||||
arr.data[zindex] = ydata
|
||||
}
|
||||
|
||||
xdata := ydata[yindex]
|
||||
if xdata == nil {
|
||||
xdata = make([]interface{}, arr.xsize, arr.xsize)
|
||||
ydata[yindex] = xdata
|
||||
arr.ysizes[zindex]++
|
||||
}
|
||||
|
||||
result = xdata[xindex]
|
||||
if result == nil {
|
||||
DoSetValue(xdata, xindex)
|
||||
result = xdata[xindex]
|
||||
if result == nil {
|
||||
panic("DoSetValue Not Set <nil> Value")
|
||||
}
|
||||
arr.xsizes[zindex][yindex]++
|
||||
return result, false
|
||||
}
|
||||
return result, true
|
||||
}
|
||||
|
||||
func (arr *Array3) Del(idx int) (interface{}, bool) {
|
||||
zindex := idx / arr.xyproduct
|
||||
nextsize := (idx % arr.xyproduct)
|
||||
yindex := nextsize / arr.xsize
|
||||
xindex := nextsize % arr.xsize
|
||||
|
||||
ydata := arr.data[zindex]
|
||||
if ydata == nil {
|
||||
return nil, false
|
||||
}
|
||||
|
||||
xdata := ydata[yindex]
|
||||
if xdata == nil {
|
||||
return nil, false
|
||||
}
|
||||
|
||||
v := xdata[xindex]
|
||||
xdata[xindex] = nil
|
||||
|
||||
isnotnil := v != nil
|
||||
|
||||
if isnotnil {
|
||||
arr.xsizes[zindex][yindex]--
|
||||
if arr.xsizes[zindex][yindex] == 0 {
|
||||
arr.data[zindex][yindex] = nil
|
||||
|
||||
arr.ysizes[zindex]--
|
||||
if arr.ysizes[zindex] == 0 {
|
||||
arr.data[zindex] = nil
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return v, isnotnil
|
||||
}
|
||||
215
sparse_array/array3/array3_test.go
Normal file
215
sparse_array/array3/array3_test.go
Normal file
@@ -0,0 +1,215 @@
|
||||
package array3
|
||||
|
||||
import (
|
||||
"testing"
|
||||
|
||||
"github.com/davecgh/go-spew/spew"
|
||||
|
||||
"github.com/Pallinder/go-randomdata"
|
||||
)
|
||||
|
||||
func testSet1(t *testing.T) {
|
||||
arr := NewWithCap(2, 2, 2)
|
||||
l := []int{0, 1, 7}
|
||||
for _, v := range l {
|
||||
arr.Set(v, v)
|
||||
}
|
||||
|
||||
var result string
|
||||
result = spew.Sprint(arr.debugValues())
|
||||
if result != "[0 1 <nil> <nil> <nil> <nil> {} 7]" {
|
||||
t.Error(result)
|
||||
}
|
||||
|
||||
defer func() {
|
||||
if err := recover(); err == nil {
|
||||
t.Error("err == nil, but array the set is out of range")
|
||||
}
|
||||
}()
|
||||
|
||||
arr.Set(8, 8)
|
||||
}
|
||||
|
||||
func testSet2(t *testing.T) {
|
||||
arr := NewWithCap(2, 2, 3)
|
||||
l := []int{0, 6, 5, 11}
|
||||
for _, v := range l {
|
||||
arr.Set(v, v)
|
||||
}
|
||||
|
||||
var result string
|
||||
result = spew.Sprint(arr.debugValues())
|
||||
if result != "[0 {} {} {} {} 5 6 {} {} {} {} 11]" {
|
||||
t.Error(arr.data)
|
||||
t.Error(result)
|
||||
}
|
||||
|
||||
defer func() {
|
||||
if err := recover(); err == nil {
|
||||
t.Error("err == nil, but array the set is out of range")
|
||||
}
|
||||
}()
|
||||
|
||||
arr.Set(12, 12)
|
||||
}
|
||||
|
||||
func TestArray2Set(t *testing.T) {
|
||||
testSet1(t)
|
||||
testSet2(t)
|
||||
}
|
||||
|
||||
func testArray2Get1(t *testing.T) {
|
||||
arr := New()
|
||||
for i := 0; i < 64; i++ {
|
||||
arr.Set(i, i)
|
||||
}
|
||||
|
||||
for i := 0; i < 64; i++ {
|
||||
if v, ok := arr.Get(i); ok {
|
||||
if v != i {
|
||||
t.Error("v is equal i, but", v, i)
|
||||
}
|
||||
} else {
|
||||
t.Error("not ok is error")
|
||||
}
|
||||
}
|
||||
|
||||
if v, ok := arr.Get(8*8*8 - 1); ok {
|
||||
t.Error(v)
|
||||
}
|
||||
|
||||
defer func() {
|
||||
if err := recover(); err == nil {
|
||||
t.Error("err == nil, but array the get is out of range")
|
||||
}
|
||||
}()
|
||||
|
||||
arr.Get(8 * 8 * 8)
|
||||
}
|
||||
|
||||
func testArray2Get2(t *testing.T) {
|
||||
arr := NewWithCap(4, 3, 3)
|
||||
for i := 0; i < 36; i++ {
|
||||
arr.Set(i, i)
|
||||
}
|
||||
|
||||
for i := 0; i < 36; i++ {
|
||||
if v, ok := arr.Get(i); ok {
|
||||
if v != i {
|
||||
t.Error("v is equal i, but", v, i)
|
||||
}
|
||||
} else {
|
||||
t.Error("not ok is error")
|
||||
}
|
||||
}
|
||||
|
||||
defer func() {
|
||||
if err := recover(); err == nil {
|
||||
t.Error("err == nil, but array the get is out of range")
|
||||
}
|
||||
}()
|
||||
|
||||
arr.Get(36)
|
||||
}
|
||||
|
||||
func TestArray2Get(t *testing.T) {
|
||||
testArray2Get1(t)
|
||||
testArray2Get2(t)
|
||||
}
|
||||
|
||||
func TestArray2Del(t *testing.T) {
|
||||
arr := NewWithCap(2, 2, 3)
|
||||
l := []int{0, 6, 5, 11}
|
||||
for _, v := range l {
|
||||
arr.Set(v, v)
|
||||
}
|
||||
// default [0 {} {} {} {} 5 6 {} <nil> <nil> <nil> <nil> {} {} {} 15]
|
||||
var result string
|
||||
|
||||
arr.Del(0)
|
||||
result = spew.Sprint(arr.debugValues())
|
||||
if result != "[<nil> <nil> <nil> {} {} 5 6 {} {} {} {} 11]" {
|
||||
t.Error(arr.data)
|
||||
t.Error(result)
|
||||
}
|
||||
|
||||
arr.Del(5)
|
||||
result = spew.Sprint(arr.debugValues())
|
||||
if result != "[<nil> <nil> <nil> <nil> <nil> <nil> 6 {} {} {} {} 11]" {
|
||||
t.Error(arr.data)
|
||||
t.Error(result)
|
||||
}
|
||||
|
||||
arr.Del(6)
|
||||
result = spew.Sprint(arr.debugValues())
|
||||
if result != "[<nil> <nil> <nil> <nil> <nil> <nil> <nil> <nil> <nil> {} {} 11]" {
|
||||
t.Error(result)
|
||||
}
|
||||
|
||||
arr.Del(11)
|
||||
result = spew.Sprint(arr.debugValues())
|
||||
if result != "[<nil> <nil> <nil> <nil> <nil> <nil> <nil> <nil> <nil> <nil> <nil> <nil>]" {
|
||||
t.Error(result)
|
||||
}
|
||||
|
||||
defer func() {
|
||||
if err := recover(); err == nil {
|
||||
t.Error("err == nil, but array the del is out of range")
|
||||
}
|
||||
}()
|
||||
|
||||
arr.Del(18)
|
||||
}
|
||||
|
||||
func BenchmarkArray3Set(b *testing.B) {
|
||||
|
||||
arr := NewWithCap(100, 100, 10)
|
||||
b.N = 500000000
|
||||
|
||||
b.StopTimer()
|
||||
var l []int
|
||||
for i := 0; i < b.N/10; i++ {
|
||||
l = append(l, randomdata.Number(0, 65535))
|
||||
}
|
||||
b.StartTimer()
|
||||
for c := 0; c < 10; c++ {
|
||||
for i := 0; i < b.N/10; i++ {
|
||||
arr.Set(l[i], i)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
func BenchmarkArray3Get(b *testing.B) {
|
||||
|
||||
arr := NewWithCap(100, 100, 10)
|
||||
b.N = 500000000
|
||||
|
||||
b.StopTimer()
|
||||
|
||||
for i := 0; i < 105535; i++ {
|
||||
v := randomdata.Number(0, 65535)
|
||||
arr.Set(v, v)
|
||||
}
|
||||
b.StartTimer()
|
||||
|
||||
for i := 0; i < b.N; i++ {
|
||||
arr.Get(i % 65535)
|
||||
}
|
||||
}
|
||||
|
||||
func BenchmarkArray3Del(b *testing.B) {
|
||||
|
||||
arr := NewWithCap(100, 100, 10)
|
||||
b.N = 500000000
|
||||
|
||||
b.StopTimer()
|
||||
for i := 0; i < 105535; i++ {
|
||||
v := randomdata.Number(0, 65535)
|
||||
arr.Set(v, v)
|
||||
}
|
||||
b.StartTimer()
|
||||
|
||||
for i := 0; i < b.N; i++ {
|
||||
arr.Del(i % 65535)
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user