eson/focus
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

new file: .gitignore

Browse Source 
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:
eson
2019-05-08 10:42:51 +08:00
commit 368447c31d
57 changed files with 18364 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

154
heap/heap.go Normal file
View File

@@ -0,0 +1,154 @@
package heap
import (
"474420502.top/eson/structure/compare"
)
type Heap struct {
size int
elements []interface{}
Compare compare.Compare
}
func New(Compare compare.Compare) *Heap {
h := &Heap{Compare: Compare}
h.elements = make([]interface{}, 16, 16)
return h
}
func (h *Heap) Size() int {
return h.size
}
func (h *Heap) Values() []interface{} {
return h.elements[0:h.size]
}
func (h *Heap) grow() {
ecap := len(h.elements)
if h.size >= ecap {
ecap = ecap << 1
grow := make([]interface{}, ecap, ecap)
copy(grow, h.elements)
h.elements = grow
}
}
func (h *Heap) Empty() bool {
return h.size < 1
}
func (h *Heap) Clear() {
h.size = 0
}
func (h *Heap) Reborn() {
h.size = 0
h.elements = make([]interface{}, 16, 16)
}
func (h *Heap) Top() (interface{}, bool) {
if h.size != 0 {
return h.elements[0], true
}
return nil, false
}
func (h *Heap) Push(v interface{}) {
if v == nil {
return
}
h.grow()
curidx := h.size
h.size++
// up
for curidx != 0 {
pidx := (curidx - 1) >> 1
pvalue := h.elements[pidx]
if h.Compare(v, pvalue) > 0 {
h.elements[curidx] = pvalue
curidx = pidx
} else {
break
}
}
h.elements[curidx] = v
}
func (h *Heap) slimming() {
elen := len(h.elements)
if elen >= 32 {
ecap := elen >> 1
if h.size <= ecap {
ecap = elen - (ecap >> 1)
slimming := make([]interface{}, ecap, ecap)
copy(slimming, h.elements)
h.elements = slimming
}
}
}
func (h *Heap) Pop() (interface{}, bool) {
if h.size == 0 {
return nil, false
}
curidx := 0
top := h.elements[curidx]
h.size--
h.slimming()
if h.size == 0 {
return top, true
}
downvalue := h.elements[h.size]
var cidx, c1, c2 int
var cvalue1, cvalue2, cvalue interface{}
// down
for {
cidx = curidx << 1
c2 = cidx + 2
if c2 < h.size {
cvalue2 = h.elements[c2]
c1 = cidx + 1
cvalue1 = h.elements[c1]
if h.Compare(cvalue1, cvalue2) >= 0 {
cidx = c1
cvalue = cvalue1
} else {
cidx = c2
cvalue = cvalue2
}
} else {
c1 = cidx + 1
if c1 < h.size {
cvalue1 = h.elements[c1]
cidx = c1
cvalue = cvalue1
} else {
break
}
}
if h.Compare(cvalue, downvalue) > 0 {
h.elements[curidx] = cvalue
curidx = cidx
} else {
break
}
}
h.elements[curidx] = downvalue
return top, true
}

182
heap/heap_test.go Normal file
View File

@@ -0,0 +1,182 @@
package heap
import (
"bytes"
"encoding/gob"
"io/ioutil"
"log"
"testing"
"github.com/Pallinder/go-randomdata"
"github.com/davecgh/go-spew/spew"
"github.com/emirpasic/gods/trees/binaryheap"
)
func Int(k1, k2 interface{}) int {
c1 := k1.(int)
c2 := k2.(int)
switch {
case c1 > c2:
return -1
case c1 < c2:
return 1
default:
return 0
}
}
func TestPush(t *testing.T) {
for i := 0; i < 1000000; i++ {
h := New(Int)
gods := binaryheap.NewWithIntComparator()
for c := 0; c < 20; c++ {
v := randomdata.Number(0, 100)
h.Push(v)
gods.Push(v)
}
r1 := spew.Sprint(h.Values())
r2 := spew.Sprint(gods.Values())
if r1 != r2 {
t.Error(r1)
t.Error(r2)
break
}
}
}
func TestPop(t *testing.T) {
for i := 0; i < 200000; i++ {
h := New(Int)
// m := make(map[int]int)
gods := binaryheap.NewWithIntComparator()
for c := 0; c < 40; c++ {
v := randomdata.Number(0, 100)
// if _, ok := m[v]; !ok {
h.Push(v)
gods.Push(v)
// m[v] = v
// }
}
// t.Error(h.Values())
// t.Error(gods.Values())
for c := 0; c < randomdata.Number(5, 10); c++ {
v1, _ := h.Pop()
v2, _ := gods.Pop()
if v1 != v2 {
t.Error(h.Values(), v1)
t.Error(gods.Values(), v2)
return
}
}
r1 := spew.Sprint(h.Values())
r2 := spew.Sprint(gods.Values())
if r1 != r2 {
t.Error(r1)
t.Error(r2)
break
}
}
}
func BenchmarkPush(b *testing.B) {
l := loadTestData()
b.ResetTimer()
execCount := 50
b.N = len(l) * execCount
for c := 0; c < execCount; c++ {
b.StopTimer()
h := New(Int)
b.StartTimer()
for _, v := range l {
h.Push(v)
}
}
}
func BenchmarkPop(b *testing.B) {
h := New(Int)
l := loadTestData()
b.ResetTimer()
execCount := 20
b.N = len(l) * execCount
for c := 0; c < execCount; c++ {
b.StopTimer()
for _, v := range l {
h.Push(v)
}
b.StartTimer()
for h.size != 0 {
h.Pop()
}
}
}
func BenchmarkGodsPop(b *testing.B) {
h := binaryheap.NewWithIntComparator()
l := loadTestData()
b.ResetTimer()
execCount := 20
b.N = len(l) * execCount
for c := 0; c < execCount; c++ {
b.StopTimer()
for _, v := range l {
h.Push(v)
}
b.StartTimer()
for h.Size() != 0 {
h.Pop()
}
}
}
func BenchmarkGodsPush(b *testing.B) {
l := loadTestData()
b.ResetTimer()
execCount := 50
b.N = len(l) * execCount
for c := 0; c < execCount; c++ {
b.StopTimer()
h := binaryheap.NewWith(Int)
b.StartTimer()
for _, v := range l {
h.Push(v)
}
}
}
func loadTestData() []int {
data, err := ioutil.ReadFile("../l.log")
if err != nil {
log.Println(err)
}
var l []int
decoder := gob.NewDecoder(bytes.NewReader(data))
decoder.Decode(&l)
return l
}