Struct Grid 

pub struct Grid<T> { /* private fields */ }

Stores elements of a certain type in a 2D grid structure.

Uses a rust Vec<T> type to reference the grid data on the heap. Also the number of rows and columns are stored in the grid data structure.

The grid data is stored in a row-major memory layout.

Implementations

impl<T> Grid<T>

where T: Clone,

pub fn new(rows: usize, cols: usize) -> Grid<T>

where T: Default,

Init a grid of size rows x columns with default values of the given type. For example this will generate a 2x3 grid of zeros:

use grid::Grid;
let grid : Grid<u8> = Grid::new(2,2);
assert_eq!(grid[0][0], 0);

pub fn init(rows: usize, cols: usize, data: T) -> Grid<T>

Init a grid of size rows x columns with the given data element.

pub fn from_vec(vec: Vec<T>, cols: usize) -> Grid<T>

Returns a grid from a vector with a given column length. The length of vec must be a multiple of cols.

For example:

use grid::Grid;
let grid = Grid::from_vec(vec![1,2,3,4,5,6], 3);
assert_eq!(grid.size(), (2, 3));

will create a grid with the following layout: [1,2,3] [4,5,6]

This example will fail, because vec.len() is not a multiple of cols:

use grid::Grid;
Grid::from_vec(vec![1,2,3,4,5], 3);

Examples found in repository

examples/bezier.rs (line 31)

fn load_teapot(
    division: (usize, usize),
) -> std::io::Result<Model<SurfacePatch<BezierSurface<Point3>>>> {
    use std::fs::File;
    use std::io::{BufRead, BufReader};
    use std::path::Path;
    use std::str::FromStr;

    let file = Path::new(&std::env::var("CARGO_MANIFEST_DIR").unwrap()).join("assets/teapot.bpt");
    let reader = BufReader::new(File::open(file)?);

    let mut model = Model::new();
    let mut points = Vec::new();
    let mut current_cols = 0;

    for line in reader.lines() {
        let numbers = line?;
        let items = numbers.split_whitespace().collect::<Vec<_>>();
        if items.len() == 1 {
            model
                .faces
                .reserve_exact(usize::from_str(items[0]).unwrap());
        } else if items.len() == 2 {
            if points.len() > 0 {
                let surface = SurfacePatch {
                    surface: BezierSurface::new(Grid::from_vec(points, current_cols)),
                    parameter_range: ((0.0, 1.0), (0.0, 1.0)),
                    parameter_division: division,
                };
                model.add_face(surface);
            }
            let m = usize::from_str(items[0]).unwrap();
            let n = usize::from_str(items[1]).unwrap();
            points = Vec::with_capacity((m + 1) * (n + 1));
            current_cols = n + 1;
        } else if items.len() == 3 {
            let point = Point3::new(
                Float::from_str(items[0]).unwrap(),
                Float::from_str(items[1]).unwrap(),
                Float::from_str(items[2]).unwrap(),
            );
            points.push(point);
        }
    }
    // add last surface
    let surface = SurfacePatch {
        surface: BezierSurface::new(Grid::from_vec(points, current_cols)),
        parameter_range: ((0.0, 1.0), (0.0, 1.0)),
        parameter_division: division,
    };
    model.add_face(surface);
    Ok(model)
}

examples/bspline.rs (line 33)

fn load_teapot(
    degree: (usize, usize),
    division: (usize, usize),
) -> std::io::Result<Model<SurfacePatch<BSplineSurface<Point3>>>> {
    use std::fs::File;
    use std::io::{BufRead, BufReader};
    use std::path::Path;
    use std::str::FromStr;

    let file = Path::new(&std::env::var("CARGO_MANIFEST_DIR").unwrap()).join("assets/teapot.bpt");
    let reader = BufReader::new(File::open(file)?);

    let mut model = Model::new();
    let mut points = Vec::new();
    let mut current_cols = 0;

    for line in reader.lines() {
        let numbers = line?;
        let items = numbers.split_whitespace().collect::<Vec<_>>();
        if items.len() == 1 {
            model
                .faces
                .reserve_exact(usize::from_str(items[0]).unwrap());
        } else if items.len() == 2 {
            if points.len() > 0 {
                let surface = SurfacePatch {
                    surface: BSplineSurface::uniform_clamped(
                        Grid::from_vec(points, current_cols),
                        degree,
                    ),
                    parameter_range: ((0.0, 1.0), (0.0, 1.0)),
                    parameter_division: division,
                };
                model.add_face(surface);
            }
            let m = usize::from_str(items[0]).unwrap();
            let n = usize::from_str(items[1]).unwrap();
            points = Vec::with_capacity((m + 1) * (n + 1));
            current_cols = n + 1;
        } else if items.len() == 3 {
            let point = Point3::new(
                Float::from_str(items[0]).unwrap(),
                Float::from_str(items[1]).unwrap(),
                Float::from_str(items[2]).unwrap(),
            );
            points.push(point);
        }
    }
    // add last surface
    let surface = SurfacePatch {
        surface: BSplineSurface::uniform_clamped(Grid::from_vec(points, current_cols), degree),
        parameter_range: ((0.0, 1.0), (0.0, 1.0)),
        parameter_division: division,
    };
    model.add_face(surface);
    Ok(model)
}

pub unsafe fn get_unchecked(&self, row: usize, col: usize) -> &T

Returns a reference to an element, without performing bound checks. Generally not recommended, use with caution! Calling this method with an out-of-bounds index is undefined behavior even if the resulting reference is not used.

pub unsafe fn get_unchecked_mut(&mut self, row: usize, col: usize) -> &mut T

Returns a mutable reference to an element, without performing bound checks. Generally not recommended, use with caution! Calling this method with an out-of-bounds index is undefined behavior even if the resulting reference is not used.

pub fn get(&self, row: usize, col: usize) -> Option<&T>

Access a certain element in the grid. Returns None if an element beyond the grid bounds is tried to be accessed.

pub fn get_mut(&mut self, row: usize, col: usize) -> Option<&mut T>

Mutable access to a certain element in the grid. Returns None if an element beyond the grid bounds is tried to be accessed.

pub fn size(&self) -> (usize, usize)

Returns the size of the gird as a two element tuple. First element are the number of rows and the second the columns.

pub fn rows(&self) -> usize

Returns the number of rows of the grid.

pub fn cols(&self) -> usize

Returns the number of columns of the grid.

pub fn is_empty(&self) -> bool

Returns true if the grid contains no elements. For example:

use grid::*;
let grid : Grid<u8> = grid![];
assert!(grid.is_empty());

pub fn clear(&mut self)

Clears the grid.

pub fn iter(&self) -> Iter<'_, T>

Returns an iterator over the whole grid, starting from the first row and column.

use grid::*;
let grid: Grid<u8> = grid![[1,2][3,4]];
let mut iter = grid.iter();
assert_eq!(iter.next(), Some(&1));
assert_eq!(iter.next(), Some(&2));
assert_eq!(iter.next(), Some(&3));
assert_eq!(iter.next(), Some(&4));
assert_eq!(iter.next(), None);

pub fn iter_mut(&mut self) -> IterMut<'_, T>

Returns an mutable iterator over the whole grid that allows modifying each value.

use grid::*;
let mut grid: Grid<u8> = grid![[1,2][3,4]];
let mut iter = grid.iter_mut();
let next = iter.next();
assert_eq!(next, Some(&mut 1));
*next.unwrap() = 10;

pub fn iter_col(&self, col: usize) -> StepBy<Iter<'_, T>>

Returns an iterator over a column.

Examples

use grid::*;
let grid: Grid<u8> = grid![[1, 2, 3][3, 4, 5]];
let mut col_iter = grid.iter_col(1);
assert_eq!(col_iter.next(), Some(&2));
assert_eq!(col_iter.next(), Some(&4));
assert_eq!(col_iter.next(), None);

Panics

Panics if the col index is out of bounds.

pub fn iter_col_mut(&mut self, col: usize) -> StepBy<IterMut<'_, T>>

Returns a mutable iterator over a column.

Examples

use grid::*;
let mut grid: Grid<u8> = grid![[1, 2, 3][3, 4, 5]];
let mut col_iter = grid.iter_col_mut(1);
let next = col_iter.next();
assert_eq!(next, Some(&mut 2));
*next.unwrap() = 10;
assert_eq!(grid[0][1], 10);

Panics

Panics if the col index is out of bounds.

pub fn iter_row(&self, row: usize) -> Iter<'_, T>

Returns an iterator over a row.

Examples

use grid::*;
let grid: Grid<u8> = grid![[1, 2, 3][3, 4, 5]];
let mut col_iter = grid.iter_row(1);
assert_eq!(col_iter.next(), Some(&3));
assert_eq!(col_iter.next(), Some(&4));
assert_eq!(col_iter.next(), Some(&5));
assert_eq!(col_iter.next(), None);

Panics

Panics if the row index is out of bounds.

pub fn iter_row_mut(&mut self, row: usize) -> IterMut<'_, T>

Returns a mutable iterator over a row.

Examples

use grid::*;
let mut grid: Grid<u8> = grid![[1, 2, 3][3, 4, 5]];
let mut col_iter = grid.iter_row_mut(1);
let next = col_iter.next();
*next.unwrap() = 10;
assert_eq!(grid[1][0], 10);

Panics

Panics if the row index is out of bounds.

pub fn push_row(&mut self, row: Vec<T>)

Add a new row to the grid.

Examples

use grid::*;
let mut grid: Grid<u8> = grid![[1, 2, 3][3, 4, 5]];
let row = vec![6,7,8];
grid.push_row(row);
assert_eq!(grid.rows(), 3);
assert_eq!(grid[2][0], 6);
assert_eq!(grid[2][1], 7);
assert_eq!(grid[2][2], 8);

Can also be used to init an empty grid:

use grid::*;
let mut grid: Grid<u8> = grid![];
let row = vec![1,2,3];
grid.push_row(row);
assert_eq!(grid.size(), (1, 3));

Panics

Panics if the grid is not empty and row.len() != grid.cols().

pub fn push_col(&mut self, col: Vec<T>)

Add a new column to the grid.

Important: Please note that Grid uses a Row-Major memory layout. Therefore, the push_col() operation requires quite a lot of memory shifting and will be significantly slower compared to a push_row() operation.

Examples

use grid::*;
let mut grid: Grid<u8> = grid![[1, 2, 3][3, 4, 5]];
let col = vec![4,6];
grid.push_col(col);
assert_eq!(grid.cols(), 4);
assert_eq!(grid[0][3], 4);
assert_eq!(grid[1][3], 6);

Can also be used to init an empty grid:

use grid::*;
let mut grid: Grid<u8> = grid![];
let col = vec![1,2,3];
grid.push_col(col);
assert_eq!(grid.size(), (3, 1));

Panics

Panics if the grid is not empty and col.len() != grid.rows().

pub fn pop_row(&mut self) -> Option<Vec<T>>

Removes the last row from a grid and returns it, or None if it is empty.

Examples

use grid::*;
let mut grid = grid![[1,2,3][4,5,6]];
assert_eq![grid.pop_row(), Some(vec![4,5,6])];
assert_eq![grid.pop_row(), Some(vec![1,2,3])];
assert_eq![grid.pop_row(), None];

pub fn pop_col(&mut self) -> Option<Vec<T>>

Removes the last column from a grid and returns it, or None if it is empty.

Note that this operation is much slower than the pop_row() because the memory layout of Grid is row-major and removing a column requires a lot of move operations.

Examples

use grid::*;
let mut grid = grid![[1,2,3][4,5,6]];
assert_eq![grid.pop_col(), Some(vec![3,6])];
assert_eq![grid.pop_col(), Some(vec![2,5])];
assert_eq![grid.pop_col(), Some(vec![1,4])];
assert_eq![grid.pop_col(), None];

pub fn insert_row(&mut self, index: usize, row: Vec<T>)

Insert a new row at the index and shifts all rows after down.

Examples

use grid::*;
let mut grid = grid![[1,2,3][4,5,6]];
grid.insert_row(1, vec![7,8,9]);
assert_eq!(grid[0], [1,2,3]);
assert_eq!(grid[1], [7,8,9]);
assert_eq!(grid[2], [4,5,6]);
assert_eq!(grid.size(), (3,3))

pub fn insert_col(&mut self, index: usize, col: Vec<T>)

Insert a new column at the index.

Important! Insertion of columns is a lot slower than the lines insertion. This is because of the memory layout of the grid data structure.

Examples

use grid::*;
let mut grid = grid![[1,2,3][4,5,6]];
grid.insert_col(1, vec![9,9]);
assert_eq!(grid[0], [1,9,2,3]);
assert_eq!(grid[1], [4,9,5,6]);
assert_eq!(grid.size(), (2,4))

pub fn flatten(&self) -> &Vec<T>

Returns a reference to the internal data structure of the grid.

Grid uses a row major layout. All rows are placed right after each other in the vector data structure.

Examples

use grid::*;
let grid = grid![[1,2,3][4,5,6]];
let flat = grid.flatten();
assert_eq!(flat, &vec![1,2,3,4,5,6]);

pub fn into_vec(self) -> Vec<T>

Converts self into a vector without clones or allocation.

Trait Implementations

impl<T> Clone for Grid<T>

where T: Clone,

fn clone(&self) -> Grid<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T> Debug for Grid<T>

where T: Debug,

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

Formats the value using the given formatter.

impl From<Grid<DVec3>> for TriangleMesh

fn from(grid: Grid<Point3>) -> TriangleMesh

Converts to this type from the input type.

impl<T> Index<usize> for Grid<T>

where T: Clone,

type Output = [T]

The returned type after indexing.

fn index(&self, idx: usize) -> &<Grid<T> as Index<usize>>::Output

Performs the indexing (container[index]) operation.

impl<T> IndexMut<usize> for Grid<T>

where T: Clone,

fn index_mut(&mut self, idx: usize) -> &mut <Grid<T> as Index<usize>>::Output

Performs the mutable indexing (container[index]) operation.

impl<T> PartialEq for Grid<T>

where T: Eq,

fn eq(&self, other: &Grid<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 for Grid<T>

where T: Eq,