nannou_core 0.20.0

The core components of nannou - a creative coding framework for Rust. Ideal for libraries and headless/embedded applications that use nannou.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92

//! Types, functions and other items related to geometry. This module is the source of all graphics
//! and lazer primitives and aids work in 2D and 3D space.
//!
//! Each module provides a set of general tools for working with the named geometry including:
//!
//! - A typed, object representation.
//! - Functions for producing vertices, triangles and triangulation indices.
//! - Functions for checking whether or not the geometry contains a point.
//! - Functions for determining the bounding rectangle or cuboid.
//! - A function for finding the centroid.

pub use glam::{
    DVec2, DVec3, DVec4, IVec2, IVec3, IVec4, Vec2, Vec3, Vec4, dvec2, dvec3, dvec4, ivec2, ivec3,
    ivec4, vec2, vec3, vec4,
};

pub use self::cuboid::Cuboid;
pub use self::ellipse::Ellipse;
pub use self::point::{Point2, Point3, Point4, pt2, pt3, pt4};
pub use self::polygon::Polygon;
pub use self::quad::Quad;
pub use self::range::{Align, Edge, Range};
pub use self::rect::{Corner, Padding, Rect};
pub use self::scalar::Scalar;
pub use self::tri::Tri;
#[allow(deprecated)]
pub use self::vector::{Vector2, Vector3, Vector4};
pub use self::vertex::{Vertex, Vertex2d, Vertex3d};

pub mod cuboid;
pub mod ellipse;
pub mod point;
pub mod polygon;
pub mod quad;
pub mod range;
pub mod rect;
pub mod scalar;
pub mod tri;
pub mod vector;
pub mod vertex;

// General geometry utility functions

/// The `Rect` that bounds the given sequence of vertices.
///
/// Returns `None` if the given iterator is empty.
pub fn bounding_rect<I>(vertices: I) -> Option<Rect<<I::Item as Vertex>::Scalar>>
where
    I: IntoIterator,
    I::Item: Vertex2d,
{
    let mut vertices = vertices.into_iter();
    vertices.next().map(|first| {
        let [x, y] = first.point2();
        let bounds = Rect {
            x: Range::new(x, x),
            y: Range::new(y, y),
        };
        vertices.fold(bounds, |b, v| b.stretch_to_point(v.point2()))
    })
}

/// The `Cuboid` that bounds the given sequence of vertices.
///
/// Returns `None` if the given iterator is empty.
pub fn bounding_cuboid<I>(vertices: I) -> Option<Cuboid<<I::Item as Vertex>::Scalar>>
where
    I: IntoIterator,
    I::Item: Vertex3d,
{
    let mut vertices = vertices.into_iter();
    vertices.next().map(|first| {
        let [x, y, z] = first.point3();
        let bounds = Cuboid {
            x: Range::new(x, x),
            y: Range::new(y, y),
            z: Range::new(z, z),
        };
        vertices.fold(bounds, |b, v| b.stretch_to_point(v.point3()))
    })
}

/// The `centroid` (average position) of all vertices in the given iterator.
///
/// Returns `None` if the given iterator contains no vertices.
pub fn centroid<I>(vertices: I) -> Option<I::Item>
where
    I: IntoIterator,
    I::Item: vertex::Average,
{
    <I::Item as vertex::Average>::average(vertices)
}