ftui-extras 0.3.1

//! BSP file format types ported from Quake 1 (id Software GPL, bspfile.h).
//!
//! These match the on-disk format of Quake .bsp files exactly.

/// BSP file header lump descriptor.
#[derive(Debug, Clone, Copy)]
pub struct Lump {
    pub offset: i32,
    pub length: i32,
}

/// BSP file header.
#[derive(Debug, Clone)]
pub struct BspHeader {
    pub version: i32,
    pub lumps: [Lump; super::constants::HEADER_LUMPS],
}

/// On-disk vertex (3 floats).
#[derive(Debug, Clone, Copy)]
pub struct DVertex {
    pub point: [f32; 3],
}

/// On-disk plane.
#[derive(Debug, Clone, Copy)]
pub struct DPlane {
    pub normal: [f32; 3],
    pub dist: f32,
    pub plane_type: i32,
}

/// On-disk BSP node.
#[derive(Debug, Clone, Copy)]
pub struct DNode {
    pub plane_num: i32,
    pub children: [i16; 2], // negative = -(leaf+1)
    pub mins: [i16; 3],
    pub maxs: [i16; 3],
    pub first_face: u16,
    pub num_faces: u16,
}

/// On-disk BSP leaf.
#[derive(Debug, Clone, Copy)]
pub struct DLeaf {
    pub contents: i32,
    pub vis_offset: i32, // -1 = no visibility info
    pub mins: [i16; 3],
    pub maxs: [i16; 3],
    pub first_mark_surface: u16,
    pub num_mark_surfaces: u16,
    pub ambient_level: [u8; 4],
}

/// On-disk face.
#[derive(Debug, Clone, Copy)]
pub struct DFace {
    pub plane_num: i16,
    pub side: i16,
    pub first_edge: i32,
    pub num_edges: i16,
    pub texinfo: i16,
    pub styles: [u8; super::constants::MAXLIGHTMAPS],
    pub light_offset: i32,
}

/// On-disk edge (two vertex indices).
#[derive(Debug, Clone, Copy)]
pub struct DEdge {
    pub v: [u16; 2],
}

/// On-disk clip node (for collision hulls).
#[derive(Debug, Clone, Copy)]
pub struct DClipNode {
    pub plane_num: i32,
    pub children: [i16; 2], // negative = contents
}

/// On-disk texture info.
#[derive(Debug, Clone, Copy)]
pub struct DTexInfo {
    pub vecs: [[f32; 4]; 2], // [s/t][xyz offset]
    pub miptex: i32,
    pub flags: i32,
}

/// On-disk model (world + brush models).
#[derive(Debug, Clone, Copy)]
pub struct DModel {
    pub mins: [f32; 3],
    pub maxs: [f32; 3],
    pub origin: [f32; 3],
    pub head_node: [i32; 4], // 4 collision hulls
    pub vis_leafs: i32,
    pub first_face: i32,
    pub num_faces: i32,
}

/// Helper: read i32 little-endian from a byte slice.
#[inline]
pub fn i32_le(data: &[u8], offset: usize) -> i32 {
    i32::from_le_bytes([
        data[offset],
        data[offset + 1],
        data[offset + 2],
        data[offset + 3],
    ])
}

/// Helper: read u16 little-endian.
#[inline]
pub fn u16_le(data: &[u8], offset: usize) -> u16 {
    u16::from_le_bytes([data[offset], data[offset + 1]])
}

/// Helper: read i16 little-endian.
#[inline]
pub fn i16_le(data: &[u8], offset: usize) -> i16 {
    i16::from_le_bytes([data[offset], data[offset + 1]])
}

/// Helper: read f32 little-endian.
#[inline]
pub fn f32_le(data: &[u8], offset: usize) -> f32 {
    f32::from_le_bytes([
        data[offset],
        data[offset + 1],
        data[offset + 2],
        data[offset + 3],
    ])
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn i32_le_roundtrip() {
        let val: i32 = -12345;
        let bytes = val.to_le_bytes();
        assert_eq!(i32_le(&bytes, 0), val);
    }

    #[test]
    fn i32_le_min_max() {
        for val in [i32::MIN, i32::MAX] {
            let bytes = val.to_le_bytes();
            assert_eq!(i32_le(&bytes, 0), val);
        }
    }

    #[test]
    fn i32_le_is_little_endian() {
        let val: i32 = 0x0102_0304;
        assert_ne!(i32_le(&val.to_be_bytes(), 0), val);
        assert_eq!(i32_le(&val.to_le_bytes(), 0), val);
    }

    #[test]
    fn f32_le_roundtrip() {
        let val: f32 = std::f32::consts::PI;
        let bytes = val.to_le_bytes();
        assert!((f32_le(&bytes, 0) - val).abs() < 1e-6);
    }

    #[test]
    fn f32_le_preserves_infinities() {
        for val in [f32::INFINITY, f32::NEG_INFINITY] {
            let bytes = val.to_le_bytes();
            assert_eq!(f32_le(&bytes, 0).to_bits(), val.to_bits());
        }
    }

    #[test]
    fn f32_le_preserves_nan() {
        let val = f32::NAN;
        let bytes = val.to_le_bytes();
        assert!(f32_le(&bytes, 0).is_nan());
    }

    #[test]
    fn f32_le_preserves_negative_zero_bits() {
        let val: f32 = -0.0;
        let bytes = val.to_le_bytes();
        assert_eq!(f32_le(&bytes, 0).to_bits(), val.to_bits());
    }

    #[test]
    fn u16_le_roundtrip() {
        let val: u16 = 0xBEEF;
        let bytes = val.to_le_bytes();
        assert_eq!(u16_le(&bytes, 0), val);
    }

    #[test]
    fn u16_le_is_little_endian() {
        let val: u16 = 0x0102;
        assert_ne!(u16_le(&val.to_be_bytes(), 0), val);
        assert_eq!(u16_le(&val.to_le_bytes(), 0), val);
    }

    #[test]
    fn u16_le_at_offset() {
        let mut buf = [0u8; 6];
        let val: u16 = 0xCAFE;
        buf[4..6].copy_from_slice(&val.to_le_bytes());
        assert_eq!(u16_le(&buf, 4), val);
    }

    #[test]
    fn i16_le_roundtrip() {
        let val: i16 = -4321;
        let bytes = val.to_le_bytes();
        assert_eq!(i16_le(&bytes, 0), val);
    }

    #[test]
    fn i16_le_min_max() {
        for val in [i16::MIN, i16::MAX] {
            let bytes = val.to_le_bytes();
            assert_eq!(i16_le(&bytes, 0), val);
        }
    }

    #[test]
    fn i16_le_at_offset() {
        let mut buf = [0u8; 6];
        let val: i16 = -1234;
        buf[4..6].copy_from_slice(&val.to_le_bytes());
        assert_eq!(i16_le(&buf, 4), val);
    }

    #[test]
    fn i32_le_at_offset() {
        let mut buf = vec![0u8; 8];
        let val: i32 = 0x12345678;
        buf[4..8].copy_from_slice(&val.to_le_bytes());
        assert_eq!(i32_le(&buf, 4), val);
    }

    #[test]
    fn f32_le_at_offset() {
        let mut buf = vec![0u8; 8];
        let val: f32 = -2.5;
        buf[4..8].copy_from_slice(&val.to_le_bytes());
        assert!((f32_le(&buf, 4) - val).abs() < 1e-6);
    }

    #[test]
    #[should_panic(expected = "index out of bounds")]
    fn i32_le_panics_on_truncated_buffer() {
        let buf = [0u8; 3];
        let _ = i32_le(&buf, 0);
    }

    #[test]
    #[should_panic(expected = "index out of bounds")]
    fn u16_le_panics_when_offset_out_of_range() {
        let buf = [0u8; 2];
        let _ = u16_le(&buf, 1);
    }

    #[test]
    fn lump_struct_size() {
        // Lump has offset (i32) + length (i32) = 8 bytes conceptual
        let lump = Lump {
            offset: 0,
            length: 100,
        };
        assert_eq!(lump.offset, 0);
        assert_eq!(lump.length, 100);
    }

    #[test]
    fn dvertex_point_access() {
        let v = DVertex {
            point: [1.0, 2.0, 3.0],
        };
        assert_eq!(v.point[0], 1.0);
        assert_eq!(v.point[1], 2.0);
        assert_eq!(v.point[2], 3.0);
    }

    #[test]
    fn dplane_fields() {
        let p = DPlane {
            normal: [0.0, 1.0, 0.0],
            dist: 64.0,
            plane_type: 1,
        };
        assert_eq!(p.normal[1], 1.0);
        assert_eq!(p.dist, 64.0);
    }

    #[test]
    fn dedge_vertex_indices() {
        let e = DEdge { v: [10, 20] };
        assert_eq!(e.v[0], 10);
        assert_eq!(e.v[1], 20);
    }

    #[test]
    fn dnode_negative_child_is_leaf() {
        let n = DNode {
            plane_num: 0,
            children: [-1, 5],
            mins: [0; 3],
            maxs: [100; 3],
            first_face: 0,
            num_faces: 4,
        };
        // Negative child means -(leaf+1), so -1 is leaf 0
        assert!(n.children[0] < 0);
        assert!(n.children[1] >= 0);
    }

    #[test]
    fn dnode_negative_child_leaf_index_decoding() {
        for (child, expected_leaf) in [(-1_i16, 0_i16), (-2_i16, 1_i16), (-5_i16, 4_i16)] {
            let decoded = -(child + 1);
            assert_eq!(decoded, expected_leaf);
        }
    }

    #[test]
    fn bsp_header_has_expected_lump_count() {
        let header = BspHeader {
            version: 29,
            lumps: [Lump {
                offset: 0,
                length: 0,
            }; super::super::constants::HEADER_LUMPS],
        };
        assert_eq!(header.lumps.len(), super::super::constants::HEADER_LUMPS);
    }

    #[test]
    fn dleaf_vis_offset_minus_one_means_no_vis() {
        let leaf = DLeaf {
            contents: -1,
            vis_offset: -1,
            mins: [0; 3],
            maxs: [0; 3],
            first_mark_surface: 0,
            num_mark_surfaces: 0,
            ambient_level: [0; 4],
        };
        assert_eq!(leaf.vis_offset, -1);
    }
}