summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorJan-Arve Sæther <jan-arve.saether@nokia.com>2009-09-29 06:21:39 (GMT)
committerJan-Arve Sæther <jan-arve.saether@nokia.com>2009-09-29 06:22:11 (GMT)
commitc7abca0813f1536482bca6b57a312cb11b2399d1 (patch)
treed748b52803af61009eb88ae4774eaaa87ee83ef3
parentbaf6fc9f10aa751b786021ef9b23ac546881b699 (diff)
downloadQt-c7abca0813f1536482bca6b57a312cb11b2399d1.zip
Qt-c7abca0813f1536482bca6b57a312cb11b2399d1.tar.gz
Qt-c7abca0813f1536482bca6b57a312cb11b2399d1.tar.bz2
Dont generate public docs for QSimplex.
-rw-r--r--src/gui/graphicsview/qsimplex_p.cpp4
1 files changed, 4 insertions, 0 deletions
diff --git a/src/gui/graphicsview/qsimplex_p.cpp b/src/gui/graphicsview/qsimplex_p.cpp
index 1ba24a3..1ece8b1 100644
--- a/src/gui/graphicsview/qsimplex_p.cpp
+++ b/src/gui/graphicsview/qsimplex_p.cpp
@@ -49,6 +49,7 @@
QT_BEGIN_NAMESPACE
/*!
+ \internal
\class QSimplex
The QSimplex class is a Linear Programming problem solver based on the two-phase
@@ -111,6 +112,7 @@ void QSimplex::clearDataStructures()
}
/*!
+ \internal
Sets the new constraints in the simplex solver and returns whether the problem
is feasible.
@@ -509,6 +511,7 @@ qreal QSimplex::solver(solverFactor factor)
}
/*!
+ \internal
Minimize the original objective.
*/
qreal QSimplex::solveMin()
@@ -517,6 +520,7 @@ qreal QSimplex::solveMin()
}
/*!
+ \internal
Maximize the original objective.
*/
qreal QSimplex::solveMax()