Spaces:
Running
Running
File size: 2,324 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 |
// _ _
// __ _____ __ ___ ___ __ _| |_ ___
// \ \ /\ / / _ \/ _` \ \ / / |/ _` | __/ _ \
// \ V V / __/ (_| |\ V /| | (_| | || __/
// \_/\_/ \___|\__,_| \_/ |_|\__,_|\__\___|
//
// Copyright © 2016 - 2024 Weaviate B.V. All rights reserved.
//
// CONTACT: [email protected]
//
package moduletools
type ObjectDiff struct {
oldVec []float32
oldPropValues map[string]interface{}
newPropValues map[string]interface{}
}
func NewObjectDiff(oldVec []float32) *ObjectDiff {
return &ObjectDiff{
oldVec: oldVec,
oldPropValues: map[string]interface{}{},
newPropValues: map[string]interface{}{},
}
}
func (od *ObjectDiff) WithProp(propName string, oldValue, newValue interface{}) *ObjectDiff {
od.oldPropValues[propName] = oldValue
od.newPropValues[propName] = newValue
return od
}
func (od *ObjectDiff) GetVec() []float32 {
return od.oldVec
}
func (od *ObjectDiff) IsChangedProp(propName string) bool {
oldVal, oldExists := od.oldPropValues[propName]
newVal, newExists := od.newPropValues[propName]
if !oldExists && !newExists {
return false
}
if !(oldExists && newExists) {
return true
}
// only strings are vectorized, therefore property changes are determined
// on values of types string, []string and []interface{} which are in fact strings
switch o := oldVal.(type) {
case string:
if n, ok := newVal.(string); ok {
return n != o
}
case []string:
if ns, ok := newVal.([]string); ok {
if len(ns) != len(o) {
return true
}
for i := range o {
if ns[i] != o[i] {
return true
}
}
return false
} else if ni, ok := newVal.([]interface{}); ok {
if len(ni) != len(o) {
return true
}
for i := range o {
if ni[i] != o[i] {
return true
}
}
return false
}
case []interface{}:
if ns, ok := newVal.([]string); ok {
if len(ns) != len(o) {
return true
}
for i := range o {
if ns[i] != o[i] {
return true
}
}
return false
} else if ni, ok := newVal.([]interface{}); ok {
if len(ni) != len(o) {
return true
}
for i := range o {
if ni[i] != o[i] {
return true
}
}
return false
}
}
return true
}
|