diff --git a/src/OpaqueVal.cc b/src/OpaqueVal.cc
index 07d2d3899d..3886c61401 100644
--- a/src/OpaqueVal.cc
+++ b/src/OpaqueVal.cc
@@ -755,7 +755,6 @@ BloomFilterValPtr BloomFilterVal::Intersect(const BloomFilterVal* x, const Bloom
 	return intersected;
 	}
 
-
 BloomFilterVal::~BloomFilterVal()
 	{
 	delete hash;
diff --git a/src/probabilistic/BloomFilter.h b/src/probabilistic/BloomFilter.h
index 14f3ef5335..e06d5ea742 100644
--- a/src/probabilistic/BloomFilter.h
+++ b/src/probabilistic/BloomFilter.h
@@ -143,6 +143,7 @@ class CountingBloomFilter;
 class BasicBloomFilter : public BloomFilter
 	{
 	friend class CountingBloomFilter;
+
 public:
 	/**
 	 * Constructs a basic Bloom filter with a given number of cells. The
@@ -260,7 +261,6 @@ public:
 	 */
 	BasicBloomFilter* Intersect(const BloomFilter* other) const override;
 
-
 protected:
 	friend class BloomFilter;
 
diff --git a/src/probabilistic/CounterVector.cc b/src/probabilistic/CounterVector.cc
index a9a9a287a1..68a38c911d 100644
--- a/src/probabilistic/CounterVector.cc
+++ b/src/probabilistic/CounterVector.cc
@@ -152,7 +152,7 @@ BitVector CounterVector::ToBitVector() const
 		bool set = false;
 
 		for ( size_t i = 0; i < width; ++i )
-			set |= (*bits)[lsb+1];
+			set |= (*bits)[lsb + 1];
 
 		newbits[cell] = set;
 		}