diff options
| author | Luke Shumaker <lukeshu@lukeshu.com> | 2023-03-17 02:28:54 -0400 |
|---|---|---|
| committer | Luke Shumaker <lukeshu@lukeshu.com> | 2023-03-17 02:52:07 -0400 |
| commit | 1ea26f04701fa66e36b058f3efb3a6c7059cdc5c (patch) | |
| tree | 9ba66e893d6f66096f6b06284d09c8eb3e50facc /lib/containers/intervaltree.go | |
| parent | 0cfc5d80855ee0a28329305cda13e7bff935a297 (diff) | |
tree-wide: Turn on all revive linters (with exceptions)
Diffstat (limited to 'lib/containers/intervaltree.go')
| -rw-r--r-- | lib/containers/intervaltree.go | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/lib/containers/intervaltree.go b/lib/containers/intervaltree.go index 7b96526..d2e2732 100644 --- a/lib/containers/intervaltree.go +++ b/lib/containers/intervaltree.go @@ -39,7 +39,7 @@ type IntervalTree[K Ordered[K], V any] struct { inner RBTree[intervalValue[K, V]] } -func (t *IntervalTree[K, V]) attrFn(node *RBNode[intervalValue[K, V]]) { +func (*IntervalTree[K, V]) attrFn(node *RBNode[intervalValue[K, V]]) { max := node.Value.ValSpan.Max if node.Left != nil && node.Left.Value.ChildSpan.Max.Compare(max) > 0 { max = node.Left.Value.ChildSpan.Max |