From 4ad311e389cfe267502f803ad3db9499a38d2a6b Mon Sep 17 00:00:00 2001
From: Anders Olsson <anders.e.olsson@gmail.com>
Date: Mon, 10 Sep 2018 21:14:02 +0200
Subject: [PATCH] Clippy.

---
 benches/bench.rs |  2 +-
 src/lib.rs       | 12 ++++++------
 2 files changed, 7 insertions(+), 7 deletions(-)

diff --git a/benches/bench.rs b/benches/bench.rs
index a95aca3..6d85740 100644
--- a/benches/bench.rs
+++ b/benches/bench.rs
@@ -21,7 +21,7 @@ fn contains(data: &[u64]) {
     let set = BitSet::new();
 
     for v in data {
-        set.contains(v);
+        set.contains(*v);
     }
 }
 
diff --git a/src/lib.rs b/src/lib.rs
index 0a8874e..2e7b6c4 100644
--- a/src/lib.rs
+++ b/src/lib.rs
@@ -25,7 +25,7 @@ type Storage = HashMap<u64, Block, BitBuildHasher>;
 pub type BitHashMap<V> = HashMap<u64, V, BitBuildHasher>;
 
 #[inline]
-fn block_bit(x: &u64, d: &u64) -> (u64, u64) {
+fn block_bit(x: u64, d: u64) -> (u64, u64) {
     (x / d, x % d)
 }
 
@@ -91,8 +91,8 @@ impl BitSet {
     }
 
     #[inline]
-    pub fn contains(&self, value: &u64) -> bool {
-        let (block, bit) = block_bit(value, &BITS);
+    pub fn contains(&self, value: u64) -> bool {
+        let (block, bit) = block_bit(value, BITS);
 
         match self.blocks.get(&block) {
             Some(block) => (block & (1 << bit)) != 0,
@@ -121,7 +121,7 @@ impl BitSet {
 
     #[inline]
     pub fn insert(&mut self, value: u64) -> bool {
-        let (block, bit) = block_bit(&value, &BITS);
+        let (block, bit) = block_bit(value, BITS);
         let block = self.blocks.entry(block).or_insert(0);
 
         let n = 1 << bit;
@@ -137,8 +137,8 @@ impl BitSet {
     }
 
     #[inline]
-    pub fn remove(&mut self, value: &u64) -> bool {
-        let (block, bit) = block_bit(value, &BITS);
+    pub fn remove(&mut self, value: u64) -> bool {
+        let (block, bit) = block_bit(value, BITS);
         let block = self.blocks.entry(block).or_insert(0);
 
         let n = 1 << bit;