From 79c5d2acf5a9af5b11dac611fe7b81de75e53b89 Mon Sep 17 00:00:00 2001
From: Marc Glisse <marc.glisse@inria.fr>
Date: Tue, 19 Mar 2019 16:54:25 +0100
Subject: Fixes

---
 src/Rips_complex/include/gudhi/Sparse_rips_complex.h | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

(limited to 'src/Rips_complex')

diff --git a/src/Rips_complex/include/gudhi/Sparse_rips_complex.h b/src/Rips_complex/include/gudhi/Sparse_rips_complex.h
index 7686d666..11d0b4c4 100644
--- a/src/Rips_complex/include/gudhi/Sparse_rips_complex.h
+++ b/src/Rips_complex/include/gudhi/Sparse_rips_complex.h
@@ -121,9 +121,9 @@ class Sparse_rips_complex {
     for(int i=0;i<n;++i)
       lambda[sorted_points[i]] = params[i];
     double cst = epsilon_ * (1 - epsilon_);
-    auto block = [=cst,&complex](typename SimplicialComplexForRips::Simplex_handle sh){
+    auto block = [cst,&complex,&lambda](typename SimplicialComplexForRips::Simplex_handle sh){
       auto filt = complex.filtration(sh);
-      auto mini = file * cst;
+      auto mini = filt * cst;
       for(auto v : complex.simplex_vertex_range(sh)){
         if(lambda[v] < mini) // FIXME: store lambda/params somewhere!!!
           return true; // v died before this simplex could be born
@@ -146,7 +146,7 @@ class Sparse_rips_complex {
   };
 
   // PointRange must be random access.
-  template <typename PointRange, typename ParamRange, typename Distance>
+  template <typename Distance>
   void compute_sparse_graph(Distance& dist, double epsilon) {
     const auto& points = sorted_points; // convenience alias
     const int n = boost::size(points);
-- 
cgit v1.2.3