From eeb7f7791130c19bd7eb0eeee245dd1087659c55 Mon Sep 17 00:00:00 2001
From: bronku <bronk.jakub@proton.me>
Date: Thu, 13 Nov 2025 19:56:18 +0100
Subject: [PATCH] removed debug info

---
 reader.hpp | 5 -----
 sort.cpp   | 7 ++-----
 2 files changed, 2 insertions(+), 10 deletions(-)

diff --git a/reader.hpp b/reader.hpp
index 2c69b3e..bc48ce1 100644
--- a/reader.hpp
+++ b/reader.hpp
@@ -17,21 +17,16 @@ private:
     // returns true if at least one record was returned
     bool refill_buffer()
     {
-        std::cout << "refilling buffer\n";
         last_element_idx = -1;
         current_idx = 0;
 
         for (size_t i = 0; i < buffer_size; i++) {
-            std::cout << "buffer refill: i: " << i << '\n';
             if (!(input_stream >> read_buffer[i])) {
-                std::cout << "input stream error\n";
-                std::cout << read_buffer[i] << '\n';
                 break;
             }
             last_element_idx = i;
         }
 
-        std::cout << "buffer refill successfull\n";
         return last_element_idx >= 0;
     }
 
diff --git a/sort.cpp b/sort.cpp
index 5697e14..0e77808 100644
--- a/sort.cpp
+++ b/sort.cpp
@@ -4,7 +4,7 @@
 #include "reader.hpp"
 #include "writer.hpp"
 #include <fstream>
-//
+
 // returns amount of records read
 size_t read_chunk(Reader& reader, SubBuffer& buff)
 {
@@ -34,9 +34,7 @@ void create_initial_runs(const std::string& input_filename, const std::string& d
     std::ifstream in_stream(input_filename);
     Reader input_reader(in_stream);
     for (size_t run_index = 0;; run_index++) {
-        std::cout << "creating run " << run_index << '\n';
         size_t size = read_chunk(input_reader, buff);
-        std::cout << "read " << size << " records\n";
         if (size == 0) {
             break;
         }
@@ -49,7 +47,6 @@ int sort_file(const Configuration& opts)
 {
     Buffer main_buffer(opts.n * opts.b);
     create_initial_runs(opts.input_file, opts.directory, main_buffer);
-    // TODO: Implement sorting with new buffer classes
-    std::cout << "Sorting not yet implemented\n";
+
     return 0;
 }