pub struct MemorySearch {
pub query: Option<String>,
pub tiers: Vec<String>,
pub scope: Option<String>,
pub limit: Option<u64>,
pub pool: Option<u64>,
pub more: bool,
pub items: Vec<MemoryItem>,
}Expand description
membrane.memory.search.v1.
Fields§
§query: Option<String>§tiers: Vec<String>Tier names asked for; empty means every tier.
scope: Option<String>§limit: Option<u64>§pool: Option<u64>Candidates ranked before the tier filter.
more: boolTrue when more memories matched than limit.
items: Vec<MemoryItem>Trait Implementations§
Source§impl Clone for MemorySearch
impl Clone for MemorySearch
Source§impl Debug for MemorySearch
impl Debug for MemorySearch
Source§impl PartialEq for MemorySearch
impl PartialEq for MemorySearch
impl StructuralPartialEq for MemorySearch
Auto Trait Implementations§
impl Forget for MemorySearch
impl Freeze for MemorySearch
impl Move for MemorySearch
impl RefUnwindSafe for MemorySearch
impl Send for MemorySearch
impl Sync for MemorySearch
impl Unpin for MemorySearch
impl UnsafeUnpin for MemorySearch
impl UnwindSafe for MemorySearch
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> 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