pub struct AlgorithmListing {
pub id: String,
pub name: String,
pub description: String,
pub author: String,
pub version: String,
pub category: AlgorithmCategory,
pub tags: Vec<String>,
pub min_qubits: usize,
pub source_snippet: String,
}Expand description
A simplified, synchronous listing for an algorithm in the marketplace.
This is a thin wrapper around RegisteredAlgorithm / AlgorithmMetadata
that surfaces only the fields needed by the synchronous API.
Fields§
§id: StringStable, unique identifier for this algorithm (UUID v4 string).
name: StringHuman-readable name.
description: StringShort description.
Author or organization name.
version: StringSemantic version string, e.g. "1.0.0".
category: AlgorithmCategoryHigh-level category.
Free-form tags for search.
min_qubits: usizeMinimum qubit count required to run.
source_snippet: StringQASM3 / pseudo-code source snippet (may be empty for proprietary algorithms).
Trait Implementations§
Source§impl Clone for AlgorithmListing
impl Clone for AlgorithmListing
Source§fn clone(&self) -> AlgorithmListing
fn clone(&self) -> AlgorithmListing
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for AlgorithmListing
impl Debug for AlgorithmListing
Source§impl<'de> Deserialize<'de> for AlgorithmListing
impl<'de> Deserialize<'de> for AlgorithmListing
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Auto Trait Implementations§
impl Freeze for AlgorithmListing
impl RefUnwindSafe for AlgorithmListing
impl Send for AlgorithmListing
impl Sync for AlgorithmListing
impl Unpin for AlgorithmListing
impl UnsafeUnpin for AlgorithmListing
impl UnwindSafe for AlgorithmListing
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> 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.