hnsw

Jun 14, 2024

Changes in this version

+ type Node struct

+ Key K

+ Value Vector

+ func MakeNode[K cmp.Ordered](key K, vec Vector) Node[K]

May 17, 2024

Changes in this version

+ func RegisterDistanceFunc(name string, fn DistanceFunc)

type Graph

+ func (g *Graph[T]) Dims() int

+ func (h *Graph[T]) Export(w io.Writer) error

+ func (h *Graph[T]) Import(r io.Reader) error

+ type SavedGraph struct

+ Path string

+ func LoadSavedGraph[T Embeddable](path string) (*SavedGraph[T], error)

+ func (g *SavedGraph[T]) Save() error

type Vector

+ func (v *Vector) ReadFrom(r io.Reader) (int64, error)

+ func (v Vector) WriteTo(w io.Writer) (int64, error)

May 8, 2024

Changes in this version

+ func CosineDistance(a, b []float32) float32

+ func EuclideanDistance(a, b []float32) float32

+ type Analyzer struct

+ Graph *Graph[T]

+ func (a *Analyzer[T]) Connectivity() []float64

+ func (a *Analyzer[T]) Height() int

+ func (a *Analyzer[T]) Topography() []int

+ type DistanceFunc func(a, b []float32) float32

+ type Embeddable interface

+ Embedding func() Embedding

+ ID func() string

+ type Embedding = []float32

+ type Graph struct

+ Distance DistanceFunc

+ EfSearch int

+ M int

+ Ml float64

+ Rng *rand.Rand

+ func NewGraph[T Embeddable]() *Graph[T]

+ func (g *Graph[T]) Add(nodes ...T)

+ func (h *Graph[T]) Delete(id string)

+ func (h *Graph[T]) Len() int

+ func (h *Graph[T]) Lookup(id string) (T, bool)

+ func (h *Graph[T]) Search(near Embedding, k int) []T

+ type Vector struct

+ func MakeVector(id string, embedding []float32) Vector

+ func (v Vector) Embedding() []float32

+ func (v Vector) ID() string