From 5c5d7f3e7c296e508de4969d1844cb50ffa923d0 Mon Sep 17 00:00:00 2001 From: glisse Date: Sun, 22 Jul 2018 10:55:07 +0000 Subject: Mark functions as inline. git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/trunk@3699 636b058d-ea47-450e-bf9e-a15bfbe3eedb Former-commit-id: 431a0f7e2169ac7ebbdc6e4bd3458176030261ff --- src/Bottleneck_distance/include/gudhi/Bottleneck.h | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'src/Bottleneck_distance') diff --git a/src/Bottleneck_distance/include/gudhi/Bottleneck.h b/src/Bottleneck_distance/include/gudhi/Bottleneck.h index b0fc3949..7a553006 100644 --- a/src/Bottleneck_distance/include/gudhi/Bottleneck.h +++ b/src/Bottleneck_distance/include/gudhi/Bottleneck.h @@ -36,7 +36,7 @@ namespace Gudhi { namespace persistence_diagram { -double bottleneck_distance_approx(Persistence_graph& g, double e) { +inline double bottleneck_distance_approx(Persistence_graph& g, double e) { double b_lower_bound = 0.; double b_upper_bound = g.diameter_bound(); const double alpha = std::pow(g.size(), 1. / 5.); @@ -66,7 +66,7 @@ double bottleneck_distance_approx(Persistence_graph& g, double e) { return (b_lower_bound + b_upper_bound) / 2.; } -double bottleneck_distance_exact(Persistence_graph& g) { +inline double bottleneck_distance_exact(Persistence_graph& g) { std::vector sd = g.sorted_distances(); long lower_bound_i = 0; long upper_bound_i = sd.size() - 1; -- cgit v1.2.3