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

167
lastack/lastack.go Normal file
View File

@@ -0,0 +1,167 @@
package lastack
import (
"github.com/davecgh/go-spew/spew"
)
type Node struct {
elements []interface{}
cur int
down *Node
}
type Stack struct {
top *Node
cache *Node
size int
}
func (as *Stack) grow() bool {
if as.top.cur+1 == cap(as.top.elements) {
var grownode *Node
if as.cache != nil {
grownode = as.cache
grownode.cur = -1
as.cache = nil
} else {
var growsize int
if as.size <= 256 {
growsize = as.size << 1
} else {
growsize = 256 + as.size>>2
}
grownode = &Node{elements: make([]interface{}, growsize, growsize), cur: -1}
}
grownode.down = as.top
as.top = grownode
return true
}
return false
}
func (as *Stack) cacheRemove() bool {
if as.top.cur == 0 && as.top.down != nil {
as.cache = as.top
as.top = as.top.down
as.cache.down = nil
return true
}
return false
}
func New() *Stack {
s := &Stack{}
s.size = 0
s.top = &Node{elements: make([]interface{}, 8, 8), cur: -1}
return s
}
func NewWithCap(cap int) *Stack {
s := &Stack{}
s.size = 0
s.top = &Node{elements: make([]interface{}, cap, cap), cur: -1}
return s
}
func (as *Stack) Clear() {
as.size = 0
as.top.down = nil
as.top.cur = -1
}
func (as *Stack) Empty() bool {
return as.size == 0
}
func (as *Stack) Size() int {
return as.size
}
func (as *Stack) String() string {
content := ""
cur := as.top
for ; cur != nil; cur = cur.down {
for i, _ := range cur.elements {
if cur.cur >= i {
content += spew.Sprint(cur.elements[cur.cur-i]) + " "
}
}
}
if len(content) > 0 {
content = content[0 : len(content)-1]
} else {
content = ""
}
return content
}
func (as *Stack) Values() []interface{} {
result := make([]interface{}, as.size, as.size)
cur := as.top
n := 0
for ; cur != nil; cur = cur.down {
for i, _ := range cur.elements {
if cur.cur >= i {
result[n] = cur.elements[cur.cur-i]
n++
}
}
}
return result
}
func (as *Stack) Get(idx int) (interface{}, bool) {
if idx < 0 {
return nil, false
}
cur := as.top
for cur != nil && idx-cur.cur > 0 {
idx = idx - cur.cur - 1
cur = cur.down
}
if cur == nil {
return nil, false
}
return cur.elements[cur.cur-idx], true
}
func (as *Stack) Push(v interface{}) {
as.grow()
as.top.cur++
as.top.elements[as.top.cur] = v
as.size++
}
func (as *Stack) Pop() (interface{}, bool) {
if as.size <= 0 {
return nil, false
}
as.size--
if as.cacheRemove() {
return as.cache.elements[as.cache.cur], true
}
epop := as.top.elements[as.top.cur]
as.top.cur--
return epop, true
}
func (as *Stack) Peek() (interface{}, bool) {
if as.size <= 0 {
return nil, false
}
return as.top.elements[as.top.cur], true
}

173
lastack/lastack_test.go Normal file
View File

@@ -0,0 +1,173 @@
package lastack
import (
"testing"
"github.com/davecgh/go-spew/spew"
"github.com/emirpasic/gods/stacks/arraystack"
"github.com/Pallinder/go-randomdata"
)
func TestPush(t *testing.T) {
var result string
s := New()
result = spew.Sprint(s.Values())
if result != "[]" {
t.Error(result)
}
l := []int{10, 7, 3, 4, 5, 15}
for _, v := range l {
s.Push(v)
}
result = spew.Sprint(s.Values())
if result != "[15 5 4 3 7 10]" {
t.Error(result)
}
if v, ok := s.Peek(); ok {
if v != 15 {
t.Error(v)
}
}
result = spew.Sprint(s.Values())
if result != "[15 5 4 3 7 10]" {
t.Error(result)
}
if v, ok := s.Pop(); ok {
if v != 15 {
t.Error(v)
}
}
result = spew.Sprint(s.Values())
if result != "[5 4 3 7 10]" {
t.Error(result)
}
for s.Size() != 1 {
s.Pop()
}
result = spew.Sprint(s.Values())
if result != "[10]" {
t.Error(result)
}
if v, ok := s.Pop(); ok {
if v != 10 {
t.Error(v)
}
}
result = spew.Sprint(s.Values())
if result != "[]" {
t.Error(result)
}
}
func BenchmarkGet(b *testing.B) {
s := New()
b.N = 20000000
for i := 0; i < b.N; i++ {
v := randomdata.Number(0, 65535)
s.Push(v)
}
b.ResetTimer()
b.StartTimer()
for i := 0; i < b.N; i++ {
s.Get(i)
}
}
func BenchmarkPush(b *testing.B) {
s := New()
b.N = 20000000
for i := 0; i < b.N; i++ {
v := randomdata.Number(0, 65535)
s.Push(v)
}
}
func BenchmarkGodsPush(b *testing.B) {
s := arraystack.New()
b.N = 2000000
for i := 0; i < b.N; i++ {
v := randomdata.Number(0, 65535)
s.Push(v)
}
}
func BenchmarkPop(b *testing.B) {
s := New()
b.N = 2000000
for i := 0; i < b.N; i++ {
v := randomdata.Number(0, 65535)
s.Push(v)
}
b.ResetTimer()
b.StartTimer()
for i := 0; i < b.N; i++ {
s.Pop()
}
}
func BenchmarkGodsPop(b *testing.B) {
s := arraystack.New()
b.N = 2000000
for i := 0; i < b.N; i++ {
v := randomdata.Number(0, 65535)
s.Push(v)
}
b.ResetTimer()
b.StartTimer()
for i := 0; i < b.N; i++ {
s.Pop()
}
}
func BenchmarkValues(b *testing.B) {
s := New()
for i := 0; i < b.N; i++ {
v := randomdata.Number(0, 65535)
s.Push(v)
}
b.ResetTimer()
b.StartTimer()
for i := 0; i < b.N; i++ {
s.Values()
}
}
func BenchmarkGodsValues(b *testing.B) {
s := arraystack.New()
for i := 0; i < b.N; i++ {
v := randomdata.Number(0, 65535)
s.Push(v)
}
b.ResetTimer()
b.StartTimer()
for i := 0; i < b.N; i++ {
s.Values()
}
}