Fixed proximity search

shinkai-libs/shinkai-vector-resources/src/document_resource.rs

@@ -3,7 +3,7 @@ use crate::data_tags::{DataTag, DataTagIndex};
 use crate::embeddings::Embedding;
 use crate::model_type::{EmbeddingModelType, RemoteModel};
 use crate::resource_errors::VectorResourceError;
-use crate::vector_resource::{DataChunk, DataContent, RetrievedDataChunk, VectorResource};
+use crate::vector_resource::{DataChunk, DataContent, RetrievedDataChunk, TraversalMethod, VectorResource};
 use serde_json;
 use std::collections::HashMap;
 
@@ -140,12 +140,14 @@ impl DocumentVectorResource {
     /// Performs a vector search using a query embedding, and then
     /// fetches a specific number of DataChunks below and above the most
     /// similar DataChunk.
+    ///
+    /// Does not traverse past the top level.
     pub fn vector_search_proximity(
         &self,
         query: Embedding,
         proximity_window: u64,
     ) -> Result<Vec<RetrievedDataChunk>, VectorResourceError> {
-        let search_results = self.vector_search(query, 1);
+        let search_results = self.vector_search_with_traversal(query, 1, &TraversalMethod::UntilDepth(0));
         let most_similar_chunk = search_results.first().ok_or(VectorResourceError::VectorResourceEmpty)?;
         let most_similar_id = most_similar_chunk
             .chunk

shinkai-libs/shinkai-vector-resources/src/vector_resource.rs

@@ -17,6 +17,7 @@ pub enum TraversalMethod {
     Efficient,
     /// Efficiently traverses until (and including) the specified depth is hit (or until there are no more levels to go).
     /// Will return BaseVectorResource DataChunks if they are the highest scored at the specified depth.
+    /// Top level starts at 0, and so first level of depth into internal BaseVectorResources is thus 1.
     UntilDepth(u64),
     /// Does not skip over any DataChunks, traverses through all levels.
     Exhaustive,