pub struct MPICommunicator { /* private fields */ }Expand description
MPI communicator abstraction for quantum operations
Implementations§
Source§impl MPICommunicator
impl MPICommunicator
Sourcepub fn new() -> QuantRS2Result<Self>
pub fn new() -> QuantRS2Result<Self>
Create a new MPI communicator
Sourcepub fn with_config(rank: usize, size: usize, backend: MPIBackend) -> Self
pub fn with_config(rank: usize, size: usize, backend: MPIBackend) -> Self
Create communicator with specific configuration
Sourcepub fn barrier(&self) -> QuantRS2Result<()>
pub fn barrier(&self) -> QuantRS2Result<()>
Barrier synchronization: every rank sharing this communicator’s
SimulatedMPIState must call this before any of them proceeds.
Sourcepub fn sendrecv(
&self,
send_data: &[Complex64],
partner: usize,
) -> QuantRS2Result<Vec<Complex64>>
pub fn sendrecv( &self, send_data: &[Complex64], partner: usize, ) -> QuantRS2Result<Vec<Complex64>>
Send and receive data with a partner rank (real rendezvous exchange for the Simulated backend).
Sourcepub fn gather<T: Clone + Send + 'static>(
&self,
local_data: &[T],
root: usize,
) -> QuantRS2Result<Vec<T>>
pub fn gather<T: Clone + Send + 'static>( &self, local_data: &[T], root: usize, ) -> QuantRS2Result<Vec<T>>
Gather data from all ranks to root (root receives every rank’s
contribution concatenated in rank order; other ranks get their own
data back, matching real MPI_Gather semantics).
Trait Implementations§
Auto Trait Implementations§
impl Freeze for MPICommunicator
impl RefUnwindSafe for MPICommunicator
impl Send for MPICommunicator
impl Sync for MPICommunicator
impl Unpin for MPICommunicator
impl UnsafeUnpin for MPICommunicator
impl UnwindSafe for MPICommunicator
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
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
impl<T> Read<Exclusive, BecauseExclusive> 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.