Primitive tuple
Implementations
impl<S, T, #uint N> [(S, T); N]
fn unzip(self) -> ([S; N], [T; N])
Splits an array of pairs into a pair of arrays.
Both arrays produced have the same length as the input array. The first element of the left
array is the first element of the first tuple, the second element the first element of the
second tuple, and so on. In other words, the array [(l0, r0), (l1, r1), (l2, r2), ...] is
split into [l0, l1, l2, ...] and [r0, r1, r2, ...].
Examples
let (l, r) = [(10u8, 20u8), (11u8, 21u8), (12u8, 22u8)].unzip();
assert l == [10u8, 11u8, 12u8];
assert r == [20u8, 21u8, 22u8];
let empty: [(uint<8>, uint<8>); 0] = [];
assert empty.unzip() == ([], []);Trait Implementations
impl Default for ()
fn hacky_default(self) -> Self
impl<T0: Default> Default for (T0)
fn hacky_default(self) -> Self
impl<T0: Default, T1: Default> Default for (T0, T1)
fn hacky_default(self) -> Self
impl<T0: Default, T1: Default, T2: Default> Default for (T0, T1, T2)
fn hacky_default(self) -> Self
impl<T0: Default, T1: Default, T2: Default, T3: Default> Default for (T0, T1, T2, T3)
fn hacky_default(self) -> Self
impl<T0: Default, T1: Default, T2: Default, T3: Default, T4: Default> Default for (T0, T1, T2, T3, T4)
fn hacky_default(self) -> Self
impl<T0: Default, T1: Default, T2: Default, T3: Default, T4: Default, T5: Default> Default for (T0, T1, T2, T3, T4, T5)
fn hacky_default(self) -> Self
impl<T0: Default, T1: Default, T2: Default, T3: Default, T4: Default, T5: Default, T6: Default> Default for (T0, T1, T2, T3, T4, T5, T6)
fn hacky_default(self) -> Self
impl<T0: Default, T1: Default, T2: Default, T3: Default, T4: Default, T5: Default, T6: Default, T7: Default> Default for (T0, T1, T2, T3, T4, T5, T6, T7)
fn hacky_default(self) -> Self