comparison src/Matcher.h @ 53:331a17753663 refactors

If the distance metric is a float, the total path cost should be a double (otherwise discriminatory precision is lost as the overall total accumulates)

      *
      *  @param i the frame number of this Matcher
      *  @param j the frame number of the other Matcher
      *  @return the cost of the minimum cost path to this location
      */
-    float getValue(int i, int j, bool firstAttempt);
+    double getValue(int i, int j, bool firstAttempt);
 
     /** Stores entries in the distance matrix and the optimal path matrix.
      *
      *  @param i the frame number of this Matcher
      *  @param j the frame number of the other Matcher
      *  @param dir the direction from which this position is reached with
      *  minimum cost
      *  @param value the cost of the minimum path except the current step
      *  @param dMN the distance cost between the two frames
      */
-    void setValue(int i, int j, Advance dir, float value, float dMN);
+    void setValue(int i, int j, Advance dir, double value, float dMN);
 
     void calcAdvance();
 
     /** Points to the other performance with which this one is being
      *  compared.  The data for the distance metric and the dynamic

      *  frames are received.  One can think of the structure of the
      *  array as a circular buffer of vectors. */
     vector<vector<double> > m_frames;
 
     /** The best path cost matrix. */
-    vector<vector<float> > m_bestPathCost;
+    vector<vector<double> > m_bestPathCost;
 
     /** The distance matrix. */
     vector<vector<float> > m_distance;
 
     /** The advance direction matrix. */