pub struct AppState {Show 21 fields
pub store: Arc<dyn StoreAdmin>,
pub sqlite: Arc<SqliteStore>,
pub indexes: Option<Arc<RwLock<Indexes>>>,
pub raw_index: Option<Arc<RwLock<RawIndex>>>,
pub raw_coverage: Option<Arc<RawCoverage>>,
pub archive: Option<Arc<TranscriptArchive>>,
pub reranker: Option<Arc<Reranker>>,
pub tunables: RetrievalTunables,
pub embedder: Option<Arc<Embedder>>,
pub machine: MachineIdentity,
pub maintenance: Arc<RwLock<Option<MaintenanceSummary>>>,
pub repair_tx: Option<Sender<DrainRequest>>,
pub near_duplicate_threshold: f32,
pub near_duplicates: Arc<RwLock<Option<NearDupCount>>>,
pub health: Arc<Health>,
pub gate: Arc<WriteGate>,
pub clock: Arc<ClockGate>,
pub data_dir: PathBuf,
pub pairing: Arc<Pairing>,
pub bootstrap: Arc<Bootstrap>,
pub device_access: Arc<DeviceAccess>,
}Fields§
§store: Arc<dyn StoreAdmin>§sqlite: Arc<SqliteStore>Same store as store: Retriever::candidates and the outbox drain need
the concrete SqliteStore, which the trait object cannot provide.
indexes: Option<Arc<RwLock<Indexes>>>A read-only Indexes handle shared by every recall call; searches take
the RwLock read side, which does not block other readers. The drain
loop owns a separate read-write Indexes and only reaches into this
lock’s write side briefly, to call reload_view after persisting.
None when index open/rebuild failed; recall then uses the legacy engine.
raw_index: Option<Arc<RwLock<RawIndex>>>Archived raws and transcript passages, searched only when nothing in
indexes clears the abstention bar. The raw index thread writes it.
raw_coverage: Option<Arc<RawCoverage>>The raw index’s age bound and what it left out, for status.
archive: Option<Arc<TranscriptArchive>>Redacted copies of transcripts, which a delete removes; None when the archive directory could not be opened.
reranker: Option<Arc<Reranker>>§tunables: RetrievalTunables§embedder: Option<Arc<Embedder>>§machine: MachineIdentity§maintenance: Arc<RwLock<Option<MaintenanceSummary>>>The most recent repair, scheduled or requested; /v1/status reports
it without recomputing anything.
repair_tx: Option<Sender<DrainRequest>>Hands a repair request to the drain thread, the one owner of the writable indexes, so an on-demand repair never races the scheduled one. None when the indexes failed to open and no drain thread exists; the repair route then runs against the store alone.
near_duplicate_threshold: f32[distill] near_duplicate_threshold: the default for the
near-duplicates route and the threshold status counts at.
near_duplicates: Arc<RwLock<Option<NearDupCount>>>The last near-duplicate count at near_duplicate_threshold, from a
listing or a repair. Counting is a grouping pass over every live
distillate (seconds on the Pi), so status reports this instead.
health: Arc<Health>§gate: Arc<WriteGate>§clock: Arc<ClockGate>§data_dir: PathBufHolds the device key, which opens the identity key envelopes that seal and open sync records.
pairing: Arc<Pairing>§bootstrap: Arc<Bootstrap>§device_access: Arc<DeviceAccess>Auto Trait Implementations§
impl !RefUnwindSafe for AppState
impl !UnwindSafe for AppState
impl Forget for AppState
impl Freeze for AppState
impl Move for AppState
impl Send for AppState
impl Sync for AppState
impl Unpin for AppState
impl UnsafeUnpin for AppState
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
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
impl<T> Fruit 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 more