Struct exr::image::recursive::Recursive

source · [−]

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

Expand description

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

source

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

source

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

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

Trait Implementations

source

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

source

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

Check for duplicate channel names.

source

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

source

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

Returns a copy of the value. Read more

1.0.0 · source

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

Performs copy-assignment from source. Read more

source

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

source

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

Formats the value using the given formatter. Read more

source

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

source

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

Returns the “default value” for a type. Read more

source

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

type NonRecursive = (A,)

The resulting tuple type.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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

type NonRecursive = (A, B)

The resulting tuple type.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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

type NonRecursive = (A, B, C)

The resulting tuple type.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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.

source

fn into_non_recursive(self) -> Self::NonRecursive

Convert this recursive type to a nice tuple.

source

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

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

The recursive type resulting from this tuple.

source

fn into_recursive(self) -> Self::Recursive

Create a recursive type from this tuple.

source

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

source

fn extract_uncompressed_block(
 &self,
 headers: &[Header ],
 block: BlockIndex
) -> Vec<u8>ⓘNotable traits for Vec<u8, A>`impl<A> Write for Vec<u8, A> where A: Allocator,`

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

source

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

source

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

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

source

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

This method tests for !=.

source

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>. Read more

source

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.

source

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.

source

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>. Read more

source

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.

source

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.

source

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

source

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.

source

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

source

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.

source

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

source

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

Compare self with the other. Exceptional behaviour: Read more

source

fn assert_equals_result(&self, result: &Self)

Compare self with the other. Panics if not equal. Read more

source

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. Read more

source

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

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

source

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

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

source

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. Read more

source

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

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

source

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

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

source

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

source

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

source

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

Create a temporary writer for this list of layers

source

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

Auto Trait Implementations

impl<Inner, Value> RefUnwindSafe for Recursive<Inner, Value> where
Inner: RefUnwindSafe,
Value: RefUnwindSafe,

impl<Inner, Value> Send for Recursive<Inner, Value> where
Inner: Send,
Value: Send,

impl<Inner, Value> Sync for Recursive<Inner, Value> where
Inner: Sync,
Value: Sync,

impl<Inner, Value> Unpin for Recursive<Inner, Value> where
Inner: Unpin,
Value: Unpin,

impl<Inner, Value> UnwindSafe for Recursive<Inner, Value> where
Inner: UnwindSafe,
Value: UnwindSafe,

Blanket Implementations

source

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

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

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

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

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

const: unstable · source

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

Mutably borrows from an owned value. Read more

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

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

const: unstable · source

fn into(self) -> U

Calls U::from(self).

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

source

impl IntoTuple<::NonRecursive> for I where
I: IntoNonRecursive,

source

fn into_tuple(self) -> ::NonRecursive

Convert this recursive type to a nice tuple.

source

impl<R, P> ReadPrimitive<R> for P where
R: Read + ReadEndian,
P: Default,

source

fn read_from_little_endian(read: &mut R) -> Result<Self, Error>

Read this value from the supplied reader. Same as ReadEndian::read_from_little_endian().

source

fn read_from_big_endian(read: &mut R) -> Result<Self, Error>

Read this value from the supplied reader. Same as ReadEndian::read_from_big_endian().

source

fn read_from_native_endian(read: &mut R) -> Result<Self, Error>

Read this value from the supplied reader. Same as ReadEndian::read_from_native_endian().

source

impl<T> ToOwned for T where
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

source

fn clone_into(&self, target: &mut T)

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

Uses borrowed data to replace owned data, usually by cloning. Read more

source

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

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

source

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

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.