Spaces:
Running
Running
File size: 3,308 Bytes
b110593 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 |
// _ _
// __ _____ __ ___ ___ __ _| |_ ___
// \ \ /\ / / _ \/ _` \ \ / / |/ _` | __/ _ \
// \ V V / __/ (_| |\ V /| | (_| | || __/
// \_/\_/ \___|\__,_| \_/ |_|\__,_|\__\___|
//
// Copyright © 2016 - 2024 Weaviate B.V. All rights reserved.
//
// CONTACT: [email protected]
//
package nearestneighbors
import (
"context"
"fmt"
"github.com/weaviate/weaviate/entities/moduletools"
"github.com/pkg/errors"
"github.com/tailor-inc/graphql/language/ast"
"github.com/weaviate/weaviate/entities/models"
"github.com/weaviate/weaviate/entities/search"
txt2vecmodels "github.com/weaviate/weaviate/modules/text2vec-contextionary/additional/models"
)
const (
DefaultLimit = 10
DefaultK = 32
)
type Extender struct {
searcher contextionary
}
type contextionary interface {
MultiNearestWordsByVector(ctx context.Context, vectors [][]float32, k, n int) ([]*txt2vecmodels.NearestNeighbors, error)
}
func (e *Extender) AdditionalPropertyDefaultValue() interface{} {
return true
}
func (e *Extender) AdditionalPropertyFn(ctx context.Context,
in []search.Result, params interface{}, limit *int,
argumentModuleParams map[string]interface{}, cfg moduletools.ClassConfig,
) ([]search.Result, error) {
return e.Multi(ctx, in, limit)
}
func (e *Extender) ExtractAdditionalFn(param []*ast.Argument) interface{} {
return true
}
func (e *Extender) Single(ctx context.Context, in *search.Result, limit *int) (*search.Result, error) {
if in == nil {
return nil, nil
}
multiRes, err := e.Multi(ctx, []search.Result{*in}, limit) // safe to deref, as we did a nil check before
if err != nil {
return nil, err
}
return &multiRes[0], nil
}
func (e *Extender) Multi(ctx context.Context, in []search.Result, limit *int) ([]search.Result, error) {
if in == nil {
return nil, nil
}
vectors := make([][]float32, len(in))
for i, res := range in {
if res.Vector == nil || len(res.Vector) == 0 {
return nil, fmt.Errorf("item %d has no vector", i)
}
vectors[i] = res.Vector
}
neighbors, err := e.searcher.MultiNearestWordsByVector(ctx, vectors, DefaultK, limitOrDefault(limit))
if err != nil {
return nil, errors.Wrap(err, "get neighbors for search results")
}
if len(neighbors) != len(in) {
return nil, fmt.Errorf("inconsistent results: input=%d neighbors=%d", len(in), len(neighbors))
}
for i, res := range in {
up := res.AdditionalProperties
if up == nil {
up = models.AdditionalProperties{}
}
up["nearestNeighbors"] = removeDollarElements(neighbors[i])
in[i].AdditionalProperties = up
}
return in, nil
}
func NewExtender(searcher contextionary) *Extender {
return &Extender{searcher: searcher}
}
func limitOrDefault(user *int) int {
if user == nil || *user == 0 {
return DefaultLimit
}
return *user
}
func removeDollarElements(in *txt2vecmodels.NearestNeighbors) *txt2vecmodels.NearestNeighbors {
neighbors := make([]*txt2vecmodels.NearestNeighbor, len(in.Neighbors))
i := 0
for _, elem := range in.Neighbors {
if elem.Concept[0] == '$' {
continue
}
neighbors[i] = elem
i++
}
return &txt2vecmodels.NearestNeighbors{
Neighbors: neighbors[:i],
}
}
|