Mercurial > hg > match-vamp
diff src/Finder.h @ 154:4159f6b71942 structure
More cost query methods
author | Chris Cannam |
---|---|
date | Fri, 23 Jan 2015 14:55:19 +0000 |
parents | 3673e2dae6a7 |
children | 28c73e5db2eb |
line wrap: on
line diff
--- a/src/Finder.h Fri Jan 23 11:46:14 2015 +0000 +++ b/src/Finder.h Fri Jan 23 14:55:19 2015 +0000 @@ -29,6 +29,8 @@ ~Finder(); + void setMatcher(Matcher *pm); + /** * Tell the finder that one or both files ends sooner than it * thought, i.e. that some of the trailing features are silence or @@ -39,6 +41,21 @@ void setDurations(int d1, int d2); /** + * Find the location and cost of the column with the cheapest path + * cost within the given row. If the row is out of range, return + * false and leave the bestCol and bestCost variables unchanged. + */ + bool getBestRowCost(int row, int &bestCol, double &bestCost); + + /** + * Find the location and cost of the row with the cheapest path + * cost within the given column. If the column is out of range, + * return false and leave the bestRow and bestCost variables + * unchanged. + */ + bool getBestColCost(int col, int &bestRow, double &bestCost); + + /** * Find the location and cost of the cheapest path cost within the * final row and column of the search area, given that the area * extends as far as the point at (row, col). This is used by