datasketches 0.2.6 → 0.3.0

data/vendor/datasketches-cpp/tuple/test/engagement_test.cpp

@@ -0,0 +1,299 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements.  See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership.  The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License.  You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied.  See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ */
+
+#include <iostream>
+#include <iomanip>
+#include <set>
+#include <catch2/catch.hpp>
+#include <tuple_sketch.hpp>
+#include <tuple_union.hpp>
+#include <stdexcept>
+
+template<typename T>
+class max_value_policy {
+public:
+    max_value_policy(const T& initial_value): initial_value(initial_value) {}
+    T create() const { return initial_value; }
+    void update(T& summary, const T& update) const { summary = std::max(summary, update); }
+private:
+    T initial_value;
+};
+
+using max_float_update_tuple_sketch = datasketches::update_tuple_sketch<float, float, max_value_policy<float>>;
+
+template<typename T>
+class always_one_policy {
+public:
+    always_one_policy(): initial_value(1) {}
+    T create() const { return 1; }
+    void update(T&, const T&) const { }
+private:
+    T initial_value;
+};
+using always_one_tuple_sketch = datasketches::update_tuple_sketch<int, int, always_one_policy<int>> ;
+
+template<typename T>
+class update_sum_value_policy {
+public:
+    update_sum_value_policy(): initial_value(0) {}
+    T create() const { return initial_value; }
+    void update(T& summary, const T& update) const { summary += update; }
+private:
+    T initial_value;
+};
+using sum_update_tuple_sketch = datasketches::update_tuple_sketch<int, int, update_sum_value_policy<int>>;
+
+template<typename Summary>
+struct union_sum_value_policy {
+    void operator()(Summary& summary, const Summary& other) const {
+        summary += other;
+    }
+};
+
+using sum_union_tuple_sketch = datasketches::tuple_union<int,  union_sum_value_policy<int>> ;
+
+
+class EngagementTest{
+public:
+    int num_std_dev = 2 ;
+    void test_always_one_update(){
+        /*
+         * Tests that updates into an update_tuple_sketch sketch only keeps a 1 in the column for stored values.
+         */
+        int lgK = 8 ;
+        std::vector<datasketches::update_tuple_sketch<int, int, always_one_policy<int>>> sketch_array ;
+
+        auto always_one_sketch = always_one_tuple_sketch::builder(always_one_policy<int>()).set_lg_k(lgK).build() ;
+
+        always_one_sketch.update(1, 1);
+        always_one_sketch.update(1, 2);
+        always_one_sketch.update(2, 1);
+        always_one_sketch.update(3, 3);
+        always_one_sketch.update(3, 7);
+
+        int num_retained = 0;
+        int sum = 0;
+        for (const auto& entry: always_one_sketch) {
+            sum += entry.second;
+            ++num_retained;
+        }
+        REQUIRE(num_retained == 3);
+        REQUIRE(sum == 3); // we only keep 1 for every stored key.
+    }
+
+    void test_sum_update_policy(){
+        /*
+        * Tests that updates into an sum_update_tuple_sketch sum the stored values on updates.
+        */
+        int lgK = 8 ;
+        auto sum_sketch = sum_update_tuple_sketch::builder().set_lg_k(lgK).build() ;
+
+        sum_sketch.update(1, 1);
+        sum_sketch.update(1, 2);
+        sum_sketch.update(2, 1);
+        sum_sketch.update(3, 3);
+        sum_sketch.update(3, 7);
+        int num_retained = 0;
+        int sum = 0;
+        for (const auto& entry: sum_sketch) {
+            sum += entry.second;
+            ++num_retained;
+        }
+        REQUIRE(num_retained == 3);
+        REQUIRE(sum == 14); // (1+2) + 1 + (3 + 7) = 14
+    }
+
+    void test_sum_union_policy(){
+        /*
+         * Tests that updates into two sketches of sum_update_tuple_sketch flavour, which have been unioned,
+         * cause the stored values of two of the same keys to be summed.
+         */
+        auto sketch1 = sum_update_tuple_sketch::builder().build() ;
+        auto sketch2 = sum_update_tuple_sketch::builder().build() ;
+
+        sketch1.update(1, 1);
+        sketch1.update(2, 1);
+        sketch1.update(3, 3);
+
+        sketch2.update(1, 2);
+        sketch2.update(2, 1);
+        sketch2.update(3, 7);
+
+        auto union_sketch = sum_union_tuple_sketch::builder().build() ;
+        union_sketch.update(sketch1) ;
+        union_sketch.update(sketch2) ;
+        auto union_result = union_sketch.get_result() ;
+
+        int num_retained = 0;
+        int sum = 0;
+        for (const auto& entry: union_result) {
+            sum += entry.second;
+            ++num_retained;
+        }
+        REQUIRE(num_retained == 3);
+        REQUIRE(sum == 15); // 1:(1+2) + 2:(1+1) + 3:(3+7) = 15
+    }
+
+    void compute_engagement_histogram(){
+        /*
+         * Returns the estimated histogram from the synthetic data.
+         * On inspection one can verify this agrees with the
+         * https://github.com/apache/datasketches-java/blob/master/src/test/java/org/apache/datasketches/tuple/aninteger/EngagementTest.java
+         */
+        int lgK = 8 ;
+        const int days = 30 ;
+        int v = 0 ;
+        std::set<int> set_array[days];
+        std::vector<datasketches::update_tuple_sketch<int, int, always_one_policy<int>>> sketch_array ;
+
+
+        for(int i=0; i<days ; i++){
+            auto builder = always_one_tuple_sketch::builder(always_one_policy<int>()) ;
+            builder.set_lg_k(lgK) ;
+            auto sketch = builder.build() ;
+            sketch_array.push_back(sketch);
+        }
+        REQUIRE(sketch_array.size() == days) ;
+
+        for(int i=0; i<=days; i++){
+            int32_t num_ids = get_num_ids(days, i) ;
+            int32_t num_days = get_num_days(days, i) ;
+
+            int my_v = v++ ;
+            for(int d=0 ; d<num_days; d++){
+                for(int id = 0; id < num_ids; id++){
+                    set_array[d].insert(my_v + id) ;
+                    sketch_array[d].update(my_v + id, 1) ;
+                }
+            }
+            v += num_ids ;
+        }
+        union_ops(lgK, sketch_array) ;
+    }
+private:
+    int32_t get_num_ids(int total_days, int index){
+        /*
+         * Generates power law distributed synthetic data
+         */
+        double d = total_days ;
+        double i = index ;
+        return int(round(exp(i * log(d) / d))) ;
+    }
+
+    int32_t get_num_days(int total_days, int index){
+        double d = total_days ;
+        double i = index ;
+        return int(round(exp( (d-i) * log(d) / d ))) ;
+    }
+
+    int32_t round_double_to_int(double x){
+        return int(std::round(x)) ;
+    }
+
+    void union_ops(int lgk, std::vector<datasketches::update_tuple_sketch<int, int, always_one_policy<int>>> sketches){
+        int num_sketches = sketches.size() ;
+        auto u = sum_union_tuple_sketch::builder().set_lg_k(lgk).build() ;
+
+        for(auto sk:sketches){
+            u.update(sk) ;
+        }
+        auto union_result = u.get_result() ;
+        std::vector<uint64_t> num_days_arr(num_sketches+1) ;
+
+        for (const auto& entry: union_result) {
+            int num_days_visited = entry.second ;
+            num_days_arr[num_days_visited]++;
+        }
+
+        int sum_visits = 0;
+        double theta = union_result.get_theta();
+        std::cout <<"\t\tEngagement Histogram.\t\t\t\n" ;
+        std::cout << "Number of Unique Visitors by Number of Days Visited" << std::endl ;
+        std::cout << "---------------------------------------------------" << std::endl ;
+
+        std::cout << std::setw(12) << "Days Visited"
+                  << std::setw(12) << "Estimate"
+                  << std::setw(12) << "LB"
+                  << std::setw(12) << "UB"
+                  << std:: endl ;
+
+        for (uint64_t i = 0; i < num_days_arr.size(); i++) {
+            int visitors_at_days_visited = num_days_arr[i] ;
+            if(visitors_at_days_visited == 0){ continue; }
+            sum_visits += visitors_at_days_visited * i ;
+
+            double est_visitors_at_days_visited = visitors_at_days_visited / theta ;
+            double lower_bound_at_days_visited =  union_result.get_lower_bound(num_std_dev, visitors_at_days_visited);
+            double upper_bound_at_days_visited =  union_result.get_upper_bound(num_std_dev, visitors_at_days_visited);
+
+            std::cout << std::setw(12) << i
+                      << std::setw(12) << est_visitors_at_days_visited
+                      << std::setw(12) << lower_bound_at_days_visited
+                      << std::setw(12) << upper_bound_at_days_visited
+                      << std:: endl ;
+
+    }
+        std::cout << std::endl << std::endl ;
+        std::cout << std::setw(12) << "Totals"
+                  << std::setw(12) << "Estimate"
+                  << std::setw(12) << "LB"
+                  << std::setw(12) << "UB"
+                  << std:: endl ;
+        std::cout << "---------------------------------------------------" << std::endl ;
+
+        const double total_visitors = union_result.get_estimate() ;
+        const double lb_visitors = union_result.get_lower_bound(num_std_dev) ;
+        const double ub_visitors = union_result.get_upper_bound(num_std_dev) ;
+
+
+        std::cout << std::setw(12) << "Visitors"
+                  << std::setw(12) << total_visitors
+                  << std::setw(12) << lb_visitors
+                  << std::setw(12) << ub_visitors
+                  << std:: endl ;
+
+        // The total number of visits, however, is a scaled metric and takes advantage of the fact that
+        // the retained entries in the sketch is a uniform random sample of all unique visitors, and
+        // the  rest of the unique users will likely behave in the same way.
+        const double est_visits = sum_visits / theta;
+        const double lb_visits = est_visits * lb_visitors / total_visitors;
+        const double ub_visits = est_visits * ub_visitors / total_visitors;
+
+
+        std::cout << std::setw(12) << "Visits"
+                  << std::setw(12) << est_visits
+                  << std::setw(12) << lb_visits
+                  << std::setw(12) << ub_visits
+                  << std:: endl ;
+    }
+
+};
+
+namespace datasketches {
+
+    TEST_CASE("engagement", "[engagement]") {
+    EngagementTest E ;
+    E.test_always_one_update() ;
+    E.test_sum_update_policy() ;
+    E.test_sum_union_policy() ;
+    E.compute_engagement_histogram() ;
+}
+
+
+} /* namespace datasketches */

data/vendor/datasketches-cpp/tuple/test/tuple_a_not_b_test.cpp

@@ -19,7 +19,7 @@
 
 #include <iostream>
 
-#include <catch.hpp>
+#include <catch2/catch.hpp>
 #include <tuple_a_not_b.hpp>
 #include <theta_sketch.hpp>
 #include <stdexcept>

data/vendor/datasketches-cpp/tuple/test/tuple_intersection_test.cpp

@@ -19,7 +19,7 @@
 
 #include <iostream>
 
-#include <catch.hpp>
+#include <catch2/catch.hpp>
 #include <tuple_intersection.hpp>
 #include <theta_sketch.hpp>
 #include <stdexcept>

data/vendor/datasketches-cpp/tuple/test/tuple_jaccard_similarity_test.cpp

@@ -19,7 +19,7 @@
 
 #include <iostream>
 
-#include <catch.hpp>
+#include <catch2/catch.hpp>
 
 #include "tuple_jaccard_similarity.hpp"
 

data/vendor/datasketches-cpp/tuple/test/tuple_sketch_allocation_test.cpp

@@ -19,7 +19,7 @@
 
 #include <iostream>
 
-#include <catch.hpp>
+#include <catch2/catch.hpp>
 #include <tuple_sketch.hpp>
 #include <test_allocator.hpp>
 #include <test_type.hpp>

data/vendor/datasketches-cpp/tuple/test/tuple_sketch_test.cpp

@@ -32,7 +32,7 @@ std::ostream& operator<<(std::ostream& os, const three_doubles& tuple) {
 
 }
 
-#include <catch.hpp>
+#include <catch2/catch.hpp>
 #include <tuple_sketch.hpp>
 
 namespace datasketches {
@@ -56,7 +56,13 @@ TEST_CASE("tuple sketch float: empty", "[tuple_sketch]") {
   REQUIRE(!update_sketch.is_estimation_mode());
   REQUIRE(update_sketch.get_estimate() == 0);
   REQUIRE(update_sketch.get_lower_bound(1) == 0);
+  REQUIRE(update_sketch.get_lower_bound(1, 1) == 0);
+  REQUIRE(update_sketch.get_lower_bound(1, update_sketch.get_num_retained()) == 0);
+  REQUIRE(update_sketch.get_lower_bound(1, update_sketch.get_num_retained()+1) == 0);
   REQUIRE(update_sketch.get_upper_bound(1) == 0);
+  REQUIRE(update_sketch.get_upper_bound(1, 1) == 0);
+  REQUIRE(update_sketch.get_upper_bound(1, update_sketch.get_num_retained()) == 0);
+  REQUIRE(update_sketch.get_upper_bound(1, update_sketch.get_num_retained()+1) == 0);
   REQUIRE(update_sketch.get_theta() == 1);
   REQUIRE(update_sketch.get_num_retained() == 0);
   REQUIRE(update_sketch.is_ordered());
@@ -67,7 +73,11 @@ TEST_CASE("tuple sketch float: empty", "[tuple_sketch]") {
   REQUIRE(!compact_sketch.is_estimation_mode());
   REQUIRE(compact_sketch.get_estimate() == 0);
   REQUIRE(compact_sketch.get_lower_bound(1) == 0);
+  REQUIRE(compact_sketch.get_lower_bound(1, 1) == 0);
+  REQUIRE(compact_sketch.get_lower_bound(1, update_sketch.get_num_retained()) == 0);
   REQUIRE(compact_sketch.get_upper_bound(1) == 0);
+  REQUIRE(compact_sketch.get_upper_bound(1, 1) == 0);
+  REQUIRE(compact_sketch.get_upper_bound(1, update_sketch.get_num_retained()) == 0);
   REQUIRE(compact_sketch.get_theta() == 1);
   REQUIRE(compact_sketch.get_num_retained() == 0);
   REQUIRE(compact_sketch.is_ordered());
@@ -110,7 +120,11 @@ TEST_CASE("tuple sketch float: exact mode", "[tuple_sketch]") {
   REQUIRE_FALSE(update_sketch.is_estimation_mode());
   REQUIRE(update_sketch.get_estimate() == 2);
   REQUIRE(update_sketch.get_lower_bound(1) == 2);
+  REQUIRE(update_sketch.get_lower_bound(1, 1) == 1);
+  REQUIRE(update_sketch.get_lower_bound(1, update_sketch.get_num_retained()) == 2);
   REQUIRE(update_sketch.get_upper_bound(1) == 2);
+  REQUIRE(update_sketch.get_upper_bound(1, 1) == 1);
+  REQUIRE(update_sketch.get_upper_bound(1, update_sketch.get_num_retained()) == 2);
   REQUIRE(update_sketch.get_theta() == 1);
   REQUIRE(update_sketch.get_num_retained() == 2);
   REQUIRE_FALSE(update_sketch.is_ordered());
@@ -127,7 +141,11 @@ TEST_CASE("tuple sketch float: exact mode", "[tuple_sketch]") {
   REQUIRE_FALSE(compact_sketch.is_estimation_mode());
   REQUIRE(compact_sketch.get_estimate() == 2);
   REQUIRE(compact_sketch.get_lower_bound(1) == 2);
+  REQUIRE(compact_sketch.get_lower_bound(1, 1) == 1);
+  REQUIRE(compact_sketch.get_lower_bound(1, compact_sketch.get_num_retained()) == 2);
   REQUIRE(compact_sketch.get_upper_bound(1) == 2);
+  REQUIRE(compact_sketch.get_upper_bound(1, 1) == 1);
+  REQUIRE(compact_sketch.get_upper_bound(1, compact_sketch.get_num_retained()) == 2);
   REQUIRE(compact_sketch.get_theta() == 1);
   REQUIRE(compact_sketch.get_num_retained() == 2);
   REQUIRE(compact_sketch.is_ordered());
@@ -146,7 +164,11 @@ TEST_CASE("tuple sketch float: exact mode", "[tuple_sketch]") {
     REQUIRE(!deserialized_sketch.is_estimation_mode());
     REQUIRE(deserialized_sketch.get_estimate() == 2);
     REQUIRE(deserialized_sketch.get_lower_bound(1) == 2);
+    REQUIRE(deserialized_sketch.get_lower_bound(1, 1) == 1);
+    REQUIRE(deserialized_sketch.get_lower_bound(1, deserialized_sketch.get_num_retained()) == 2);
     REQUIRE(deserialized_sketch.get_upper_bound(1) == 2);
+    REQUIRE(deserialized_sketch.get_upper_bound(1, 1) == 1);
+    REQUIRE(deserialized_sketch.get_upper_bound(1, deserialized_sketch.get_num_retained()) == 2);
     REQUIRE(deserialized_sketch.get_theta() == 1);
     REQUIRE(deserialized_sketch.get_num_retained() == 2);
     REQUIRE(deserialized_sketch.is_ordered());
@@ -160,7 +182,11 @@ TEST_CASE("tuple sketch float: exact mode", "[tuple_sketch]") {
     REQUIRE(!deserialized_sketch.is_estimation_mode());
     REQUIRE(deserialized_sketch.get_estimate() == 2);
     REQUIRE(deserialized_sketch.get_lower_bound(1) == 2);
+    REQUIRE(deserialized_sketch.get_lower_bound(1, 1) == 1);
+    REQUIRE(deserialized_sketch.get_lower_bound(1, deserialized_sketch.get_num_retained()) == 2);
     REQUIRE(deserialized_sketch.get_upper_bound(1) == 2);
+    REQUIRE(deserialized_sketch.get_upper_bound(1, 1) == 1);
+    REQUIRE(deserialized_sketch.get_upper_bound(1, deserialized_sketch.get_num_retained()) == 2);
     REQUIRE(deserialized_sketch.get_theta() == 1);
     REQUIRE(deserialized_sketch.get_num_retained() == 2);
     REQUIRE(deserialized_sketch.is_ordered());

data/vendor/datasketches-cpp/tuple/test/tuple_union_test.cpp

@@ -20,7 +20,7 @@
 #include <iostream>
 #include <stdexcept>
 
-#include <catch.hpp>
+#include <catch2/catch.hpp>
 #include <tuple_union.hpp>
 #include <theta_sketch.hpp>
 

data/vendor/datasketches-cpp/version.cfg.in

@@ -0,0 +1 @@
+4.0.0

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: datasketches
 version: !ruby/object:Gem::Version
-  version: 0.2.6
+  version: 0.3.0
 platform: ruby
 authors:
 - Andrew Kane
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2022-07-13 00:00:00.000000000 Z
+date: 2022-12-09 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rice
@@ -65,16 +65,16 @@ files:
 - vendor/datasketches-cpp/common/include/kolmogorov_smirnov.hpp
 - vendor/datasketches-cpp/common/include/kolmogorov_smirnov_impl.hpp
 - vendor/datasketches-cpp/common/include/memory_operations.hpp
-- vendor/datasketches-cpp/common/include/quantile_sketch_sorted_view.hpp
-- vendor/datasketches-cpp/common/include/quantile_sketch_sorted_view_impl.hpp
+- vendor/datasketches-cpp/common/include/quantiles_sorted_view.hpp
+- vendor/datasketches-cpp/common/include/quantiles_sorted_view_impl.hpp
 - vendor/datasketches-cpp/common/include/serde.hpp
+- vendor/datasketches-cpp/common/include/version.hpp.in
 - vendor/datasketches-cpp/common/test/CMakeLists.txt
-- vendor/datasketches-cpp/common/test/catch.hpp
 - vendor/datasketches-cpp/common/test/catch_runner.cpp
 - vendor/datasketches-cpp/common/test/integration_test.cpp
+- vendor/datasketches-cpp/common/test/quantiles_sorted_view_test.cpp
 - vendor/datasketches-cpp/common/test/test_allocator.cpp
 - vendor/datasketches-cpp/common/test/test_allocator.hpp
-- vendor/datasketches-cpp/common/test/test_runner.cpp
 - vendor/datasketches-cpp/common/test/test_type.hpp
 - vendor/datasketches-cpp/cpc/CMakeLists.txt
 - vendor/datasketches-cpp/cpc/include/compression_data.hpp
@@ -173,6 +173,9 @@ files:
 - vendor/datasketches-cpp/pyproject.toml
 - vendor/datasketches-cpp/python/CMakeLists.txt
 - vendor/datasketches-cpp/python/README.md
+- vendor/datasketches-cpp/python/datasketches/PySerDe.py
+- vendor/datasketches-cpp/python/datasketches/__init__.py
+- vendor/datasketches-cpp/python/include/py_serde.hpp
 - vendor/datasketches-cpp/python/jupyter/CPCSketch.ipynb
 - vendor/datasketches-cpp/python/jupyter/FrequentItemsSketch.ipynb
 - vendor/datasketches-cpp/python/jupyter/HLLSketch.ipynb
@@ -186,6 +189,7 @@ files:
 - vendor/datasketches-cpp/python/src/hll_wrapper.cpp
 - vendor/datasketches-cpp/python/src/kll_wrapper.cpp
 - vendor/datasketches-cpp/python/src/ks_wrapper.cpp
+- vendor/datasketches-cpp/python/src/py_serde.cpp
 - vendor/datasketches-cpp/python/src/quantiles_wrapper.cpp
 - vendor/datasketches-cpp/python/src/req_wrapper.cpp
 - vendor/datasketches-cpp/python/src/theta_wrapper.cpp
@@ -285,6 +289,7 @@ files:
 - vendor/datasketches-cpp/theta/test/theta_setop_test.cpp
 - vendor/datasketches-cpp/theta/test/theta_sketch_test.cpp
 - vendor/datasketches-cpp/theta/test/theta_union_test.cpp
+- vendor/datasketches-cpp/tox.ini
 - vendor/datasketches-cpp/tuple/CMakeLists.txt
 - vendor/datasketches-cpp/tuple/include/array_of_doubles_a_not_b.hpp
 - vendor/datasketches-cpp/tuple/include/array_of_doubles_a_not_b_impl.hpp
@@ -310,12 +315,14 @@ files:
 - vendor/datasketches-cpp/tuple/test/aod_2_compact_exact_from_java.sk
 - vendor/datasketches-cpp/tuple/test/aod_3_compact_empty_from_java.sk
 - vendor/datasketches-cpp/tuple/test/array_of_doubles_sketch_test.cpp
+- vendor/datasketches-cpp/tuple/test/engagement_test.cpp
 - vendor/datasketches-cpp/tuple/test/tuple_a_not_b_test.cpp
 - vendor/datasketches-cpp/tuple/test/tuple_intersection_test.cpp
 - vendor/datasketches-cpp/tuple/test/tuple_jaccard_similarity_test.cpp
 - vendor/datasketches-cpp/tuple/test/tuple_sketch_allocation_test.cpp
 - vendor/datasketches-cpp/tuple/test/tuple_sketch_test.cpp
 - vendor/datasketches-cpp/tuple/test/tuple_union_test.cpp
+- vendor/datasketches-cpp/version.cfg.in
 homepage: https://github.com/ankane/datasketches-ruby
 licenses:
 - Apache-2.0
@@ -328,7 +335,7 @@ required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
     - !ruby/object:Gem::Version
-      version: '2.6'
+      version: '2.7'
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="

data/vendor/datasketches-cpp/common/include/quantile_sketch_sorted_view_impl.hpp

@@ -1,91 +0,0 @@
-/*
- * Licensed to the Apache Software Foundation (ASF) under one
- * or more contributor license agreements.  See the NOTICE file
- * distributed with this work for additional information
- * regarding copyright ownership.  The ASF licenses this file
- * to you under the Apache License, Version 2.0 (the
- * "License"); you may not use this file except in compliance
- * with the License.  You may obtain a copy of the License at
- *
- *   http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing,
- * software distributed under the License is distributed on an
- * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
- * KIND, either express or implied.  See the License for the
- * specific language governing permissions and limitations
- * under the License.
- */
-
-#ifndef QUANTILE_SKETCH_SORTED_VIEW_IMPL_HPP_
-#define QUANTILE_SKETCH_SORTED_VIEW_IMPL_HPP_
-
-#include <algorithm>
-#include <stdexcept>
-
-namespace datasketches {
-
-template<typename T, typename C, typename A>
-quantile_sketch_sorted_view<T, C, A>::quantile_sketch_sorted_view(uint32_t num, const A& allocator):
-total_weight_(0),
-entries_(allocator)
-{
-  entries_.reserve(num);
-}
-
-template<typename T, typename C, typename A>
-template<typename Iterator>
-void quantile_sketch_sorted_view<T, C, A>::add(Iterator first, Iterator last, uint64_t weight) {
-  const size_t size_before = entries_.size();
-  for (auto it = first; it != last; ++it) entries_.push_back(Entry(ref_helper(*it), weight));
-  if (size_before > 0) {
-    Container tmp(entries_.get_allocator());
-    tmp.reserve(entries_.capacity());
-    std::merge(
-        entries_.begin(), entries_.begin() + size_before,
-        entries_.begin() + size_before, entries_.end(),
-        std::back_inserter(tmp), compare_pairs_by_first()
-    );
-    std::swap(tmp, entries_);
-  }
-}
-
-template<typename T, typename C, typename A>
-template<bool inclusive>
-void quantile_sketch_sorted_view<T, C, A>::convert_to_cummulative() {
-  uint64_t subtotal = 0;
-  for (auto& entry: entries_) {
-    const uint64_t new_subtotal = subtotal + entry.second;
-    entry.second = inclusive ? new_subtotal : subtotal;
-    subtotal = new_subtotal;
-  }
-  total_weight_ = subtotal;
-}
-
-template<typename T, typename C, typename A>
-auto quantile_sketch_sorted_view<T, C, A>::get_quantile(double rank) const -> quantile_return_type {
-  if (total_weight_ == 0) throw std::invalid_argument("supported for cumulative weight only");
-  uint64_t weight = static_cast<uint64_t>(rank * total_weight_);
-  auto it = std::lower_bound(entries_.begin(), entries_.end(), make_dummy_entry<T>(weight), compare_pairs_by_second());
-  if (it == entries_.end()) return deref_helper(entries_[entries_.size() - 1].first);
-  return deref_helper(it->first);
-}
-
-template<typename T, typename C, typename A>
-auto quantile_sketch_sorted_view<T, C, A>::begin() const -> const_iterator {
-  return entries_.begin();
-}
-
-template<typename T, typename C, typename A>
-auto quantile_sketch_sorted_view<T, C, A>::end() const -> const_iterator {
-  return entries_.end();
-}
-
-template<typename T, typename C, typename A>
-size_t quantile_sketch_sorted_view<T, C, A>::size() const {
-  return entries_.size();
-}
-
-} /* namespace datasketches */
-
-#endif