diff options
author | Luke Shumaker <lukeshu@lukeshu.com> | 2022-06-30 03:14:05 -0600 |
---|---|---|
committer | Luke Shumaker <lukeshu@lukeshu.com> | 2022-06-30 03:31:43 -0600 |
commit | 27d2f3a0efe6de94c7720907557e640e8a2f1428 (patch) | |
tree | 5cf5fd8f3ca247198fdb978b017c9c72ab581f27 /pkg/rbtree/range.go | |
parent | 428d86a1816d13ea6969793a42893c739487cf3d (diff) |
btrfsvol: use rbtree
Diffstat (limited to 'pkg/rbtree/range.go')
-rw-r--r-- | pkg/rbtree/range.go | 23 |
1 files changed, 0 insertions, 23 deletions
diff --git a/pkg/rbtree/range.go b/pkg/rbtree/range.go deleted file mode 100644 index 9f67078..0000000 --- a/pkg/rbtree/range.go +++ /dev/null @@ -1,23 +0,0 @@ -package rbtree - -import ( - "lukeshu.com/btrfs-tools/pkg/util" -) - -// SearchRange is like Search, but returns all nodes that match the -// function; assuming that they are contiguous. -func (t *Tree[K, V]) SearchRange(fn func(V) int) []V { - middle := t.Search(fn) - if middle == nil { - return nil - } - ret := []V{middle.Value} - for node := t.Prev(middle); node != nil && fn(node.Value) == 0; node = t.Prev(node) { - ret = append(ret, node.Value) - } - util.ReverseSlice(ret) - for node := t.Next(middle); node != nil && fn(node.Value) == 0; node = t.Next(node) { - ret = append(ret, node.Value) - } - return ret -} |