rene 0.2.0

Computational geometry.
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

use std::hash::{Hash, Hasher};

use crate::oriented::{Orientation, Oriented};

use super::types::Contour;

impl<Scalar: Hash + Ord> Hash for Contour<Scalar>
where
    for<'a> &'a Self: Oriented,
{
    fn hash<H: Hasher>(&self, state: &mut H) {
        let min_vertex_index = self.to_min_vertex_index();
        self.vertices[min_vertex_index].hash(state);
        if self.to_orientation() == Orientation::Clockwise {
            for index in (0..min_vertex_index).rev() {
                self.vertices[index].hash(state);
            }
            for index in (min_vertex_index + 1..self.vertices.len()).rev() {
                self.vertices[index].hash(state);
            }
        } else {
            for index in min_vertex_index + 1..self.vertices.len() {
                self.vertices[index].hash(state);
            }
            for index in 0..min_vertex_index {
                self.vertices[index].hash(state);
            }
        }
    }
}