mirror of
https://github.com/qdrant/qdrant.git
synced 2026-08-04 17:10:59 -05:00
* bump and migrate to rand 0.9.0 also bump rand_distr to 0.5.0 to match it * Migrate AVX2 and SSE implementations * Remove unused thread_rng placeholders * More random migrations * Migrate GPU tests * bump seed --------- Co-authored-by: timvisee <tim@visee.me> Co-authored-by: Arnaud Gourlay <arnaud.gourlay@gmail.com>
342 lines
11 KiB
Rust
342 lines
11 KiB
Rust
#[cfg(test)]
|
|
mod tests {
|
|
use std::sync::atomic::AtomicBool;
|
|
|
|
use common::counter::hardware_counter::HardwareCounterCell;
|
|
use quantization::encoded_vectors::{DistanceType, EncodedVectors, VectorParameters};
|
|
use quantization::encoded_vectors_u8::EncodedVectorsU8;
|
|
use rand::{Rng, SeedableRng};
|
|
|
|
use crate::metrics::{dot_similarity, l1_similarity, l2_similarity};
|
|
|
|
#[test]
|
|
fn test_dot_simple() {
|
|
let vectors_count = 129;
|
|
let vector_dim = 65;
|
|
let error = vector_dim as f32 * 0.1;
|
|
|
|
let mut rng = rand::rngs::StdRng::seed_from_u64(42);
|
|
let mut vector_data: Vec<Vec<f32>> = Vec::new();
|
|
for _ in 0..vectors_count {
|
|
let vector: Vec<f32> = (0..vector_dim).map(|_| rng.random()).collect();
|
|
vector_data.push(vector);
|
|
}
|
|
let query: Vec<f32> = (0..vector_dim).map(|_| rng.random()).collect();
|
|
|
|
let encoded = EncodedVectorsU8::encode(
|
|
vector_data.iter(),
|
|
Vec::<u8>::new(),
|
|
&VectorParameters {
|
|
dim: vector_dim,
|
|
count: vectors_count,
|
|
distance_type: DistanceType::Dot,
|
|
invert: false,
|
|
},
|
|
None,
|
|
&AtomicBool::new(false),
|
|
)
|
|
.unwrap();
|
|
let query_u8 = encoded.encode_query(&query);
|
|
|
|
for (index, vector) in vector_data.iter().enumerate() {
|
|
let score = encoded.score_point_simple(&query_u8, index as u32);
|
|
let orginal_score = dot_similarity(&query, vector);
|
|
assert!((score - orginal_score).abs() < error);
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
fn test_l2_simple() {
|
|
let vectors_count = 129;
|
|
let vector_dim = 65;
|
|
let error = vector_dim as f32 * 0.1;
|
|
|
|
let mut rng = rand::rngs::StdRng::seed_from_u64(42);
|
|
let mut vector_data: Vec<Vec<f32>> = Vec::new();
|
|
for _ in 0..vectors_count {
|
|
let vector: Vec<f32> = (0..vector_dim).map(|_| rng.random::<f32>()).collect();
|
|
vector_data.push(vector);
|
|
}
|
|
let query: Vec<f32> = (0..vector_dim).map(|_| rng.random::<f32>()).collect();
|
|
|
|
let encoded = EncodedVectorsU8::encode(
|
|
vector_data.iter(),
|
|
Vec::<u8>::new(),
|
|
&VectorParameters {
|
|
dim: vector_dim,
|
|
count: vectors_count,
|
|
distance_type: DistanceType::L2,
|
|
invert: false,
|
|
},
|
|
None,
|
|
&AtomicBool::new(false),
|
|
)
|
|
.unwrap();
|
|
let query_u8 = encoded.encode_query(&query);
|
|
|
|
for (index, vector) in vector_data.iter().enumerate() {
|
|
let score = encoded.score_point_simple(&query_u8, index as u32);
|
|
let orginal_score = l2_similarity(&query, vector);
|
|
assert!((score - orginal_score).abs() < error);
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
fn test_l1_simple() {
|
|
let vectors_count = 129;
|
|
let vector_dim = 65;
|
|
let error = vector_dim as f32 * 0.1;
|
|
|
|
let mut rng = rand::rngs::StdRng::seed_from_u64(42);
|
|
let mut vector_data: Vec<Vec<f32>> = Vec::new();
|
|
for _ in 0..vectors_count {
|
|
let vector: Vec<f32> = (0..vector_dim)
|
|
.map(|_| rng.random_range(-1.0..=1.0))
|
|
.collect();
|
|
vector_data.push(vector);
|
|
}
|
|
let query: Vec<f32> = (0..vector_dim)
|
|
.map(|_| rng.random_range(-1.0..=1.0))
|
|
.collect();
|
|
|
|
let encoded = EncodedVectorsU8::encode(
|
|
vector_data.iter(),
|
|
Vec::<u8>::new(),
|
|
&VectorParameters {
|
|
dim: vector_dim,
|
|
count: vectors_count,
|
|
distance_type: DistanceType::L1,
|
|
invert: false,
|
|
},
|
|
None,
|
|
&AtomicBool::new(false),
|
|
)
|
|
.unwrap();
|
|
let query_u8 = encoded.encode_query(&query);
|
|
|
|
for (index, vector) in vector_data.iter().enumerate() {
|
|
let score = encoded.score_point_simple(&query_u8, index as u32);
|
|
let orginal_score = l1_similarity(&query, vector);
|
|
assert!((score - orginal_score).abs() < error);
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
fn test_dot_inverted_simple() {
|
|
let vectors_count = 129;
|
|
let vector_dim = 65;
|
|
let error = vector_dim as f32 * 0.1;
|
|
|
|
let mut rng = rand::rngs::StdRng::seed_from_u64(42);
|
|
let mut vector_data: Vec<Vec<f32>> = Vec::new();
|
|
for _ in 0..vectors_count {
|
|
let vector: Vec<f32> = (0..vector_dim).map(|_| rng.random()).collect();
|
|
vector_data.push(vector);
|
|
}
|
|
let query: Vec<f32> = (0..vector_dim).map(|_| rng.random()).collect();
|
|
|
|
let encoded = EncodedVectorsU8::encode(
|
|
vector_data.iter(),
|
|
Vec::<u8>::new(),
|
|
&VectorParameters {
|
|
dim: vector_dim,
|
|
count: vectors_count,
|
|
distance_type: DistanceType::Dot,
|
|
invert: true,
|
|
},
|
|
None,
|
|
&AtomicBool::new(false),
|
|
)
|
|
.unwrap();
|
|
let query_u8 = encoded.encode_query(&query);
|
|
|
|
for (index, vector) in vector_data.iter().enumerate() {
|
|
let score = encoded.score_point_simple(&query_u8, index as u32);
|
|
let orginal_score = -dot_similarity(&query, vector);
|
|
assert!((score - orginal_score).abs() < error);
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
fn test_l2_inverted_simple() {
|
|
let vectors_count = 129;
|
|
let vector_dim = 65;
|
|
let error = vector_dim as f32 * 0.1;
|
|
|
|
let mut rng = rand::rngs::StdRng::seed_from_u64(42);
|
|
let mut vector_data: Vec<Vec<f32>> = Vec::new();
|
|
for _ in 0..vectors_count {
|
|
let vector: Vec<f32> = (0..vector_dim).map(|_| rng.random::<f32>()).collect();
|
|
vector_data.push(vector);
|
|
}
|
|
let query: Vec<f32> = (0..vector_dim).map(|_| rng.random::<f32>()).collect();
|
|
|
|
let encoded = EncodedVectorsU8::encode(
|
|
vector_data.iter(),
|
|
Vec::<u8>::new(),
|
|
&VectorParameters {
|
|
dim: vector_dim,
|
|
count: vectors_count,
|
|
distance_type: DistanceType::L2,
|
|
invert: true,
|
|
},
|
|
None,
|
|
&AtomicBool::new(false),
|
|
)
|
|
.unwrap();
|
|
let query_u8 = encoded.encode_query(&query);
|
|
|
|
for (index, vector) in vector_data.iter().enumerate() {
|
|
let score = encoded.score_point_simple(&query_u8, index as u32);
|
|
let orginal_score = -l2_similarity(&query, vector);
|
|
assert!((score - orginal_score).abs() < error);
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
fn test_l1_inverted_simple() {
|
|
let vectors_count = 129;
|
|
let vector_dim = 65;
|
|
let error = vector_dim as f32 * 0.1;
|
|
|
|
let mut rng = rand::rngs::StdRng::seed_from_u64(42);
|
|
let mut vector_data: Vec<Vec<f32>> = Vec::new();
|
|
for _ in 0..vectors_count {
|
|
let vector: Vec<f32> = (0..vector_dim)
|
|
.map(|_| rng.random_range(-1.0..=1.0))
|
|
.collect();
|
|
vector_data.push(vector);
|
|
}
|
|
let query: Vec<f32> = (0..vector_dim)
|
|
.map(|_| rng.random_range(-1.0..=1.0))
|
|
.collect();
|
|
|
|
let encoded = EncodedVectorsU8::encode(
|
|
vector_data.iter(),
|
|
Vec::<u8>::new(),
|
|
&VectorParameters {
|
|
dim: vector_dim,
|
|
count: vectors_count,
|
|
distance_type: DistanceType::L1,
|
|
invert: true,
|
|
},
|
|
None,
|
|
&AtomicBool::new(false),
|
|
)
|
|
.unwrap();
|
|
let query_u8 = encoded.encode_query(&query);
|
|
|
|
for (index, vector) in vector_data.iter().enumerate() {
|
|
let score = encoded.score_point_simple(&query_u8, index as u32);
|
|
let orginal_score = -l1_similarity(&query, vector);
|
|
assert!((score - orginal_score).abs() < error);
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
fn test_dot_internal_simple() {
|
|
let vectors_count: usize = 129;
|
|
let vector_dim = 65;
|
|
let error = vector_dim as f32 * 0.1;
|
|
|
|
let mut rng = rand::rngs::StdRng::seed_from_u64(42);
|
|
let mut vector_data: Vec<Vec<f32>> = Vec::new();
|
|
for _ in 0..vectors_count {
|
|
let vector: Vec<f32> = (0..vector_dim).map(|_| rng.random()).collect();
|
|
vector_data.push(vector);
|
|
}
|
|
|
|
let encoded = EncodedVectorsU8::encode(
|
|
vector_data.iter(),
|
|
Vec::<u8>::new(),
|
|
&VectorParameters {
|
|
dim: vector_dim,
|
|
count: vectors_count,
|
|
distance_type: DistanceType::Dot,
|
|
invert: false,
|
|
},
|
|
None,
|
|
&AtomicBool::new(false),
|
|
)
|
|
.unwrap();
|
|
|
|
let counter = HardwareCounterCell::new();
|
|
for i in 1..vectors_count {
|
|
let score = encoded.score_internal(0, i as u32, &counter);
|
|
let orginal_score = dot_similarity(&vector_data[0], &vector_data[i]);
|
|
assert!((score - orginal_score).abs() < error);
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
fn test_dot_inverted_internal_simple() {
|
|
let vectors_count: usize = 129;
|
|
let vector_dim = 65;
|
|
let error = vector_dim as f32 * 0.1;
|
|
|
|
let mut rng = rand::rngs::StdRng::seed_from_u64(42);
|
|
let mut vector_data: Vec<Vec<f32>> = Vec::new();
|
|
for _ in 0..vectors_count {
|
|
let vector: Vec<f32> = (0..vector_dim).map(|_| rng.random()).collect();
|
|
vector_data.push(vector);
|
|
}
|
|
|
|
let encoded = EncodedVectorsU8::encode(
|
|
vector_data.iter(),
|
|
Vec::<u8>::new(),
|
|
&VectorParameters {
|
|
dim: vector_dim,
|
|
count: vectors_count,
|
|
distance_type: DistanceType::Dot,
|
|
invert: true,
|
|
},
|
|
None,
|
|
&AtomicBool::new(false),
|
|
)
|
|
.unwrap();
|
|
|
|
let counter = HardwareCounterCell::new();
|
|
for i in 1..vectors_count {
|
|
let score = encoded.score_internal(0, i as u32, &counter);
|
|
let orginal_score = -dot_similarity(&vector_data[0], &vector_data[i]);
|
|
assert!((score - orginal_score).abs() < error);
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
fn test_u8_large_quantile() {
|
|
let vectors_count = 129;
|
|
let vector_dim = 65;
|
|
let error = vector_dim as f32 * 0.1;
|
|
|
|
let mut rng = rand::rngs::StdRng::seed_from_u64(42);
|
|
let mut vector_data: Vec<Vec<f32>> = Vec::new();
|
|
for _ in 0..vectors_count {
|
|
let vector: Vec<f32> = (0..vector_dim).map(|_| rng.random()).collect();
|
|
vector_data.push(vector);
|
|
}
|
|
let query: Vec<f32> = (0..vector_dim).map(|_| rng.random()).collect();
|
|
|
|
let encoded = EncodedVectorsU8::encode(
|
|
vector_data.iter(),
|
|
Vec::<u8>::new(),
|
|
&VectorParameters {
|
|
dim: vector_dim,
|
|
count: vectors_count,
|
|
distance_type: DistanceType::Dot,
|
|
invert: false,
|
|
},
|
|
Some(1.0 - f32::EPSILON), // almost 1.0 value, but not 1.0
|
|
&AtomicBool::new(false),
|
|
)
|
|
.unwrap();
|
|
let query_u8 = encoded.encode_query(&query);
|
|
|
|
for (index, vector) in vector_data.iter().enumerate() {
|
|
let score = encoded.score_point_simple(&query_u8, index as u32);
|
|
let orginal_score = dot_similarity(&query, vector);
|
|
assert!((score - orginal_score).abs() < error);
|
|
}
|
|
}
|
|
}
|