# HG changeset patch
# User Chris Cannam
# Date 1425548835 0
# Node ID 97cc0b9135e7273039d9829475ef21c7e53dbc45
# Parent  2fcd1c14f0f6ea3cc01adb7fdb6a8a0f5053ed4a
Refer to distances rather than path costs for availability (in case we deem old path costs surplus to requirement for live tracking)

diff -r 2fcd1c14f0f6 -r 97cc0b9135e7 src/Matcher.cpp
--- a/src/Matcher.cpp	Fri Feb 27 14:27:34 2015 +0000
+++ b/src/Matcher.cpp	Thu Mar 05 09:47:15 2015 +0000
@@ -81,7 +81,7 @@
 {
     if (m_firstPM) {
         if (isInRange(i, j)) {
-            return (m_bestPathCost[i][j - m_first[i]] != INVALID_PATHCOST);
+            return (m_distance[i][j - m_first[i]] != INVALID_DISTANCE);
         } else {
             return false;
         }
@@ -96,8 +96,8 @@
     if (m_firstPM) {
 
         if (i < 0 || i >= int(m_first.size())) return false;
-        for (auto c: m_bestPathCost[i]) {
-            if (c != INVALID_PATHCOST) return true;
+        for (auto c: m_distance[i]) {
+            if (c != INVALID_DISTANCE) return true;
         }
         return false;
 
@@ -112,7 +112,7 @@
     if (m_firstPM) {
         for (int i = 0; i < int(m_first.size()); ++i) {
             if (j >= m_first[i] && j < m_last[i]) {
-                if (m_bestPathCost[i][j - m_first[i]] != INVALID_PATHCOST) {
+                if (m_distance[i][j - m_first[i]] != INVALID_DISTANCE) {
                     return true;
                 }
             }
@@ -130,7 +130,7 @@
         return ((i >= 0) &&
                 (i < int(m_first.size())) &&
                 (j >= m_first[i]) &&
-                (j < int(m_first[i] + m_bestPathCost[i].size())));
+                (j < int(m_first[i] + m_distance[i].size())));
     } else {
         return m_otherMatcher->isInRange(j, i);
     }