some optimizations

Author: ekinimo

Diff for: src/node.rs

@@ -14,30 +14,30 @@ impl TrieNode {
         }
     }
 }
-
-// Bit manipulation utilities
+#[inline]
 pub(crate) fn set_bit(a: &mut [u64; 4], k: u8) {
-    a[(k / 64) as usize] |= 1u64 << (k % 64);
+    a[(k >> 6) as usize] |= 1u64 << (k & 0x3F);
 }
-
+#[inline]
 pub(crate) fn clear_bit(a: &mut [u64; 4], k: u8) {
-    a[(k / 64) as usize] &= !(1u64 << (k % 64));
+    a[(k >> 6) as usize] &= !(1u64 << (k & 0x3F));
 }
-
+#[inline]
 pub(crate) fn test_bit(a: &[u64; 4], k: u8) -> bool {
-    (a[(k / 64) as usize] >> (k % 64)) & 0x01 != 0
+    (a[(k >> 6) as usize] & (1u64 << (k & 0x3F))) != 0
 }
-
+#[inline]
 pub(crate) fn popcount(a: &[u64; 4], k: u8) -> u16 {
-    let mut res = 0;
-
-    for i in a.iter().take((k / 64) as usize) {
-        res += i.count_ones() as u16;
-    }
-
-    for i in 0..(k % 64) {
-        res += (((a[(k / 64) as usize] >> i) & 0x01) != 0) as u16;
-    }
-
-    res
+    // Calculate indices for full chunks and remainder
+    let full_chunks = (k >> 6) as usize;
+    let remainder_bits = k & 0x3F;
+
+    // Use fold instead of map+sum for better performance
+    let full_sum: u16 = a[..full_chunks]
+        .iter()
+        .fold(0, |acc, &x| acc + x.count_ones() as u16);
+
+    // Add remaining bits (only if there are any)
+    let has_remainder = (remainder_bits > 0) as u16;
+    full_sum + has_remainder * (a[full_chunks] & ((1u64 << remainder_bits) - 1)).count_ones() as u16
 }

Diff for: src/slice_pool.rs

@@ -10,16 +10,13 @@ pub(crate) struct SlicePool {
 impl SlicePool {
     /// Creates a new empty slice pool
     pub fn new() -> Self {
-        let pools = std::array::from_fn(|_| Vec::new());
+        let pools = std::array::from_fn(|_| Vec::with_capacity(1024));
         SlicePool { pools }
     }
     /// Gets a boxed slice of the specified length from the pool, or creates a new one
     pub fn get(&mut self, len: usize) -> Box<[TrieNode]> {
-        if len == 0 {
-            return Box::new([]);
-        }
         let idx = len.max(256);
-        if let Some(slice) = self.pools[idx as usize].pop() {
+        if let Some(slice) = unsafe { self.pools.get_unchecked_mut(idx as usize) }.pop() {
             return slice;
         }
         let mut vec = Vec::with_capacity(len as usize);
@@ -32,13 +29,8 @@ impl SlicePool {
     /// Returns a boxed slice to the pool for future reuse
     pub fn put(&mut self, slice: Box<[TrieNode]>) {
         let len = slice.len();
-
-        if len == 0 {
-            return; // Don't pool empty slices
-        }
-
-        let idx = len.min(255);
-        self.pools[idx].push(slice);
+        let idx = len;
+        unsafe { self.pools.get_unchecked_mut(idx as usize) }.push(slice);
     }
 
     /// Clears all pools, dropping all stored slices