Tweak inline and visibility

kdtree/src/lib.rs

@@ -57,6 +57,7 @@ impl KdNode {
         Box::new(Self::Node { plane, left, right })
     }
 
+    #[inline]
     pub fn is_empty(&self) -> bool {
         match self {
             Self::Leaf(indices) => indices.is_empty(),
@@ -165,19 +166,22 @@ pub struct KdTree {
 }
 
 impl KdTree {
+    #[inline]
     pub fn iter_nodes(&self) -> KdTreeNodeIter<'_> {
         KdTreeNodeIter {
             stack: vec![(1, &self.root)],
         }
     }
 
+    #[inline]
     pub fn iter_leafs(&self) -> impl Iterator<Item = (usize, &Vec<u32>)> {
         self.iter_nodes().filter_map(|(depth, node)| match node {
             KdNode::Leaf(indices) => Some((depth, indices)),
             _ => None,
         })
     }
 
+    #[inline]
     pub fn intersect(
         &self,
         ray: &Ray,

kdtree/src/split.rs

@@ -15,7 +15,7 @@ pub(crate) fn clip_geometries(geometries: &[Geometry], cell: &KdCell) -> Vec<(u3
         .collect::<Vec<_>>()
 }
 
-pub fn partition_triangles(
+pub(crate) fn partition_triangles(
     clipped_triangles: &[(u32, Aabb)],
     plane: &Aap,
 ) -> (Vec<u32>, Vec<u32>, Vec<u32>) {
@@ -42,15 +42,19 @@ pub fn partition_triangles(
     (left_triangles, middle_triangles, right_triangles)
 }
 
-pub struct SplitPartitioning {
+pub(crate) struct SplitPartitioning {
     pub left_aabb: Aabb,
     pub right_aabb: Aabb,
     pub left_indices: Vec<u32>,
     pub middle_indices: Vec<u32>,
     pub right_indices: Vec<u32>,
 }
 
-pub fn split_and_partition(clipped: &[(u32, Aabb)], aabb: &Aabb, plane: Aap) -> SplitPartitioning {
+pub(crate) fn split_and_partition(
+    clipped: &[(u32, Aabb)],
+    aabb: &Aabb,
+    plane: Aap,
+) -> SplitPartitioning {
     let (left_aabb, right_aabb) = aabb.split(&plane);
     let (left_indices, middle_indices, right_indices) = partition_triangles(clipped, &plane);
     SplitPartitioning {