[tube] added TubeTreeSynthesis::slice(double t)

src/core/domains/tube/codac_Tube.cpp

@@ -347,7 +347,7 @@ namespace codac
       assert(tdomain().contains(t));
 
       if(m_synthesis_tree != NULL) // fast evaluation
-        return m_synthesis_tree->slice(m_synthesis_tree->time_to_index(t));
+        return m_synthesis_tree->slice(t);
 
       else
       {

src/core/domains/tube/codac_TubeTreeSynthesis.cpp

@@ -234,6 +234,29 @@ namespace codac
     }
   }
 
+  Slice* TubeTreeSynthesis::slice(double t)
+  {
+    assert(tdomain().contains(t));
+    return const_cast<Slice*>(static_cast<const TubeTreeSynthesis&>(*this).slice(t));
+  }
+
+  const Slice* TubeTreeSynthesis::slice(double t) const
+  {
+    assert(tdomain().contains(t));
+
+    if(is_leaf())
+      return m_slice_ref;
+
+    else
+    {
+      if(t < m_first_subtree->tdomain().ub())
+        return m_first_subtree->slice(t);
+
+      else
+        return m_second_subtree->slice(t);
+    }
+  }
+
   void TubeTreeSynthesis::request_values_update()
   {
     if(m_values_update_needed)

src/core/domains/tube/codac_TubeTreeSynthesis.h

@@ -33,6 +33,8 @@ namespace codac
       int time_to_index(double t) const;
       Slice* slice(int slice_id);
       const Slice* slice(int slice_id) const;
+      Slice* slice(double t);
+      const Slice* slice(double t) const;
 
       bool is_leaf() const;
       bool is_root() const;