diff --git a/lab2/src/algo/bit_vector.rs b/lab2/src/algo/bit_vector.rs
index 58d2057..6956ff5 100644
--- a/lab2/src/algo/bit_vector.rs
+++ b/lab2/src/algo/bit_vector.rs
@@ -2,15 +2,13 @@ use std::cmp::min;
 use std::ops::{BitAnd, BitAndAssign, Index, IndexMut, Not, Shl};
 
 pub struct BitVector {
-    len: usize,
-    data: Box<[usize]>,
+    data: Box<[bool]>,
 }
 
 impl BitVector {
     pub fn alloc(len: usize) -> Self {
         return Self {
-            len,
-            data: vec![0usize; (len + (usize::BITS as usize) - 1) / (usize::BITS as usize)]
+            data: vec![false; len]
                 .into_boxed_slice(),
         };
     }
@@ -18,25 +16,22 @@ impl BitVector {
     pub fn count1(&self) -> usize {
         let mut counter = 0usize;
         for i in 0..(self.data.len() - 1) {
-            counter += self.data[i].count_ones() as usize;
+            if self.data[i] {
+                counter += 1;
+            }
         }
 
-        counter += (self.data[self.data.len() - 1]
-            & (0usize.not().shl(self.len % (usize::BITS as usize)).not()))
-        .count_ones() as usize;
-
         return counter;
     }
 
     pub fn len(&self) -> usize {
-        return self.len;
+        return self.data.len();
     }
 }
 
 impl Clone for BitVector {
     fn clone(&self) -> Self {
         return Self {
-            len: self.len,
             data: self.data.clone(),
         };
     }
@@ -54,39 +49,27 @@ impl BitAnd<Self> for &BitVector {
 
 impl BitAndAssign<&Self> for BitVector {
     fn bitand_assign(&mut self, rhs: &Self) {
-        assert_eq!(self.len, rhs.len, "Vectors has different length's");
+        assert_eq!(self.data.len(), rhs.data.len(), "Vectors has different length's");
         for i in 0..self.data.len() {
             self.data[i] &= rhs.data[i]
         }
     }
 }
 
-struct _BitLocation {
-    offset: usize,
-    mask: usize,
+impl Index<usize> for BitVector {
+    type Output = bool;
+
+    fn index(&self, index: usize) -> &Self::Output {
+        assert!(index < self.data.len());
+        return &self.data[index]
+    }
 }
 
-impl BitVector {
-    fn _unpackIndex(&self, i: usize) -> _BitLocation {
-        assert!(i < self.len);
-        return _BitLocation {
-            offset: i / (usize::BITS as usize),
-            mask: 1 << i % (usize::BITS as usize),
-        };
-    }
 
-    pub fn get(&self, i: usize) -> bool {
-        let bl = self._unpackIndex(i);
-        return self.data[bl.offset] & bl.mask != 0;
-    }
-
-    pub fn set(&mut self, i: usize, value: bool) {
-        let bl = self._unpackIndex(i);
-        if value {
-            self.data[bl.offset] |= bl.mask;
-        } else {
-            self.data[bl.offset] &= !bl.mask;
-        }
+impl IndexMut<usize> for BitVector {
+    fn index_mut(&mut self, index: usize) -> &mut Self::Output {
+        assert!(index < self.data.len());
+        return &mut self.data[index]
     }
 }
 
diff --git a/lab2/src/algo/mod.rs b/lab2/src/algo/mod.rs
index fc23934..f1c5fd0 100644
--- a/lab2/src/algo/mod.rs
+++ b/lab2/src/algo/mod.rs
@@ -2,4 +2,5 @@ mod bit_vector;
 mod operations;
 mod r#impl;
 
-pub use bit_vector::BitVector;
\ No newline at end of file
+pub use bit_vector::BitVector;
+pub use r#impl::adaptiveResonanceTheoryImpl;
\ No newline at end of file