pub trait VecFromOtherType<T>: Sized {
    fn vec_from_other_type(value: T) -> Vec<Self>;
}
Expand description

Converts a slice of one type of value to a Vec of another type.

Required Methods

Implementations on Foreign Types

Converts a value of one type to a Vec of the same type.

In this case, it just creates a one-element Vec.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type to a Vec of the same type.

In this case, it just creates a one-element Vec.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type to a Vec of the same type.

In this case, it just creates a one-element Vec.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type to a Vec of the same type.

In this case, it just creates a one-element Vec.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type to a Vec of the same type.

In this case, it just creates a one-element Vec.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type to a Vec of the same type.

In this case, it just creates a one-element Vec.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type of unsigned integer to a Vec of a smaller unsigned type.

The input value will be broken up into several values in the output Vec.

$f(x) = (y_k){k=0}^{m-1}$, where $x = \sum{j=0}^{m-1}2^{jW}y_j$ and $m = 2^{V-W}n$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type of unsigned integer to a Vec of a smaller unsigned type.

The input value will be broken up into several values in the output Vec.

$f(x) = (y_k){k=0}^{m-1}$, where $x = \sum{j=0}^{m-1}2^{jW}y_j$ and $m = 2^{V-W}n$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type of unsigned integer to a Vec of a smaller unsigned type.

The input value will be broken up into several values in the output Vec.

$f(x) = (y_k){k=0}^{m-1}$, where $x = \sum{j=0}^{m-1}2^{jW}y_j$ and $m = 2^{V-W}n$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type of unsigned integer to a Vec of a smaller unsigned type.

The input value will be broken up into several values in the output Vec.

$f(x) = (y_k){k=0}^{m-1}$, where $x = \sum{j=0}^{m-1}2^{jW}y_j$ and $m = 2^{V-W}n$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type of unsigned integer to a Vec of a smaller unsigned type.

The input value will be broken up into several values in the output Vec.

$f(x) = (y_k){k=0}^{m-1}$, where $x = \sum{j=0}^{m-1}2^{jW}y_j$ and $m = 2^{V-W}n$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type of unsigned integer to a Vec of a smaller unsigned type.

The input value will be broken up into several values in the output Vec.

$f(x) = (y_k){k=0}^{m-1}$, where $x = \sum{j=0}^{m-1}2^{jW}y_j$ and $m = 2^{V-W}n$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type of unsigned integer to a Vec of a smaller unsigned type.

The input value will be broken up into several values in the output Vec.

$f(x) = (y_k){k=0}^{m-1}$, where $x = \sum{j=0}^{m-1}2^{jW}y_j$ and $m = 2^{V-W}n$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type of unsigned integer to a Vec of a smaller unsigned type.

The input value will be broken up into several values in the output Vec.

$f(x) = (y_k){k=0}^{m-1}$, where $x = \sum{j=0}^{m-1}2^{jW}y_j$ and $m = 2^{V-W}n$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type of unsigned integer to a Vec of a smaller unsigned type.

The input value will be broken up into several values in the output Vec.

$f(x) = (y_k){k=0}^{m-1}$, where $x = \sum{j=0}^{m-1}2^{jW}y_j$ and $m = 2^{V-W}n$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type of unsigned integer to a Vec of a smaller unsigned type.

The input value will be broken up into several values in the output Vec.

$f(x) = (y_k){k=0}^{m-1}$, where $x = \sum{j=0}^{m-1}2^{jW}y_j$ and $m = 2^{V-W}n$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type of unsigned integer to a Vec of a smaller unsigned type.

The input value will be broken up into several values in the output Vec.

$f(x) = (y_k){k=0}^{m-1}$, where $x = \sum{j=0}^{m-1}2^{jW}y_j$ and $m = 2^{V-W}n$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type of unsigned integer to a Vec of a smaller unsigned type.

The input value will be broken up into several values in the output Vec.

$f(x) = (y_k){k=0}^{m-1}$, where $x = \sum{j=0}^{m-1}2^{jW}y_j$ and $m = 2^{V-W}n$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type of unsigned integer to a Vec of a smaller unsigned type.

The input value will be broken up into several values in the output Vec.

$f(x) = (y_k){k=0}^{m-1}$, where $x = \sum{j=0}^{m-1}2^{jW}y_j$ and $m = 2^{V-W}n$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type of unsigned integer to a Vec of a larger unsigned type.

The output Vec only contains one value. The least-significant bits of the output value contain the input value, and the most-significant bits are set to 0.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type of unsigned integer to a Vec of a larger unsigned type.

The output Vec only contains one value. The least-significant bits of the output value contain the input value, and the most-significant bits are set to 0.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type of unsigned integer to a Vec of a larger unsigned type.

The output Vec only contains one value. The least-significant bits of the output value contain the input value, and the most-significant bits are set to 0.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type of unsigned integer to a Vec of a larger unsigned type.

The output Vec only contains one value. The least-significant bits of the output value contain the input value, and the most-significant bits are set to 0.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type of unsigned integer to a Vec of a larger unsigned type.

The output Vec only contains one value. The least-significant bits of the output value contain the input value, and the most-significant bits are set to 0.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type of unsigned integer to a Vec of a larger unsigned type.

The output Vec only contains one value. The least-significant bits of the output value contain the input value, and the most-significant bits are set to 0.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type of unsigned integer to a Vec of a larger unsigned type.

The output Vec only contains one value. The least-significant bits of the output value contain the input value, and the most-significant bits are set to 0.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type of unsigned integer to a Vec of a larger unsigned type.

The output Vec only contains one value. The least-significant bits of the output value contain the input value, and the most-significant bits are set to 0.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type of unsigned integer to a Vec of a larger unsigned type.

The output Vec only contains one value. The least-significant bits of the output value contain the input value, and the most-significant bits are set to 0.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type of unsigned integer to a Vec of a larger unsigned type.

The output Vec only contains one value. The least-significant bits of the output value contain the input value, and the most-significant bits are set to 0.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type of unsigned integer to a Vec of a larger unsigned type.

The output Vec only contains one value. The least-significant bits of the output value contain the input value, and the most-significant bits are set to 0.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type of unsigned integer to a Vec of a larger unsigned type.

The output Vec only contains one value. The least-significant bits of the output value contain the input value, and the most-significant bits are set to 0.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a value of one type of unsigned integer to a Vec of a larger unsigned type.

The output Vec only contains one value. The least-significant bits of the output value contain the input value, and the most-significant bits are set to 0.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Converts a u32 to a Vec of usizes.

Worst-case complexity

Constant time and additional memory.

See here.

Converts a u64 to a Vec of usizes.

Worst-case complexity

Constant time and additional memory.

See here.

Converts a usize to a Vec of u32s.

Worst-case complexity

Constant time and additional memory.

See here.

Converts a usize to a Vec of u64s.

Worst-case complexity

Constant time and additional memory.

See here.

Implementors