pub struct CandidateSearchOutcome {
pub paths: Vec<PathResult>,
pub results: Vec<SearchResult>,
}Expand description
Tree paths and flattened ranked nodes produced by one in-memory search.
Fields§
§paths: Vec<PathResult>Highest-ranked root-to-answer tree paths; empty in Flat mode.
results: Vec<SearchResult>Stable transport-ready node results after mode-specific ranking.
Trait Implementations§
Source§impl Clone for CandidateSearchOutcome
impl Clone for CandidateSearchOutcome
Auto Trait Implementations§
impl Freeze for CandidateSearchOutcome
impl RefUnwindSafe for CandidateSearchOutcome
impl Send for CandidateSearchOutcome
impl Sync for CandidateSearchOutcome
impl Unpin for CandidateSearchOutcome
impl UnsafeUnpin for CandidateSearchOutcome
impl UnwindSafe for CandidateSearchOutcome
Blanket Implementations§
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
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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> ⓘ
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 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> ⓘ
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