pub struct CognitionLoop { /* private fields */ }Expand description
The cognition loop. Spawns a background thread that periodically scans the triple store for patterns, gaps, and analogies.
Implementations§
Source§impl CognitionLoop
impl CognitionLoop
Sourcepub fn start(
atom_memory: Arc<AtomMemory>,
triple_store: Arc<TripleStore>,
config: CognitionConfig,
) -> Self
pub fn start( atom_memory: Arc<AtomMemory>, triple_store: Arc<TripleStore>, config: CognitionConfig, ) -> Self
Start the cognition loop in a background thread.
The loop acquires read-only references to the atom memory and triple store. It does NOT hold locks across cycles; it snapshots and releases.
Sourcepub fn state(&self) -> &Arc<CognitionState> ⓘ
pub fn state(&self) -> &Arc<CognitionState> ⓘ
Access the shared state (insights, cycle count, etc.).
Sourcepub fn run_once(
atom_memory: &AtomMemory,
triple_store: &TripleStore,
config: &CognitionConfig,
) -> Vec<Insight>
pub fn run_once( atom_memory: &AtomMemory, triple_store: &TripleStore, config: &CognitionConfig, ) -> Vec<Insight>
Run a single cognition cycle synchronously (for testing).
Trait Implementations§
Source§impl Drop for CognitionLoop
impl Drop for CognitionLoop
Auto Trait Implementations§
impl !RefUnwindSafe for CognitionLoop
impl !UnwindSafe for CognitionLoop
impl Freeze for CognitionLoop
impl Send for CognitionLoop
impl Sync for CognitionLoop
impl Unpin for CognitionLoop
impl UnsafeUnpin for CognitionLoop
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> 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§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.