Skip to main content

VectorStoreWriter

Struct VectorStoreWriter 

Source
pub struct VectorStoreWriter { /* private fields */ }
Expand description

Stages appends, deletes, and compactions of one store, and publishes them together on commit.

Nothing a reader sees changes before a commit. Appending a document that is already present replaces it; deleting one that is not present does nothing. A commit with nothing staged still advances the time readers report as fresh, so an idle writer can keep a store within a reader’s allowed lag. One writer writes a store at a time.

Implementations§

Source§

impl VectorStoreWriter

Source

pub fn create( path: impl AsRef<Path>, encoding: Encoding, corpus: impl Into<String>, representation: Representation, ) -> Result<Self>

Writes an empty store at path, which must not exist.

Examples found in repository?
examples/stored_maxsim.rs (line 84)
76fn main() -> Result<()> {
77    let representation = Representation::new("toy-encoder", "1", DIMENSION, true)?;
78    let directory = std::env::temp_dir().join(format!("lateweave-example-{}", std::process::id()));
79    let path = directory.join("vectors");
80
81    // The indexing side: one token per word, the axis standing in for what
82    // a real encoder produces.
83    let mut writer =
84        VectorStoreWriter::create(&path, Encoding::Float32, "fruit", representation.clone())?;
85    let embeddings = [unit(0), unit(2), unit(1), unit(2), unit(0), unit(3)].concat();
86    writer.append(["a", "b", "c"], &embeddings, DIMENSION, &[2, 2, 2], None)?;
87    writer.commit()?;
88
89    // The serving side.
90    let gatherer = TermGatherer {
91        requires: BTreeMap::new(),
92        documents: vec![("a", "red apple"), ("b", "green apple"), ("c", "red car")],
93        indexed_at: SystemTime::now(),
94    };
95    let store = Arc::new(VectorStore::open(&path)?) as Arc<dyn MultiVectorSource>;
96    let reranker = MaxSimReranker::new([store], DEFAULT_FEATURE)?;
97    let pipeline = SearchPipeline::new(Arc::new(gatherer), Some(Arc::new(reranker)));
98
99    let query = Query::new("apple").with_feature(
100        DEFAULT_FEATURE,
101        Feature::lazy(representation, || {
102            TokenMatrix::new(unit(1).to_vec(), DIMENSION)
103        }),
104    );
105    let request = SearchRequest::new(10, 2).with_budget(ResourceBudget::new(4096, 64, Some(1))?);
106
107    let print = |label: &str| -> Result<()> {
108        let result = pipeline.search(&query, &request)?;
109        println!("{label}:");
110        for document in &result.documents {
111            println!(
112                "  #{} {:?} score {}",
113                document.rank, document.key, document.score
114            );
115        }
116        println!("  {:?}", result.diagnostics);
117        Ok(())
118    };
119    print("before the delete")?;
120
121    // The indexing side deletes "b" from the vectors; the gatherer still
122    // finds it, and the pipeline drops it.
123    writer.delete(["b"]);
124    writer.commit()?;
125    print("after the delete")?;
126
127    std::fs::remove_dir_all(directory)?;
128    Ok(())
129}
Source

pub fn open(path: impl AsRef<Path>) -> Result<Self>

Source

pub fn path(&self) -> &Path

Source

pub fn corpus(&self) -> &str

Source

pub fn encoding(&self) -> Encoding

Source

pub fn representation(&self) -> &Representation

Source

pub fn append<I>( &mut self, document_ids: I, embeddings: &[f32], dimension: usize, lengths: &[usize], threads: Option<usize>, ) -> Result<()>
where I: IntoIterator, I::Item: Into<Arc<str>>,

Stages documents as a new segment. embeddings is a row-major float32 [sum(lengths), dimension] matrix packed by document in the order of document_ids.

Examples found in repository?
examples/stored_maxsim.rs (line 86)
76fn main() -> Result<()> {
77    let representation = Representation::new("toy-encoder", "1", DIMENSION, true)?;
78    let directory = std::env::temp_dir().join(format!("lateweave-example-{}", std::process::id()));
79    let path = directory.join("vectors");
80
81    // The indexing side: one token per word, the axis standing in for what
82    // a real encoder produces.
83    let mut writer =
84        VectorStoreWriter::create(&path, Encoding::Float32, "fruit", representation.clone())?;
85    let embeddings = [unit(0), unit(2), unit(1), unit(2), unit(0), unit(3)].concat();
86    writer.append(["a", "b", "c"], &embeddings, DIMENSION, &[2, 2, 2], None)?;
87    writer.commit()?;
88
89    // The serving side.
90    let gatherer = TermGatherer {
91        requires: BTreeMap::new(),
92        documents: vec![("a", "red apple"), ("b", "green apple"), ("c", "red car")],
93        indexed_at: SystemTime::now(),
94    };
95    let store = Arc::new(VectorStore::open(&path)?) as Arc<dyn MultiVectorSource>;
96    let reranker = MaxSimReranker::new([store], DEFAULT_FEATURE)?;
97    let pipeline = SearchPipeline::new(Arc::new(gatherer), Some(Arc::new(reranker)));
98
99    let query = Query::new("apple").with_feature(
100        DEFAULT_FEATURE,
101        Feature::lazy(representation, || {
102            TokenMatrix::new(unit(1).to_vec(), DIMENSION)
103        }),
104    );
105    let request = SearchRequest::new(10, 2).with_budget(ResourceBudget::new(4096, 64, Some(1))?);
106
107    let print = |label: &str| -> Result<()> {
108        let result = pipeline.search(&query, &request)?;
109        println!("{label}:");
110        for document in &result.documents {
111            println!(
112                "  #{} {:?} score {}",
113                document.rank, document.key, document.score
114            );
115        }
116        println!("  {:?}", result.diagnostics);
117        Ok(())
118    };
119    print("before the delete")?;
120
121    // The indexing side deletes "b" from the vectors; the gatherer still
122    // finds it, and the pipeline drops it.
123    writer.delete(["b"]);
124    writer.commit()?;
125    print("after the delete")?;
126
127    std::fs::remove_dir_all(directory)?;
128    Ok(())
129}
Source

pub fn delete<I>(&mut self, document_ids: I) -> usize
where I: IntoIterator, I::Item: AsRef<str>,

Stages the deletion of every present document among document_ids, returning how many there were.

Examples found in repository?
examples/stored_maxsim.rs (line 123)
76fn main() -> Result<()> {
77    let representation = Representation::new("toy-encoder", "1", DIMENSION, true)?;
78    let directory = std::env::temp_dir().join(format!("lateweave-example-{}", std::process::id()));
79    let path = directory.join("vectors");
80
81    // The indexing side: one token per word, the axis standing in for what
82    // a real encoder produces.
83    let mut writer =
84        VectorStoreWriter::create(&path, Encoding::Float32, "fruit", representation.clone())?;
85    let embeddings = [unit(0), unit(2), unit(1), unit(2), unit(0), unit(3)].concat();
86    writer.append(["a", "b", "c"], &embeddings, DIMENSION, &[2, 2, 2], None)?;
87    writer.commit()?;
88
89    // The serving side.
90    let gatherer = TermGatherer {
91        requires: BTreeMap::new(),
92        documents: vec![("a", "red apple"), ("b", "green apple"), ("c", "red car")],
93        indexed_at: SystemTime::now(),
94    };
95    let store = Arc::new(VectorStore::open(&path)?) as Arc<dyn MultiVectorSource>;
96    let reranker = MaxSimReranker::new([store], DEFAULT_FEATURE)?;
97    let pipeline = SearchPipeline::new(Arc::new(gatherer), Some(Arc::new(reranker)));
98
99    let query = Query::new("apple").with_feature(
100        DEFAULT_FEATURE,
101        Feature::lazy(representation, || {
102            TokenMatrix::new(unit(1).to_vec(), DIMENSION)
103        }),
104    );
105    let request = SearchRequest::new(10, 2).with_budget(ResourceBudget::new(4096, 64, Some(1))?);
106
107    let print = |label: &str| -> Result<()> {
108        let result = pipeline.search(&query, &request)?;
109        println!("{label}:");
110        for document in &result.documents {
111            println!(
112                "  #{} {:?} score {}",
113                document.rank, document.key, document.score
114            );
115        }
116        println!("  {:?}", result.diagnostics);
117        Ok(())
118    };
119    print("before the delete")?;
120
121    // The indexing side deletes "b" from the vectors; the gatherer still
122    // finds it, and the pipeline drops it.
123    writer.delete(["b"]);
124    writer.commit()?;
125    print("after the delete")?;
126
127    std::fs::remove_dir_all(directory)?;
128    Ok(())
129}
Source

pub fn compact(&mut self) -> Result<()>

Stages the store’s present documents as one segment, dropping deleted and replaced rows.

Source

pub fn commit(&mut self) -> Result<SystemTime>

Publishes everything staged, and returns the commit time readers report for it. Files no longer named are then removed.

Examples found in repository?
examples/stored_maxsim.rs (line 87)
76fn main() -> Result<()> {
77    let representation = Representation::new("toy-encoder", "1", DIMENSION, true)?;
78    let directory = std::env::temp_dir().join(format!("lateweave-example-{}", std::process::id()));
79    let path = directory.join("vectors");
80
81    // The indexing side: one token per word, the axis standing in for what
82    // a real encoder produces.
83    let mut writer =
84        VectorStoreWriter::create(&path, Encoding::Float32, "fruit", representation.clone())?;
85    let embeddings = [unit(0), unit(2), unit(1), unit(2), unit(0), unit(3)].concat();
86    writer.append(["a", "b", "c"], &embeddings, DIMENSION, &[2, 2, 2], None)?;
87    writer.commit()?;
88
89    // The serving side.
90    let gatherer = TermGatherer {
91        requires: BTreeMap::new(),
92        documents: vec![("a", "red apple"), ("b", "green apple"), ("c", "red car")],
93        indexed_at: SystemTime::now(),
94    };
95    let store = Arc::new(VectorStore::open(&path)?) as Arc<dyn MultiVectorSource>;
96    let reranker = MaxSimReranker::new([store], DEFAULT_FEATURE)?;
97    let pipeline = SearchPipeline::new(Arc::new(gatherer), Some(Arc::new(reranker)));
98
99    let query = Query::new("apple").with_feature(
100        DEFAULT_FEATURE,
101        Feature::lazy(representation, || {
102            TokenMatrix::new(unit(1).to_vec(), DIMENSION)
103        }),
104    );
105    let request = SearchRequest::new(10, 2).with_budget(ResourceBudget::new(4096, 64, Some(1))?);
106
107    let print = |label: &str| -> Result<()> {
108        let result = pipeline.search(&query, &request)?;
109        println!("{label}:");
110        for document in &result.documents {
111            println!(
112                "  #{} {:?} score {}",
113                document.rank, document.key, document.score
114            );
115        }
116        println!("  {:?}", result.diagnostics);
117        Ok(())
118    };
119    print("before the delete")?;
120
121    // The indexing side deletes "b" from the vectors; the gatherer still
122    // finds it, and the pipeline drops it.
123    writer.delete(["b"]);
124    writer.commit()?;
125    print("after the delete")?;
126
127    std::fs::remove_dir_all(directory)?;
128    Ok(())
129}

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = !

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, !>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.