From 2975364ca6da680bacb7dce510ce66fa515268ad Mon Sep 17 00:00:00 2001
From: BezhenarAN <bezhenaran@mpei.ru>
Date: Tue, 23 Apr 2024 21:02:14 +0300
Subject: [PATCH] =?UTF-8?q?code:=20=D0=BF=D1=83=D0=BD=D0=BA=D1=82=205(?=
 =?UTF-8?q?=D1=84=D1=83=D0=BD=D0=BA=D1=86=D0=B8=D1=8F=20find=5Fminmax=20?=
 =?UTF-8?q?=D0=BF=D0=B5=D1=80=D0=B5=D1=81=D1=82=D0=B0=D0=BB=D0=B0=20=D0=B1?=
 =?UTF-8?q?=D1=8B=D1=82=D1=8C=20=D1=81=D1=82=D0=B0=D1=82=D0=B8=D1=87=D0=BD?=
 =?UTF-8?q?=D0=BE=D0=B9)?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 histogram.cpp | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/histogram.cpp b/histogram.cpp
index 6744741..41fad77 100644
--- a/histogram.cpp
+++ b/histogram.cpp
@@ -1,7 +1,7 @@
 #include "histogram.h"
 #include <vector>
 
-static void find_minmax(const std::vector <double> &numbers, double &min, double &max){
+void find_minmax(const std::vector <double> &numbers, double &min, double &max){
     min = numbers[0];
     max = numbers[0];
     for ( double x : numbers ){
@@ -13,15 +13,15 @@ static void find_minmax(const std::vector <double> &numbers, double &min, double
     }
 }
 
-std::vector<std::size_t> make_histogram(const std::vector<double> &numbers, size_t bin_count) {
+std::vector<std::size_t> make_histogram(const std::vector<double> &numbers, std::size_t bin_count) {
     double min = numbers[0];
     double max = numbers[0];
     find_minmax(numbers, min, max);
     double bin_size = ( max - min ) / bin_count;
     std::vector<std::size_t> bins ( bin_count );
-    for (size_t i=0; i <  numbers.size(); i++ ){
+    for (std::size_t i=0; i <  numbers.size(); i++ ){
         bool found = false;
-        for (size_t j = 0; ( j < bin_count - 1 ) && !found; j++ ){
+        for (std::size_t j = 0; ( j < bin_count - 1 ) && !found; j++ ){
             auto lo = min + j * bin_size;
             auto hi = min + ( j + 1 ) * bin_size;
             if (lo <= numbers[i] && ( numbers[i] < hi )){