pub struct MethodStream<'a, I, P = NoProgress, A = I, L = Root, W = fn(I) -> A> { /* private fields */ }Implementations§
Source§impl<'a, I, P, A> MethodStream<'a, I, P, A>
impl<'a, I, P, A> MethodStream<'a, I, P, A>
Sourcepub fn new(
items: RawItemStream<'a>,
item: Decoder<I>,
event: fn(I) -> A,
) -> Self
pub fn new( items: RawItemStream<'a>, item: Decoder<I>, event: fn(I) -> A, ) -> Self
Type a transport’s wire items as one method’s stream: item decodes
each data frame’s content, event wraps an item in the
aggregate (TicketsEvent::List) for events.
Sourcepub fn call<T>(
transport: &'a T,
method: MethodRef,
params: Result<Value, ClientError>,
item: Decoder<I>,
event: fn(I) -> A,
) -> Self
pub fn call<T>( transport: &'a T, method: MethodRef, params: Result<Value, ClientError>, item: Decoder<I>, event: fn(I) -> A, ) -> Self
Call method on transport with params and type the answer — what
a generated client’s many-item method is. When params is an Err
(an argument that would not encode) nothing is sent and the stream
yields that error once.
Sourcepub fn call_with_input<T>(
transport: &'a T,
method: MethodRef,
params: Result<Value, ClientError>,
input: InputItems<'a>,
item: Decoder<I>,
event: fn(I) -> A,
) -> Self
pub fn call_with_input<T>( transport: &'a T, method: MethodRef, params: Result<Value, ClientError>, input: InputItems<'a>, item: Decoder<I>, event: fn(I) -> A, ) -> Self
BIDIR-6: call, for a method with an input half:
input is sent under the callee’s credit as the stream is read.
Sourcepub fn call_as<T, W>(
transport: &'a T,
method: MethodRef,
params: Result<Value, ClientError>,
item: Decoder<I>,
event: W,
) -> MethodStream<'a, I, P, A, Root, W>
pub fn call_as<T, W>( transport: &'a T, method: MethodRef, params: Result<Value, ClientError>, item: Decoder<I>, event: W, ) -> MethodStream<'a, I, P, A, Root, W>
Source§impl<'a, I, P, A> MethodStream<'a, I, P, A>
impl<'a, I, P, A> MethodStream<'a, I, P, A>
Sourcepub fn call_as_with_input<T, W>(
transport: &'a T,
method: MethodRef,
params: Result<Value, ClientError>,
input: InputItems<'a>,
item: Decoder<I>,
event: W,
) -> MethodStream<'a, I, P, A, Root, W>
pub fn call_as_with_input<T, W>( transport: &'a T, method: MethodRef, params: Result<Value, ClientError>, input: InputItems<'a>, item: Decoder<I>, event: W, ) -> MethodStream<'a, I, P, A, Root, W>
call_as for a method with an input half
(BIDIR-6, RETURNS-46): input is sent under the callee’s credit as
the stream is read.
Source§impl<'a, I, P, A, L, W> MethodStream<'a, I, P, A, L, W>
impl<'a, I, P, A, L, W> MethodStream<'a, I, P, A, L, W>
Sourcepub fn lifted<L2: Lift<A>>(self, lift: L2) -> MethodStream<'a, I, P, A, L2, W>
pub fn lifted<L2: Lift<A>>(self, lift: L2) -> MethodStream<'a, I, P, A, L2, W>
RETURNS-46: the same call, its events lifted by
lift into an enclosing aggregate — what a client reached through a
parent’s accessor does with every many-item call, so the call’s
events are the parent’s (TreeEvent::Branch(BranchEvent::Grow(..))).
Sourcepub fn with_progress(self) -> WithProgress<'a, I, P>where
P: DeserializeOwned,
pub fn with_progress(self) -> WithProgress<'a, I, P>where
P: DeserializeOwned,
Opt in to progress: the same call, yielding each item as
Frame::Item and each progress frame, decoded as P, as
Frame::Progress — in arrival order.
For a method that declares no progress P is NoProgress, and the
stream yields only items.
Sourcepub fn events(self) -> Events<'a, L::Out>where
L: Lift<A>,
W: EventOf<I, Aggregate = A> + Clone + MaybeSendSync + 'a,
I: 'a,
P: 'a,
A: 'a,
L::Out: 'a,
pub fn events(self) -> Events<'a, L::Out>where
L: Lift<A>,
W: EventOf<I, Aggregate = A> + Clone + MaybeSendSync + 'a,
I: 'a,
P: 'a,
A: 'a,
L::Out: 'a,
The same call as the activation’s aggregate: each item i becomes
{Ns}Event::M(i); progress is dropped (the aggregate carries items
only). Every method’s events() has the same type, so several calls
merge into one listener with ordinary stream plumbing:
let mut all = futures::stream::select_all([
client.watch(None).events(),
client.list(None, None).events(),
]);
while let Some(ev) = all.next().await { state.reduce(ev?) } // ev: TicketsEventTrait Implementations§
Source§impl<I, P, A, L, W> Debug for MethodStream<'_, I, P, A, L, W>
impl<I, P, A, L, W> Debug for MethodStream<'_, I, P, A, L, W>
Source§impl<I, P, A, L, W> FusedStream for MethodStream<'_, I, P, A, L, W>
impl<I, P, A, L, W> FusedStream for MethodStream<'_, I, P, A, L, W>
Source§fn is_terminated(&self) -> bool
fn is_terminated(&self) -> bool
true if the stream should no longer be polled.Source§impl<I, P, A, L, W> Stream for MethodStream<'_, I, P, A, L, W>
impl<I, P, A, L, W> Stream for MethodStream<'_, I, P, A, L, W>
Source§type Item = Result<I, ClientError>
type Item = Result<I, ClientError>
impl<I, P, A, L, W> Unpin for MethodStream<'_, I, P, A, L, W>
Auto Trait Implementations§
impl<'a, I, P = NoProgress, A = I, L = Root, W = fn(I) -> A> !RefUnwindSafe for MethodStream<'a, I, P, A, L, W>
impl<'a, I, P = NoProgress, A = I, L = Root, W = fn(I) -> A> !Sync for MethodStream<'a, I, P, A, L, W>
impl<'a, I, P = NoProgress, A = I, L = Root, W = fn(I) -> A> !UnwindSafe for MethodStream<'a, I, P, A, L, W>
impl<'a, I, P, A, L, W> Forget for MethodStream<'a, I, P, A, L, W>
impl<'a, I, P, A, L, W> Freeze for MethodStream<'a, I, P, A, L, W>where
Core<'a, I>: Freeze,
W: Freeze,
PhantomData<fn() -> A>: Freeze,
L: Freeze,
PhantomData<fn() -> P>: Freeze,
impl<'a, I, P, A, L, W> Send for MethodStream<'a, I, P, A, L, W>where
Core<'a, I>: Send,
W: Send,
PhantomData<fn() -> A>: Send,
L: Send,
PhantomData<fn() -> P>: Send,
impl<'a, I, P, A, L, W> UnsafeUnpin for MethodStream<'a, I, P, A, L, W>where
Core<'a, I>: UnsafeUnpin,
W: UnsafeUnpin,
PhantomData<fn() -> A>: UnsafeUnpin,
L: UnsafeUnpin,
PhantomData<fn() -> P>: UnsafeUnpin,
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
impl<T> MaybeSend for Twhere
T: Send,
Source§impl<T> StreamExt for T
impl<T> StreamExt for T
Source§fn next(&mut self) -> Next<'_, Self> ⓘwhere
Self: Unpin,
fn next(&mut self) -> Next<'_, Self> ⓘwhere
Self: Unpin,
Source§fn into_future(self) -> StreamFuture<Self> ⓘ
fn into_future(self) -> StreamFuture<Self> ⓘ
Source§fn map<T, F>(self, f: F) -> Map<Self, F>
fn map<T, F>(self, f: F) -> Map<Self, F>
Source§fn enumerate(self) -> Enumerate<Self>where
Self: Sized,
fn enumerate(self) -> Enumerate<Self>where
Self: Sized,
Source§fn filter<Fut, F>(self, f: F) -> Filter<Self, Fut, F>
fn filter<Fut, F>(self, f: F) -> Filter<Self, Fut, F>
Source§fn filter_map<Fut, T, F>(self, f: F) -> FilterMap<Self, Fut, F>
fn filter_map<Fut, T, F>(self, f: F) -> FilterMap<Self, Fut, F>
Source§fn then<Fut, F>(self, f: F) -> Then<Self, Fut, F>
fn then<Fut, F>(self, f: F) -> Then<Self, Fut, F>
Source§fn collect<C>(self) -> Collect<Self, C> ⓘ
fn collect<C>(self) -> Collect<Self, C> ⓘ
Source§fn unzip<A, B, FromA, FromB>(self) -> Unzip<Self, FromA, FromB> ⓘ
fn unzip<A, B, FromA, FromB>(self) -> Unzip<Self, FromA, FromB> ⓘ
Source§fn concat(self) -> Concat<Self> ⓘ
fn concat(self) -> Concat<Self> ⓘ
Source§fn count(self) -> Count<Self> ⓘwhere
Self: Sized,
fn count(self) -> Count<Self> ⓘwhere
Self: Sized,
Source§fn fold<T, Fut, F>(self, init: T, f: F) -> Fold<Self, Fut, T, F> ⓘ
fn fold<T, Fut, F>(self, init: T, f: F) -> Fold<Self, Fut, T, F> ⓘ
Source§fn any<Fut, F>(self, f: F) -> Any<Self, Fut, F> ⓘ
fn any<Fut, F>(self, f: F) -> Any<Self, Fut, F> ⓘ
true if any element in stream satisfied a predicate. Read moreSource§fn all<Fut, F>(self, f: F) -> All<Self, Fut, F> ⓘ
fn all<Fut, F>(self, f: F) -> All<Self, Fut, F> ⓘ
true if all element in stream satisfied a predicate. Read moreSource§fn flatten(self) -> Flatten<Self>
fn flatten(self) -> Flatten<Self>
Source§fn flatten_unordered(
self,
limit: impl Into<Option<usize>>,
) -> FlattenUnorderedWithFlowController<Self, ()>
fn flatten_unordered( self, limit: impl Into<Option<usize>>, ) -> FlattenUnorderedWithFlowController<Self, ()>
Source§fn flat_map_unordered<U, F>(
self,
limit: impl Into<Option<usize>>,
f: F,
) -> FlatMapUnordered<Self, U, F>
fn flat_map_unordered<U, F>( self, limit: impl Into<Option<usize>>, f: F, ) -> FlatMapUnordered<Self, U, F>
StreamExt::map but flattens nested Streams
and polls them concurrently, yielding items in any order, as they made
available. Read moreSource§fn scan<S, B, Fut, F>(self, initial_state: S, f: F) -> Scan<Self, S, Fut, F>
fn scan<S, B, Fut, F>(self, initial_state: S, f: F) -> Scan<Self, S, Fut, F>
StreamExt::fold that holds internal state
and produces a new stream. Read moreSource§fn skip_while<Fut, F>(self, f: F) -> SkipWhile<Self, Fut, F>
fn skip_while<Fut, F>(self, f: F) -> SkipWhile<Self, Fut, F>
true. Read moreSource§fn take_while<Fut, F>(self, f: F) -> TakeWhile<Self, Fut, F>
fn take_while<Fut, F>(self, f: F) -> TakeWhile<Self, Fut, F>
true. Read moreSource§fn take_until<Fut>(self, fut: Fut) -> TakeUntil<Self, Fut>
fn take_until<Fut>(self, fut: Fut) -> TakeUntil<Self, Fut>
Source§fn for_each<Fut, F>(self, f: F) -> ForEach<Self, Fut, F> ⓘ
fn for_each<Fut, F>(self, f: F) -> ForEach<Self, Fut, F> ⓘ
Source§fn for_each_concurrent<Fut, F>(
self,
limit: impl Into<Option<usize>>,
f: F,
) -> ForEachConcurrent<Self, Fut, F> ⓘ
fn for_each_concurrent<Fut, F>( self, limit: impl Into<Option<usize>>, f: F, ) -> ForEachConcurrent<Self, Fut, F> ⓘ
Source§fn take(self, n: usize) -> Take<Self>where
Self: Sized,
fn take(self, n: usize) -> Take<Self>where
Self: Sized,
n items of the underlying stream. Read moreSource§fn skip(self, n: usize) -> Skip<Self>where
Self: Sized,
fn skip(self, n: usize) -> Skip<Self>where
Self: Sized,
n items of the underlying stream. Read moreSource§fn catch_unwind(self) -> CatchUnwind<Self>where
Self: Sized + UnwindSafe,
fn catch_unwind(self) -> CatchUnwind<Self>where
Self: Sized + UnwindSafe,
Source§fn boxed<'a>(self) -> Pin<Box<dyn Stream<Item = Self::Item> + Send + 'a>>
fn boxed<'a>(self) -> Pin<Box<dyn Stream<Item = Self::Item> + Send + 'a>>
Source§fn boxed_local<'a>(self) -> Pin<Box<dyn Stream<Item = Self::Item> + 'a>>where
Self: Sized + 'a,
fn boxed_local<'a>(self) -> Pin<Box<dyn Stream<Item = Self::Item> + 'a>>where
Self: Sized + 'a,
Source§fn buffered(self, n: usize) -> Buffered<Self>
fn buffered(self, n: usize) -> Buffered<Self>
Source§fn buffer_unordered(self, n: usize) -> BufferUnordered<Self>
fn buffer_unordered(self, n: usize) -> BufferUnordered<Self>
Source§fn zip<St>(self, other: St) -> Zip<Self, St>
fn zip<St>(self, other: St) -> Zip<Self, St>
Source§fn peekable(self) -> Peekable<Self>where
Self: Sized,
fn peekable(self) -> Peekable<Self>where
Self: Sized,
peek method. Read moreSource§fn chunks(self, capacity: usize) -> Chunks<Self>where
Self: Sized,
fn chunks(self, capacity: usize) -> Chunks<Self>where
Self: Sized,
Source§fn ready_chunks(self, capacity: usize) -> ReadyChunks<Self>where
Self: Sized,
fn ready_chunks(self, capacity: usize) -> ReadyChunks<Self>where
Self: Sized,
Source§fn inspect<F>(self, f: F) -> Inspect<Self, F>
fn inspect<F>(self, f: F) -> Inspect<Self, F>
Source§fn left_stream<B>(self) -> Either<Self, B> ⓘ
fn left_stream<B>(self) -> Either<Self, B> ⓘ
Source§fn right_stream<B>(self) -> Either<B, Self> ⓘ
fn right_stream<B>(self) -> Either<B, Self> ⓘ
Source§fn poll_next_unpin(&mut self, cx: &mut Context<'_>) -> Poll<Option<Self::Item>>where
Self: Unpin,
fn poll_next_unpin(&mut self, cx: &mut Context<'_>) -> Poll<Option<Self::Item>>where
Self: Unpin,
Stream::poll_next on Unpin
stream types.Source§fn select_next_some(&mut self) -> SelectNextSome<'_, Self> ⓘwhere
Self: Unpin + FusedStream,
fn select_next_some(&mut self) -> SelectNextSome<'_, Self> ⓘwhere
Self: Unpin + FusedStream,
Source§impl<S> TryStreamExt for S
impl<S> TryStreamExt for S
Source§fn err_into<E>(self) -> ErrInto<Self, E>
fn err_into<E>(self) -> ErrInto<Self, E>
Source§fn map_ok<T, F>(self, f: F) -> MapOk<Self, F>
fn map_ok<T, F>(self, f: F) -> MapOk<Self, F>
Source§fn map_err<E, F>(self, f: F) -> MapErr<Self, F>
fn map_err<E, F>(self, f: F) -> MapErr<Self, F>
Source§fn and_then<Fut, F>(self, f: F) -> AndThen<Self, Fut, F>
fn and_then<Fut, F>(self, f: F) -> AndThen<Self, Fut, F>
f. Read moreSource§fn or_else<Fut, F>(self, f: F) -> OrElse<Self, Fut, F>
fn or_else<Fut, F>(self, f: F) -> OrElse<Self, Fut, F>
f. Read moreSource§fn inspect_ok<F>(self, f: F) -> InspectOk<Self, F>
fn inspect_ok<F>(self, f: F) -> InspectOk<Self, F>
Source§fn inspect_err<F>(self, f: F) -> InspectErr<Self, F>
fn inspect_err<F>(self, f: F) -> InspectErr<Self, F>
Source§fn into_stream(self) -> IntoStream<Self>where
Self: Sized,
fn into_stream(self) -> IntoStream<Self>where
Self: Sized,
Source§fn try_next(&mut self) -> TryNext<'_, Self> ⓘwhere
Self: Unpin,
fn try_next(&mut self) -> TryNext<'_, Self> ⓘwhere
Self: Unpin,
Source§fn try_for_each<Fut, F>(self, f: F) -> TryForEach<Self, Fut, F> ⓘ
fn try_for_each<Fut, F>(self, f: F) -> TryForEach<Self, Fut, F> ⓘ
Source§fn try_skip_while<Fut, F>(self, f: F) -> TrySkipWhile<Self, Fut, F>
fn try_skip_while<Fut, F>(self, f: F) -> TrySkipWhile<Self, Fut, F>
true. Read moreSource§fn try_take_while<Fut, F>(self, f: F) -> TryTakeWhile<Self, Fut, F>
fn try_take_while<Fut, F>(self, f: F) -> TryTakeWhile<Self, Fut, F>
true. Read moreSource§fn try_for_each_concurrent<Fut, F>(
self,
limit: impl Into<Option<usize>>,
f: F,
) -> TryForEachConcurrent<Self, Fut, F> ⓘ
fn try_for_each_concurrent<Fut, F>( self, limit: impl Into<Option<usize>>, f: F, ) -> TryForEachConcurrent<Self, Fut, F> ⓘ
Source§fn try_collect<C>(self) -> TryCollect<Self, C> ⓘ
fn try_collect<C>(self) -> TryCollect<Self, C> ⓘ
Source§fn try_chunks(self, capacity: usize) -> TryChunks<Self>where
Self: Sized,
fn try_chunks(self, capacity: usize) -> TryChunks<Self>where
Self: Sized,
Source§fn try_ready_chunks(self, capacity: usize) -> TryReadyChunks<Self>where
Self: Sized,
fn try_ready_chunks(self, capacity: usize) -> TryReadyChunks<Self>where
Self: Sized,
Source§fn try_filter<Fut, F>(self, f: F) -> TryFilter<Self, Fut, F>
fn try_filter<Fut, F>(self, f: F) -> TryFilter<Self, Fut, F>
Source§fn try_filter_map<Fut, F, T>(self, f: F) -> TryFilterMap<Self, Fut, F>
fn try_filter_map<Fut, F, T>(self, f: F) -> TryFilterMap<Self, Fut, F>
Source§fn try_flatten_unordered(
self,
limit: impl Into<Option<usize>>,
) -> TryFlattenUnordered<Self>
fn try_flatten_unordered( self, limit: impl Into<Option<usize>>, ) -> TryFlattenUnordered<Self>
Source§fn try_flatten(self) -> TryFlatten<Self>
fn try_flatten(self) -> TryFlatten<Self>
Source§fn try_fold<T, Fut, F>(self, init: T, f: F) -> TryFold<Self, Fut, T, F> ⓘ
fn try_fold<T, Fut, F>(self, init: T, f: F) -> TryFold<Self, Fut, T, F> ⓘ
Source§fn try_concat(self) -> TryConcat<Self> ⓘ
fn try_concat(self) -> TryConcat<Self> ⓘ
Source§fn try_buffer_unordered(self, n: usize) -> TryBufferUnordered<Self>
fn try_buffer_unordered(self, n: usize) -> TryBufferUnordered<Self>
Source§fn try_buffered(self, n: usize) -> TryBuffered<Self>
fn try_buffered(self, n: usize) -> TryBuffered<Self>
Source§fn try_poll_next_unpin(
&mut self,
cx: &mut Context<'_>,
) -> Poll<Option<Result<Self::Ok, Self::Error>>>where
Self: Unpin,
fn try_poll_next_unpin(
&mut self,
cx: &mut Context<'_>,
) -> Poll<Option<Result<Self::Ok, Self::Error>>>where
Self: Unpin,
TryStream::try_poll_next on Unpin
stream types.Source§fn try_all<Fut, F>(self, f: F) -> TryAll<Self, Fut, F> ⓘ
fn try_all<Fut, F>(self, f: F) -> TryAll<Self, Fut, F> ⓘ
Err is encountered or if an Ok item is found
that does not satisfy the predicate. Read more