Skip to content

Fixed split level bug. #55

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Feb 9, 2015
+7 −1
Merged

Fixed split level bug. #55

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 7 additions & 1 deletion slice/skip/skip.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -138,6 +138,7 @@ func insertNode(sl *SkipList, n *node, entry Entry, pos uint64, cache nodes, pos
func splitAt(sl *SkipList, index uint64) (*SkipList, *SkipList) {
right := &SkipList{}
right.maxLevel = sl.maxLevel
right.level = sl.level
right.cache = make(nodes, sl.maxLevel)
right.posCache = make(widths, sl.maxLevel)
right.head = newNode(nil, sl.maxLevel)
Expand Down Expand Up @@ -219,7 +220,12 @@ func (sl *SkipList) search(e Entry, update nodes, widths widths) (*node, uint64)
}

func (sl *SkipList) resetMaxLevel() {
for sl.head.forward[sl.level] == nil && sl.level > 1 {
if sl.level < 1 {
sl.level = 1
return
}

for sl.head.forward[sl.level-1] == nil && sl.level > 1 {
sl.level--
}
}
Expand Down