Commit 1b38552491597f113bca8ee0a12469a139e93303

Authored by Josh Klontz
1 parent 12d4b019

fixed gcc compiler warnings

openbr/core/bee.cpp
@@ -240,7 +240,7 @@ void BEE::makeMask(const QString &targetInput, const QString &queryInput, const @@ -240,7 +240,7 @@ void BEE::makeMask(const QString &targetInput, const QString &queryInput, const
240 int partitions = targets.first().get<int>("crossValidate"); 240 int partitions = targets.first().get<int>("crossValidate");
241 if (partitions == 0) writeMask(makeMask(targets, queries), mask, targetInput, queryInput); 241 if (partitions == 0) writeMask(makeMask(targets, queries), mask, targetInput, queryInput);
242 else { 242 else {
243 - if (!mask.contains("%1")) qFatal("Mask file name missing partition number place marker (%1)"); 243 + if (!mask.contains("%1")) qFatal("Mask file name missing partition number place marker (%%1)");
244 for (int i=0; i<partitions; i++) { 244 for (int i=0; i<partitions; i++) {
245 writeMask(makeMask(targets, queries, i), mask.arg(i), targetInput, queryInput); 245 writeMask(makeMask(targets, queries, i), mask.arg(i), targetInput, queryInput);
246 } 246 }
openbr/core/core.cpp
@@ -205,7 +205,7 @@ struct AlgorithmCore @@ -205,7 +205,7 @@ struct AlgorithmCore
205 QList<int> partitionSizes; 205 QList<int> partitionSizes;
206 QList<File> outputFiles; 206 QList<File> outputFiles;
207 if (output.contains("split")) { 207 if (output.contains("split")) {
208 - if (!output.fileName().contains("%1")) qFatal("Output file name missing split number place marker (%1)"); 208 + if (!output.fileName().contains("%1")) qFatal("Output file name missing split number place marker (%%1)");
209 partitionSizes = output.getList<int>("split"); 209 partitionSizes = output.getList<int>("split");
210 for (int i=0; i<partitionSizes.size(); i++) { 210 for (int i=0; i<partitionSizes.size(); i++) {
211 File splitOutputFile = output.fileName().arg(i); 211 File splitOutputFile = output.fileName().arg(i);
openbr/plugins/quantize2.cpp
@@ -30,6 +30,9 @@ class BayesianQuantizationTransform : public Transform @@ -30,6 +30,9 @@ class BayesianQuantizationTransform : public Transform
30 int low = 0; 30 int low = 0;
31 int high = cumulativeGenuines.size()-1; 31 int high = cumulativeGenuines.size()-1;
32 int index = cumulativeGenuines.size()/2; 32 int index = cumulativeGenuines.size()/2;
  33 + (void) cumulativeImpostors;
  34 + (void) thresholds;
  35 + (void) thresholdIndex;
33 36
34 while ((index != low) && (index != high)) { 37 while ((index != low) && (index != high)) {
35 index = (high - low)/2; 38 index = (high - low)/2;