Enum rama::combinators::Either7

pub enum Either7<A, B, C, D, E, F, G> {
    A(A),
    B(B),
    C(C),
    D(D),
    E(E),
    F(F),
    G(G),
}

A type to allow you to use multiple types as a single type.

and will delegate the functionality to the type that is wrapped in the Either type. To keep it easy all wrapped types are expected to work with the same inputs and outputs.

You can use [crate::combinators::impl_either] to implement the Either type for the available number of type parameters on your own Trait implementations.

Variants

A(A)

one of the Either variants

B(B)

one of the Either variants

C(C)

one of the Either variants

D(D)

one of the Either variants

E(E)

one of the Either variants

F(F)

one of the Either variants

G(G)

one of the Either variants

Trait Implementations

impl<A, B, C, D, E, F, G> AsyncRead for Either7<A, B, C, D, E, F, G>

where A: AsyncRead, B: AsyncRead, C: AsyncRead, D: AsyncRead, E: AsyncRead, F: AsyncRead, G: AsyncRead,

fn poll_read( self: Pin<&mut Either7<A, B, C, D, E, F, G>>, cx: &mut Context<'_>, buf: &mut ReadBuf<'_>, ) -> Poll<Result<(), Error>>

Attempts to read from the AsyncRead into buf.

impl<A, B, C, D, E, F, G> AsyncWrite for Either7<A, B, C, D, E, F, G>

where A: AsyncWrite, B: AsyncWrite, C: AsyncWrite, D: AsyncWrite, E: AsyncWrite, F: AsyncWrite, G: AsyncWrite,

fn poll_write( self: Pin<&mut Either7<A, B, C, D, E, F, G>>, cx: &mut Context<'_>, buf: &[u8], ) -> Poll<Result<usize, Error>>

Attempt to write bytes from buf into the object.

fn poll_flush( self: Pin<&mut Either7<A, B, C, D, E, F, G>>, cx: &mut Context<'_>, ) -> Poll<Result<(), Error>>

Attempts to flush the object, ensuring that any buffered data reach their destination.

fn poll_shutdown( self: Pin<&mut Either7<A, B, C, D, E, F, G>>, cx: &mut Context<'_>, ) -> Poll<Result<(), Error>>

Initiates or attempts to shut down this writer, returning success when the I/O connection has completely shut down.

fn poll_write_vectored( self: Pin<&mut Either7<A, B, C, D, E, F, G>>, cx: &mut Context<'_>, bufs: &[IoSlice<'_>], ) -> Poll<Result<usize, Error>>

Like poll_write, except that it writes from a slice of buffers.

fn is_write_vectored(&self) -> bool

Determines if this writer has an efficient poll_write_vectored implementation.

impl<A, B, C, D, E, F, G> Clone for Either7<A, B, C, D, E, F, G>

where A: Clone, B: Clone, C: Clone, D: Clone, E: Clone, F: Clone, G: Clone,

fn clone(&self) -> Either7<A, B, C, D, E, F, G>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<A, B, C, D, E, F, G> Debug for Either7<A, B, C, D, E, F, G>

where A: Debug, B: Debug, C: Debug, D: Debug, E: Debug, F: Debug, G: Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<A, B, C, D, E, F, G> Display for Either7<A, B, C, D, E, F, G>

where A: Display, B: Display, C: Display, D: Display, E: Display, F: Display, G: Display,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<A, B, C, D, E, F, G> DnsResolver for Either7<A, B, C, D, E, F, G>

where A: DnsResolver, <A as DnsResolver>::Error: Into<Box<dyn Error + Sync + Send>>, B: DnsResolver, <B as DnsResolver>::Error: Into<Box<dyn Error + Sync + Send>>, C: DnsResolver, <C as DnsResolver>::Error: Into<Box<dyn Error + Sync + Send>>, D: DnsResolver, <D as DnsResolver>::Error: Into<Box<dyn Error + Sync + Send>>, E: DnsResolver, <E as DnsResolver>::Error: Into<Box<dyn Error + Sync + Send>>, F: DnsResolver, <F as DnsResolver>::Error: Into<Box<dyn Error + Sync + Send>>, G: DnsResolver, <G as DnsResolver>::Error: Into<Box<dyn Error + Sync + Send>>,

type Error = Box<dyn Error + Sync + Send>

Error returned by the DnsResolver

async fn ipv4_lookup( &self, domain: Domain, ) -> Result<Vec<Ipv4Addr>, <Either7<A, B, C, D, E, F, G> as DnsResolver>::Error>

Resolve the ‘A’ records accessible by this resolver for the given Domain into Ipv4Addresses.

async fn ipv6_lookup( &self, domain: Domain, ) -> Result<Vec<Ipv6Addr>, <Either7<A, B, C, D, E, F, G> as DnsResolver>::Error>

Resolve the ‘AAAA’ records accessible by this resolver for the given Domain into Ipv6Addresses.

impl<A, B, C, D, E, F, G, Output> Future for Either7<A, B, C, D, E, F, G>

where A: Future<Output = Output>, B: Future<Output = Output>, C: Future<Output = Output>, D: Future<Output = Output>, E: Future<Output = Output>, F: Future<Output = Output>, G: Future<Output = Output>,

type Output = Output

The type of value produced on completion.

fn poll( self: Pin<&mut Either7<A, B, C, D, E, F, G>>, cx: &mut Context<'_>, ) -> Poll<<Either7<A, B, C, D, E, F, G> as Future>::Output>

Attempts to resolve the future to a final value, registering the current task for wakeup if the value is not yet available.

impl<A, B, C, D, E, F, G, Item> Iterator for Either7<A, B, C, D, E, F, G>

where A: Iterator<Item = Item>, B: Iterator<Item = Item>, C: Iterator<Item = Item>, D: Iterator<Item = Item>, E: Iterator<Item = Item>, F: Iterator<Item = Item>, G: Iterator<Item = Item>,

type Item = Item

The type of the elements being iterated over.

fn next(&mut self) -> Option<Item>

Advances the iterator and returns the next value.

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator.

fn next_chunk<const N: usize>( &mut self, ) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>

where Self: Sized,

🔬This is a nightly-only experimental API. (iter_next_chunk)

Advances the iterator and returns an array containing the next N values.

fn count(self) -> usize

where Self: Sized,

Consumes the iterator, counting the number of iterations and returning it.

fn last(self) -> Option<Self::Item>

where Self: Sized,

Consumes the iterator, returning the last element.

fn advance_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

🔬This is a nightly-only experimental API. (iter_advance_by)

Advances the iterator by n elements.

fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator.

fn step_by(self, step: usize) -> StepBy<Self>

where Self: Sized,

Creates an iterator starting at the same point, but stepping by the given amount at each iteration.

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>

where Self: Sized, U: IntoIterator<Item = Self::Item>,

Takes two iterators and creates a new iterator over both in sequence.

fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>

where Self: Sized, U: IntoIterator,

‘Zips up’ two iterators into a single iterator of pairs.

fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>

where Self: Sized, G: FnMut() -> Self::Item,

🔬This is a nightly-only experimental API. (iter_intersperse)

Creates a new iterator which places an item generated by separator between adjacent items of the original iterator.

fn map<B, F>(self, f: F) -> Map<Self, F>

where Self: Sized, F: FnMut(Self::Item) -> B,

Takes a closure and creates an iterator which calls that closure on each element.

fn for_each<F>(self, f: F)

where Self: Sized, F: FnMut(Self::Item),

Calls a closure on each element of an iterator.

fn filter<P>(self, predicate: P) -> Filter<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator which uses a closure to determine if an element should be yielded.

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>

where Self: Sized, F: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both filters and maps.

fn enumerate(self) -> Enumerate<Self>

where Self: Sized,

Creates an iterator which gives the current iteration count as well as the next value.

fn peekable(self) -> Peekable<Self>

where Self: Sized,

Creates an iterator which can use the peek and peek_mut methods to look at the next element of the iterator without consuming it. See their documentation for more information.

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator that skips elements based on a predicate.

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator that yields elements based on a predicate.

fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>

where Self: Sized, P: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both yields elements based on a predicate and maps.

fn skip(self, n: usize) -> Skip<Self>

where Self: Sized,

Creates an iterator that skips the first n elements.

fn take(self, n: usize) -> Take<Self>

where Self: Sized,

Creates an iterator that yields the first n elements, or fewer if the underlying iterator ends sooner.

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>

where Self: Sized, F: FnMut(&mut St, Self::Item) -> Option<B>,

An iterator adapter which, like fold, holds internal state, but unlike fold, produces a new iterator.

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>

where Self: Sized, U: IntoIterator, F: FnMut(Self::Item) -> U,

Creates an iterator that works like map, but flattens nested structure.

fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>

where Self: Sized, F: FnMut(&[Self::Item; N]) -> R,

🔬This is a nightly-only experimental API. (iter_map_windows)

Calls the given function f for each contiguous window of size N over self and returns an iterator over the outputs of f. Like slice::windows(), the windows during mapping overlap as well.

fn fuse(self) -> Fuse<Self>

where Self: Sized,

Creates an iterator which ends after the first None.

fn inspect<F>(self, f: F) -> Inspect<Self, F>

where Self: Sized, F: FnMut(&Self::Item),

Does something with each element of an iterator, passing the value on.

fn by_ref(&mut self) -> &mut Self

where Self: Sized,

Borrows an iterator, rather than consuming it.

fn collect<B>(self) -> B

where B: FromIterator<Self::Item>, Self: Sized,

Transforms an iterator into a collection.

fn collect_into<E>(self, collection: &mut E) -> &mut E

where E: Extend<Self::Item>, Self: Sized,

🔬This is a nightly-only experimental API. (iter_collect_into)

Collects all the items from an iterator into a collection.

fn partition<B, F>(self, f: F) -> (B, B)

where Self: Sized, B: Default + Extend<Self::Item>, F: FnMut(&Self::Item) -> bool,

Consumes an iterator, creating two collections from it.

fn is_partitioned<P>(self, predicate: P) -> bool

where Self: Sized, P: FnMut(Self::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_is_partitioned)

Checks if the elements of this iterator are partitioned according to the given predicate, such that all those that return true precede all those that return false.

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R

where Self: Sized, F: FnMut(B, Self::Item) -> R, R: Try<Output = B>,

An iterator method that applies a function as long as it returns successfully, producing a single, final value.

fn try_for_each<F, R>(&mut self, f: F) -> R

where Self: Sized, F: FnMut(Self::Item) -> R, R: Try<Output = ()>,

An iterator method that applies a fallible function to each item in the iterator, stopping at the first error and returning that error.

fn fold<B, F>(self, init: B, f: F) -> B

where Self: Sized, F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, returning the final result.

fn reduce<F>(self, f: F) -> Option<Self::Item>

where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Self::Item,

Reduces the elements to a single one, by repeatedly applying a reducing operation.

fn try_reduce<R>( &mut self, f: impl FnMut(Self::Item, Self::Item) -> R, ) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryType

where Self: Sized, R: Try<Output = Self::Item>, <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (iterator_try_reduce)

Reduces the elements to a single one by repeatedly applying a reducing operation. If the closure returns a failure, the failure is propagated back to the caller immediately.

fn all<F>(&mut self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> bool,

Tests if every element of the iterator matches a predicate.

fn any<F>(&mut self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> bool,

Tests if any element of the iterator matches a predicate.

fn find<P>(&mut self, predicate: P) -> Option<Self::Item>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Searches for an element of an iterator that satisfies a predicate.

fn find_map<B, F>(&mut self, f: F) -> Option<B>

where Self: Sized, F: FnMut(Self::Item) -> Option<B>,

Applies function to the elements of iterator and returns the first non-none result.

fn try_find<R>( &mut self, f: impl FnMut(&Self::Item) -> R, ) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryType

where Self: Sized, R: Try<Output = bool>, <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (try_find)

Applies function to the elements of iterator and returns the first true result or the first error.

fn position<P>(&mut self, predicate: P) -> Option<usize>

where Self: Sized, P: FnMut(Self::Item) -> bool,

Searches for an element in an iterator, returning its index.

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>

where B: Ord, Self: Sized, F: FnMut(&Self::Item) -> B,

Returns the element that gives the maximum value from the specified function.

fn max_by<F>(self, compare: F) -> Option<Self::Item>

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Returns the element that gives the maximum value with respect to the specified comparison function.

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>

where B: Ord, Self: Sized, F: FnMut(&Self::Item) -> B,

Returns the element that gives the minimum value from the specified function.

fn min_by<F>(self, compare: F) -> Option<Self::Item>

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Returns the element that gives the minimum value with respect to the specified comparison function.

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)

where FromA: Default + Extend<A>, FromB: Default + Extend<B>, Self: Sized + Iterator<Item = (A, B)>,

Converts an iterator of pairs into a pair of containers.

fn copied<'a, T>(self) -> Copied<Self>

where T: 'a + Copy, Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which copies all of its elements.

fn cloned<'a, T>(self) -> Cloned<Self>

where T: 'a + Clone, Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which clones all of its elements.

fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>

where Self: Sized,

🔬This is a nightly-only experimental API. (iter_array_chunks)

Returns an iterator over N elements of the iterator at a time.

fn sum<S>(self) -> S

where Self: Sized, S: Sum<Self::Item>,

Sums the elements of an iterator.

fn product<P>(self) -> P

where Self: Sized, P: Product<Self::Item>,

Iterates over the entire iterator, multiplying all the elements

fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,

🔬This is a nightly-only experimental API. (iter_order_by)

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function.

fn partial_cmp<I>(self, other: I) -> Option<Ordering>

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Lexicographically compares the PartialOrd elements of this Iterator with those of another. The comparison works like short-circuit evaluation, returning a result without comparing the remaining elements. As soon as an order can be determined, the evaluation stops and a result is returned.

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (iter_order_by)

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function.

fn eq<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are equal to those of another.

fn eq_by<I, F>(self, other: I, eq: F) -> bool

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_order_by)

Determines if the elements of this Iterator are equal to those of another with respect to the specified equality function.

fn ne<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are not equal to those of another.

fn lt<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically less than those of another.

fn le<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically less or equal to those of another.

fn gt<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically greater than those of another.

fn ge<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically greater than or equal to those of another.

fn is_sorted_by<F>(self, compare: F) -> bool

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> bool,

Checks if the elements of this iterator are sorted using the given comparator function.

fn is_sorted_by_key<F, K>(self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> K, K: PartialOrd,

Checks if the elements of this iterator are sorted using the given key extraction function.

impl<A, B, C, D, E, F, G, S> Layer<S> for Either7<A, B, C, D, E, F, G>

where A: Layer<S>, B: Layer<S>, C: Layer<S>, D: Layer<S>, E: Layer<S>, F: Layer<S>, G: Layer<S>,

type Service = Either7<<A as Layer<S>>::Service, <B as Layer<S>>::Service, <C as Layer<S>>::Service, <D as Layer<S>>::Service, <E as Layer<S>>::Service, <F as Layer<S>>::Service, <G as Layer<S>>::Service>

The service produced by the layer.

fn layer(&self, inner: S) -> <Either7<A, B, C, D, E, F, G> as Layer<S>>::Service

Wrap the given service with the middleware, returning a new service.

impl<A, B, C, D, E, F, G, State, Request> Matcher<State, Request> for Either7<A, B, C, D, E, F, G>

where A: Matcher<State, Request>, B: Matcher<State, Request>, C: Matcher<State, Request>, D: Matcher<State, Request>, E: Matcher<State, Request>, F: Matcher<State, Request>, G: Matcher<State, Request>, Request: Send + 'static, State: Clone + Send + Sync + 'static,

fn matches( &self, ext: Option<&mut Extensions>, ctx: &Context<State>, req: &Request, ) -> bool

returns true on a match, false otherwise

fn or<M>(self, other: M) -> impl Matcher<State, Request>

where Self: Sized, M: Matcher<State, Request>,

Provide an alternative matcher to match if the current one does not match.

fn and<M>(self, other: M) -> impl Matcher<State, Request>

where Self: Sized, M: Matcher<State, Request>,

Add another condition to match on top of the current one.

fn not(self) -> impl Matcher<State, Request>

where Self: Sized,

Negate the current condition.

impl<A, B, C, D, E, F, G, State, Request> Policy<State, Request> for Either7<A, B, C, D, E, F, G>

where A: Policy<State, Request>, <A as Policy<State, Request>>::Error: Into<Box<dyn Error + Sync + Send>>, B: Policy<State, Request>, <B as Policy<State, Request>>::Error: Into<Box<dyn Error + Sync + Send>>, C: Policy<State, Request>, <C as Policy<State, Request>>::Error: Into<Box<dyn Error + Sync + Send>>, D: Policy<State, Request>, <D as Policy<State, Request>>::Error: Into<Box<dyn Error + Sync + Send>>, E: Policy<State, Request>, <E as Policy<State, Request>>::Error: Into<Box<dyn Error + Sync + Send>>, F: Policy<State, Request>, <F as Policy<State, Request>>::Error: Into<Box<dyn Error + Sync + Send>>, G: Policy<State, Request>, <G as Policy<State, Request>>::Error: Into<Box<dyn Error + Sync + Send>>, Request: Send + 'static, State: Clone + Send + Sync + 'static,

type Guard = Either7<<A as Policy<State, Request>>::Guard, <B as Policy<State, Request>>::Guard, <C as Policy<State, Request>>::Guard, <D as Policy<State, Request>>::Guard, <E as Policy<State, Request>>::Guard, <F as Policy<State, Request>>::Guard, <G as Policy<State, Request>>::Guard>

The guard type that is returned when the request is allowed to proceed.

type Error = Box<dyn Error + Sync + Send>

The error type that is returned when the request is not allowed to proceed, and should be aborted.

async fn check( &self, ctx: Context<State>, req: Request, ) -> PolicyResult<State, Request, <Either7<A, B, C, D, E, F, G> as Policy<State, Request>>::Guard, <Either7<A, B, C, D, E, F, G> as Policy<State, Request>>::Error>

Check whether the request is allowed to proceed.

impl<A, B, C, D, E, F, G, State, Response, Error> Policy<State, Response, Error> for Either7<A, B, C, D, E, F, G>

where A: Policy<State, Response, Error>, B: Policy<State, Response, Error>, C: Policy<State, Response, Error>, D: Policy<State, Response, Error>, E: Policy<State, Response, Error>, F: Policy<State, Response, Error>, G: Policy<State, Response, Error>, State: Clone + Send + Sync + 'static, Response: Send + 'static, Error: Send + Sync + 'static,

async fn retry( &self, ctx: Context<State>, req: Request<RetryBody>, result: Result<Response, Error>, ) -> PolicyResult<State, Response, Error>

Check the policy if a certain request should be retried.

fn clone_input( &self, ctx: &Context<State>, req: &Request<RetryBody>, ) -> Option<(Context<State>, Request<RetryBody>)>

Tries to clone a request before being passed to the inner service.

impl<A, B, C, D, E, F, G> ProxyDB for Either7<A, B, C, D, E, F, G>

where A: ProxyDB, <A as ProxyDB>::Error: Into<Box<dyn Error + Sync + Send>>, B: ProxyDB, <B as ProxyDB>::Error: Into<Box<dyn Error + Sync + Send>>, C: ProxyDB, <C as ProxyDB>::Error: Into<Box<dyn Error + Sync + Send>>, D: ProxyDB, <D as ProxyDB>::Error: Into<Box<dyn Error + Sync + Send>>, E: ProxyDB, <E as ProxyDB>::Error: Into<Box<dyn Error + Sync + Send>>, F: ProxyDB, <F as ProxyDB>::Error: Into<Box<dyn Error + Sync + Send>>, G: ProxyDB, <G as ProxyDB>::Error: Into<Box<dyn Error + Sync + Send>>,

type Error = Box<dyn Error + Sync + Send>

The error type that can be returned by the proxy database

async fn get_proxy_if( &self, ctx: TransportContext, filter: ProxyFilter, predicate: impl ProxyQueryPredicate, ) -> Result<Proxy, <Either7<A, B, C, D, E, F, G> as ProxyDB>::Error>

Same as Self::get_proxy but with a predicate to filter out found proxies that do not match the given predicate.

async fn get_proxy( &self, ctx: TransportContext, filter: ProxyFilter, ) -> Result<Proxy, <Either7<A, B, C, D, E, F, G> as ProxyDB>::Error>

Get a Proxy based on the given TransportContext and ProxyFilter, or return an error in case no Proxy could be returned.

impl<A, B, C, D, E, F, G, State, Request, Response> Service<State, Request> for Either7<A, B, C, D, E, F, G>

where A: Service<State, Request, Response = Response>, <A as Service<State, Request>>::Error: Into<Box<dyn Error + Sync + Send>>, B: Service<State, Request, Response = Response>, <B as Service<State, Request>>::Error: Into<Box<dyn Error + Sync + Send>>, C: Service<State, Request, Response = Response>, <C as Service<State, Request>>::Error: Into<Box<dyn Error + Sync + Send>>, D: Service<State, Request, Response = Response>, <D as Service<State, Request>>::Error: Into<Box<dyn Error + Sync + Send>>, E: Service<State, Request, Response = Response>, <E as Service<State, Request>>::Error: Into<Box<dyn Error + Sync + Send>>, F: Service<State, Request, Response = Response>, <F as Service<State, Request>>::Error: Into<Box<dyn Error + Sync + Send>>, G: Service<State, Request, Response = Response>, <G as Service<State, Request>>::Error: Into<Box<dyn Error + Sync + Send>>, Request: Send + 'static, State: Clone + Send + Sync + 'static, Response: Send + 'static,

type Response = Response

The type of response returned by the service.

type Error = Box<dyn Error + Sync + Send>

The type of error returned by the service.

async fn serve( &self, ctx: Context<State>, req: Request, ) -> Result<<Either7<A, B, C, D, E, F, G> as Service<State, Request>>::Response, <Either7<A, B, C, D, E, F, G> as Service<State, Request>>::Error>

Serve a response or error for the given request, using the given context.

fn boxed(self) -> BoxService<S, Request, Self::Response, Self::Error>

Box this service to allow for dynamic dispatch.

impl<A, B, C, D, E, F, G> TcpStreamConnector for Either7<A, B, C, D, E, F, G>

where A: TcpStreamConnector, <A as TcpStreamConnector>::Error: Into<Box<dyn Error + Sync + Send>>, B: TcpStreamConnector, <B as TcpStreamConnector>::Error: Into<Box<dyn Error + Sync + Send>>, C: TcpStreamConnector, <C as TcpStreamConnector>::Error: Into<Box<dyn Error + Sync + Send>>, D: TcpStreamConnector, <D as TcpStreamConnector>::Error: Into<Box<dyn Error + Sync + Send>>, E: TcpStreamConnector, <E as TcpStreamConnector>::Error: Into<Box<dyn Error + Sync + Send>>, F: TcpStreamConnector, <F as TcpStreamConnector>::Error: Into<Box<dyn Error + Sync + Send>>, G: TcpStreamConnector, <G as TcpStreamConnector>::Error: Into<Box<dyn Error + Sync + Send>>,

type Error = Box<dyn Error + Sync + Send>

Type of error that can occurr when establishing the connection failed.

async fn connect( &self, addr: SocketAddr, ) -> Result<TcpStream, <Either7<A, B, C, D, E, F, G> as TcpStreamConnector>::Error>

Connect to the target via the given SocketAddress to establish a [TcpStream].

impl<State, A, B, C, D, E, F, G> TcpStreamConnectorFactory<State> for Either7<A, B, C, D, E, F, G>

where State: Send + Sync + 'static, A: TcpStreamConnectorFactory<State>, <A as TcpStreamConnectorFactory<State>>::Connector: TcpStreamConnector, <<A as TcpStreamConnectorFactory<State>>::Connector as TcpStreamConnector>::Error: Into<Box<dyn Error + Sync + Send>>, <A as TcpStreamConnectorFactory<State>>::Error: Into<Box<dyn Error + Sync + Send>>, B: TcpStreamConnectorFactory<State>, <B as TcpStreamConnectorFactory<State>>::Connector: TcpStreamConnector, <<B as TcpStreamConnectorFactory<State>>::Connector as TcpStreamConnector>::Error: Into<Box<dyn Error + Sync + Send>>, <B as TcpStreamConnectorFactory<State>>::Error: Into<Box<dyn Error + Sync + Send>>, C: TcpStreamConnectorFactory<State>, <C as TcpStreamConnectorFactory<State>>::Connector: TcpStreamConnector, <<C as TcpStreamConnectorFactory<State>>::Connector as TcpStreamConnector>::Error: Into<Box<dyn Error + Sync + Send>>, <C as TcpStreamConnectorFactory<State>>::Error: Into<Box<dyn Error + Sync + Send>>, D: TcpStreamConnectorFactory<State>, <D as TcpStreamConnectorFactory<State>>::Connector: TcpStreamConnector, <<D as TcpStreamConnectorFactory<State>>::Connector as TcpStreamConnector>::Error: Into<Box<dyn Error + Sync + Send>>, <D as TcpStreamConnectorFactory<State>>::Error: Into<Box<dyn Error + Sync + Send>>, E: TcpStreamConnectorFactory<State>, <E as TcpStreamConnectorFactory<State>>::Connector: TcpStreamConnector, <<E as TcpStreamConnectorFactory<State>>::Connector as TcpStreamConnector>::Error: Into<Box<dyn Error + Sync + Send>>, <E as TcpStreamConnectorFactory<State>>::Error: Into<Box<dyn Error + Sync + Send>>, F: TcpStreamConnectorFactory<State>, <F as TcpStreamConnectorFactory<State>>::Connector: TcpStreamConnector, <<F as TcpStreamConnectorFactory<State>>::Connector as TcpStreamConnector>::Error: Into<Box<dyn Error + Sync + Send>>, <F as TcpStreamConnectorFactory<State>>::Error: Into<Box<dyn Error + Sync + Send>>, G: TcpStreamConnectorFactory<State>, <G as TcpStreamConnectorFactory<State>>::Connector: TcpStreamConnector, <<G as TcpStreamConnectorFactory<State>>::Connector as TcpStreamConnector>::Error: Into<Box<dyn Error + Sync + Send>>, <G as TcpStreamConnectorFactory<State>>::Error: Into<Box<dyn Error + Sync + Send>>,

type Connector = Either7<<A as TcpStreamConnectorFactory<State>>::Connector, <B as TcpStreamConnectorFactory<State>>::Connector, <C as TcpStreamConnectorFactory<State>>::Connector, <D as TcpStreamConnectorFactory<State>>::Connector, <E as TcpStreamConnectorFactory<State>>::Connector, <F as TcpStreamConnectorFactory<State>>::Connector, <G as TcpStreamConnectorFactory<State>>::Connector>

TcpStreamConnector created by this TcpStreamConnectorFactory

type Error = Box<dyn Error + Sync + Send>

Error returned in case TcpStreamConnectorFactory was not able to create a TcpStreamConnector.

async fn make_connector( &self, ctx: Context<State>, ) -> Result<CreatedTcpStreamConnector<State, <Either7<A, B, C, D, E, F, G> as TcpStreamConnectorFactory<State>>::Connector>, <Either7<A, B, C, D, E, F, G> as TcpStreamConnectorFactory<State>>::Error>

Try to create a TcpStreamConnector, and return an error or otherwise.

impl<const SEPARATOR: char, A, B, C, D, E, F, G> UsernameLabelWriter<SEPARATOR> for Either7<A, B, C, D, E, F, G>

where A: UsernameLabelWriter<SEPARATOR>, B: UsernameLabelWriter<SEPARATOR>, C: UsernameLabelWriter<SEPARATOR>, D: UsernameLabelWriter<SEPARATOR>, E: UsernameLabelWriter<SEPARATOR>, F: UsernameLabelWriter<SEPARATOR>, G: UsernameLabelWriter<SEPARATOR>,

fn write_labels( &self, composer: &mut Composer<SEPARATOR>, ) -> Result<(), ComposeError>

Write all labels into the given Composer.