From 1b38552491597f113bca8ee0a12469a139e93303 Mon Sep 17 00:00:00 2001
From: Josh Klontz <josh.klontz@gmail.com>
Date: Sat, 30 Mar 2013 13:33:56 -0400
Subject: [PATCH] fixed gcc compiler warnings

---
 openbr/core/bee.cpp          | 2 +-
 openbr/core/core.cpp         | 2 +-
 openbr/plugins/quantize2.cpp | 3 +++
 3 files changed, 5 insertions(+), 2 deletions(-)

diff --git a/openbr/core/bee.cpp b/openbr/core/bee.cpp
index cf04b47..409ca53 100644
--- a/openbr/core/bee.cpp
+++ b/openbr/core/bee.cpp
@@ -240,7 +240,7 @@ void BEE::makeMask(const QString &targetInput, const QString &queryInput, const 
     int partitions = targets.first().get<int>("crossValidate");
     if (partitions == 0) writeMask(makeMask(targets, queries), mask, targetInput, queryInput);
     else {
-        if (!mask.contains("%1")) qFatal("Mask file name missing partition number place marker (%1)");
+        if (!mask.contains("%1")) qFatal("Mask file name missing partition number place marker (%%1)");
         for (int i=0; i<partitions; i++) {
             writeMask(makeMask(targets, queries, i), mask.arg(i), targetInput, queryInput);
         }
diff --git a/openbr/core/core.cpp b/openbr/core/core.cpp
index 5fb5ca2..cb37038 100644
--- a/openbr/core/core.cpp
+++ b/openbr/core/core.cpp
@@ -205,7 +205,7 @@ struct AlgorithmCore
         QList<int> partitionSizes;
         QList<File> outputFiles;
         if (output.contains("split")) {
-            if (!output.fileName().contains("%1")) qFatal("Output file name missing split number place marker (%1)");
+            if (!output.fileName().contains("%1")) qFatal("Output file name missing split number place marker (%%1)");
             partitionSizes = output.getList<int>("split");
             for (int i=0; i<partitionSizes.size(); i++) {
                 File splitOutputFile = output.fileName().arg(i);
diff --git a/openbr/plugins/quantize2.cpp b/openbr/plugins/quantize2.cpp
index dc9b1a2..ea9a299 100644
--- a/openbr/plugins/quantize2.cpp
+++ b/openbr/plugins/quantize2.cpp
@@ -30,6 +30,9 @@ class BayesianQuantizationTransform : public Transform
         int low = 0;
         int high = cumulativeGenuines.size()-1;
         int index = cumulativeGenuines.size()/2;
+        (void) cumulativeImpostors;
+        (void) thresholds;
+        (void) thresholdIndex;
 
         while ((index != low) && (index != high)) {
             index = (high - low)/2;
--
libgit2 0.21.4