Struct MipMap1D 

pub struct MipMap1D<T: Num + ToPrimitive + FromPrimitive> { /* private fields */ }

Creates several downsampled versions of given vector. This data structure takes 2x space of original data. Example:

use mipmap_1d::MipMap1D;

let data = vec![2, 4, 6, 8, 9];
let mipmap = MipMap1D::new(data);
assert_eq!(mipmap.num_levels(), 4);
assert_eq!(*mipmap.get_level(0).unwrap(), [2, 4, 6, 8, 9]);
assert_eq!(*mipmap.get_level(1).unwrap(), [3, 7, 9]);
assert_eq!(*mipmap.get_level(2).unwrap(), [5, 9]);
assert_eq!(*mipmap.get_level(3).unwrap(), [7]);
assert_eq!(mipmap.get_level(4), None);

Implementations

impl<T: Num + ToPrimitive + FromPrimitive + Copy> MipMap1D<T>

pub fn new(source: Vec<T>) -> Self

pub fn num_levels(&self) -> usize

Returns the total number of downsampled levels. Equal to ceil(log2(source.len())

pub fn get_level(&self, level: usize) -> Option<&Vec<T>>

Returns the data on given level. Level 0 returns the source data; the higher the level, the higher the compression (i.e. smaller vectors are returned). If the level is out of bounds, returns None

Trait Implementations

impl<T: Debug + Num + ToPrimitive + FromPrimitive> Debug for MipMap1D<T>

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

Formats the value using the given formatter.

impl<T: Default + Num + ToPrimitive + FromPrimitive> Default for MipMap1D<T>

fn default() -> MipMap1D<T>

Returns the “default value” for a type.

impl<T: PartialEq + Num + ToPrimitive + FromPrimitive> PartialEq for MipMap1D<T>

fn eq(&self, other: &MipMap1D<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl<T: Eq + Num + ToPrimitive + FromPrimitive> Eq for MipMap1D<T>

impl<T: Num + ToPrimitive + FromPrimitive> StructuralPartialEq for MipMap1D<T>