blob: 4bd319fe471c9d8f1dc9e377f6c4e6959e2d2bf7 (
plain)
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
|
/*
* Copyright (C) Oscar Shrimpton 2020
*
* This program is free software: you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the Free
* Software Foundation, either version 3 of the License, or (at your option)
* any later version.
*
* This program is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
* more details.
*
* You should have received a copy of the GNU General Public License along
* with this program. If not, see <http://www.gnu.org/licenses/>.
*/
const PLANE_SIZE: usize = (4 * 3) + 4;
use super::Q3BspFile;
use crate::coords::CoordSystem;
use crate::helpers::{slice_to_f32, slice_to_vec3};
use crate::traits::planes::*;
use crate::types::{ParseError, Result};
/// Parse a lump of planes.
/// A lump is (data length / plane size) planes long
pub fn from_data(data: &[u8]) -> Result<Box<[Plane]>> {
let length = data.len() / PLANE_SIZE;
if data.is_empty() || data.len() % PLANE_SIZE != 0 || length % 2 != 0 {
return Err(ParseError::Invalid);
}
let mut planes = Vec::with_capacity(length / 2);
for n in 0..length {
let offset = n * PLANE_SIZE;
let plane = &data[offset..offset + PLANE_SIZE];
planes.push(Plane {
normal: slice_to_vec3(&plane[0..12]),
dist: slice_to_f32(&plane[12..16]),
});
}
Ok(planes.into_boxed_slice())
}
impl<T: CoordSystem> HasPlanes<T> for Q3BspFile<T> {
type PlanesIter<'a> = std::slice::Iter<'a, Plane>;
fn planes_iter(&self) -> Self::PlanesIter<'_> {
self.planes.iter()
}
fn get_plane(&self, idx: u32) -> &Plane {
&self.planes[idx as usize]
}
}
|
