[BPTree] removed ignore from test

src/datastructures/min_max.rs

@@ -278,7 +278,6 @@ impl MinMax {
     }
 
     fn bwd_search(&self, index: u64, diff: i64) -> Result<u64, NodeError> {
-
         let mut block_no = index / self.block_size;
         let mut begin_of_block = block_no * self.block_size;
         let mut end_of_block = begin_of_block + self.block_size - 1;
@@ -309,8 +308,9 @@ impl MinMax {
 
             while bottom_up && current_node > 0 {
                 if current_node % 2 == 0 {
-                    if self.heap[current_node as usize -1].max_excess >= look_for &&
-                        self.heap[current_node as usize -1].min_excess <= look_for {
+                    if self.heap[current_node as usize - 1].max_excess >= look_for
+                        && self.heap[current_node as usize - 1].min_excess <= look_for
+                    {
                         bottom_up = false;
                         top_down = true;
                         current_node -= 1;
@@ -324,20 +324,20 @@ impl MinMax {
             }
 
             while top_down {
-                if self.heap[current_node as usize * 2 + 2].max_excess >= look_for &&
-                    self.heap[current_node as usize * 2 + 2].min_excess <= look_for {
+                if self.heap[current_node as usize * 2 + 2].max_excess >= look_for
+                    && self.heap[current_node as usize * 2 + 2].min_excess <= look_for
+                {
                     current_node = current_node * 2 + 2;
-                } else if self.heap[current_node as usize * 2 + 1].max_excess >= look_for &&
-                    self.heap[current_node as usize * 2 + 1].min_excess <= look_for {
+                } else if self.heap[current_node as usize * 2 + 1].max_excess >= look_for
+                    && self.heap[current_node as usize * 2 + 1].min_excess <= look_for
+                {
                     current_node = current_node * 2 + 1;
-
                 }
 
                 if current_node < self.heap.len() as u64 / 2 {
                     top_down = false;
                 }
             }
-
         }
 
         Ok(1)

src/trees/bp_tree.rs

@@ -391,7 +391,6 @@ mod tests {
     }
 
     #[test]
-    #[ignore]
     fn next_sibling() {
         let bitvec = bit_vec!(true, true, false, true, false, false);
         let tree: BPTree<String> = BPTree::from_bitvec(bitvec.clone()).unwrap();