Struct SearchHit 

pub struct SearchHit {
    pub conversation_id: String,
    pub title: String,
    pub seq: i64,
    pub snippet: String,
    pub rank: f64,
}

One full-text recall hit from ConversationStore::search (17.3).

rank is the raw FTS5 bm25 score: negative, and smaller (more negative) = better. search returns hits best-first; the value is exposed so 17.4/17.5 callers can show or threshold it. snippet is the matched column’s excerpt (>>>match<<<, …-trimmed) — deliberately the only content returned.

Fields

conversation_id: String

The conversation the matching turn belongs to.

title: String

That conversation’s current title.

seq: i64

The matching turn’s §6 per-writer tick (its position in the chain).

snippet: String

snippet() of the matched column: ±~10 tokens of context around the match, which is wrapped in >>>/<<<; … marks trimmed edges.

rank: f64

Raw bm25 rank (negative; more negative = better match).

Trait Implementations

impl Clone for SearchHit

fn clone(&self) -> SearchHit

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for SearchHit

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for SearchHit

fn eq(&self, other: &SearchHit) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for SearchHit