Changeset e4ae9e95f7 in tspsg for src

Timestamp:

Jan 12, 2010, 4:27:52 PM (15 years ago)

Author:

Oleksii Serdiuk

Branches:

0.1.3.145-beta1-symbian, 0.1.4.170-beta2-bb10, appveyor, imgbot, master, readme

Children:

3e46075789

Parents:

fcd8c1e4c1

Message:

Back to double to maintain compatibility between platforms.

Location:

src

Files:

• globals.h (modified) (1 diff)
• mainwindow.cpp (modified) (2 diffs)
• tspmodel.cpp (modified) (5 diffs)
• tspmodel.h (modified) (1 diff)
• tspsolver.cpp (modified) (7 diffs)
• tspsolver.h (modified) (3 diffs)

src/globals.h

@@ -96 +96 @@
  * \return \c true if \a x countains an integer, oherwise \c false.
  */
-inline bool isInteger(qreal x)
+inline bool isInteger(double x)
 {
-qreal i;
+double i;
         return (modf(x, &i) == 0.0);
 }

src/mainwindow.cpp

@@ -383 +383 @@
 {
 TMatrix matrix;
-QList<qreal> row;
+QList<double> row;
 int n = spinCities->value();
 bool ok;
@@ -389 +389 @@
                 row.clear();
                 for (int c = 0; c < n; c++) {
-                        row.append(tspmodel->index(r,c).data(Qt::UserRole).toReal(&ok));
+                        row.append(tspmodel->index(r,c).data(Qt::UserRole).toDouble(&ok));
                         if (!ok) {
                                 QMessageBox(QMessageBox::Critical,tr("Data error"),tr("Error in cell [Row %1; Column %2]: Invalid data format.").arg(r + 1).arg(c + 1),QMessageBox::Ok,this).exec();

src/tspmodel.cpp

@@ -281 +281 @@
                 for (int c = 0; c < nCities; c++)
                         if (r != c) {
-                                ds << static_cast<double>(table[r][c]); // We cast to double because qreal may be float on some platforms and we store double values in file
+                                ds << static_cast<double>(table[r][c]); // We cast to double because double may be float on some platforms and we store double values in file
                                 if (f.error() != QFile::NoError) {
                                         f.close();
@@ -312 +312 @@
                 else {
 bool ok;
-qreal tmp = value.toReal(&ok);
+double tmp = value.toDouble(&ok);
                         if (!ok || tmp < 0)
                                 return false;
@@ -399 +399 @@
         }
 
-double x; // We need this as qreal may be float on some platforms and we store double values in file
+double x; // We need this as double may be float on some platforms and we store double values in file
         // Travel costs
         for (int r = 0; r < size; r++)
@@ -447 +447 @@
         }
         // Travel costs
-qreal val;
+double val;
         for (int r = 0; r < 5; r++)
                 for (int c = 0; c < 5; c++)
@@ -469 +469 @@
 }
 
-inline qreal CTSPModel::rand(int min, int max) const
-{
-qreal r;
+inline double CTSPModel::rand(int min, int max) const
+{
+double r;
         if (settings->value("Task/FractionalRandom", DEF_FRACTIONAL_RANDOM).toBool()) {
-qreal x = qPow(10, settings->value("Task/FractionalAccuracy", DEF_FRACTIONAL_ACCURACY).toInt());
-                r = (qreal)qRound((qreal)qrand() / RAND_MAX * (max - min) * x) / x;
+double x = qPow(10, settings->value("Task/FractionalAccuracy", DEF_FRACTIONAL_ACCURACY).toInt());
+                r = (double)qRound((double)qrand() / RAND_MAX * (max - min) * x) / x;
         } else
-                r = qRound((qreal)qrand() / RAND_MAX * (max - min));
+                r = qRound((double)qrand() / RAND_MAX * (max - min));
         return min + r;
 }

src/tspmodel.h

@@ -64 +64 @@
 private:
         QSettings *settings;
-        QVector<QVector<qreal> > table;
+        QVector<QVector<double> > table;
         quint16 nCities;
         bool loadError(QDataStream::Status);
         bool loadTSPT(QDataStream *);
         bool loadZKT(QDataStream *);
-        qreal rand(int, int) const;
+        double rand(int, int) const;
 };
 

src/tspsolver.cpp

@@ -106 +106 @@
 int nRow, nCol;
 bool firstStep = true;
-qreal check;
+double check;
         while (this->route.size() < nCities) {
 //              forbidden.clear();
@@ -188 +188 @@
 /* Privates **********************************************************/
 
-qreal CTSPSolver::align(TMatrix &matrix)
-{
-qreal r = 0;
-qreal min;
+double CTSPSolver::align(TMatrix &matrix)
+{
+double r = 0;
+double min;
         for (int k = 0; k < nCities; k++) {
                 min = findMinInRow(k,matrix);
@@ -240 +240 @@
 QList<SCandidate> alts;
 SCandidate cand;
-qreal h = -1;
-qreal sum;
+double h = -1;
+double sum;
         for (int r = 0; r < nCities; r++)
                 for (int c = 0; c < nCities; c++)
@@ -261 +261 @@
 }
 
-qreal CTSPSolver::findMinInCol(int nCol, const TMatrix &matrix, int exr) const
-{
-qreal min = INFINITY;
+double CTSPSolver::findMinInCol(int nCol, const TMatrix &matrix, int exr) const
+{
+double min = INFINITY;
         for (int k = 0; k < nCities; k++)
                 if ((k != exr) && (min > matrix.at(k).at(nCol)))
@@ -270 +270 @@
 }
 
-qreal CTSPSolver::findMinInRow(int nRow, const TMatrix &matrix, int exc) const
-{
-qreal min = INFINITY;
+double CTSPSolver::findMinInRow(int nRow, const TMatrix &matrix, int exc) const
+{
+double min = INFINITY;
         for (int k = 0; k < nCities; k++)
                 if (((k != exc)) && (min > matrix.at(nRow).at(k)))
@@ -293 +293 @@
 }
 
-void CTSPSolver::subCol(TMatrix &matrix, int nCol, qreal val)
+void CTSPSolver::subCol(TMatrix &matrix, int nCol, double val)
 {
         for (int k = 0; k < nCities; k++)
@@ -300 +300 @@
 }
 
-void CTSPSolver::subRow(TMatrix &matrix, int nRow, qreal val)
+void CTSPSolver::subRow(TMatrix &matrix, int nRow, double val)
 {
         for (int k = 0; k < nCities; k++)

src/tspsolver.h

@@ -34 +34 @@
 
 //! A matrix of city-to-city travel costs.
-typedef QList<QList<qreal> > TMatrix;
+typedef QList<QList<double> > TMatrix;
 
 /*!
@@ -60 +60 @@
 struct SStep {
         TMatrix matrix; //!< This step's matrix
-        qreal price; //!< The price of travel to this step
+        double price; //!< The price of travel to this step
         SCandidate candidate; //!< A candiadate for branching in the current matrix
         QList<SCandidate> alts; //!< A list of alternative branching candidates
@@ -98 +98 @@
 //      QHash<int,int> forbidden;
 
-        qreal align(TMatrix &matrix);
+        double align(TMatrix &matrix);
         void cleanup();
         void deleteNode(SStep *&node);
         QList<SCandidate> findCandidate(const TMatrix &matrix, int &nRow, int &nCol) const;
-        qreal findMinInCol(int nCol, const TMatrix &matrix, int exr = -1) const;
-        qreal findMinInRow(int nRow, const TMatrix &matrix, int exc = -1) const;
+        double findMinInCol(int nCol, const TMatrix &matrix, int exr = -1) const;
+        double findMinInRow(int nRow, const TMatrix &matrix, int exc = -1) const;
         bool hasSubCycles(int nRow, int nCol) const;
-        void subCol(TMatrix &matrix, int nCol, qreal val);
-        void subRow(TMatrix &matrix, int nRow, qreal val);
+        void subCol(TMatrix &matrix, int nCol, double val);
+        void subRow(TMatrix &matrix, int nRow, double val);
 };