pub struct KnowledgeSearchSelection {
pub candidates: Vec<String>,
pub ranking: Value,
pub coverage: Value,
pub explanations: BTreeMap<String, String>,
}Expand description
Caller-ranked candidates for one ranked-search page. Candidates must be
visible and satisfy the request’s exact filters; no ranking model is implied.
explanations are optional per-hit texts keyed by event ID.
Fields§
§candidates: Vec<String>§ranking: Value§coverage: Value§explanations: BTreeMap<String, String>Trait Implementations§
Source§impl Clone for KnowledgeSearchSelection
impl Clone for KnowledgeSearchSelection
Source§impl Debug for KnowledgeSearchSelection
impl Debug for KnowledgeSearchSelection
Source§impl Default for KnowledgeSearchSelection
impl Default for KnowledgeSearchSelection
Source§impl PartialEq for KnowledgeSearchSelection
impl PartialEq for KnowledgeSearchSelection
impl StructuralPartialEq for KnowledgeSearchSelection
Auto Trait Implementations§
impl Freeze for KnowledgeSearchSelection
impl RefUnwindSafe for KnowledgeSearchSelection
impl Send for KnowledgeSearchSelection
impl Sync for KnowledgeSearchSelection
impl Unpin for KnowledgeSearchSelection
impl UnsafeUnpin for KnowledgeSearchSelection
impl UnwindSafe for KnowledgeSearchSelection
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