transvoxel 0.5.1

Implementation of Eric Lengyel's Transvoxel Algorithm
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

use super::aux_tables::{RegularCellVoxelIndex, TransitionCellGridPointIndex};

pub struct RegularReuseIndex(pub usize);
pub struct TransitionReuseIndex(pub usize);

pub struct RegularVertexData(pub u16);

impl RegularVertexData {
    pub fn reuse_dx(&self) -> isize {
        let reuse_info = (self.0 & 0xFF00) >> 8;
        return -(((reuse_info & 0x10) >> 4) as i16) as isize;
    }
    pub fn reuse_dy(&self) -> isize {
        let reuse_info = (self.0 & 0xFF00) >> 8;
        return -(((reuse_info & 0x20) >> 5) as i16) as isize;
    }
    pub fn reuse_dz(&self) -> isize {
        let reuse_info = (self.0 & 0xFF00) >> 8;
        return -(((reuse_info & 0x40) >> 6) as i16) as isize;
    }
    pub fn new_vertex(&self) -> bool {
        let reuse_info = (self.0 & 0xFF00) >> 8;
        return (reuse_info & 0x80) != 0;
    }
    pub fn reuse_index(&self) -> RegularReuseIndex {
        let reuse_info = (self.0 & 0xFF00) >> 8;
        return RegularReuseIndex((reuse_info & 0x0F) as usize);
    }
    pub fn voxel_a_index(&self) -> RegularCellVoxelIndex {
        let edge_location = self.0 & 0xFF;
        return RegularCellVoxelIndex(((edge_location & 0xF0) >> 4) as usize);
    }
    pub fn voxel_b_index(&self) -> RegularCellVoxelIndex {
        let edge_location = self.0 & 0xFF;
        return RegularCellVoxelIndex((edge_location & 0xF) as usize);
    }
}

/// The low byte contains the indices for the two endpoints of the edge on which the vertex lies.
/// The high byte contains the vertex reuse data.

pub struct TransitionVertexData(pub u16);

impl TransitionVertexData {
    pub fn reuse(&self) -> bool {
        let reuse_info = (self.0 & 0xFF00) >> 8;
        return (reuse_info & 0x30) != 0;
    }
    pub fn reuse_du(&self) -> isize {
        let reuse_info = (self.0 & 0xFF00) >> 8;
        return -(((reuse_info & 0x10) >> 4) as i16) as isize;
    }
    pub fn reuse_dv(&self) -> isize {
        let reuse_info = (self.0 & 0xFF00) >> 8;
        return -(((reuse_info & 0x20) >> 5) as i16) as isize;
    }
    pub fn _new_interior(&self) -> bool {
        let reuse_info = (self.0 & 0xFF00) >> 8;
        return (reuse_info & 0x40) != 0;
    }
    pub fn new_reusable(&self) -> bool {
        let reuse_info = (self.0 & 0xFF00) >> 8;
        return (reuse_info & 0x80) != 0;
    }
    pub fn reuse_index(&self) -> TransitionReuseIndex {
        let reuse_info = (self.0 & 0xFF00) >> 8;
        return TransitionReuseIndex((reuse_info & 0x0F) as usize);
    }
    pub fn grid_point_a_index(&self) -> TransitionCellGridPointIndex {
        let edge_location = self.0 & 0xFF;
        return TransitionCellGridPointIndex(((edge_location & 0xF0) >> 4) as usize);
    }
    pub fn grid_point_b_index(&self) -> TransitionCellGridPointIndex {
        let edge_location = self.0 & 0xFF;
        return TransitionCellGridPointIndex((edge_location & 0xF) as usize);
    }
}