mirror of
https://github.com/gohugoio/hugo.git
synced 2024-12-01 06:50:02 -05:00
98 lines
2.2 KiB
Go
98 lines
2.2 KiB
Go
// Copyright 2024 The Hugo Authors. All rights reserved.
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
package doctree
|
|
|
|
import (
|
|
"sync"
|
|
|
|
radix "github.com/armon/go-radix"
|
|
)
|
|
|
|
// Tree is a radix tree that holds T.
|
|
type Tree[T any] interface {
|
|
Get(s string) T
|
|
LongestPrefix(s string) (string, T)
|
|
Insert(s string, v T) T
|
|
WalkPrefix(lockType LockType, s string, f func(s string, v T) (bool, error)) error
|
|
}
|
|
|
|
// NewSimpleTree creates a new SimpleTree.
|
|
func NewSimpleTree[T comparable]() *SimpleTree[T] {
|
|
return &SimpleTree[T]{tree: radix.New()}
|
|
}
|
|
|
|
// SimpleTree is a thread safe radix tree that holds T.
|
|
type SimpleTree[T comparable] struct {
|
|
mu sync.RWMutex
|
|
tree *radix.Tree
|
|
zero T
|
|
}
|
|
|
|
func (tree *SimpleTree[T]) Get(s string) T {
|
|
tree.mu.RLock()
|
|
defer tree.mu.RUnlock()
|
|
|
|
if v, ok := tree.tree.Get(s); ok {
|
|
return v.(T)
|
|
}
|
|
return tree.zero
|
|
}
|
|
|
|
func (tree *SimpleTree[T]) LongestPrefix(s string) (string, T) {
|
|
tree.mu.RLock()
|
|
defer tree.mu.RUnlock()
|
|
|
|
if s, v, ok := tree.tree.LongestPrefix(s); ok {
|
|
return s, v.(T)
|
|
}
|
|
return "", tree.zero
|
|
}
|
|
|
|
func (tree *SimpleTree[T]) Insert(s string, v T) T {
|
|
tree.mu.Lock()
|
|
defer tree.mu.Unlock()
|
|
|
|
tree.tree.Insert(s, v)
|
|
return v
|
|
}
|
|
|
|
func (tree *SimpleTree[T]) Lock(lockType LockType) func() {
|
|
switch lockType {
|
|
case LockTypeNone:
|
|
return func() {}
|
|
case LockTypeRead:
|
|
tree.mu.RLock()
|
|
return tree.mu.RUnlock
|
|
case LockTypeWrite:
|
|
tree.mu.Lock()
|
|
return tree.mu.Unlock
|
|
}
|
|
return func() {}
|
|
}
|
|
|
|
func (tree *SimpleTree[T]) WalkPrefix(lockType LockType, s string, f func(s string, v T) (bool, error)) error {
|
|
commit := tree.Lock(lockType)
|
|
defer commit()
|
|
var err error
|
|
tree.tree.WalkPrefix(s, func(s string, v any) bool {
|
|
var b bool
|
|
b, err = f(s, v.(T))
|
|
if err != nil {
|
|
return true
|
|
}
|
|
return b
|
|
})
|
|
|
|
return err
|
|
}
|