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

use std::hash;

use cgmath::Point3;

use ptr::{Ptr, EdgePtr, EdgeRc};
use iterators::*;

#[derive(Debug)]
pub struct Vert {
  pub edge: EdgePtr,
  pub pos: Point3<f32>,
  pub id: u32,
}

impl Vert {
  /// All structure of the mesh revolves around vertex positions and their connectivity.
  /// (Faces are just an abstraction). All vertices must therefore have a concrete position.
  pub fn empty(id: u32, pos: Point3<f32>) -> Vert {
    Vert {
      id: id,
      edge: EdgePtr::empty(),
      pos: pos,
    }
  }

  /// Vertex connected to an existing edge
  pub fn with_edge(id: u32, pos: Point3<f32>, edge: EdgePtr) -> Vert {
    Vert {
      id: id,
      edge: edge,
      pos: pos,
    }
  }

  pub fn take_edge(&mut self, edge: EdgePtr) { self.edge = edge; }

  pub fn set_edge(&mut self, edge: & EdgePtr) { self.edge = edge.clone(); }

  pub fn set_edge_rc(&mut self, edge: & EdgeRc) { self.edge = Ptr::new(edge); }

  pub fn move_to(&mut self, pos: Point3<f32>) { self.pos = pos; }

  pub fn get_pos(& self) -> Point3<f32> { self.pos }

  pub fn is_valid(& self) -> bool { self.edge.is_valid() }

  pub fn get_edge(& self) -> Option<EdgeRc> { self.edge.upgrade() }

  /// Important: Iterates over the vertices connected to a vertex in *clockwise* order
  pub fn adjacent_verts(& self) -> VertAdjacentVertIterator {
    VertAdjacentVertIterator::new(self.edge.clone())
  }

  /// Important: Iterates over the edges connected to a vertex in *clockwise* order
  pub fn adjacent_edges(& self) -> VertAdjacentEdgeIterator {
    VertAdjacentEdgeIterator::new(self.edge.clone())
  }

  /// Important: Iterates over the faces connected to a vertex in *clockwise* order
  pub fn adjacent_faces(& self) -> VertAdjacentFaceIterator {
    VertAdjacentFaceIterator::new(self.edge.clone())
  }
}

impl PartialEq<Vert> for Vert {
  fn eq(& self, other: & Vert) -> bool { self.id == other.id }
}

impl Eq for Vert {}

impl hash::Hash for Vert {
  fn hash<H>(& self, state: &mut H) where H: hash::Hasher {
    state.write_u32(self.id);
    state.finish();
  }
}