pub struct RipvecIndex { /* private fields */ }Expand description
Combined orchestrator for the ripvec retrieval pipeline.
Constructed via RipvecIndex::from_root which walks files,
chunks them with ripvec’s chunker, embeds with the static encoder,
and builds the BM25 index.
Implementations§
Source§impl RipvecIndex
impl RipvecIndex
Sourcepub fn from_root(
root: &Path,
encoder: StaticEncoder,
cfg: &SearchConfig,
profiler: &Profiler,
pagerank_lookup: Option<HashMap<String, f32>>,
pagerank_alpha: f32,
) -> Result<Self>
pub fn from_root( root: &Path, encoder: StaticEncoder, cfg: &SearchConfig, profiler: &Profiler, pagerank_lookup: Option<HashMap<String, f32>>, pagerank_alpha: f32, ) -> Result<Self>
Build a RipvecIndex by walking root and indexing every
supported file. Uses encoder.embed_root (ripvec’s chunker +
model2vec encode) and builds a fresh BM25 index over the
resulting chunks.
pagerank_lookup is the optional structural-prior map (file
path → normalized PageRank) used by the final ranking layer;
pass None to disable. pagerank_alpha is the corresponding
boost strength.
§Errors
Returns the underlying error if embed_root fails.
Sourcepub fn embeddings(&self) -> &[Vec<f32>]
pub fn embeddings(&self) -> &[Vec<f32>]
Indexed embeddings (read-only access).
One row per chunk in the same order as chunks.
Each row is L2-normalized, so cosine similarity reduces to a
dot product. Used by callers that need to do their own
similarity arithmetic outside the canonical hybrid search —
find_similar (rank-by-source-embedding) and
find_duplicates (all-pairs cosine).
Sourcepub fn search(
&self,
query: &str,
top_k: usize,
mode: SearchMode,
alpha: Option<f32>,
filter_languages: Option<&[String]>,
filter_paths: Option<&[String]>,
) -> Vec<(usize, f32)>
pub fn search( &self, query: &str, top_k: usize, mode: SearchMode, alpha: Option<f32>, filter_languages: Option<&[String]>, filter_paths: Option<&[String]>, ) -> Vec<(usize, f32)>
Search the index and return ranked (chunk_index, score) pairs.
mode = SearchMode::Hybrid (default) fuses semantic + BM25 via
RRF; Semantic and Keyword use one signal each.
filter_languages and filter_paths build a selector mask
that restricts retrieval to chunks in the named files /
languages.
Trait Implementations§
Source§impl SearchableIndex for RipvecIndex
impl SearchableIndex for RipvecIndex
Source§fn search(
&self,
query_text: &str,
top_k: usize,
mode: SearchMode,
) -> Vec<(usize, f32)>
fn search( &self, query_text: &str, top_k: usize, mode: SearchMode, ) -> Vec<(usize, f32)>
Trait-shape search: text-only, no engine-specific knobs.
The trait surface is the LSP-callers’ common ground. Filters (language, path) and the alpha auto-detect override are not surfaced through the trait because no LSP module uses them.
Source§fn search_from_chunk(
&self,
chunk_idx: usize,
query_text: &str,
top_k: usize,
mode: SearchMode,
) -> Vec<(usize, f32)>
fn search_from_chunk( &self, chunk_idx: usize, query_text: &str, top_k: usize, mode: SearchMode, ) -> Vec<(usize, f32)>
Use chunk chunk_idx’s own embedding as the query vector and
rank everything else by cosine similarity (semantic-only) or
blend with BM25 (hybrid). Falls back to text-only keyword
search when the chunk index is out of range.
Mirrors the [HybridIndex] equivalent so goto_definition
and goto_implementation work identically across engines.
Auto Trait Implementations§
impl !Freeze for RipvecIndex
impl !RefUnwindSafe for RipvecIndex
impl Send for RipvecIndex
impl Sync for RipvecIndex
impl Unpin for RipvecIndex
impl UnsafeUnpin for RipvecIndex
impl UnwindSafe for RipvecIndex
Blanket Implementations§
Source§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
Source§type ArchivedMetadata = ()
type ArchivedMetadata = ()
Source§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be
downcast into Box<dyn ConcreteType> where ConcreteType implements Trait.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait> (where Trait: Downcast) to Rc<Any>, which can then be further
downcast into Rc<ConcreteType> where ConcreteType implements Trait.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.Source§impl<T> DowncastSend for T
impl<T> DowncastSend for T
Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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 moreSource§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
Source§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
Source§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
Source§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
Source§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
out indicating that a T is niched.