Struct autd3_driver :: datagram :: Group Copy item path

impl<K, FK, F> Group<K, FK, F>
where K: Hash + Eq + Clone + Debug + Send + Sync, FK: Fn(&Transducer) -> Option<K> + Send + Sync, F: Fn(&Device) -> FK + Send + Sync,

pub const fn parallel(&self) -> bool

impl<K, FK, F> Group<K, FK, F>
where K: Hash + Eq + Clone + Debug + Send + Sync, FK: Fn(&Transducer) -> Option<K> + Send + Sync, F: Fn(&Device) -> FK + Send + Sync,

pub const fn with_parallel(self, parallel: bool) -> Self

impl<K, FK, F> Group<K, FK, F>
where K: Hash + Eq + Clone + Debug + Send + Sync, FK: Fn(&Transducer) -> Option<K> + Send + Sync, F: Fn(&Device) -> FK + Send + Sync,

pub fn new(f: F) -> Self

impl<K, FK, F> Group<K, FK, F>
where K: Hash + Eq + Clone + Debug + Send + Sync, FK: Fn(&Transducer) -> Option<K> + Send + Sync, F: Fn(&Device) -> FK + Send + Sync,

pub fn set(self, key: K, gain: impl Gain + Send + Sync + 'static) -> Self

Trait Implementations§

impl<K, FK, F> Datagram for Group<K, FK, F>
where K: Hash + Eq + Clone + Debug + Send + Sync, FK: Fn(&Transducer) -> Option<K> + Send + Sync, F: Fn(&Device) -> FK + Send + Sync,

type G = GainOperationGenerator<Group<K, FK, F>>

fn operation_generator( self, geometry: &Geometry, ) -> Result<Self::G, AUTDInternalError>

impl<K, FK, F> DatagramS for Group<K, FK, F>
where K: Hash + Eq + Clone + Debug + Send + Sync, FK: Fn(&Transducer) -> Option<K> + Send + Sync, F: Fn(&Device) -> FK + Send + Sync,

type G = GainOperationGenerator<Group<K, FK, F>>

fn operation_generator_with_segment( self, geometry: &Geometry, segment: Segment, transition: bool, ) -> Result<Self::G, AUTDInternalError>

fn trace(&self, geometry: &Geometry)

fn timeout(&self) -> Option<Duration>

fn parallel_threshold(&self) -> Option<usize>

impl<K, FK, F> Gain for Group<K, FK, F>
where K: Hash + Eq + Clone + Debug + Send + Sync, FK: Fn(&Transducer) -> Option<K> + Send + Sync, F: Fn(&Device) -> FK + Send + Sync,

fn calc(&self, geometry: &Geometry) -> GainCalcResult<'_>

fn trace(&self, geometry: &Geometry)

fn calc_with_filter<'a>( &'a self, geometry: &Geometry, _filter: HashMap<usize, BitVec<u32>>, ) -> GainCalcResult<'a>

fn transform<'a, D: Into<Drive>, FT: Fn(&Transducer) -> D + Sync + Send + 'static, F: Fn(&Device) -> FT + 'a>( f: F, ) -> Box<dyn Fn(&Device) -> Box<dyn Fn(&Transducer) -> Drive + Sync + Send> + 'a>
where Self: Sized,

impl<K, FK, F> IntoCache<Group<K, FK, F>> for Group<K, FK, F>
where K: Hash + Eq + Clone + Debug + Send + Sync, FK: Fn(&Transducer) -> Option<K> + Send + Sync, F: Fn(&Device) -> FK + Send + Sync,

fn with_cache(self) -> GainCache<Self>

impl<K, FK, F> IntoTransform<Group<K, FK, F>> for Group<K, FK, F>
where K: Hash + Eq + Clone + Debug + Send + Sync, FK: Fn(&Transducer) -> Option<K> + Send + Sync, F: Fn(&Device) -> FK + Send + Sync,

fn with_transform<GainTransformD: Into<Drive>, GainTransformFT: Fn(&Transducer, Drive) -> GainTransformD + Send + Sync, GainTransformF: Fn(&Device) -> GainTransformFT>( self, f: GainTransformF, ) -> GainTransform<Self, GainTransformD, GainTransformFT, GainTransformF>

Auto Trait Implementations§

impl<K, FK, F> Freeze for Group<K, FK, F>
where F: Freeze,

impl<K, FK, F> !RefUnwindSafe for Group<K, FK, F>

impl<K, FK, F> Send for Group<K, FK, F>

impl<K, FK, F> Sync for Group<K, FK, F>

impl<K, FK, F> Unpin for Group<K, FK, F>
where F: Unpin, K: Unpin,

impl<K, FK, F> !UnwindSafe for Group<K, FK, F>

Blanket Implementations§

impl<T> Any for T
where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

impl<T> Borrow<T> for T
where T: ?Sized,

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

impl<T> BorrowMut<T> for T
where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

impl<T> From<T> for T

fn from(t: T) -> T

Returns the argument unchanged.

impl<T> Instrument for T

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more

impl<T, U> Into for T
where U: From<T>,

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

impl<D> IntoDatagramWithParallelThreshold<D> for D
where D: Datagram,

fn with_parallel_threshold( self, threshold: usize, ) -> DatagramWithParallelThreshold<D>

impl<D> IntoDatagramWithSegment<D> for D
where D: DatagramS,

fn with_segment( self, segment: Segment, transition: bool, ) -> DatagramWithSegment<D>

impl<D> IntoDatagramWithTimeout<D> for D
where D: Datagram,

fn with_timeout(self, timeout: Duration) -> DatagramWithTimeout<D>

impl<T> IntoEither for T

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 more

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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 more

impl<T> Pointable for T

const ALIGN: usize = _

The alignment of pointer.

type Init = T

The type for initializers.

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more

impl<T> Same for T

type Output = T

Should always be Self

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.

impl<T, U> TryFrom for T
where U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

impl<T, U> TryInto for T
where U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

impl<T> WithSubscriber for T

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more