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

stack/stack.go

@@ -0,0 +1,90 @@
+package lastack
+
+import (
+	"github.com/davecgh/go-spew/spew"
+)
+
+type Node struct {
+	value interface{}
+	down  *Node
+}
+
+type Stack struct {
+	top  *Node
+	size int
+}
+
+func New() *Stack {
+	s := &Stack{}
+	s.size = 0
+	return s
+}
+
+func (as *Stack) Clear() {
+	as.size = 0
+	as.top = nil
+}
+
+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 {
+		content += spew.Sprint(cur.value) + " "
+	}
+
+	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 {
+		result[n] = cur.value
+		n++
+	}
+
+	return result
+}
+
+func (as *Stack) Push(v interface{}) {
+	nv := &Node{value: v}
+	nv.down = as.top
+	as.top = nv
+	as.size++
+}
+
+func (as *Stack) Pop() (interface{}, bool) {
+	if as.size <= 0 {
+		return nil, false
+	}
+
+	as.size--
+
+	result := as.top
+	as.top = as.top.down
+	result.down = nil
+	return result.value, true
+}
+
+func (as *Stack) Peek() (interface{}, bool) {
+	if as.size <= 0 {
+		return nil, false
+	}
+	return as.top.value, true
+}

stack/stack_test.go

@@ -0,0 +1,91 @@
+package lastack
+
+import (
+	"testing"
+
+	"github.com/emirpasic/gods/stacks/arraystack"
+
+	"github.com/Pallinder/go-randomdata"
+)
+
+func BenchmarkPush(b *testing.B) {
+	s := New()
+	b.N = 200000
+	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 = 200000
+	for i := 0; i < b.N; i++ {
+		v := randomdata.Number(0, 65535)
+		s.Push(v)
+	}
+}
+
+func BenchmarkPop(b *testing.B) {
+	s := New()
+	b.N = 200000
+
+	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 = 200000
+
+	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()
+	}
+}