diskann-disk 0.52.0

DiskANN is a fast approximate nearest neighbor search library for high dimensional data
Documentation 
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

/*
 * Copyright (c) Microsoft Corporation.
 * Licensed under the MIT license.
 */

//! Test-only concrete implementations of [`GraphDataType`].

use diskann_providers::common::MinMax8;

use crate::data_model::{AdHoc, GraphDataType};

/// Graph data with f32 vector and associated data of unit type (empty).
pub type GraphDataF32VectorUnitData = AdHoc<f32>;

/// Graph data with MinMax8 vector and associated data of unit type (empty).
pub type GraphDataMinMaxVectorUnitData = AdHoc<MinMax8>;

/// Graph data with f32 vector and associated data of u32.
pub struct GraphDataF32VectorU32Data {}

impl GraphDataType for GraphDataF32VectorU32Data {
    type VectorIdType = u32;
    type VectorDataType = f32;
    type AssociatedDataType = u32;
}