Documentation
¶
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Dictionary ¶
type Dictionary struct {
// contains filtered or unexported fields
}
type IndexEntry ¶
type IndexEntry struct {
// contains filtered or unexported fields
}
type InvertedIndex ¶
type InvertedIndex struct {
MaxReferences int // maximum number of references stored per key
// contains filtered or unexported fields
}
func NewInvertedIndex ¶
func NewInvertedIndex(maxRef int) *InvertedIndex
func (*InvertedIndex) Get ¶
func (i *InvertedIndex) Get(key string) []Reference
Get fetches a slice of references for the given key, or returns a nil slice of no slice is found.
type Item ¶
type Item struct {
// contains filtered or unexported fields
}
An Item is something we manage in a priority queue.
type PriorityQueue ¶
type PriorityQueue []*Item
A PriorityQueue implements heap.Interface and holds Items.
func (PriorityQueue) Len ¶
func (pq PriorityQueue) Len() int
func (PriorityQueue) Less ¶
func (pq PriorityQueue) Less(i, j int) bool
func (*PriorityQueue) Pop ¶
func (pq *PriorityQueue) Pop() interface{}
func (*PriorityQueue) Push ¶
func (pq *PriorityQueue) Push(x interface{})
func (PriorityQueue) Swap ¶
func (pq PriorityQueue) Swap(i, j int)
type RadixNode ¶
type RadixNode struct {
// contains filtered or unexported fields
}
func (RadixNode) FindPrefixedEntries ¶
type RadixTree ¶
type RadixTree struct {
Root *RadixNode
}
func NewRadixTree ¶
func NewRadixTree() *RadixTree
func (*RadixTree) FindWordsWithPrefix ¶
Source Files
Click to show internal directories.
Click to hide internal directories.