Struct plexus::index::HashIndexer

pub struct HashIndexer<T, K> where
    T: Topological,
    K: Clone + Eq + Hash,  { /* private fields */ }

Hashing vertex indexer.

This indexer hashes key data for vertices to form an index. This is fast, reliable, and requires no configuration. Prefer this indexer when possible.

The vertex key data must implement Hash. Vertex data often includes floating-point values (i.e., f32 or f64), which do not implement Hash. Types from the decorum crate can be used to allow floating-point data to be hashed.

Examples

use decorum::R64;
use nalgebra::Point3;
use plexus::index::{Flat3, HashIndexer};
use plexus::prelude::*;
use plexus::primitive::cube::Cube;
use plexus::primitive::generate::Position;

let (indices, positions) = Cube::new()
    .polygons::<Position<Point3<R64>>>()
    .triangulate()
    .index_vertices::<Flat3, _>(HashIndexer::default());

Implementations

impl<T, K> HashIndexer<T, K> where
    T: Topological,
    K: Clone + Eq + Hash, 

pub fn new() -> Self

Creates a new HashIndexer.

Trait Implementations

impl<T, K> Default for HashIndexer<T, K> where
    T: Topological,
    K: Clone + Eq + Hash, 

fn default() -> Self

Returns the “default value” for a type.

impl<T, K> Indexer<T, K> for HashIndexer<T, K> where
    T: Topological,
    K: Clone + Eq + Hash, 

fn index<F>(&mut self, input: T::Vertex, f: F) -> (usize, Option<T::Vertex>) where
    F: Fn(&T::Vertex) -> &K, 

Indexes a vertex using a keying function.