datasketches 0.3.2 → 0.4.1

data/vendor/datasketches-cpp/count/include/count_min_impl.hpp

@@ -38,78 +38,77 @@ _num_hashes(num_hashes),
 _num_buckets(num_buckets),
 _sketch_array((num_hashes*num_buckets < 1<<30) ? num_hashes*num_buckets : 0, 0, _allocator),
 _seed(seed),
-_total_weight(0){
-  if(num_buckets < 3) throw std::invalid_argument("Using fewer than 3 buckets incurs relative error greater than 1.") ;
+_total_weight(0) {
+  if (num_buckets < 3) throw std::invalid_argument("Using fewer than 3 buckets incurs relative error greater than 1.");
 
   // This check is to ensure later compatibility with a Java implementation whose maximum size can only
   // be 2^31-1.  We check only against 2^30 for simplicity.
-  if(num_buckets*num_hashes >= 1<<30) {
+  if (num_buckets * num_hashes >= 1 << 30) {
     throw std::invalid_argument("These parameters generate a sketch that exceeds 2^30 elements."
-                                "Try reducing either the number of buckets or the number of hash functions.") ;
+                                "Try reducing either the number of buckets or the number of hash functions.");
   }
 
   std::default_random_engine rng(_seed);
   std::uniform_int_distribution<uint64_t> extra_hash_seeds(0, std::numeric_limits<uint64_t>::max());
-  hash_seeds.reserve(num_hashes) ;
+  hash_seeds.reserve(num_hashes);
 
-  for(uint64_t i=0 ; i < num_hashes ; ++i){
+  for (uint64_t i=0; i < num_hashes; ++i) {
     hash_seeds.push_back(extra_hash_seeds(rng) + _seed); // Adds the global seed to all hash functions.
   }
 }
 
 template<typename W, typename A>
-uint8_t count_min_sketch<W,A>::get_num_hashes() const{
-    return _num_hashes ;
+uint8_t count_min_sketch<W,A>::get_num_hashes() const {
+  return _num_hashes;
 }
 
 template<typename W, typename A>
-uint32_t count_min_sketch<W,A>::get_num_buckets() const{
-    return _num_buckets ;
+uint32_t count_min_sketch<W,A>::get_num_buckets() const {
+   return _num_buckets;
 }
 
 template<typename W, typename A>
 uint64_t count_min_sketch<W,A>::get_seed() const {
-    return _seed ;
+  return _seed;
 }
 
 template<typename W, typename A>
-double count_min_sketch<W,A>::get_relative_error() const{
-  return exp(1.0) / double(_num_buckets) ;
+double count_min_sketch<W,A>::get_relative_error() const {
+  return exp(1.0) / double(_num_buckets);
 }
 
 template<typename W, typename A>
-W count_min_sketch<W,A>::get_total_weight() const{
-  return _total_weight ;
+W count_min_sketch<W,A>::get_total_weight() const {
+  return _total_weight;
 }
 
 template<typename W, typename A>
-uint32_t count_min_sketch<W,A>::suggest_num_buckets(double relative_error){
+uint32_t count_min_sketch<W,A>::suggest_num_buckets(double relative_error) {
   /*
    * Function to help users select a number of buckets for a given error.
    * TODO: Change this when we use only power of 2 buckets.
-   *
    */
-  if(relative_error < 0.){
-    throw std::invalid_argument( "Relative error must be at least 0." );
+  if (relative_error < 0.) {
+    throw std::invalid_argument("Relative error must be at least 0.");
   }
-  return ceil(exp(1.0) / relative_error);
+  return static_cast<uint32_t>(ceil(exp(1.0) / relative_error));
 }
 
 template<typename W, typename A>
-uint8_t count_min_sketch<W,A>::suggest_num_hashes(double confidence){
+uint8_t count_min_sketch<W,A>::suggest_num_hashes(double confidence) {
   /*
    * Function to help users select a number of hashes for a given confidence
    * e.g. confidence = 1 - failure probability
    * failure probability == delta in the literature.
    */
-  if(confidence < 0. || confidence > 1.0){
-    throw std::invalid_argument( "Confidence must be between 0 and 1.0 (inclusive)." );
+  if (confidence < 0. || confidence > 1.0) {
+    throw std::invalid_argument("Confidence must be between 0 and 1.0 (inclusive).");
   }
-  return std::min<uint8_t>( ceil(log(1.0/(1.0 - confidence))), UINT8_MAX) ;
+  return std::min<uint8_t>(ceil(log(1.0 / (1.0 - confidence))), UINT8_MAX);
 }
 
 template<typename W, typename A>
-std::vector<uint64_t> count_min_sketch<W,A>::get_hashes(const void* item, size_t size) const{
+std::vector<uint64_t> count_min_sketch<W,A>::get_hashes(const void* item, size_t size) const {
   /*
    * Returns the hash locations for the input item using the original hashing
    * scheme from [1].
@@ -124,20 +123,20 @@ std::vector<uint64_t> count_min_sketch<W,A>::get_hashes(const void* item, size_t
    * https://github.com/Claudenw/BloomFilter/wiki/Bloom-Filters----An-overview
    * https://www.eecs.harvard.edu/~michaelm/postscripts/tr-02-05.pdf
    */
-  uint64_t bucket_index ;
-  std::vector<uint64_t> sketch_update_locations; //(_num_hashes) ;
-  sketch_update_locations.reserve(_num_hashes) ;
+  uint64_t bucket_index;
+  std::vector<uint64_t> sketch_update_locations;
+  sketch_update_locations.reserve(_num_hashes);
 
-  uint64_t hash_seed_index = 0 ;
-  for(const auto &it : hash_seeds){
+  uint64_t hash_seed_index = 0;
+  for (const auto &it: hash_seeds) {
     HashState hashes;
     MurmurHash3_x64_128(item, size, it, hashes); // ? BEWARE OVERFLOW.
-    uint64_t hash = hashes.h1 ;
-    bucket_index = hash % _num_buckets ;
-    sketch_update_locations.push_back((hash_seed_index * _num_buckets) + bucket_index) ;
-    hash_seed_index += 1 ;
+    uint64_t hash = hashes.h1;
+    bucket_index = hash % _num_buckets;
+    sketch_update_locations.push_back((hash_seed_index * _num_buckets) + bucket_index);
+    hash_seed_index += 1;
   }
-  return sketch_update_locations ;
+  return sketch_update_locations;
 }
 
 template<typename W, typename A>
@@ -148,7 +147,7 @@ W count_min_sketch<W,A>::get_estimate(int64_t item) const {return get_estimate(&
 
 template<typename W, typename A>
 W count_min_sketch<W,A>::get_estimate(const std::string& item) const {
-  if (item.empty()) return 0 ; // Empty strings are not inserted into the sketch.
+  if (item.empty()) return 0; // Empty strings are not inserted into the sketch.
   return get_estimate(item.c_str(), item.length());
 }
 
@@ -157,13 +156,12 @@ W count_min_sketch<W,A>::get_estimate(const void* item, size_t size) const {
   /*
    * Returns the estimated frequency of the item
    */
-  std::vector<uint64_t> hash_locations = get_hashes(item, size) ;
-  std::vector<W> estimates ;
-  for (auto h: hash_locations){
-    estimates.push_back(_sketch_array[h]) ;
+  std::vector<uint64_t> hash_locations = get_hashes(item, size);
+  std::vector<W> estimates;
+  for (const auto h: hash_locations) {
+    estimates.push_back(_sketch_array[h]);
   }
-  W result = *std::min_element(estimates.begin(), estimates.end());
-  return result ;
+  return *std::min_element(estimates.begin(), estimates.end());
 }
 
 template<typename W, typename A>
@@ -171,44 +169,27 @@ void count_min_sketch<W,A>::update(uint64_t item, W weight) {
   update(&item, sizeof(item), weight);
 }
 
-template<typename W, typename A>
-void count_min_sketch<W,A>::update(uint64_t item) {
-  update(&item, sizeof(item), 1);
-}
-
 template<typename W, typename A>
 void count_min_sketch<W,A>::update(int64_t item, W weight) {
   update(&item, sizeof(item), weight);
 }
 
-template<typename W, typename A>
-void count_min_sketch<W,A>::update(int64_t item) {
-  update(&item, sizeof(item), 1);
-}
-
 template<typename W, typename A>
 void count_min_sketch<W,A>::update(const std::string& item, W weight) {
   if (item.empty()) return;
   update(item.c_str(), item.length(), weight);
 }
 
-template<typename W, typename A>
-void count_min_sketch<W,A>::update(const std::string& item) {
-  if (item.empty()) return;
-  update(item.c_str(), item.length(), 1);
-}
-
 template<typename W, typename A>
 void count_min_sketch<W,A>::update(const void* item, size_t size, W weight) {
   /*
    * Gets the item's hash locations and then increments the sketch in those
    * locations by the weight.
    */
-  W magnitude = (weight >= 0) ? weight : -weight ;
-  _total_weight += magnitude ;
-  std::vector<uint64_t> hash_locations = get_hashes(item, size) ;
-  for (auto h: hash_locations){
-    _sketch_array[h] += weight ;
+  _total_weight += weight >= 0 ? weight : -weight;
+  std::vector<uint64_t> hash_locations = get_hashes(item, size);
+  for (const auto h: hash_locations) {
+    _sketch_array[h] += weight;
   }
 }
 
@@ -220,13 +201,13 @@ W count_min_sketch<W,A>::get_upper_bound(int64_t item) const {return get_upper_b
 
 template<typename W, typename A>
 W count_min_sketch<W,A>::get_upper_bound(const std::string& item) const {
-  if (item.empty()) return 0 ; // Empty strings are not inserted into the sketch.
+  if (item.empty()) return 0; // Empty strings are not inserted into the sketch.
   return get_upper_bound(item.c_str(), item.length());
 }
 
 template<typename W, typename A>
 W count_min_sketch<W,A>::get_upper_bound(const void* item, size_t size) const {
-  return get_estimate(item, size) + get_relative_error()*get_total_weight() ;
+  return static_cast<W>(get_estimate(item, size) + get_relative_error() * get_total_weight());
 }
 
 template<typename W, typename A>
@@ -237,41 +218,41 @@ W count_min_sketch<W,A>::get_lower_bound(int64_t item) const {return get_lower_b
 
 template<typename W, typename A>
 W count_min_sketch<W,A>::get_lower_bound(const std::string& item) const {
-  if (item.empty()) return 0 ; // Empty strings are not inserted into the sketch.
+  if (item.empty()) return 0; // Empty strings are not inserted into the sketch.
   return get_lower_bound(item.c_str(), item.length());
 }
 
 template<typename W, typename A>
 W count_min_sketch<W,A>::get_lower_bound(const void* item, size_t size) const {
-  return get_estimate(item, size) ;
+  return get_estimate(item, size);
 }
 
 template<typename W, typename A>
-void count_min_sketch<W,A>::merge(const count_min_sketch &other_sketch){
+void count_min_sketch<W,A>::merge(const count_min_sketch &other_sketch) {
   /*
   * Merges this sketch into other_sketch sketch by elementwise summing of buckets
   */
-  if(this == &other_sketch){
+  if (this == &other_sketch) {
     throw std::invalid_argument( "Cannot merge a sketch with itself." );
   }
 
   bool acceptable_config =
     (get_num_hashes() == other_sketch.get_num_hashes())   &&
     (get_num_buckets() == other_sketch.get_num_buckets()) &&
-    (get_seed() == other_sketch.get_seed()) ;
-  if(!acceptable_config){
+    (get_seed() == other_sketch.get_seed());
+  if (!acceptable_config) {
     throw std::invalid_argument( "Incompatible sketch configuration." );
   }
 
   // Merge step - iterate over the other vector and add the weights to this sketch
-  auto it = _sketch_array.begin() ; // This is a std::vector iterator.
-  auto other_it = other_sketch.begin() ; //This is a const iterator over the other sketch.
-  while(it != _sketch_array.end()){
-    *it += *other_it ;
-    ++it ;
-    ++other_it ;
+  auto it = _sketch_array.begin(); // This is a std::vector iterator.
+  auto other_it = other_sketch.begin(); //This is a const iterator over the other sketch.
+  while (it != _sketch_array.end()) {
+    *it += *other_it;
+    ++it;
+    ++other_it;
   }
-  _total_weight += other_sketch.get_total_weight() ;
+  _total_weight += other_sketch.get_total_weight();
 }
 
 // Iterators
@@ -291,35 +272,34 @@ void count_min_sketch<W,A>::serialize(std::ostream& os) const {
   //const uint8_t preamble_longs = is_empty() ? PREAMBLE_LONGS_SHORT : PREAMBLE_LONGS_FULL;
   const uint8_t preamble_longs = PREAMBLE_LONGS_SHORT;
   const uint8_t ser_ver = SERIAL_VERSION_1;
-  const uint8_t family_id = FAMILY_ID ;
+  const uint8_t family_id = FAMILY_ID;
   const uint8_t flags_byte = (is_empty() ? 1 << flags::IS_EMPTY : 0);
-  const uint32_t unused32 = NULL_32 ;
-  write(os, preamble_longs) ;
-  write(os, ser_ver) ;
-  write(os, family_id) ;
-  write(os, flags_byte) ;
-  write(os, unused32) ;
+  const uint32_t unused32 = NULL_32;
+  write(os, preamble_longs);
+  write(os, ser_ver);
+  write(os, family_id);
+  write(os, flags_byte);
+  write(os, unused32);
 
   // Long 1
-  const uint32_t nbuckets = _num_buckets ;
-  const uint8_t nhashes = _num_hashes ;
+  const uint32_t nbuckets = _num_buckets;
+  const uint8_t nhashes = _num_hashes;
   const uint16_t seed_hash(compute_seed_hash(_seed));
   const uint8_t unused8 =  NULL_8;
-  write(os, nbuckets) ;
-  write(os, nhashes) ;
-  write(os, seed_hash) ;
-  write(os, unused8) ;
-  if (is_empty()) return  ; // sketch is empty, no need to write further bytes.
+  write(os, nbuckets);
+  write(os, nhashes);
+  write(os, seed_hash);
+  write(os, unused8);
+  if (is_empty()) return; // sketch is empty, no need to write further bytes.
 
   // Long 2
-  const W t_weight = _total_weight ;
-  write(os, t_weight) ;
+  write(os, _total_weight);
 
-  // Long  3 onwards: remaining bytes are consumed by writing the weight and the array values.
-  auto it = _sketch_array.begin() ;
-  while(it != _sketch_array.end()){
-    write(os, *it) ;
-    ++it ;
+  // Long 3 onwards: remaining bytes are consumed by writing the weight and the array values.
+  auto it = _sketch_array.begin();
+  while (it != _sketch_array.end()) {
+    write(os, *it);
+    ++it;
   }
 }
 
@@ -327,40 +307,40 @@ template<typename W, typename A>
 auto count_min_sketch<W,A>::deserialize(std::istream& is, uint64_t seed, const A& allocator) -> count_min_sketch {
 
   // First 8 bytes are 4 bytes of preamble and 4 unused bytes.
-  const auto preamble_longs = read<uint8_t>(is) ;
-  const auto serial_version = read<uint8_t>(is) ;
-  const auto family_id = read<uint8_t>(is) ;
-  const auto flags_byte = read<uint8_t>(is) ;
-  read<uint32_t>(is) ; // 4 unused bytes
+  const auto preamble_longs = read<uint8_t>(is);
+  const auto serial_version = read<uint8_t>(is);
+  const auto family_id = read<uint8_t>(is);
+  const auto flags_byte = read<uint8_t>(is);
+  read<uint32_t>(is); // 4 unused bytes
 
   check_header_validity(preamble_longs, serial_version, family_id, flags_byte);
 
   // Sketch parameters
-  const auto nbuckets = read<uint32_t>(is) ;
+  const auto nbuckets = read<uint32_t>(is);
   const auto nhashes = read<uint8_t>(is);
-  const auto seed_hash = read<uint16_t>(is) ;
-  read<uint8_t>(is) ; // 1 unused byte
+  const auto seed_hash = read<uint16_t>(is);
+  read<uint8_t>(is); // 1 unused byte
 
   if (seed_hash != compute_seed_hash(seed)) {
     throw std::invalid_argument("Incompatible seed hashes: " + std::to_string(seed_hash) + ", "
                                 + std::to_string(compute_seed_hash(seed)));
   }
-  count_min_sketch c(nhashes, nbuckets, seed, allocator) ;
+  count_min_sketch c(nhashes, nbuckets, seed, allocator);
   const bool is_empty = (flags_byte & (1 << flags::IS_EMPTY)) > 0;
-  if (is_empty == 1) return c ; // sketch is empty, no need to read further.
+  if (is_empty == 1) return c; // sketch is empty, no need to read further.
 
   // Set the sketch weight and read in the sketch values
-  const auto weight = read<W>(is) ;
-  c._total_weight += weight ;
+  const auto weight = read<W>(is);
+  c._total_weight += weight;
   read(is, c._sketch_array.data(), sizeof(W) * c._sketch_array.size());
 
-  return c ;
+  return c;
 }
 
 template<typename W, typename A>
 size_t count_min_sketch<W,A>::get_serialized_size_bytes() const {
   // The header is always 2 longs, whether empty or full
-  size_t preamble_longs = PREAMBLE_LONGS_SHORT;
+  const size_t preamble_longs = PREAMBLE_LONGS_SHORT;
 
   // If the sketch is empty, we're done. Otherwise, we need the total weight
   // held by the sketch as well as a data table of size (num_buckets * num_hashes)
@@ -377,33 +357,33 @@ auto count_min_sketch<W,A>::serialize(unsigned header_size_bytes) const -> vecto
   ptr += copy_to_mem(preamble_longs, ptr);
   const uint8_t ser_ver = SERIAL_VERSION_1;
   ptr += copy_to_mem(ser_ver, ptr);
-  const uint8_t family_id = FAMILY_ID ;
+  const uint8_t family_id = FAMILY_ID;
   ptr += copy_to_mem(family_id, ptr);
   const uint8_t flags_byte = (is_empty() ? 1 << flags::IS_EMPTY : 0);
   ptr += copy_to_mem(flags_byte, ptr);
-  const uint32_t unused32 = NULL_32 ;
-  ptr += copy_to_mem(unused32, ptr) ;
+  const uint32_t unused32 = NULL_32;
+  ptr += copy_to_mem(unused32, ptr);
 
   // Long 1
-  const uint32_t nbuckets = _num_buckets ;
-  const uint8_t nhashes = _num_hashes ;
+  const uint32_t nbuckets = _num_buckets;
+  const uint8_t nhashes = _num_hashes;
   const uint16_t seed_hash(compute_seed_hash(_seed));
   const uint8_t null_characters_8 =  NULL_8;
-  ptr += copy_to_mem(nbuckets, ptr) ;
-  ptr += copy_to_mem(nhashes, ptr) ;
-  ptr += copy_to_mem(seed_hash, ptr) ;
-  ptr += copy_to_mem(null_characters_8, ptr) ;
-  if (is_empty()) return bytes  ; // sketch is empty, no need to write further bytes.
+  ptr += copy_to_mem(nbuckets, ptr);
+  ptr += copy_to_mem(nhashes, ptr);
+  ptr += copy_to_mem(seed_hash, ptr);
+  ptr += copy_to_mem(null_characters_8, ptr);
+  if (is_empty()) return bytes; // sketch is empty, no need to write further bytes.
 
   // Long 2
-  const W t_weight = _total_weight ;
-  ptr += copy_to_mem(t_weight, ptr) ;
+  const W t_weight = _total_weight;
+  ptr += copy_to_mem(t_weight, ptr);
 
   // Long  3 onwards: remaining bytes are consumed by writing the weight and the array values.
-  auto it = _sketch_array.begin() ;
-  while(it != _sketch_array.end()){
-    ptr += copy_to_mem(*it, ptr) ;
-    ++it ;
+  auto it = _sketch_array.begin();
+  while (it != _sketch_array.end()) {
+    ptr += copy_to_mem(*it, ptr);
+    ++it;
   }
 
   return bytes;
@@ -416,45 +396,45 @@ auto count_min_sketch<W,A>::deserialize(const void* bytes, size_t size, uint64_t
   const char* ptr = static_cast<const char*>(bytes);
 
   // First 8 bytes are 4 bytes of preamble and 4 unused bytes.
-  uint8_t preamble_longs ;
-  ptr += copy_from_mem(ptr, preamble_longs) ;
-  uint8_t serial_version ;
-  ptr += copy_from_mem(ptr, serial_version) ;
-  uint8_t family_id ;
-  ptr += copy_from_mem(ptr, family_id) ;
-  uint8_t flags_byte ;
-  ptr += copy_from_mem(ptr, flags_byte) ;
+  uint8_t preamble_longs;
+  ptr += copy_from_mem(ptr, preamble_longs);
+  uint8_t serial_version;
+  ptr += copy_from_mem(ptr, serial_version);
+  uint8_t family_id;
+  ptr += copy_from_mem(ptr, family_id);
+  uint8_t flags_byte;
+  ptr += copy_from_mem(ptr, flags_byte);
   ptr += sizeof(uint32_t);
 
   check_header_validity(preamble_longs, serial_version, family_id, flags_byte);
 
   // Second 8 bytes are the sketch parameters with a final, unused byte.
-  uint32_t nbuckets ;
-  uint8_t nhashes ;
-  uint16_t seed_hash ;
-  ptr += copy_from_mem(ptr, nbuckets) ;
-  ptr += copy_from_mem(ptr, nhashes) ;
-  ptr += copy_from_mem(ptr, seed_hash) ;
+  uint32_t nbuckets;
+  uint8_t nhashes;
+  uint16_t seed_hash;
+  ptr += copy_from_mem(ptr, nbuckets);
+  ptr += copy_from_mem(ptr, nhashes);
+  ptr += copy_from_mem(ptr, seed_hash);
   ptr += sizeof(uint8_t);
 
   if (seed_hash != compute_seed_hash(seed)) {
     throw std::invalid_argument("Incompatible seed hashes: " + std::to_string(seed_hash) + ", "
                                 + std::to_string(compute_seed_hash(seed)));
   }
-  count_min_sketch c(nhashes, nbuckets, seed, allocator) ;
+  count_min_sketch c(nhashes, nbuckets, seed, allocator);
   const bool is_empty = (flags_byte & (1 << flags::IS_EMPTY)) > 0;
-  if (is_empty) return c ; // sketch is empty, no need to read further.
+  if (is_empty) return c; // sketch is empty, no need to read further.
 
   ensure_minimum_memory(size, sizeof(W) * (1 + nbuckets * nhashes));
 
   // Long 2 is the weight.
   W weight;
-  ptr += copy_from_mem(ptr, weight) ;
-  c._total_weight += weight ;
+  ptr += copy_from_mem(ptr, weight);
+  c._total_weight += weight;
 
   // All remaining bytes are the sketch table entries.
-  for (size_t i = 0; i<c._num_buckets*c._num_hashes ; ++i){
-    ptr += copy_from_mem(ptr, c._sketch_array[i]) ;
+  for (size_t i = 0; i<c._num_buckets*c._num_hashes; ++i) {
+    ptr += copy_from_mem(ptr, c._sketch_array[i]);
   }
   return c;
 }
@@ -468,7 +448,7 @@ template<typename W, typename A>
 string<A> count_min_sketch<W,A>::to_string() const {
   // count the number of used entries in the sketch
   uint64_t num_nonzero = 0;
-  for (auto entry : _sketch_array) {
+  for (const auto entry: _sketch_array) {
     if (entry != static_cast<W>(0.0))
       ++num_nonzero;
   }
@@ -497,7 +477,7 @@ void count_min_sketch<W,A>::check_header_validity(uint8_t preamble_longs, uint8_
   switch (sw) { // exhaustive list and description of all valid cases
     case 138 : break; // !empty, ser_ver==1, family==18, preLongs=2;
     case 139 : break; // empty, ser_ver==1, family==18, preLongs=2;
-    //case 170 : break ; // !empty, ser_ver==1, family==18, preLongs=3 ;
+    //case 170 : break; // !empty, ser_ver==1, family==18, preLongs=3;
     default : // all other case values are invalid
       valid = false;
   }
@@ -507,7 +487,7 @@ void count_min_sketch<W,A>::check_header_validity(uint8_t preamble_longs, uint8_
     os << "Possible sketch corruption. Inconsistent state: "
        << "preamble_longs = " << static_cast<uint32_t>(preamble_longs)
        << ", empty = " << (empty ? "true" : "false")
-       << ", serialization_version = " << static_cast<uint32_t>(serial_version) ;
+       << ", serialization_version = " << static_cast<uint32_t>(serial_version);
     throw std::invalid_argument(os.str());
   }
 }

data/vendor/datasketches-cpp/count/test/CMakeLists.txt

@@ -20,24 +20,23 @@ add_executable(count_min_test)
 target_link_libraries(count_min_test count common_test_lib)
 
 set_target_properties(count_min_test PROPERTIES
-        CXX_STANDARD 11
-        CXX_STANDARD_REQUIRED YES
-        )
+  CXX_STANDARD_REQUIRED YES
+)
 
 file(TO_CMAKE_PATH "${CMAKE_CURRENT_SOURCE_DIR}" COUNT_TEST_BINARY_PATH)
 string(APPEND COUNT_TEST_BINARY_PATH "/")
 target_compile_definitions(count_min_test
-        PRIVATE
-        TEST_BINARY_INPUT_PATH="${COUNT_TEST_BINARY_PATH}"
-        )
+  PRIVATE
+    TEST_BINARY_INPUT_PATH="${COUNT_TEST_BINARY_PATH}"
+)
 
 add_test(
-        NAME count_min_test
-        COMMAND count_min_test
+  NAME count_min_test
+  COMMAND count_min_test
 )
 
 target_sources(count_min_test
-        PRIVATE
-        count_min_test.cpp
-        count_min_allocation_test.cpp
-        )
+  PRIVATE
+    count_min_test.cpp
+    count_min_allocation_test.cpp
+)