Documentation ¶
Overview ¶
Package vptree is an implementation of Vantage Point Trees in Go for bit hash of uint64. It is ideally suited for image similarity using an uint64 hash
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Results ¶
type Results struct {
// contains filtered or unexported fields
}
Results are the VPTree search results
func LinearSearch ¶
Search an arr using Linear Search with the given query, tau, and k
func (Results) Array ¶
Array returns VPTree search results as 2 arrays. arrays are always equally lengthed.
func (*Results) Pop ¶
Pop removes and returns the minimum element (according to Less) from the heap. The complexity is O(log n) where n = h.Len(). Pop is equivalent to Remove(h, 0).
type VPTree ¶
type VPTree struct {
// contains filtered or unexported fields
}
VPTree is a vantage point tree
func NewVPTreeConcurrent ¶
func NewVPTreeConcurrent() *VPTree
NewVPTreeConcurrent returns a new VPTree with locking features
func (*VPTree) AddConcurrent ¶
Click to show internal directories.
Click to hide internal directories.