From: Gard Spreemann Date: Mon, 11 Jun 2018 15:42:51 +0200 Subject: Rounding workaround on i686. --- include/gudhi/Bottleneck.h | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/include/gudhi/Bottleneck.h b/include/gudhi/Bottleneck.h index 7aee07b..ffa87a8 100644 --- a/include/gudhi/Bottleneck.h +++ b/include/gudhi/Bottleneck.h @@ -42,7 +42,7 @@ double bottleneck_distance_approx(Persistence_graph& g, double e) { Graph_matching m(g); Graph_matching biggest_unperfect(g); while (b_upper_bound - b_lower_bound > 2 * e) { - double step = b_lower_bound + (b_upper_bound - b_lower_bound) / alpha; + volatile double step = b_lower_bound + (b_upper_bound - b_lower_bound) / alpha; if (step <= b_lower_bound || step >= b_upper_bound) // Avoid precision problem break; m.set_r(step);