@@ -18,7 +18,8 @@ limitations under the License.
18
18
#ifdef HAVE_TFLOGGER
19
19
20
20
#include " histogram.h"
21
- #include < limits>
21
+ #include < float.h>
22
+ #include < math.h>
22
23
#include < vector>
23
24
#include < algorithm>
24
25
#include < tflogger/summary.pb.h>
@@ -36,8 +37,8 @@ static std::vector<double>* InitDefaultBucketsInner() {
36
37
neg_buckets.push_back (-v);
37
38
v *= 1.1 ;
38
39
}
39
- buckets.push_back (std::numeric_limits< double >:: max () );
40
- neg_buckets.push_back (-std::numeric_limits< double >:: max () );
40
+ buckets.push_back (DBL_MAX );
41
+ neg_buckets.push_back (-DBL_MAX );
41
42
std::reverse (neg_buckets.begin (), neg_buckets.end ());
42
43
std::vector<double >* result = new std::vector<double >;
43
44
result->insert (result->end (), neg_buckets.begin (), neg_buckets.end ());
@@ -84,7 +85,7 @@ bool Histogram::DecodeFromProto(const HistogramProto& proto) {
84
85
85
86
void Histogram::Clear () {
86
87
min_ = bucket_limits_[bucket_limits_.size () - 1 ];
87
- max_ = -std::numeric_limits< double >:: max () ;
88
+ max_ = -DBL_MAX ;
88
89
num_ = 0 ;
89
90
sum_ = 0 ;
90
91
sum_squares_ = 0 ;
@@ -177,7 +178,7 @@ std::string Histogram::ToString() const {
177
178
if (buckets_[b] <= 0.0 ) continue ;
178
179
sum += buckets_[b];
179
180
snprintf (buf, sizeof (buf), " [ %10.2g, %10.2g ) %7.0f %7.3f%% %7.3f%% " ,
180
- ((b == 0 ) ? -std::numeric_limits< double >:: max () : bucket_limits_[b - 1 ]), // left
181
+ ((b == 0 ) ? -DBL_MAX : bucket_limits_[b - 1 ]), // left
181
182
bucket_limits_[b], // right
182
183
buckets_[b], // count
183
184
mult * buckets_[b], // percentage
@@ -217,7 +218,7 @@ void Histogram::EncodeToProto(HistogramProto* proto,
217
218
}
218
219
if (proto->bucket_size () == 0.0 ) {
219
220
// It's easier when we restore if we always have at least one bucket entry
220
- proto->add_bucket_limit (std::numeric_limits< double >:: max () );
221
+ proto->add_bucket_limit (DBL_MAX );
221
222
proto->add_bucket (0.0 );
222
223
}
223
224
}
0 commit comments