aboutsummaryrefslogtreecommitdiff
path: root/stockton-levels/src/q3/visdata.rs
diff options
context:
space:
mode:
Diffstat (limited to 'stockton-levels/src/q3/visdata.rs')
-rw-r--r--stockton-levels/src/q3/visdata.rs68
1 files changed, 68 insertions, 0 deletions
diff --git a/stockton-levels/src/q3/visdata.rs b/stockton-levels/src/q3/visdata.rs
new file mode 100644
index 0000000..39bfcf4
--- /dev/null
+++ b/stockton-levels/src/q3/visdata.rs
@@ -0,0 +1,68 @@
+// Copyright (C) Oscar Shrimpton 2019
+
+// 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/>.
+//! Parses visdata from Q3 BSPs.
+
+
+use std::vec::IntoIter;
+use bitvec::prelude::*;
+
+use crate::types::{Result, ParseError};
+use crate::traits::visdata::*;
+use crate::helpers::slice_to_i32;
+use super::file::Q3BSPFile;
+
+/// Stores cluster-to-cluster visibility information.
+pub fn from_data(data: &[u8]) -> Result<Box<[BitBox<Local, u8>]>> {
+ if data.len() < 8 {
+ return Err(ParseError::Invalid);
+ }
+
+ let n_vecs = slice_to_i32(&data[0..4]) as usize;
+ let size_vecs = slice_to_i32(&data[4..8]) as usize;
+
+ if data.len() - 8 != (n_vecs * size_vecs) {
+ return Err(ParseError::Invalid);
+ }
+
+ let mut vecs = Vec::with_capacity(n_vecs);
+ for n in 0..n_vecs {
+ let offset = 8 + (n * size_vecs);
+ let slice = &data[offset..offset + size_vecs];
+ vecs.push(BitBox::from_slice(slice));
+ }
+
+ Ok(vecs.into_boxed_slice())
+}
+
+impl HasVisData for Q3BSPFile {
+ type VisibleIterator = IntoIter<ClusterId>;
+
+ fn all_visible_from(&self, from: ClusterId) -> Self::VisibleIterator {
+ let mut visible = vec![];
+
+ for (idx,val) in self.visdata[from as usize].iter().enumerate() {
+ if *val {
+ visible.push(idx as u32);
+ }
+ }
+
+ visible.into_iter()
+ }
+
+ fn cluster_visible_from(&self, from: ClusterId, dest: ClusterId) -> bool {
+ self.visdata[from as usize][dest as usize]
+ }
+}
+