Mercurial > hg > match-vamp
diff src/Finder.h @ 182:a67663dc698d types
Start using properly-named types
author | Chris Cannam |
---|---|
date | Thu, 19 Feb 2015 16:57:19 +0000 |
parents | 8e7f96432570 |
children | f415747b151b |
line wrap: on
line diff
--- a/src/Finder.h Thu Feb 19 16:45:42 2015 +0000 +++ b/src/Finder.h Thu Feb 19 16:57:19 2015 +0000 @@ -47,7 +47,7 @@ * 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); + bool getBestRowCost(int row, int &bestCol, pathcost_t &bestCost); /** * Find the location and cost of the row with the cheapest path @@ -55,7 +55,7 @@ * return false and leave the bestRow and bestCost variables * unchanged. */ - bool getBestColCost(int col, int &bestRow, double &bestCost); + bool getBestColCost(int col, int &bestRow, pathcost_t &bestCost); /** * Find the location and cost of the cheapest path cost within the @@ -67,7 +67,7 @@ */ void getBestEdgeCost(int row, int col, int &bestRow, int &bestCol, - double &bestCost); + pathcost_t &bestCost); /** * Calculate which direction to expand the search area in, given @@ -110,7 +110,7 @@ * Get the path cost for the overall path to the end of both * sources. */ - double getOverallCost(); + pathcost_t getOverallCost(); protected: #ifdef PERFORM_ERROR_CHECKS @@ -120,10 +120,10 @@ Type type; int r; int c; - double prevCost; - float distance; - double costWas; - double costShouldBe; + pathcost_t prevCost; + distance_t distance; + pathcost_t costWas; + pathcost_t costShouldBe; advance_t advanceWas; advance_t advanceShouldBe; };