pub struct StrangeLoop<R: Reasoner, C: Critic, F: Reflector> { /* private fields */ }Expand description
Main strange loop execution engine
Implementations§
Source§impl<R: Reasoner, C: Critic, F: Reflector> StrangeLoop<R, C, F>
impl<R: Reasoner, C: Critic, F: Reflector> StrangeLoop<R, C, F>
Sourcepub fn new(reasoner: R, critic: C, reflector: F, config: LoopConfig) -> Self
pub fn new(reasoner: R, critic: C, reflector: F, config: LoopConfig) -> Self
Create a new strange loop
Sourcepub fn run(&mut self, context: &mut Context) -> Result<LoopResult>
pub fn run(&mut self, context: &mut Context) -> Result<LoopResult>
Run the strange loop until convergence or timeout
Sourcepub fn iteration_count(&self) -> usize
pub fn iteration_count(&self) -> usize
Get current iteration count
Sourcepub fn config(&self) -> &LoopConfig
pub fn config(&self) -> &LoopConfig
Get configuration
Auto Trait Implementations§
impl<R, C, F> Freeze for StrangeLoop<R, C, F>
impl<R, C, F> !RefUnwindSafe for StrangeLoop<R, C, F>
impl<R, C, F> Send for StrangeLoop<R, C, F>
impl<R, C, F> Sync for StrangeLoop<R, C, F>
impl<R, C, F> Unpin for StrangeLoop<R, C, F>
impl<R, C, F> !UnwindSafe for StrangeLoop<R, C, F>
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> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.