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:
217
sparse_array/arrayn/arrayn.go
Normal file
217
sparse_array/arrayn/arrayn.go
Normal file
@@ -0,0 +1,217 @@
|
||||
package arrayn
|
||||
|
||||
type SizeN struct {
|
||||
Sizes []int
|
||||
}
|
||||
|
||||
type ProductN struct {
|
||||
Values []int
|
||||
}
|
||||
|
||||
type DimensionSize struct {
|
||||
Sizes []int
|
||||
}
|
||||
|
||||
type Node struct {
|
||||
size int
|
||||
data interface{}
|
||||
}
|
||||
|
||||
type ArrayN struct {
|
||||
dims []int
|
||||
product []int
|
||||
|
||||
dimN int
|
||||
data *Node // []*Node
|
||||
|
||||
cap int
|
||||
}
|
||||
|
||||
func New() *ArrayN {
|
||||
return NewWithCap(8, 8, 8)
|
||||
}
|
||||
|
||||
func NewWithCap(dims ...int) *ArrayN {
|
||||
arr := &ArrayN{dimN: len(dims), dims: dims}
|
||||
arr.product = make([]int, len(dims)-1, len(dims)-1)
|
||||
for i := 0; i < len(dims)-1; i++ {
|
||||
pvalue := 1
|
||||
for n := i + 1; n < len(dims); n++ {
|
||||
pvalue *= dims[n]
|
||||
}
|
||||
arr.product[i] = pvalue
|
||||
}
|
||||
// arr.data = make([]*Node, arr.dims[0], arr.dims[0])
|
||||
arr.cap = 1
|
||||
for _, d := range arr.dims {
|
||||
arr.cap *= d
|
||||
}
|
||||
return arr
|
||||
}
|
||||
|
||||
func (arr *ArrayN) collectValues(curDim int, cur *Node, result *[]interface{}) {
|
||||
if cur == nil {
|
||||
return
|
||||
}
|
||||
|
||||
if curDim == 1 {
|
||||
for _, v := range cur.data.([]interface{}) {
|
||||
if v != nil {
|
||||
*result = append(*result, v)
|
||||
} else {
|
||||
*result = append(*result, nil)
|
||||
}
|
||||
}
|
||||
return
|
||||
}
|
||||
|
||||
for _, n := range cur.data.([]*Node) {
|
||||
if n != nil {
|
||||
arr.collectValues(curDim-1, n, result)
|
||||
} else {
|
||||
total := 1
|
||||
for i := len(arr.dims) - curDim + 1; i < len(arr.dims); i++ {
|
||||
total *= arr.dims[i]
|
||||
}
|
||||
|
||||
for i := 0; i < total; i++ {
|
||||
*result = append(*result, nil)
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
func (arr *ArrayN) Values() (result []interface{}) {
|
||||
arr.collectValues(arr.dimN, arr.data, &result)
|
||||
return
|
||||
}
|
||||
|
||||
func (arr *ArrayN) set(curDim int, curidx int, pdata **Node, parent *Node) (*Node, int) {
|
||||
|
||||
sidx := arr.dimN - curDim
|
||||
|
||||
if *pdata == nil {
|
||||
if parent != nil {
|
||||
parent.size++
|
||||
}
|
||||
if curDim > 1 {
|
||||
*pdata = &Node{data: make([]*Node, arr.dims[sidx], arr.dims[sidx])}
|
||||
} else {
|
||||
*pdata = &Node{data: make([]interface{}, arr.dims[sidx], arr.dims[sidx])}
|
||||
return *pdata, curidx
|
||||
}
|
||||
}
|
||||
|
||||
cur := *pdata
|
||||
if curDim == 1 {
|
||||
return cur, curidx
|
||||
}
|
||||
|
||||
nidx := curidx % arr.product[sidx]
|
||||
dimindex := curidx / arr.product[sidx]
|
||||
|
||||
return arr.set(curDim-1, nidx, &cur.data.([]*Node)[dimindex], cur)
|
||||
}
|
||||
|
||||
func (arr *ArrayN) Cap() int {
|
||||
return arr.cap
|
||||
}
|
||||
|
||||
func (arr *ArrayN) Grow(size int) {
|
||||
arr.dims[0] += size
|
||||
|
||||
pvalue := 1
|
||||
for n := 1; n < len(arr.dims); n++ {
|
||||
pvalue *= arr.dims[n]
|
||||
}
|
||||
arr.product[0] = pvalue
|
||||
|
||||
tempdata := arr.data.data.([]*Node)
|
||||
|
||||
newData := make([]*Node, arr.dims[0], arr.dims[0])
|
||||
copy(newData, tempdata)
|
||||
arr.data.data = newData
|
||||
|
||||
arr.cap = 1
|
||||
for _, d := range arr.dims {
|
||||
arr.cap *= d
|
||||
}
|
||||
}
|
||||
|
||||
func (arr *ArrayN) Set(idx int, value interface{}) {
|
||||
n, nidx := arr.set(arr.dimN, idx, &arr.data, nil)
|
||||
n.data.([]interface{})[nidx] = value
|
||||
}
|
||||
|
||||
func (arr *ArrayN) get(curDim int, curidx int, pdata **Node) (*Node, int) {
|
||||
sidx := arr.dimN - curDim
|
||||
|
||||
if *pdata == nil {
|
||||
return nil, 0
|
||||
}
|
||||
|
||||
cur := *pdata
|
||||
if curDim == 1 {
|
||||
return cur, curidx
|
||||
}
|
||||
|
||||
nidx := curidx % arr.product[sidx]
|
||||
dimindex := curidx / arr.product[sidx]
|
||||
return arr.get(curDim-1, nidx, &cur.data.([]*Node)[dimindex])
|
||||
}
|
||||
|
||||
func (arr *ArrayN) Get(idx int) (interface{}, bool) {
|
||||
n, nidx := arr.get(arr.dimN, idx, &arr.data)
|
||||
if n != nil {
|
||||
v := n.data.([]interface{})[nidx]
|
||||
return v, v != nil
|
||||
}
|
||||
return nil, false
|
||||
}
|
||||
|
||||
func (arr *ArrayN) del(curDim int, curidx int, pdata **Node) (interface{}, bool) {
|
||||
|
||||
cur := *pdata
|
||||
if cur == nil {
|
||||
return nil, false
|
||||
}
|
||||
|
||||
if curDim == 1 {
|
||||
values := cur.data.([]interface{})
|
||||
|
||||
v := values[curidx]
|
||||
if v != nil {
|
||||
cur.size--
|
||||
values[curidx] = nil
|
||||
if cur.size == 0 {
|
||||
return v, true
|
||||
}
|
||||
}
|
||||
return v, false
|
||||
}
|
||||
|
||||
sidx := arr.dimN - curDim
|
||||
|
||||
nidx := curidx % arr.product[sidx]
|
||||
dimindex := curidx / arr.product[sidx]
|
||||
curdata := cur.data.([]*Node)
|
||||
|
||||
v, ok := arr.del(curDim-1, nidx, &curdata[dimindex])
|
||||
if ok {
|
||||
cur.size--
|
||||
curdata[dimindex] = nil
|
||||
if cur.size == 0 {
|
||||
return v, true
|
||||
}
|
||||
}
|
||||
|
||||
return v, false
|
||||
}
|
||||
|
||||
func (arr *ArrayN) Del(idx int) (interface{}, bool) {
|
||||
v, _ := arr.del(arr.dimN, idx, &arr.data)
|
||||
if v != nil {
|
||||
return v, true
|
||||
}
|
||||
return nil, false
|
||||
}
|
||||
224
sparse_array/arrayn/arrayn_test.go
Normal file
224
sparse_array/arrayn/arrayn_test.go
Normal file
@@ -0,0 +1,224 @@
|
||||
package arrayn
|
||||
|
||||
import (
|
||||
"testing"
|
||||
|
||||
"github.com/Pallinder/go-randomdata"
|
||||
"github.com/davecgh/go-spew/spew"
|
||||
)
|
||||
|
||||
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.Values())
|
||||
if result != "[0 1 <nil> <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.Values())
|
||||
if result != "[0 <nil> <nil> <nil> <nil> 5 6 <nil> <nil> <nil> <nil> 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 TestSet(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 TestDel(t *testing.T) {
|
||||
arr := NewWithCap(2, 2, 2, 3)
|
||||
for i := 0; i < 12; i++ {
|
||||
arr.Set(i, i)
|
||||
}
|
||||
|
||||
arr.Set(23, 23)
|
||||
|
||||
for i := 0; i < 12; i++ {
|
||||
arr.Del(i)
|
||||
}
|
||||
|
||||
arr.Del(23)
|
||||
var result string
|
||||
|
||||
result = spew.Sprint(arr.Values())
|
||||
if result != "[<nil> <nil> <nil> <nil> <nil> <nil> <nil> <nil> <nil> <nil> <nil> <nil> <nil> <nil> <nil> <nil> <nil> <nil> <nil> <nil> <nil> <nil> <nil> <nil>]" {
|
||||
t.Error("result should be all is nil")
|
||||
}
|
||||
}
|
||||
|
||||
func TestArray2Grow(t *testing.T) {
|
||||
arr := NewWithCap(4, 4)
|
||||
l := []int{0, 6, 5, 15}
|
||||
for _, v := range l {
|
||||
arr.Set(v, v)
|
||||
}
|
||||
|
||||
arr.Grow(1)
|
||||
|
||||
if v, ok := arr.Get(15); ok {
|
||||
if v != 15 {
|
||||
t.Error(v)
|
||||
}
|
||||
} else {
|
||||
t.Error(v)
|
||||
}
|
||||
|
||||
arr.Set(19, 19)
|
||||
if v, ok := arr.Get(19); ok {
|
||||
if v != 19 {
|
||||
t.Error(v)
|
||||
}
|
||||
} else {
|
||||
t.Error(v)
|
||||
}
|
||||
|
||||
arr.Grow(-1)
|
||||
var result string
|
||||
result = spew.Sprint(arr.Values())
|
||||
if result != "[0 <nil> <nil> <nil> <nil> 5 6 <nil> <nil> <nil> <nil> <nil> <nil> <nil> <nil> 15]" {
|
||||
t.Error(result)
|
||||
}
|
||||
}
|
||||
|
||||
func BenchmarkGoMap(b *testing.B) {
|
||||
m := make(map[int]bool)
|
||||
b.N = 50000000
|
||||
b.StopTimer()
|
||||
var l []int
|
||||
for i := 0; i < b.N/10; i++ {
|
||||
l = append(l, randomdata.Number(0, 100000000))
|
||||
}
|
||||
b.StartTimer()
|
||||
for c := 0; c < 10; c++ {
|
||||
for i := 0; i < b.N/10; i++ {
|
||||
m[l[i]] = true
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
func BenchmarkArrayNSet(b *testing.B) {
|
||||
|
||||
arr := NewWithCap(1000, 10, 10, 100)
|
||||
b.N = 10000000
|
||||
|
||||
b.StopTimer()
|
||||
var l []int
|
||||
for i := 0; i < b.N/10; i++ {
|
||||
l = append(l, randomdata.Number(0, 10000000))
|
||||
}
|
||||
b.StartTimer()
|
||||
for c := 0; c < 10; c++ {
|
||||
for i := 0; i < b.N/10; i++ {
|
||||
arr.Set(l[i], i)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
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)
|
||||
}
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user