1 files changed, 11 insertions, 11 deletions

diff --git a/include/framework/reconstruction/BSMPolicy.h b/include/framework/reconstruction/BSMPolicy.h
index 9138bd1..4ceca9a 100644
--- a/include/framework/reconstruction/BSMPolicy.h
+++ b/include/framework/reconstruction/BSMPolicy.h
@@ -16,17 +16,17 @@
 
 namespace de {
 template <ShardInterface ShardType, QueryInterface<ShardType> QueryType>
-class BSMPolicy : ReconstructionPolicy<ShardType, QueryType> {
+class BSMPolicy : public ReconstructionPolicy<ShardType, QueryType> {
   typedef std::vector<std::shared_ptr<InternalLevel<ShardType, QueryType>>>
       LevelVector;
 
 public:
-  BSMPolicy(size_t scale_factor, size_t buffer_size)
-      : m_scale_factor(scale_factor), m_buffer_size(buffer_size) {}
+  BSMPolicy(size_t buffer_size)
+      : m_scale_factor(2), m_buffer_size(buffer_size) {}
 
   ReconstructionVector
-  get_reconstruction_tasks(Epoch<ShardType, QueryType> *epoch,
-                           size_t incoming_reccnt) override {
+  get_reconstruction_tasks(const Epoch<ShardType, QueryType> *epoch,
+                           size_t incoming_reccnt) const override {
     ReconstructionVector reconstructions;
     auto levels = epoch->get_structure()->get_level_vector();
 
@@ -44,7 +44,7 @@ public:
     task.type = ReconstructionType::Merge;
 
     for (level_index i = target_level; i > source_level; i--) {
-      if (i < levels.size()) {
+      if (i < (level_index)levels.size()) {
         task.add_shard({i, all_shards_idx}, levels[i]->get_record_count());
       }
     }
@@ -54,17 +54,17 @@ public:
   }
 
   ReconstructionTask
-  get_flush_task(Epoch<ShardType, QueryType> *epoch) override {
+  get_flush_task(const Epoch<ShardType, QueryType> *epoch) const override {
     return ReconstructionTask{
         {{buffer_shid}}, 0, m_buffer_size, ReconstructionType::Flush};
   }
 
 private:
-  level_index find_reconstruction_target(LevelVector &levels) {
+  level_index find_reconstruction_target(LevelVector &levels) const {
     level_index target_level = 0;
 
-    for (size_t i = 0; i < (level_index)levels.size(); i++) {
-      if (levels[i].get_record_count() + 1 <= capacity(i)) {
+    for (level_index i = 0; i < (level_index)levels.size(); i++) {
+      if (levels[i]->get_record_count() + 1 <= capacity(i)) {
         target_level = i;
         break;
       }
@@ -73,7 +73,7 @@ private:
     return target_level;
   }
 
-  inline size_t capacity(level_index level) {
+  inline size_t capacity(level_index level) const {
     return m_buffer_size * pow(m_scale_factor, level + 1);
   }