First complete implementation of the hierarchical SAP.

1 files changed, 32 insertions, 0 deletions

diff --git a/src/utils.rs b/src/utils.rs
index 4ed89f6..c1eb31d 100644
--- a/src/utils.rs
+++ b/src/utils.rs
@@ -3,6 +3,7 @@
 use na::{Matrix3, Point2, Point3, Scalar, SimdRealField, Vector2, Vector3};
 use num::Zero;
 use simba::simd::SimdValue;
+use std::ops::IndexMut;
 
 use parry::utils::SdpMatrix3;
 use {
@@ -676,3 +677,34 @@ pub(crate) fn select_other<T: PartialEq>(pair: (T, T), elt: T) -> T {
         pair.0
     }
 }
+
+/// Methods for simultaneously indexing a container with two distinct indices.
+pub trait IndexMut2<I>: IndexMut<I> {
+    /// Gets mutable references to two distinct elements of the container.
+    ///
+    /// Panics if `i == j`.
+    fn index_mut2(&mut self, i: usize, j: usize) -> (&mut Self::Output, &mut Self::Output);
+
+    /// Gets a mutable reference to one element, and immutable reference to a second one.
+    ///
+    /// Panics if `i == j`.
+    #[inline]
+    fn index_mut_const(&mut self, i: usize, j: usize) -> (&mut Self::Output, &Self::Output) {
+        let (a, b) = self.index_mut2(i, j);
+        (a, &*b)
+    }
+}
+
+impl<T> IndexMut2<usize> for Vec<T> {
+    #[inline]
+    fn index_mut2(&mut self, i: usize, j: usize) -> (&mut T, &mut T) {
+        assert!(i != j, "Unable to index the same element twice.");
+        assert!(i < self.len() && j < self.len(), "Index out of bounds.");
+
+        unsafe {
+            let a = &mut *(self.get_unchecked_mut(i) as *mut _);
+            let b = &mut *(self.get_unchecked_mut(j) as *mut _);
+            (a, b)
+        }
+    }
+}