From f5cec3e7949691cb50aeb2b403a12fd42706ab51 Mon Sep 17 00:00:00 2001
From: nico <nico.pietroni@gmail.com>
Date: Mon, 29 Nov 2021 07:17:31 +1100
Subject: [PATCH] changed numeric_limits::lowest with
 -std::numeric_limits<ScalarType>::max as it was creating problems with
 percentile in hist

---
 vcg/complex/algorithms/stat.h | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/vcg/complex/algorithms/stat.h b/vcg/complex/algorithms/stat.h
index 40eca014..bb1eec41 100644
--- a/vcg/complex/algorithms/stat.h
+++ b/vcg/complex/algorithms/stat.h
@@ -99,7 +99,7 @@ public:
   static std::pair<ScalarType,ScalarType> ComputePerFaceQualityMinMax( const MeshType & m)
   {
     tri::RequirePerFaceQuality(m);
-    std::pair<ScalarType,ScalarType> minmax = std::make_pair(std::numeric_limits<ScalarType>::max(),-std::numeric_limits<ScalarType>::lowest());
+    std::pair<ScalarType,ScalarType> minmax = std::make_pair(std::numeric_limits<ScalarType>::max(),-std::numeric_limits<ScalarType>::max());
 
     ConstFaceIterator fi;
     for(fi = m.face.begin(); fi != m.face.end(); ++fi)
@@ -122,7 +122,7 @@ public:
   static std::pair<ScalarType, ScalarType> ComputePerTetraQualityMinMax(const MeshType & m)
   {
     tri::RequirePerTetraQuality(m);
-	std::pair<ScalarType, ScalarType> minmax = std::make_pair(std::numeric_limits<ScalarType>::max(), std::numeric_limits<ScalarType>::lowest());
+    std::pair<ScalarType, ScalarType> minmax = std::make_pair(std::numeric_limits<ScalarType>::max(), -std::numeric_limits<ScalarType>::max());
 
     ForEachTetra(m, [&minmax] (const TetraType & t) {
       if (t.cQ() < minmax.first)  minmax.first  = t.cQ();
@@ -179,7 +179,7 @@ public:
   static std::pair<ScalarType,ScalarType> ComputePerEdgeQualityMinMax(const MeshType & m)
   {
     tri::RequirePerEdgeQuality(m);
-    std::pair<ScalarType,ScalarType> minmax = std::make_pair(std::numeric_limits<ScalarType>::max(),std::numeric_limits<ScalarType>::lowest());
+    std::pair<ScalarType,ScalarType> minmax = std::make_pair(std::numeric_limits<ScalarType>::max(),-std::numeric_limits<ScalarType>::max());
 
     EdgeIterator ei;
     for(ei = m.edge.begin(); ei != m.edge.end(); ++ei)