pub struct AlgorithmRegistry { /* private fields */ }Expand description
Algorithm registry for managing all registered algorithms
Implementations§
Source§impl AlgorithmRegistry
impl AlgorithmRegistry
Sourcepub fn new(config: &RegistryConfig) -> DeviceResult<Self>
pub fn new(config: &RegistryConfig) -> DeviceResult<Self>
Create a new algorithm registry
Sourcepub async fn initialize(&self) -> DeviceResult<()>
pub async fn initialize(&self) -> DeviceResult<()>
Initialize the registry
Sourcepub async fn register_algorithm(
&mut self,
registration: AlgorithmRegistration,
) -> DeviceResult<String>
pub async fn register_algorithm( &mut self, registration: AlgorithmRegistration, ) -> DeviceResult<String>
Register a new algorithm
Sourcepub async fn get_algorithm(
&self,
algorithm_id: &str,
) -> DeviceResult<Option<RegisteredAlgorithm>>
pub async fn get_algorithm( &self, algorithm_id: &str, ) -> DeviceResult<Option<RegisteredAlgorithm>>
Get algorithm by ID
Sourcepub async fn get_algorithm_count(&self) -> DeviceResult<usize>
pub async fn get_algorithm_count(&self) -> DeviceResult<usize>
Get algorithm count
Sourcepub async fn search_by_keyword(
&self,
keyword: &str,
) -> DeviceResult<Vec<String>>
pub async fn search_by_keyword( &self, keyword: &str, ) -> DeviceResult<Vec<String>>
Search algorithms by keyword
Sourcepub async fn get_by_category(
&self,
category: &AlgorithmCategory,
) -> DeviceResult<Vec<String>>
pub async fn get_by_category( &self, category: &AlgorithmCategory, ) -> DeviceResult<Vec<String>>
Get algorithms by category
Sourcepub async fn update_performance_data(
&mut self,
algorithm_id: &str,
benchmark: PerformanceBenchmark,
) -> DeviceResult<()>
pub async fn update_performance_data( &mut self, algorithm_id: &str, benchmark: PerformanceBenchmark, ) -> DeviceResult<()>
Update algorithm performance data
Auto Trait Implementations§
impl Freeze for AlgorithmRegistry
impl RefUnwindSafe for AlgorithmRegistry
impl Send for AlgorithmRegistry
impl Sync for AlgorithmRegistry
impl Unpin for AlgorithmRegistry
impl UnwindSafe for AlgorithmRegistry
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> 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>
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
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.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.