proximity-cache 0.1.1

Experiments on approximate vector search in high-dimensional spaces
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
26

use std::{
    cell::RefCell,
    rc::{Rc, Weak},
};

pub(crate) type SharedNode<K, V> = Rc<RefCell<Node<K, V>>>;
pub(crate) type WeakSharedNode<K, V> = Weak<RefCell<Node<K, V>>>;

#[derive(Debug)]
pub struct Node<K, V> {
    pub(crate) key: K,
    pub(crate) value: V,
    pub(crate) prev: Option<WeakSharedNode<K, V>>,
    pub(crate) next: Option<SharedNode<K, V>>,
}

impl<K, V> Node<K, V> {
    pub fn new(key: K, value: V) -> Rc<RefCell<Self>> {
        Rc::new(RefCell::new(Node {
            key,
            value,
            prev: None,
            next: None,
        }))
    }
}