diff options
| -rw-r--r-- | src/widgets/graphicsview/qsimplex_p.cpp | 4 | ||||
| -rw-r--r-- | src/widgets/graphicsview/qsimplex_p.h | 4 |
2 files changed, 4 insertions, 4 deletions
diff --git a/src/widgets/graphicsview/qsimplex_p.cpp b/src/widgets/graphicsview/qsimplex_p.cpp index a2437d8ab1..cf023dc8f1 100644 --- a/src/widgets/graphicsview/qsimplex_p.cpp +++ b/src/widgets/graphicsview/qsimplex_p.cpp @@ -509,7 +509,7 @@ bool QSimplex::iterate() Both solveMin and solveMax are interfaces to this method. - The enum solverFactor admits 2 values: Minimum (-1) and Maximum (+1). + The enum SolverFactor admits 2 values: Minimum (-1) and Maximum (+1). This method sets the original objective and runs the second phase Simplex to obtain the optimal solution for the problem. As the internal @@ -517,7 +517,7 @@ bool QSimplex::iterate() minimization case by inverting the original objective and then maximizing it. */ -qreal QSimplex::solver(solverFactor factor) +qreal QSimplex::solver(SolverFactor factor) { // Remove old objective clearRow(0); diff --git a/src/widgets/graphicsview/qsimplex_p.h b/src/widgets/graphicsview/qsimplex_p.h index 3fa3417eaf..8cb295e7ef 100644 --- a/src/widgets/graphicsview/qsimplex_p.h +++ b/src/widgets/graphicsview/qsimplex_p.h @@ -180,8 +180,8 @@ private: // Helpers void clearDataStructures(); void solveMaxHelper(); - enum solverFactor { Minimum = -1, Maximum = 1 }; - qreal solver(solverFactor factor); + enum SolverFactor { Minimum = -1, Maximum = 1 }; + qreal solver(SolverFactor factor); void collectResults(); QList<QSimplexConstraint *> constraints; |