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

完成大部分的copy

Browse Source
This commit is contained in:
eson
2019-03-24 22:21:25 +08:00
parent ba7263c3f9
commit 51acc649a4
12 changed files with 2173 additions and 1271 deletions
Download Patch File Download Diff File Expand all files Collapse all files

616
avlkeydup/avlkeydup.go
View File

@@ -1,9 +1,8 @@
package avlkeydup
import (
"474420502.top/eson/structure/compare"
"github.com/davecgh/go-spew/spew"
"github.com/emirpasic/gods/utils"
)
type Node struct {
@@ -13,13 +12,6 @@ type Node struct {
key, value interface{}
}
// func (n *Node) String() string {
// if n == nil {
// return "nil"
// }
// return spew.Sprint(n.value)
// }
func (n *Node) String() string {
if n == nil {
return "nil"
@@ -33,40 +25,40 @@ func (n *Node) String() string {
}
type Tree struct {
root *Node
size int
comparator utils.Comparator
root *Node
size int
compare compare.Compare
}
func New(comparator utils.Comparator) *Tree {
return &Tree{comparator: comparator}
func New(compare compare.Compare) *Tree {
return &Tree{compare: compare}
}
func (avl *Tree) String() string {
if avl.size == 0 {
func (tree *Tree) String() string {
if tree.size == 0 {
return ""
}
str := "AVLTree\n"
output(avl.root, "", true, &str)
output(tree.root, "", true, &str)
return str
}
func (avl *Tree) Iterator() *Iterator {
return initIterator(avl)
func (tree *Tree) Iterator() *Iterator {
return initIterator(tree)
}
func (avl *Tree) Size() int {
return avl.size
func (tree *Tree) Size() int {
return tree.size
}
func (avl *Tree) Remove(key interface{}) *Node {
func (tree *Tree) Remove(key interface{}) *Node {
if n, ok := avl.GetNode(key); ok {
if n, ok := tree.GetNode(key); ok {
avl.size--
if avl.size == 0 {
avl.root = nil
tree.size--
if tree.size == 0 {
tree.root = nil
return n
}
@@ -76,7 +68,7 @@ func (avl *Tree) Remove(key interface{}) *Node {
if left == -1 && right == -1 {
p := n.parent
p.children[getRelationship(n)] = nil
avl.fixRemoveHeight(p)
tree.fixRemoveHeight(p)
return n
}
@@ -113,9 +105,9 @@ func (avl *Tree) Remove(key interface{}) *Node {
// 考虑到刚好替换的节点是 被替换节点的孩子节点的时候, 从自身修复高度
if cparent == n {
avl.fixRemoveHeight(n)
tree.fixRemoveHeight(n)
} else {
avl.fixRemoveHeight(cparent)
tree.fixRemoveHeight(cparent)
}
return cur
@@ -124,16 +116,94 @@ func (avl *Tree) Remove(key interface{}) *Node {
return nil
}
func (avl *Tree) Get(key interface{}) (interface{}, bool) {
n, ok := avl.GetNode(key)
// Values 返回先序遍历的值
func (tree *Tree) Values() []interface{} {
mszie := 0
if tree.root != nil {
mszie = tree.size
}
result := make([]interface{}, 0, mszie)
tree.Traversal(func(v interface{}) bool {
result = append(result, v)
return true
}, LDR)
return result
}
func (tree *Tree) GetRange(k1, k2 interface{}) (result []interface{}) {
c := tree.compare(k2, k1)
switch c {
case 1:
var min, max *Node
resultmin := tree.getArountNode(k1)
resultmax := tree.getArountNode(k2)
for i := 1; i < 3 && min == nil; i++ {
min = resultmin[i]
}
for i := 1; i > -1 && max == nil; i-- {
max = resultmax[i]
}
if max == nil {
return []interface{}{}
}
result = make([]interface{}, 0, 16)
iter := NewIterator(min)
for iter.Next() {
result = append(result, iter.Value())
if iter.cur == max {
break
}
}
case -1:
var min, max *Node
resultmin := tree.getArountNode(k2)
resultmax := tree.getArountNode(k1)
for i := 1; i < 3 && min == nil; i++ {
min = resultmin[i]
}
for i := 1; i > -1 && max == nil; i-- {
max = resultmax[i]
}
if min == nil {
return []interface{}{}
}
result = make([]interface{}, 0, 16)
iter := NewIterator(max)
for iter.Prev() {
result = append(result, iter.Value())
if iter.cur == min {
break
}
}
case 0:
if n, ok := tree.GetNode(k1); ok {
return []interface{}{n.value}
}
return []interface{}{}
}
return
}
func (tree *Tree) Get(key interface{}) (interface{}, bool) {
n, ok := tree.GetNode(key)
if ok {
return n.value, true
}
return n, false
}
func (avl *Tree) GetAround(key interface{}) (result [3]interface{}) {
an := avl.GetAroundNode(key)
func (tree *Tree) GetAround(key interface{}) (result [3]interface{}) {
an := tree.getArountNode(key)
for i, n := range an {
if n != nil {
result[i] = n.value
@@ -142,170 +212,277 @@ func (avl *Tree) GetAround(key interface{}) (result [3]interface{}) {
return
}
func (avl *Tree) GetAroundNode(key interface{}) (result [3]*Node) {
n := avl.root
func (tree *Tree) getArountNode(key interface{}) (result [3]*Node) {
var last *Node
var lastc int
for {
for n := tree.root; n != nil; {
last = n
c := tree.compare(key, n.value)
switch c {
case -1:
n = n.children[0]
lastc = c
case 1:
n = n.children[1]
lastc = c
case 0:
iter := NewIterator(n)
iter.Prev()
for iter.Prev() {
if tree.compare(iter.cur.value, n.value) == 0 {
n = iter.cur
} else {
break
}
}
result[1] = n
n = nil
default:
panic("Get compare only is allowed in -1, 0, 1")
}
}
if n == nil {
switch lastc {
case 1:
if result[1] != nil {
result[0] = GetPrev(result[1], 1)
result[2] = GetNext(result[1], 1)
} else {
result[0] = last
result[2] = GetNext(last, 1)
}
case -1:
if result[1] != nil {
result[0] = GetPrev(result[1], 1)
result[2] = GetNext(result[1], 1)
} else {
result[2] = last
result[0] = GetPrev(last, 1)
}
case 0:
if result[1] == nil {
return
}
lastc := 0
switch c := avl.comparator(key, n.key); c {
case -1:
if c != -lastc {
result[0] = n
}
lastc = c
n = n.children[0]
case 1:
if c != -lastc {
result[2] = n
}
lastc = c
n = n.children[1]
case 0:
switch lastc {
case -1:
if n.children[1] != nil {
result[0] = n.children[1]
}
case 1:
if n.children[0] != nil {
result[2] = n.children[0]
}
case 0:
if n.children[1] != nil {
result[0] = n.children[1]
}
if n.children[0] != nil {
result[2] = n.children[0]
}
result[1] = n
return
}
default:
panic("Get comparator only is allowed in -1, 0, 1")
}
result[0] = GetPrev(result[1], 1)
result[2] = GetNext(result[1], 1)
}
return
}
func (avl *Tree) GetNode(key interface{}) (*Node, bool) {
for n := avl.root; n != nil; {
switch c := avl.comparator(key, n.key); c {
func (tree *Tree) GetNode(key interface{}) (*Node, bool) {
for n := tree.root; n != nil; {
switch c := tree.compare(key, n.key); c {
case -1:
n = n.children[0]
case 1:
n = n.children[1]
case 0:
iter := NewIterator(n)
iter.Prev()
for iter.Prev() {
if tree.compare(iter.cur.key, n.key) == 0 {
n = iter.cur
} else {
break
}
}
return n, true
default:
panic("Get comparator only is allowed in -1, 0, 1")
panic("Get compare only is allowed in -1, 0, 1")
}
}
return nil, false
}
func (avl *Tree) Put(key, value interface{}) {
if avl.size == 0 {
avl.root = &Node{key: key, value: value}
avl.size++
func (tree *Tree) Put(key, value interface{}) {
tree.size++
node := &Node{key: key, value: value}
if tree.size == 1 {
tree.root = node
return
}
cur := avl.root
cur := tree.root
parent := cur.parent
child := -1
for {
if cur == nil {
avl.size++
node := &Node{key: key, value: value}
parent.children[child] = node
node.parent = parent
if node.parent.height == 0 {
avl.fixPutHeight(node.parent)
tree.fixPutHeight(node.parent)
}
return
}
parent = cur
c := avl.comparator(key, cur.key)
c := tree.compare(key, cur.key)
if c == 0 {
cur.key = key
cur.value = value
return
}
child = (c + 2) / 2
cur = cur.children[child]
}
}
func (avl *Tree) debugString() string {
if avl.size == 0 {
return ""
type TraversalMethod int
const (
// L = left R = right D = Value(dest)
_ TraversalMethod = iota
//DLR 先值 然后左递归 右递归 下面同理
DLR
//LDR 先从左边有序访问到右边 从小到大
LDR
// LRD 同理
LRD
// DRL 同理
DRL
// RDL 先从右边有序访问到左边 从大到小
RDL
// RLD 同理
RLD
)
// Traversal 遍历的方法 默认是LDR 从小到大 compare 为 l < r
func (tree *Tree) Traversal(every func(v interface{}) bool, traversalMethod ...interface{}) {
if tree.root == nil {
return
}
str := "AVLTree\n"
outputfordebug(avl.root, "", true, &str)
return str
}
func (avl *Tree) TraversalBreadth() (result []interface{}) {
result = make([]interface{}, 0, avl.size)
var traverasl func(cur *Node)
traverasl = func(cur *Node) {
if cur == nil {
return
}
result = append(result, cur.value)
traverasl(cur.children[0])
traverasl(cur.children[1])
method := LDR
if len(traversalMethod) != 0 {
method = traversalMethod[0].(TraversalMethod)
}
traverasl(avl.root)
return
}
func (avl *Tree) TraversalDepth(leftright int) (result []interface{}) {
result = make([]interface{}, 0, avl.size)
if leftright < 0 {
var traverasl func(cur *Node)
traverasl = func(cur *Node) {
switch method {
case DLR:
var traverasl func(cur *Node) bool
traverasl = func(cur *Node) bool {
if cur == nil {
return
return true
}
traverasl(cur.children[0])
result = append(result, cur.value)
traverasl(cur.children[1])
if !every(cur.value) {
return false
}
if !traverasl(cur.children[0]) {
return false
}
if !traverasl(cur.children[1]) {
return false
}
return true
}
traverasl(avl.root)
} else {
var traverasl func(cur *Node)
traverasl = func(cur *Node) {
traverasl(tree.root)
case LDR:
var traverasl func(cur *Node) bool
traverasl = func(cur *Node) bool {
if cur == nil {
return
return true
}
traverasl(cur.children[1])
result = append(result, cur.value)
traverasl(cur.children[0])
if !traverasl(cur.children[0]) {
return false
}
if !every(cur.value) {
return false
}
if !traverasl(cur.children[1]) {
return false
}
return true
}
traverasl(avl.root)
traverasl(tree.root)
case LRD:
var traverasl func(cur *Node) bool
traverasl = func(cur *Node) bool {
if cur == nil {
return true
}
if !traverasl(cur.children[0]) {
return false
}
if !traverasl(cur.children[1]) {
return false
}
if !every(cur.value) {
return false
}
return true
}
traverasl(tree.root)
case DRL:
var traverasl func(cur *Node) bool
traverasl = func(cur *Node) bool {
if cur == nil {
return true
}
if !every(cur.value) {
return false
}
if !traverasl(cur.children[0]) {
return false
}
if !traverasl(cur.children[1]) {
return false
}
return true
}
traverasl(tree.root)
case RDL:
var traverasl func(cur *Node) bool
traverasl = func(cur *Node) bool {
if cur == nil {
return true
}
if !traverasl(cur.children[1]) {
return false
}
if !every(cur.value) {
return false
}
if !traverasl(cur.children[0]) {
return false
}
return true
}
traverasl(tree.root)
case RLD:
var traverasl func(cur *Node) bool
traverasl = func(cur *Node) bool {
if cur == nil {
return true
}
if !traverasl(cur.children[1]) {
return false
}
if !traverasl(cur.children[0]) {
return false
}
if !every(cur.value) {
return false
}
return true
}
traverasl(tree.root)
}
return
}
func (avl *Tree) lrrotate(cur *Node) {
func (tree *Tree) lrrotate(cur *Node) {
const l = 1
const r = 0
@@ -340,12 +517,16 @@ func (avl *Tree) lrrotate(cur *Node) {
cur.children[r] = mov
mov.parent = cur
// movparent.size = getChildrenSumSize(movparent) + 1
// mov.size = getChildrenSumSize(mov) + 1
// cur.size = getChildrenSumSize(cur) + 1
mov.height = getMaxChildrenHeight(mov) + 1
movparent.height = getMaxChildrenHeight(movparent) + 1
cur.height = getMaxChildrenHeight(cur) + 1
}
func (avl *Tree) rlrotate(cur *Node) {
func (tree *Tree) rlrotate(cur *Node) {
const l = 0
const r = 1
@@ -378,30 +559,31 @@ func (avl *Tree) rlrotate(cur *Node) {
cur.children[r] = mov
mov.parent = cur
// movparent.size = getChildrenSumSize(movparent) + 1
// mov.size = getChildrenSumSize(mov) + 1
// cur.size = getChildrenSumSize(cur) + 1
mov.height = getMaxChildrenHeight(mov) + 1
movparent.height = getMaxChildrenHeight(movparent) + 1
cur.height = getMaxChildrenHeight(cur) + 1
}
func (avl *Tree) rrotate(cur *Node) {
func (tree *Tree) rrotateex(cur *Node) {
const l = 0
const r = 1
// 1 right 0 left
mov := cur.children[l]
if mov == nil {
return
}
mov.key, mov.value, cur.key, cur.value = cur.key, cur.value, mov.key, mov.value //交换值达到, 相对位移
// if mov.children[l] != nil {
// mov.children[l].parent = cur
// cur.children[l] = mov.children[l]
// } else {
// cur.children[l] = nil
// }
// 不可能为nil
mov.children[l].parent = cur
// mov.children[l]不可能为nil
cur.children[l] = mov.children[l]
if mov.children[l] != nil {
mov.children[l].parent = cur
}
// 解决mov节点孩子转移的问题
if mov.children[r] != nil {
@@ -424,7 +606,83 @@ func (avl *Tree) rrotate(cur *Node) {
cur.height = getMaxChildrenHeight(cur) + 1
}
func (avl *Tree) lrotate(cur *Node) {
func (tree *Tree) rrotate(cur *Node) {
const l = 0
const r = 1
// 1 right 0 left
mov := cur.children[l]
mov.key, mov.value, cur.key, cur.value = cur.key, cur.value, mov.key, mov.value //交换值达到, 相对位移
// mov.children[l]不可能为nil
mov.children[l].parent = cur
cur.children[l] = mov.children[l]
// 解决mov节点孩子转移的问题
if mov.children[r] != nil {
mov.children[l] = mov.children[r]
} else {
mov.children[l] = nil
}
if cur.children[r] != nil {
mov.children[r] = cur.children[r]
mov.children[r].parent = mov
} else {
mov.children[r] = nil
}
// 连接转移后的节点 由于mov只是与cur交换值,parent不变
cur.children[r] = mov
// mov.size = getChildrenSumSize(mov) + 1
// cur.size = getChildrenSumSize(cur) + 1
mov.height = getMaxChildrenHeight(mov) + 1
cur.height = getMaxChildrenHeight(cur) + 1
}
func (tree *Tree) lrotateex(cur *Node) {
const l = 1
const r = 0
mov := cur.children[l]
if mov == nil {
return
}
mov.key, mov.value, cur.key, cur.value = cur.key, cur.value, mov.key, mov.value //交换值达到, 相对位移
// 不可能为nil
cur.children[l] = mov.children[l]
if mov.children[l] != nil {
mov.children[l].parent = cur
}
if mov.children[r] != nil {
mov.children[l] = mov.children[r]
} else {
mov.children[l] = nil
}
if cur.children[r] != nil {
mov.children[r] = cur.children[r]
mov.children[r].parent = mov
} else {
mov.children[r] = nil
}
cur.children[r] = mov
// mov.size = getChildrenSumSize(mov) + 1
// cur.size = getChildrenSumSize(cur) + 1
mov.height = getMaxChildrenHeight(mov) + 1
cur.height = getMaxChildrenHeight(cur) + 1
}
func (tree *Tree) lrotate(cur *Node) {
const l = 1
const r = 0
@@ -433,13 +691,6 @@ func (avl *Tree) lrotate(cur *Node) {
mov.key, mov.value, cur.key, cur.value = cur.key, cur.value, mov.key, mov.value //交换值达到, 相对位移
// if mov.children[l] != nil {
// mov.children[l].parent = cur
// cur.children[l] = mov.children[l]
// } else {
// cur.children[l] = nil
// }
// 不可能为nil
mov.children[l].parent = cur
cur.children[l] = mov.children[l]
@@ -459,6 +710,9 @@ func (avl *Tree) lrotate(cur *Node) {
cur.children[r] = mov
// mov.size = getChildrenSumSize(mov) + 1
// cur.size = getChildrenSumSize(cur) + 1
mov.height = getMaxChildrenHeight(mov) + 1
cur.height = getMaxChildrenHeight(cur) + 1
}
@@ -491,42 +745,35 @@ func getHeight(cur *Node) int {
return cur.height
}
func (avl *Tree) fixRemoveHeight(cur *Node) {
func (tree *Tree) fixRemoveHeight(cur *Node) {
for {
lefth, rigthh, lrmax := getMaxAndChildrenHeight(cur)
// 判断当前节点是否有变化, 如果没变化的时候, 不需要往上修复
isBreak := false
if cur.height == lrmax+1 {
isBreak = true
} else {
cur.height = lrmax + 1
}
curheight := lrmax + 1
cur.height = curheight
// 计算高度的差值 绝对值大于2的时候需要旋转
diff := lefth - rigthh
if diff < -1 {
r := cur.children[1] // 根据左旋转的右边节点的子节点 左右高度选择旋转的方式
if getHeight(r.children[0]) > getHeight(r.children[1]) {
avl.lrrotate(cur)
tree.lrrotate(cur)
} else {
avl.lrotate(cur)
tree.lrotate(cur)
}
} else if diff > 1 {
l := cur.children[0]
if getHeight(l.children[1]) > getHeight(l.children[0]) {
avl.rlrotate(cur)
tree.rlrotate(cur)
} else {
avl.rrotate(cur)
tree.rrotate(cur)
}
} else {
if isBreak {
if cur.height == curheight {
return
}
}
if cur.parent == nil {
@@ -538,7 +785,7 @@ func (avl *Tree) fixRemoveHeight(cur *Node) {
}
func (avl *Tree) fixPutHeight(cur *Node) {
func (tree *Tree) fixPutHeight(cur *Node) {
for {
@@ -550,16 +797,16 @@ func (avl *Tree) fixPutHeight(cur *Node) {
if diff < -1 {
r := cur.children[1] // 根据左旋转的右边节点的子节点 左右高度选择旋转的方式
if getHeight(r.children[0]) > getHeight(r.children[1]) {
avl.lrrotate(cur)
tree.lrrotate(cur)
} else {
avl.lrotate(cur)
tree.lrotate(cur)
}
} else if diff > 1 {
l := cur.children[0]
if getHeight(l.children[1]) > getHeight(l.children[0]) {
avl.rlrotate(cur)
tree.rlrotate(cur)
} else {
avl.rrotate(cur)
tree.rrotate(cur)
}
} else {
@@ -596,7 +843,7 @@ func output(node *Node, prefix string, isTail bool, str *string) {
*str += "┌── "
}
*str += spew.Sprint(node.value) + "\n"
*str += spew.Sprint(node.key) + "\n"
if node.children[0] != nil {
newPrefix := prefix
@@ -636,7 +883,7 @@ func outputfordebug(node *Node, prefix string, isTail bool, str *string) {
parentv = spew.Sprint(node.parent.value)
}
suffix += parentv + "|" + spew.Sprint(node.height) + ")"
*str += spew.Sprint(node.value) + suffix + "\n"
*str += spew.Sprint(node.key) + suffix + "\n"
if node.children[0] != nil {
newPrefix := prefix
@@ -648,3 +895,12 @@ func outputfordebug(node *Node, prefix string, isTail bool, str *string) {
outputfordebug(node.children[0], newPrefix, true, str)
}
}
func (tree *Tree) debugString() string {
if tree.size == 0 {
return ""
}
str := "AVLTree\n"
outputfordebug(tree.root, "", true, &str)
return str
}

329
avlkeydup/avlkeydup_test.go
View File

@@ -5,9 +5,9 @@ import (
"encoding/gob"
"io/ioutil"
"log"
"os"
"testing"
"474420502.top/eson/structure/compare"
"github.com/Pallinder/go-randomdata"
"github.com/davecgh/go-spew/spew"
"github.com/emirpasic/gods/trees/avltree"
@@ -16,36 +16,6 @@ import (
"github.com/emirpasic/gods/utils"
)
const CompartorSize = 500000
const NumberMax = 60000000
func TestSave(t *testing.T) {
f, err := os.OpenFile("../l.log", os.O_CREATE|os.O_TRUNC|os.O_WRONLY, 0666)
if err != nil {
log.Println(err)
}
//fmt.Println(userBytes)
var l []int
m := make(map[int]int)
for i := 0; len(l) < CompartorSize; i++ {
v := randomdata.Number(0, NumberMax)
if _, ok := m[v]; !ok {
m[v] = v
l = append(l, v)
}
}
var result bytes.Buffer
encoder := gob.NewEncoder(&result)
encoder.Encode(l)
lbytes := result.Bytes()
f.Write(lbytes)
}
func loadTestData() []int {
data, err := ioutil.ReadFile("../l.log")
if err != nil {
@@ -57,125 +27,145 @@ func loadTestData() []int {
return l
}
func TestDupKey(t *testing.T) {
tree1 := New(utils.IntComparator)
tree2 := avltree.NewWithIntComparator()
for i := 0; i < CompartorSize/100; i++ {
v := randomdata.Number(0, NumberMax)
tree1.Put(v, v)
tree2.Put(v, v)
func TestGetRange(t *testing.T) {
tree := New(compare.Int)
for _, v := range []int{5, 6, 8, 10, 13, 17, 1, 2, 40, 30} {
tree.Put(v, v)
}
tree1.Put(500, 500)
tree2.Put(500, 500)
// t.Error(tree.debugString())
// t.Error(tree.getArountNode(20))
// t.Error(tree.Values())
tree1.Put(500, 500)
tree2.Put(500, 500)
if tree1.Size() != tree2.Size() {
t.Error("tree size is not equal")
result := tree.GetRange(0, 20)
if spew.Sprint(result) != "[1 2 5 6 8 10 13 17]" {
t.Error(result)
}
if tree1.String() != tree2.String() {
t.Error(tree1.String())
}
}
func TestIterator(t *testing.T) {
avl := New(utils.IntComparator)
for _, v := range []int{1, 2, 7, 4, 5, 6, 7, 14, 15, 20, 30, 21, 3} {
// t.Error(v)
avl.Put(v, v)
}
// ` AVLTree
// │ ┌── 30
// │ │ └── 21
// │ ┌── 20
// │ │ └── 15
// └── 14
// │ ┌── 7
// │ ┌── 7
// │ │ └── 6
// └── 5
// │ ┌── 4
// │ │ └── 3
// └── 2
// └── 1`
iter := avl.Iterator() // root start point
l := []int{14, 15, 20, 21, 30}
for i := 0; iter.Prev(); i++ {
if iter.Value().(int) != l[i] {
t.Error("iter prev error", iter.Value(), l[i])
}
result = tree.GetRange(-5, -1)
if spew.Sprint(result) != "[]" {
t.Error(result)
}
iter.Prev()
if iter.Value().(int) != 30 {
t.Error("prev == false", iter.Value(), iter.Prev(), iter.Value())
result = tree.GetRange(7, 20)
if spew.Sprint(result) != "[8 10 13 17]" {
t.Error(result)
}
l = []int{21, 20, 15, 14, 7, 7, 6, 5, 4, 3, 2, 1}
for i := 0; iter.Next(); i++ { // cur is 30 next is 21
if iter.Value().(int) != l[i] {
t.Error(iter.Value())
}
result = tree.GetRange(30, 40)
if spew.Sprint(result) != "[30 40]" {
t.Error(result)
}
if iter.Next() != false {
t.Error("Next is error, cur is tail, val = 1 Next return false")
}
if iter.Value().(int) != 1 { // cur is 1
t.Error("next == false", iter.Value(), iter.Next(), iter.Value())
result = tree.GetRange(30, 60)
if spew.Sprint(result) != "[30 40]" {
t.Error(result)
}
if iter.Prev() != true && iter.Value().(int) != 2 {
t.Error("next to prev is error")
result = tree.GetRange(40, 40)
if spew.Sprint(result) != "[40]" {
t.Error(result)
}
result = tree.GetRange(50, 60)
if spew.Sprint(result) != "[]" {
t.Error(result)
}
result = tree.GetRange(50, 1)
if spew.Sprint(result) != "[40 30 17 13 10 8 6 5 2 1]" {
t.Error(result)
}
result = tree.GetRange(30, 20)
if spew.Sprint(result) != "[30]" {
t.Error(result)
}
}
func TestGetAround(t *testing.T) {
avl := New(utils.IntComparator)
for _, v := range []int{7, 14, 15, 20, 30, 21, 40, 40, 50, 3, 40, 40, 40} {
avl.Put(v, v)
tree := New(compare.Int)
for _, v := range []int{7, 14, 14, 14, 16, 17, 20, 30, 21, 40, 50, 3, 40, 40, 40, 15} {
tree.Put(v, v)
}
if spew.Sprint(avl.GetAround(30)) != "[40 30 21]" {
t.Error("avl.GetAround(40)) is error", spew.Sprint(avl.GetAround(30)))
var Result string
Result = spew.Sprint(tree.GetAround(14))
if Result != "[7 14 15]" {
t.Error(tree.Values())
t.Error("17 is root, tree.GetAround(14)) is error", Result)
t.Error(tree.debugString())
}
if spew.Sprint(avl.GetAround(40)) != "[40 40 30]" {
t.Error("avl.GetAround(40)) is error", spew.Sprint(avl.GetAround(50)))
Result = spew.Sprint(tree.GetAround(17))
if Result != "[16 17 20]" {
t.Error(tree.Values())
t.Error("tree.GetAround(17)) is error", Result)
t.Error(tree.debugString())
}
if spew.Sprint(avl.GetAround(50)) != "[<nil> 50 40]" {
t.Error("avl.GetAround(40)) is error", spew.Sprint(avl.GetAround(50)))
Result = spew.Sprint(tree.GetAround(3))
if Result != "[<nil> 3 7]" {
t.Error(tree.Values())
t.Error("tree.GetAround(3)) is error", Result)
t.Error(tree.debugString())
}
Result = spew.Sprint(tree.GetAround(40))
if Result != "[30 40 50]" {
t.Error(tree.Values())
t.Error("tree.GetAround(40)) is error", Result)
t.Error(tree.debugString())
}
Result = spew.Sprint(tree.GetAround(50))
if Result != "[40 50 <nil>]" {
t.Error(tree.Values())
t.Error("tree.GetAround(50)) is error", Result)
t.Error(tree.debugString())
}
Result = spew.Sprint(tree.GetAround(18))
if Result != "[17 <nil> 20]" {
t.Error(tree.Values())
t.Error("18 is not in list, tree.GetAround(18)) is error", Result)
t.Error(tree.debugString())
}
Result = spew.Sprint(tree.GetAround(5))
if Result != "[3 <nil> 7]" {
t.Error(tree.Values())
t.Error("5 is not in list, tree.GetAround(5)) is error", Result)
t.Error(tree.debugString())
}
Result = spew.Sprint(tree.GetAround(2))
if Result != "[<nil> <nil> 3]" {
t.Error(tree.Values())
t.Error("2 is not in list, tree.GetAround(2)) is error", Result)
t.Error(tree.debugString())
}
Result = spew.Sprint(tree.GetAround(100))
if Result != "[50 <nil> <nil>]" {
t.Error(tree.Values())
t.Error("50 is not in list, tree.GetAround(50)) is error", Result)
t.Error(tree.debugString())
}
}
// for test error case
func TestPutStable(t *testing.T) {
// avl := New(utils.IntComparator)
// gods := avltree.NewWithIntComparator()
// // 44908, 34985, 62991, 4201, 27210, 30707
// for _, v := range []int{2383, 7666, 3055, 39016, 57092, 27897, 36513, 1562, 22574, 23202} {
// t.Error(v)
// t.Error(avl.debugString())
// avl.Put(v, v)
// gods.Put(v, v)
// t.Error(avl.debugString())
// t.Error(gods.String())
// }
// t.Error(tree.debugString(), tree.TraversalBreadth(), "\n", "-----------")
}
func TestPutComparatorRandom(t *testing.T) {
for n := 0; n < 300000; n++ {
avl := New(utils.IntComparator)
tree := New(compare.Int)
godsavl := avltree.NewWithIntComparator()
content := ""
@@ -185,16 +175,14 @@ func TestPutComparatorRandom(t *testing.T) {
if _, ok := m[v]; !ok {
m[v] = v
content += spew.Sprint(v) + ","
// t.Error(v)
avl.Put(v, v)
// t.Error(avl.String())
tree.Put(v, v)
godsavl.Put(v, v)
}
}
if avl.String() != godsavl.String() {
if tree.String() != godsavl.String() {
t.Error(godsavl.String())
t.Error(avl.debugString())
t.Error(tree.debugString())
t.Error(content, n)
break
}
@@ -202,9 +190,9 @@ func TestPutComparatorRandom(t *testing.T) {
}
func TestGet(t *testing.T) {
avl := New(utils.IntComparator)
tree := New(compare.Int)
for _, v := range []int{2383, 7666, 3055, 39016, 57092, 27897, 36513, 1562, 22574, 23202} {
avl.Put(v, v)
tree.Put(v, v)
}
result := `
@@ -220,21 +208,21 @@ func TestGet(t *testing.T) {
└── 1562
`
s1 := avl.String()
s1 := tree.String()
s2 := "AVLTree" + result
if s1 != s2 {
t.Error(s1, s2)
}
for _, v := range []int{2383, 7666, 3055, 39016, 57092, 27897, 36513, 1562, 22574, 23202} {
v, ok := avl.Get(v)
v, ok := tree.Get(v)
if !ok {
t.Error("the val not found ", v)
}
}
if v, ok := avl.Get(10000); ok {
t.Error("the val(1000) is not in tree, but is found", v)
if v, ok := tree.Get(10000); ok {
t.Error("the val(10000) is not in tree, but is found", v)
}
}
@@ -243,7 +231,7 @@ func TestRemoveAll(t *testing.T) {
ALL:
for c := 0; c < 5000; c++ {
avl := New(utils.IntComparator)
tree := New(compare.Int)
gods := avltree.NewWithIntComparator()
var l []int
m := make(map[int]int)
@@ -253,31 +241,32 @@ ALL:
if _, ok := m[v]; !ok {
m[v] = v
l = append(l, v)
avl.Put(v, v)
tree.Put(v, v)
gods.Put(v, v)
}
}
for i := 0; i < 100; i++ {
avl.Remove(l[i])
tree.Remove(l[i])
gods.Remove(l[i])
s1 := spew.Sprint(avl.TraversalDepth(-1))
s1 := spew.Sprint(tree.Values())
s2 := spew.Sprint(gods.Values())
if s1 != s2 {
t.Error("avl remove error", "avlsize = ", avl.Size())
t.Error("avl remove error", "avlsize = ", tree.Size())
t.Error(s1)
t.Error(s2)
break ALL
}
}
}
}
func TestRemove(t *testing.T) {
ALL:
for N := 0; N < 500000; N++ {
avl := New(utils.IntComparator)
tree := New(compare.Int)
gods := avltree.NewWithIntComparator()
var l []int
@@ -288,25 +277,25 @@ ALL:
if _, ok := m[v]; !ok {
l = append(l, v)
m[v] = v
avl.Put(v, v)
tree.Put(v, v)
gods.Put(v, v)
}
}
src1 := avl.String()
src1 := tree.String()
src2 := gods.String()
for i := 0; i < 10; i++ {
avl.Remove(l[i])
tree.Remove(l[i])
gods.Remove(l[i])
if spew.Sprint(gods.Values()) != spew.Sprint(avl.TraversalDepth(-1)) && avl.size != 0 {
// if gods.String() != avl.String() && gods.Size() != 0 && avl.size != 0 {
if spew.Sprint(gods.Values()) != spew.Sprint(tree.Values()) && tree.size != 0 {
// if gods.String() != tree.String() && gods.Size() != 0 && tree.size != 0 {
t.Error(src1)
t.Error(src2)
t.Error(avl.debugString())
t.Error(tree.debugString())
t.Error(gods.String())
t.Error(l[i])
// t.Error(avl.TraversalDepth(-1))
// t.Error(tree.TraversalDepth(-1))
// t.Error(gods.Values())
break ALL
}
@@ -318,7 +307,6 @@ func BenchmarkIterator(b *testing.B) {
tree := New(utils.IntComparator)
l := loadTestData()
b.N = len(l)
for _, v := range l {
tree.Put(v, v)
@@ -326,35 +314,21 @@ func BenchmarkIterator(b *testing.B) {
b.ResetTimer()
b.StartTimer()
b.N = 0
iter := tree.Iterator()
for iter.Next() {
b.N++
}
for iter.Prev() {
b.N++
}
for iter.Next() {
}
}
func BenchmarkGodsIterator(b *testing.B) {
tree := avltree.NewWithIntComparator()
l := loadTestData()
b.N = len(l)
for _, v := range l {
tree.Put(v, v)
}
b.ResetTimer()
b.StartTimer()
iter := tree.Iterator()
for iter.Next() {
b.N++
}
for iter.Prev() {
b.N++
}
for iter.Next() {
}
}
func BenchmarkRemove(b *testing.B) {
@@ -362,15 +336,16 @@ func BenchmarkRemove(b *testing.B) {
l := loadTestData()
b.N = len(l)
for _, v := range l {
tree.Put(v, v)
}
ll := tree.Values()
b.N = len(ll)
b.ResetTimer()
b.StartTimer()
for i := 0; i < len(l); i++ {
for i := 0; i < len(ll); i++ {
tree.Remove(l[i])
}
}
@@ -385,10 +360,12 @@ func BenchmarkGodsRemove(b *testing.B) {
tree.Put(v, v)
}
ll := tree.Values()
b.N = len(ll)
b.ResetTimer()
b.StartTimer()
for i := 0; i < len(l); i++ {
for i := 0; i < len(ll); i++ {
tree.Remove(l[i])
}
}
@@ -403,17 +380,20 @@ func BenchmarkGodsRBRemove(b *testing.B) {
tree.Put(v, v)
}
ll := tree.Values()
b.N = len(ll)
b.ResetTimer()
b.StartTimer()
for i := 0; i < len(l); i++ {
for i := 0; i < len(ll); i++ {
tree.Remove(l[i])
}
}
func BenchmarkGet(b *testing.B) {
avl := New(utils.IntComparator)
tree := New(compare.Int)
l := loadTestData()
b.N = len(l)
@@ -421,7 +401,7 @@ func BenchmarkGet(b *testing.B) {
b.ResetTimer()
b.StartTimer()
for i := 0; i < b.N; i++ {
avl.Get(l[i])
tree.Get(l[i])
}
}
@@ -452,18 +432,21 @@ func BenchmarkGodsAvlGet(b *testing.B) {
}
func BenchmarkPut(b *testing.B) {
avl := New(utils.IntComparator)
l := loadTestData()
b.ResetTimer()
b.StartTimer()
b.N = len(l)
for _, v := range l {
avl.Put(v, v)
execCount := 50
b.N = len(l) * execCount
for i := 0; i < execCount; i++ {
tree := New(compare.Int)
for _, v := range l {
tree.Put(v, v)
}
}
// b.Log(tree.count)
}
func BenchmarkGodsRBPut(b *testing.B) {

153
avlkeydup/iterator.go
View File

@@ -5,8 +5,6 @@ import (
)
type Iterator struct {
op *Tree
dir int
up *Node
cur *Node
@@ -15,11 +13,17 @@ type Iterator struct {
}
func initIterator(avltree *Tree) *Iterator {
iter := &Iterator{op: avltree, tstack: lastack.New()}
iter := &Iterator{tstack: lastack.New()}
iter.up = avltree.root
return iter
}
func NewIterator(n *Node) *Iterator {
iter := &Iterator{tstack: lastack.New()}
iter.up = n
return iter
}
func (iter *Iterator) Value() interface{} {
return iter.cur.value
}
@@ -42,46 +46,47 @@ func (iter *Iterator) Right() bool {
return false
}
func (iter *Iterator) Prev() (result bool) {
func GetNext(cur *Node, idx int) *Node {
if iter.dir > -1 {
if iter.dir == 1 && iter.cur != nil {
iter.tstack.Clear()
iter.curPushPrevStack(iter.cur)
iter.up = iter.getPrevUp(iter.cur)
iter := NewIterator(cur)
iter.curPushNextStack(iter.up)
iter.up = iter.getNextUp(iter.up)
for i := 0; i < idx; i++ {
if iter.tstack.Size() == 0 {
if iter.up == nil {
return nil
}
iter.tstack.Push(iter.up)
iter.up = iter.getNextUp(iter.up)
}
iter.dir = -1
}
if iter.tstack.Size() == 0 {
if iter.up == nil {
return false
if v, ok := iter.tstack.Pop(); ok {
iter.cur = v.(*Node)
if i == idx-1 {
return iter.cur
}
iter.curPushNextStack(iter.cur)
} else {
return nil
}
iter.tstack.Push(iter.up)
iter.up = iter.getPrevUp(iter.up)
}
if v, ok := iter.tstack.Pop(); ok {
iter.cur = v.(*Node)
iter.curPushPrevStack(iter.cur)
return true
}
return false
return cur
}
func (iter *Iterator) Next() (result bool) {
if iter.dir < 1 { // 非 1(next 方向定义 -1 为 prev)
if iter.dir == -1 && iter.cur != nil { // 如果上次为prev方向, 则清空辅助计算的栈
if iter.dir > -1 {
if iter.dir == 1 && iter.cur != nil {
iter.tstack.Clear()
iter.curPushNextStack(iter.cur) // 把当前cur计算的逆向回朔
iter.up = iter.getNextUp(iter.cur) // cur 寻找下个要计算up
iter.curPushNextStack(iter.cur)
iter.up = iter.getNextUp(iter.cur)
}
iter.dir = 1
iter.dir = -1
}
// 如果栈空了, 把up的递归计算入栈, 重新计算 下次的up值
if iter.tstack.Size() == 0 {
if iter.up == nil {
return false
@@ -96,6 +101,64 @@ func (iter *Iterator) Next() (result bool) {
return true
}
return false
}
func GetPrev(cur *Node, idx int) *Node {
iter := NewIterator(cur)
iter.curPushPrevStack(iter.up)
iter.up = iter.getPrevUp(iter.up)
for i := 0; i < idx; i++ {
if iter.tstack.Size() == 0 {
if iter.up == nil {
return nil
}
iter.tstack.Push(iter.up)
iter.up = iter.getPrevUp(iter.up)
}
if v, ok := iter.tstack.Pop(); ok {
iter.cur = v.(*Node)
if i == idx-1 {
return iter.cur
}
iter.curPushPrevStack(iter.cur)
} else {
return nil
}
}
return cur
}
func (iter *Iterator) Prev() (result bool) {
if iter.dir < 1 { // 非 1(next 方向定义 -1 为 prev)
if iter.dir == -1 && iter.cur != nil { // 如果上次为prev方向, 则清空辅助计算的栈
iter.tstack.Clear()
iter.curPushPrevStack(iter.cur) // 把当前cur计算的逆向回朔
iter.up = iter.getPrevUp(iter.cur) // cur 寻找下个要计算up
}
iter.dir = 1
}
// 如果栈空了, 把up的递归计算入栈, 重新计算 下次的up值
if iter.tstack.Size() == 0 {
if iter.up == nil {
return false
}
iter.tstack.Push(iter.up)
iter.up = iter.getPrevUp(iter.up)
}
if v, ok := iter.tstack.Pop(); ok {
iter.cur = v.(*Node)
iter.curPushPrevStack(iter.cur)
return true
}
// 如果再次计算的栈为空, 则只能返回false
return false
}
@@ -107,7 +170,7 @@ func getRelationship(cur *Node) int {
return 0
}
func (iter *Iterator) getNextUp(cur *Node) *Node {
func (iter *Iterator) getPrevUp(cur *Node) *Node {
for cur.parent != nil {
if getRelationship(cur) == 1 { // next 在 降序 小值. 如果child在右边, parent 比 child 小, parent才有效, 符合降序
return cur.parent
@@ -117,19 +180,19 @@ func (iter *Iterator) getNextUp(cur *Node) *Node {
return nil
}
func (iter *Iterator) curPushNextStack(cur *Node) {
next := cur.children[0] // 当前的左然后向右找, 找到最大, 就是最接近cur 并且小于cur的值
func (iter *Iterator) curPushPrevStack(cur *Node) {
Prev := cur.children[0] // 当前的左然后向右找, 找到最大, 就是最接近cur 并且小于cur的值
if next != nil {
iter.tstack.Push(next)
for next.children[1] != nil {
next = next.children[1]
iter.tstack.Push(next) // 入栈 用于回溯
if Prev != nil {
iter.tstack.Push(Prev)
for Prev.children[1] != nil {
Prev = Prev.children[1]
iter.tstack.Push(Prev) // 入栈 用于回溯
}
}
}
func (iter *Iterator) getPrevUp(cur *Node) *Node {
func (iter *Iterator) getNextUp(cur *Node) *Node {
for cur.parent != nil {
if getRelationship(cur) == 0 { // Prev 在 降序 大值. 如果child在左边, parent 比 child 大, parent才有效 , 符合降序
return cur.parent
@@ -139,14 +202,14 @@ func (iter *Iterator) getPrevUp(cur *Node) *Node {
return nil
}
func (iter *Iterator) curPushPrevStack(cur *Node) {
prev := cur.children[1]
func (iter *Iterator) curPushNextStack(cur *Node) {
next := cur.children[1]
if prev != nil {
iter.tstack.Push(prev)
for prev.children[0] != nil {
prev = prev.children[0]
iter.tstack.Push(prev)
if next != nil {
iter.tstack.Push(next)
for next.children[0] != nil {
next = next.children[0]
iter.tstack.Push(next)
}
}
}