Spaces:
Build error
Build error
File size: 9,404 Bytes
84d2a97 |
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 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 |
use std::collections::HashSet;
use std::iter::FromIterator;
use std::sync::atomic::AtomicBool;
use itertools::Itertools;
use segment::common::operation_error::OperationError;
use segment::data_types::named_vectors::NamedVectors;
use segment::data_types::vectors::{
only_default_vector, VectorRef, VectorStructInternal, DEFAULT_VECTOR_NAME,
};
use segment::entry::entry_point::SegmentEntry;
use segment::fixtures::index_fixtures::random_vector;
use segment::segment_constructor::load_segment;
use segment::segment_constructor::simple_segment_constructor::build_simple_segment;
use segment::types::{Condition, Distance, Filter, SearchParams, WithPayload};
use tempfile::Builder;
use crate::fixtures::segment::{build_segment_1, build_segment_3};
#[test]
fn test_point_exclusion() {
let dir = Builder::new().prefix("segment_dir").tempdir().unwrap();
let segment = build_segment_1(dir.path());
assert!(segment.has_point(3.into()));
let query_vector = [1.0, 1.0, 1.0, 1.0].into();
let res = segment
.search(
DEFAULT_VECTOR_NAME,
&query_vector,
&WithPayload::default(),
&false.into(),
None,
1,
None,
)
.unwrap();
let best_match = res.first().expect("Non-empty result");
assert_eq!(best_match.id, 3.into());
let ids: HashSet<_> = HashSet::from_iter([3.into()]);
let frt = Filter::new_must_not(Condition::HasId(ids.into()));
let res = segment
.search(
DEFAULT_VECTOR_NAME,
&query_vector,
&WithPayload::default(),
&false.into(),
Some(&frt),
1,
None,
)
.unwrap();
let best_match = res.first().expect("Non-empty result");
assert_ne!(best_match.id, 3.into());
let point_ids1: Vec<_> = segment.iter_points().collect();
let point_ids2: Vec<_> = segment.iter_points().collect();
assert!(!point_ids1.is_empty());
assert!(!point_ids2.is_empty());
assert_eq!(&point_ids1, &point_ids2)
}
#[test]
fn test_named_vector_search() {
let dir = Builder::new().prefix("segment_dir").tempdir().unwrap();
let segment = build_segment_3(dir.path());
assert!(segment.has_point(3.into()));
let query_vector = [1.0, 1.0, 1.0, 1.0].into();
let res = segment
.search(
"vector1",
&query_vector,
&WithPayload::default(),
&false.into(),
None,
1,
None,
)
.unwrap();
let best_match = res.first().expect("Non-empty result");
assert_eq!(best_match.id, 3.into());
let ids: HashSet<_> = HashSet::from_iter([3.into()]);
let frt = Filter {
should: None,
min_should: None,
must: None,
must_not: Some(vec![Condition::HasId(ids.into())]),
};
let res = segment
.search(
"vector1",
&query_vector,
&WithPayload::default(),
&false.into(),
Some(&frt),
1,
None,
)
.unwrap();
let best_match = res.first().expect("Non-empty result");
assert_ne!(best_match.id, 3.into());
let point_ids1: Vec<_> = segment.iter_points().collect();
let point_ids2: Vec<_> = segment.iter_points().collect();
assert!(!point_ids1.is_empty());
assert!(!point_ids2.is_empty());
assert_eq!(&point_ids1, &point_ids2)
}
#[test]
fn test_missed_vector_name() {
let dir = Builder::new().prefix("segment_dir").tempdir().unwrap();
let mut segment = build_segment_3(dir.path());
let exists = segment
.upsert_point(
7,
1.into(),
NamedVectors::from_pairs([
("vector2".to_owned(), vec![10.]),
("vector3".to_owned(), vec![5., 6., 7., 8.]),
]),
)
.unwrap();
assert!(exists, "this partial vector should overwrite existing");
let exists = segment
.upsert_point(
8,
6.into(),
NamedVectors::from_pairs([
("vector2".to_owned(), vec![10.]),
("vector3".to_owned(), vec![5., 6., 7., 8.]),
]),
)
.unwrap();
assert!(!exists, "this partial vector should not existing");
}
#[test]
fn test_vector_name_not_exists() {
let dir = Builder::new().prefix("segment_dir").tempdir().unwrap();
let mut segment = build_segment_3(dir.path());
let result = segment.upsert_point(
6,
6.into(),
NamedVectors::from_pairs([
("vector1".to_owned(), vec![5., 6., 7., 8.]),
("vector2".to_owned(), vec![10.]),
("vector3".to_owned(), vec![5., 6., 7., 8.]),
("vector4".to_owned(), vec![5., 6., 7., 8.]),
]),
);
if let Err(OperationError::VectorNameNotExists { received_name }) = result {
assert_eq!(received_name, "vector4");
} else {
panic!("wrong upsert result")
}
}
#[test]
fn ordered_deletion_test() {
let dir = Builder::new().prefix("segment_dir").tempdir().unwrap();
let path = {
let mut segment = build_segment_1(dir.path());
segment.delete_point(6, 5.into()).unwrap();
segment.delete_point(6, 4.into()).unwrap();
segment.flush(true, false).unwrap();
segment.current_path.clone()
};
let segment = load_segment(&path, &AtomicBool::new(false))
.unwrap()
.unwrap();
let query_vector = [1.0, 1.0, 1.0, 1.0].into();
let res = segment
.search(
DEFAULT_VECTOR_NAME,
&query_vector,
&WithPayload::default(),
&false.into(),
None,
1,
None,
)
.unwrap();
let best_match = res.first().expect("Non-empty result");
assert_eq!(best_match.id, 3.into());
}
#[test]
fn skip_deleted_segment() {
let dir = Builder::new().prefix("segment_dir").tempdir().unwrap();
let path = {
let mut segment = build_segment_1(dir.path());
segment.delete_point(6, 5.into()).unwrap();
segment.delete_point(6, 4.into()).unwrap();
segment.flush(true, false).unwrap();
segment.current_path.clone()
};
let new_path = path.with_extension("deleted");
std::fs::rename(&path, new_path).unwrap();
let segment = load_segment(&path, &AtomicBool::new(false)).unwrap();
assert!(segment.is_none());
}
#[test]
fn test_update_named_vector() {
let num_points = 25;
let dim = 4;
let mut rng = rand::thread_rng();
let distance = Distance::Cosine;
let vectors = (0..num_points)
.map(|_| random_vector(&mut rng, dim))
.collect_vec();
let dir = Builder::new().prefix("segment_dir").tempdir().unwrap();
let mut segment = build_simple_segment(dir.path(), dim, distance).unwrap();
for (i, vec) in vectors.iter().enumerate() {
let i = i as u64;
segment
.upsert_point(i, i.into(), only_default_vector(vec))
.unwrap();
}
let query_vector = random_vector(&mut rng, dim).into();
// do exact search
let search_params = SearchParams {
hnsw_ef: None,
exact: true,
quantization: None,
indexed_only: false,
};
let nearest_upsert = segment
.search(
DEFAULT_VECTOR_NAME,
&query_vector,
&false.into(),
&true.into(),
None,
1,
Some(&search_params),
)
.unwrap();
let nearest_upsert = nearest_upsert.first().unwrap();
let sqrt_distance = |v: &[f32]| -> f32 { v.iter().map(|x| x * x).sum::<f32>().sqrt() };
// check if nearest_upsert is normalized
match &nearest_upsert.vector {
Some(VectorStructInternal::Single(v)) => {
assert!((sqrt_distance(v) - 1.).abs() < 1e-5);
}
Some(VectorStructInternal::Named(v)) => {
let v: VectorRef = (&v[DEFAULT_VECTOR_NAME]).into();
let v: &[_] = v.try_into().unwrap();
assert!((sqrt_distance(v) - 1.).abs() < 1e-5);
}
_ => panic!("unexpected vector type"),
}
// update vector using the same values
for (i, vec) in vectors.iter().enumerate() {
let i = i as u64;
segment
.update_vectors(i + num_points as u64, i.into(), only_default_vector(vec))
.unwrap();
}
// do search after update
let nearest_update = segment
.search(
DEFAULT_VECTOR_NAME,
&query_vector,
&false.into(),
&true.into(),
None,
1,
Some(&search_params),
)
.unwrap();
let nearest_update = nearest_update.first().unwrap();
// check that nearest_upsert is normalized
match &nearest_update.vector {
Some(VectorStructInternal::Single(v)) => {
assert!((sqrt_distance(v) - 1.).abs() < 1e-5);
}
Some(VectorStructInternal::Named(v)) => {
let v: VectorRef = (&v[DEFAULT_VECTOR_NAME]).into();
let v: &[_] = v.try_into().unwrap();
assert!((sqrt_distance(v) - 1.).abs() < 1e-5);
}
_ => panic!("unexpected vector type"),
}
// check that nearests are the same
assert_eq!(nearest_upsert.id, nearest_update.id);
}
|