Struct exr::image::recursive::Recursive

pub struct Recursive<Inner, Value> {
    pub inner: Inner,
    pub value: Value,
}

A recursive type-level linked list of Value entries. Mainly used to represent an arbitrary number of channels. The recursive architecture removes the need to implement traits for many different tuples.

Fields

inner: Inner

The remaining values of this linked list, probably either NoneMore or another instance of the same Recursive<Inner - 1, Value>.

value: Value

The next item in this linked list.

Implementations

impl<Inner, Value> Recursive<Inner, Value>

pub fn new(inner: Inner, value: Value) -> Self

Create a new recursive type. Equivalent to the manual constructor, but less verbose.

Trait Implementations

impl<Inner: CheckDuplicates> CheckDuplicates for Recursive<Inner, ChannelDescription>

fn already_contains(&self, name: &Text) -> bool

Check for duplicate channel names.

impl<Inner: Clone, Value: Clone> Clone for Recursive<Inner, Value>

fn clone(&self) -> Recursive<Inner, Value>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<Inner: Debug, Value: Debug> Debug for Recursive<Inner, Value>

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

Formats the value using the given formatter.

impl<Inner: Default, Value: Default> Default for Recursive<Inner, Value>

fn default() -> Recursive<Inner, Value>

Returns the “default value” for a type.

impl<A> IntoNonRecursive for Recursive<NoneMore, A>

type NonRecursive = (A,)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B> IntoNonRecursive for Recursive<Recursive<NoneMore, A>, B>

type NonRecursive = (A, B)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C> IntoNonRecursive for Recursive<Recursive<Recursive<NoneMore, A>, B>, C>

type NonRecursive = (A, B, C)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>

type NonRecursive = (A, B, C, D)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>

type NonRecursive = (A, B, C, D, E)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>

type NonRecursive = (A, B, C, D, E, F)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F, G> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>, G>

type NonRecursive = (A, B, C, D, E, F, G)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F, G, H> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>, G>, H>

type NonRecursive = (A, B, C, D, E, F, G, H)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F, G, H, I> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>, G>, H>, I>

type NonRecursive = (A, B, C, D, E, F, G, H, I)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F, G, H, I, J> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>, G>, H>, I>, J>

type NonRecursive = (A, B, C, D, E, F, G, H, I, J)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F, G, H, I, J, K> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>, G>, H>, I>, J>, K>

type NonRecursive = (A, B, C, D, E, F, G, H, I, J, K)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F, G, H, I, J, K, L> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>, G>, H>, I>, J>, K>, L>

type NonRecursive = (A, B, C, D, E, F, G, H, I, J, K, L)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F, G, H, I, J, K, L, M> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>, G>, H>, I>, J>, K>, L>, M>

type NonRecursive = (A, B, C, D, E, F, G, H, I, J, K, L, M)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>, G>, H>, I>, J>, K>, L>, M>, N>

type NonRecursive = (A, B, C, D, E, F, G, H, I, J, K, L, M, N)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>, G>, H>, I>, J>, K>, L>, M>, N>, O>

type NonRecursive = (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>, G>, H>, I>, J>, K>, L>, M>, N>, O>, P>

type NonRecursive = (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>, G>, H>, I>, J>, K>, L>, M>, N>, O>, P>, Q>

type NonRecursive = (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>, G>, H>, I>, J>, K>, L>, M>, N>, O>, P>, Q>, R>

type NonRecursive = (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>, G>, H>, I>, J>, K>, L>, M>, N>, O>, P>, Q>, R>, S>

type NonRecursive = (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>, G>, H>, I>, J>, K>, L>, M>, N>, O>, P>, Q>, R>, S>, T>

type NonRecursive = (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>, G>, H>, I>, J>, K>, L>, M>, N>, O>, P>, Q>, R>, S>, T>, U>

type NonRecursive = (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>, G>, H>, I>, J>, K>, L>, M>, N>, O>, P>, Q>, R>, S>, T>, U>, V>

type NonRecursive = (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>, G>, H>, I>, J>, K>, L>, M>, N>, O>, P>, Q>, R>, S>, T>, U>, V>, W>

type NonRecursive = (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>, G>, H>, I>, J>, K>, L>, M>, N>, O>, P>, Q>, R>, S>, T>, U>, V>, W>, X>

type NonRecursive = (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>, G>, H>, I>, J>, K>, L>, M>, N>, O>, P>, Q>, R>, S>, T>, U>, V>, W>, X>, Y>

type NonRecursive = (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>, G>, H>, I>, J>, K>, L>, M>, N>, O>, P>, Q>, R>, S>, T>, U>, V>, W>, X>, Y>, Z>

type NonRecursive = (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>, G>, H>, I>, J>, K>, L>, M>, N>, O>, P>, Q>, R>, S>, T>, U>, V>, W>, X>, Y>, Z>, A1>

type NonRecursive = (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>, G>, H>, I>, J>, K>, L>, M>, N>, O>, P>, Q>, R>, S>, T>, U>, V>, W>, X>, Y>, Z>, A1>, B1>

type NonRecursive = (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>, G>, H>, I>, J>, K>, L>, M>, N>, O>, P>, Q>, R>, S>, T>, U>, V>, W>, X>, Y>, Z>, A1>, B1>, C1>

type NonRecursive = (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1, D1> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>, G>, H>, I>, J>, K>, L>, M>, N>, O>, P>, Q>, R>, S>, T>, U>, V>, W>, X>, Y>, Z>, A1>, B1>, C1>, D1>

type NonRecursive = (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1, D1)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1, D1, E1> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>, G>, H>, I>, J>, K>, L>, M>, N>, O>, P>, Q>, R>, S>, T>, U>, V>, W>, X>, Y>, Z>, A1>, B1>, C1>, D1>, E1>

type NonRecursive = (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1, D1, E1)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1, D1, E1, F1> IntoNonRecursive for Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<Recursive<NoneMore, A>, B>, C>, D>, E>, F>, G>, H>, I>, J>, K>, L>, M>, N>, O>, P>, Q>, R>, S>, T>, U>, V>, W>, X>, Y>, Z>, A1>, B1>, C1>, D1>, E1>, F1>

type NonRecursive = (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1, D1, E1, F1)

The resulting tuple type.

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

impl<Inner: IntoRecursive, Value> IntoRecursive for Recursive<Inner, Value>

type Recursive = Recursive<<Inner as IntoRecursive>::Recursive, Value>

The recursive type resulting from this tuple.

fn into_recursive(self) -> Self::Recursive

Create a recursive type from this tuple.

impl<InnerLayersWriter, Channels> LayersWriter for Recursive<InnerLayersWriter, (usize, LayerWriter<Channels>)>where InnerLayersWriter: LayersWriter, Channels: ChannelsWriter,

fn extract_uncompressed_block( &self, headers: &[Header], block: BlockIndex ) -> Vec<u8>

Deliver a block of pixels from a single layer to be stored in the file

impl<Inner: PartialEq, Value: PartialEq> PartialEq<Recursive<Inner, Value>> for Recursive<Inner, Value>

fn eq(&self, other: &Recursive<Inner, Value>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<Sample, InnerReader: RecursivePixelReader> RecursivePixelReader for Recursive<InnerReader, OptionalSampleReader<Sample>>where Sample: FromNativeSample + 'static,

type RecursiveChannelDescriptions = Recursive<<InnerReader as RecursivePixelReader>::RecursiveChannelDescriptions, Option<ChannelDescription>>

The channel descriptions from the image. Will be converted to a tuple before being stored in SpecificChannels<_, ChannelDescriptions>.

fn get_descriptions(&self) -> Self::RecursiveChannelDescriptions

Returns the channel descriptions based on the channels in the file.

type RecursivePixel = Recursive<<InnerReader as RecursivePixelReader>::RecursivePixel, Sample>

The pixel type. Will be converted to a tuple at the end of the process.

fn read_pixels<'s, FullPixel>( &self, bytes: &'s [u8], pixels: &mut [FullPixel], get_pixel: impl Fn(&mut FullPixel) -> &mut Self::RecursivePixel )

Read the line of pixels.

impl<Sample, InnerReader: RecursivePixelReader> RecursivePixelReader for Recursive<InnerReader, SampleReader<Sample>>where Sample: FromNativeSample + 'static,

type RecursiveChannelDescriptions = Recursive<<InnerReader as RecursivePixelReader>::RecursiveChannelDescriptions, ChannelDescription>

The channel descriptions from the image. Will be converted to a tuple before being stored in SpecificChannels<_, ChannelDescriptions>.

fn get_descriptions(&self) -> Self::RecursiveChannelDescriptions

Returns the channel descriptions based on the channels in the file.

type RecursivePixel = Recursive<<InnerReader as RecursivePixelReader>::RecursivePixel, Sample>

The pixel type. Will be converted to a tuple at the end of the process.

fn read_pixels<'s, FullPixel>( &self, bytes: &'s [u8], pixels: &mut [FullPixel], get_pixel: impl Fn(&mut FullPixel) -> &mut Self::RecursivePixel )

Read the line of pixels.

impl<Inner, InnerPixel, Sample> RecursivePixelWriter<Recursive<InnerPixel, Sample>> for Recursive<Inner, Option<SampleWriter<Sample>>>where Inner: RecursivePixelWriter<InnerPixel>, Sample: IntoNativeSample,

fn write_pixels<FullPixel>( &self, bytes: &mut [u8], pixels: &[FullPixel], get_pixel: impl Fn(&FullPixel) -> &Recursive<InnerPixel, Sample> )

Write pixels to a slice of bytes. Recursively do this for all channels.

impl<Inner, InnerPixel, Sample: IntoNativeSample> RecursivePixelWriter<Recursive<InnerPixel, Sample>> for Recursive<Inner, SampleWriter<Sample>>where Inner: RecursivePixelWriter<InnerPixel>,

fn write_pixels<FullPixel>( &self, bytes: &mut [u8], pixels: &[FullPixel], get_pixel: impl Fn(&FullPixel) -> &Recursive<InnerPixel, Sample> )

Write pixels to a slice of bytes. Recursively do this for all channels.

impl<Inner, T> ValidateResult for Recursive<Inner, T>where Inner: ValidateResult, T: ValidateResult,

fn validate_result( &self, other: &Self, options: ValidationOptions, location: impl Fn() -> String ) -> ValidationResult

Compare self with the other. Exceptional behaviour:

fn assert_equals_result(&self, result: &Self)

Compare self with the other. Panics if not equal.

impl<InnerDescriptions, InnerPixel, Sample: IntoNativeSample> WritableChannelsDescription<Recursive<InnerPixel, Sample>> for Recursive<InnerDescriptions, ChannelDescription>where InnerDescriptions: WritableChannelsDescription<InnerPixel>,

type RecursiveWriter = Recursive<<InnerDescriptions as WritableChannelsDescription<InnerPixel>>::RecursiveWriter, SampleWriter<Sample>>

A type that has a recursive entry for each channel in the image, which must accept the desired pixel type.

fn create_recursive_writer( &self, channels: &ChannelList ) -> Self::RecursiveWriter

Create the temporary writer, accepting the sorted list of channels from channel_descriptions_list.

fn channel_descriptions_list(&self) -> SmallVec<[ChannelDescription; 5]>

Return all the channels that should actually end up in the image, in any order.

impl<InnerDescriptions, InnerPixel, Sample: IntoNativeSample> WritableChannelsDescription<Recursive<InnerPixel, Sample>> for Recursive<InnerDescriptions, Option<ChannelDescription>>where InnerDescriptions: WritableChannelsDescription<InnerPixel>,

type RecursiveWriter = Recursive<<InnerDescriptions as WritableChannelsDescription<InnerPixel>>::RecursiveWriter, Option<SampleWriter<Sample>>>

A type that has a recursive entry for each channel in the image, which must accept the desired pixel type.

fn create_recursive_writer( &self, channels: &ChannelList ) -> Self::RecursiveWriter

Create the temporary writer, accepting the sorted list of channels from channel_descriptions_list.

fn channel_descriptions_list(&self) -> SmallVec<[ChannelDescription; 5]>

Return all the channels that should actually end up in the image, in any order.

impl<'slf, InnerLayers, Channels> WritableLayers<'slf> for Recursive<InnerLayers, Layer<Channels>>where InnerLayers: WritableLayers<'slf>, Channels: WritableChannels<'slf>,

fn infer_headers(&self, image_attributes: &ImageAttributes) -> Headers

Generate the file meta data for this list of layers

type Writer = Recursive<<InnerLayers as WritableLayers<'slf>>::Writer, (usize, LayerWriter<<Channels as WritableChannels<'slf>>::Writer>)>

The type of temporary writer

fn create_writer(&'slf self, headers: &[Header]) -> Self::Writer

Create a temporary writer for this list of layers

impl<Inner: Copy, Value: Copy> Copy for Recursive<Inner, Value>

impl<Inner: Eq, Value: Eq> Eq for Recursive<Inner, Value>

impl<Inner, Value> StructuralEq for Recursive<Inner, Value>

impl<Inner, Value> StructuralPartialEq for Recursive<Inner, Value>