Struct AlgorithmMarketplace 

pub struct AlgorithmMarketplace { /* private fields */ }

Lightweight synchronous marketplace facade.

Stores algorithm listings in memory and provides CRUD + search + mock execution without requiring an async runtime.

Implementations

impl AlgorithmMarketplace

pub fn new() -> Self

Create an empty marketplace.

pub fn register_algorithm(&self, algo: AlgorithmListing) -> DeviceResult<()>

Register a new algorithm.

Fails if an algorithm with the same id is already registered.

pub fn search_algorithms( &self, query: &AlgorithmQuery, ) -> DeviceResult<Vec<AlgorithmListing>>

Search for algorithms matching query.

Returns a cloned Vec so the caller does not need to hold any locks.

pub fn get_algorithm(&self, id: &str) -> DeviceResult<Option<AlgorithmListing>>

Retrieve an algorithm by its exact identifier.

pub fn deregister_algorithm(&self, id: &str) -> DeviceResult<()>

Remove a previously registered algorithm.

pub fn execute_algorithm( &self, id: &str, params: AlgorithmParams, ) -> DeviceResult<AlgorithmResult>

Execute an algorithm by ID with the given parameters.

This is a mock executor: it simulates a uniform distribution over all 2^n bitstrings (where n is min_qubits for the listing) and records counts that sum to params.shots. A real implementation would dispatch to a backend simulator or quantum hardware.

Trait Implementations

impl Default for AlgorithmMarketplace

fn default() -> Self

Returns the “default value” for a type.