minecraftrs 0.1.1

Minecraft world generation backend in Rust.
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
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155

use std::ops::AddAssign;


#[allow(clippy::approx_constant)]
pub const JAVA_PI: f64 = 3.14159265358979323846;


#[inline]
pub fn lerp(factor: f64, from: f64, to: f64) -> f64 {
    from + factor * (to - from)
}


#[inline(always)]
fn mc_sin_table(i: u16) -> f32 {
    (i as f64 * JAVA_PI * 2.0 / 65536.0).sin() as f32
}


/// Emulate the Minecraft sinus lookup table.
pub fn mc_sin(x: f32) -> f32 {
    mc_sin_table(((x * 10430.38) as i32 & 0xffff) as u16)
}


/// Emulate the Minecraft cosinus lookup table.
pub fn mc_cos(x: f32) -> f32 {
    mc_sin_table(((x * 10430.38 + 16384.0) as i32 & 0xffff) as u16)
}


/// A generic rectangle.
///
/// Coordinate ordering: X then Z
pub struct Rect<T> {
    pub data: Vec<T>,
    pub x_size: usize,
    pub z_size: usize
}

impl<T> Rect<T> {

    pub fn new_empty() -> Self {
        Rect { data: Vec::new(), x_size: 0, z_size: 0 }
    }

    pub fn new(x_size: usize, z_size: usize, def: T) -> Self
        where T: Clone
    {
        Rect { data: vec![def; x_size * z_size], x_size, z_size }
    }

    pub fn new_default(x_size: usize, z_size: usize) -> Self
        where T: Clone + Default
    {
        Self::new(x_size, z_size, T::default())
    }

    #[inline]
    fn get_index(&self, x: usize, z: usize) -> usize {
        debug_assert!(x < self.x_size && z < self.z_size);
        x + (z * self.x_size)
    }

    #[inline]
    pub fn set(&mut self, x: usize, z: usize, value: T) {
        let idx = self.get_index(x, z);
        self.data[idx] = value;
    }

    #[inline]
    pub fn get(&self, x: usize, z: usize) -> T
        where T: Copy
    {
        self.data[self.get_index(x, z)]
    }

    #[inline]
    pub fn get_mut(&mut self, x: usize, z: usize) -> &mut T {
        let idx = self.get_index(x, z);
        &mut self.data[idx]
    }

}

/// A generic cube.
///
/// Coordinate ordering: Y then Z then X
pub struct Cube<T> {
    pub data: Vec<T>,
    pub x_size: usize,
    pub y_size: usize,
    pub z_size: usize
}

impl<T> Cube<T> {

    pub fn new_empty() -> Self {
        Cube { data: Vec::new(), x_size: 0, y_size: 0, z_size: 0 }
    }

    pub fn new(x_size: usize, y_size: usize, z_size: usize, def: T) -> Self
        where T: Clone
    {
        Cube { data: vec![def; x_size * y_size * z_size], x_size, y_size, z_size }
    }

    pub fn new_default(x_size: usize, y_size: usize, z_size: usize) -> Self
        where T: Clone + Default
    {
        Self::new(x_size, y_size, z_size, T::default())
    }

    pub fn reset(&mut self, value: T)
        where T: Copy
    {
        for v in &mut self.data {
            *v = value;
        }
    }

    #[inline]
    fn get_index(&self, x: usize, y: usize, z: usize) -> usize {
        debug_assert!(x < self.x_size && y < self.y_size && z < self.z_size);
        (x * self.z_size + z) * self.y_size + y
    }

    #[inline]
    pub fn set(&mut self, x: usize, y: usize, z: usize, value: T) {
        let idx = self.get_index(x, y, z);
        self.data[idx] = value;
    }

    #[inline]
    pub fn add(&mut self, x: usize, y: usize, z: usize, value: T)
        where T: AddAssign
    {
        let idx = self.get_index(x, y, z);
        self.data[idx] += value;
    }

    #[inline]
    pub fn get(&self, x: usize, y: usize, z: usize) -> T
        where T: Copy
    {
        self.data[self.get_index(x, y, z)]
    }

    #[inline]
    pub fn get_mut(&mut self, x: usize, y: usize, z: usize) -> &mut T {
        let idx = self.get_index(x, y, z);
        &mut self.data[idx]
    }

}