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

// Copyright (c) 2018-2020 Thomas Kramer.
// SPDX-FileCopyrightText: 2018-2022 Thomas Kramer
//
// SPDX-License-Identifier: AGPL-3.0-or-later

//! This crate provides basic data structures for Euclidean geometry in the plane.

// Enforce documentation.
#![deny(missing_docs)]


#[cfg(feature = "serde")]
#[macro_use]
extern crate serde;
extern crate itertools;

use num_traits::Num;

/// Trait for types that can be used as coordinates in the euclidean plane.
/// In practice this are integers, floats and possible rational numbers.
pub trait CoordinateType: Num + Copy + PartialOrd + Sized {}
impl<T: Num + Copy + PartialOrd> CoordinateType for T {}

/// Trait for types that can be used as areas.
/// In practice this are integers, floats and possible rational numbers.
pub trait AreaType: Num + Copy + PartialOrd + Sized {}
impl<T: Num + Copy + PartialOrd> AreaType for T {}

pub mod prelude;
 
mod cmp;
pub mod math;
pub mod types;
pub mod traits;
pub mod vector;
pub mod point;
pub mod point_string;
pub mod edge;
pub mod edge_rational;
pub mod edge_integer;
pub mod rect;
pub mod simple_polygon;
pub mod simple_rpolygon;
pub mod polygon;
pub mod matrix2d;
pub mod matrix3d;
pub mod multi_polygon;
pub mod path;
pub mod shape;
pub mod text;
pub mod transform;
pub mod redge;
pub mod repetition;
pub mod algorithms;
pub mod concepts;
pub mod isotropy;
pub mod interval;
pub mod concepts_impl;