Better way to organize 2 compared cell values.

Turns out this is slightly faster too.

Change-Id: I5a8c3474ab2a342200a5cfa9a93e6d89433595c4

1 files changed, 13 insertions, 13 deletions

diff --git a/sc/inc/compare.hxx b/sc/inc/compare.hxx
index 0bbf8dcc45fd..3189bc81d05a 100644
--- a/sc/inc/compare.hxx
+++ b/sc/inc/compare.hxx
@@ -30,23 +30,23 @@ namespace sc {
 
 struct Compare
 {
-    double nVal[2];
-    OUString* pVal[2];
-    bool bVal[2];
-    bool bEmpty[2];
+    struct Cell
+    {
+        double mfValue;
+        OUString* mpStr;
+        bool mbValue;
+        bool mbEmpty;
+
+        Cell();
+        Cell( OUString* p );
+    };
+
+    Cell maCells[2];
 
     ScQueryOp meOp;
     bool mbIgnoreCase;
 
-    Compare( OUString* p1, OUString* p2 ) :
-        meOp(SC_EQUAL),
-        mbIgnoreCase(true)
-    {
-        pVal[0] = p1;
-        pVal[1] = p2;
-        bEmpty[0] = false;
-        bEmpty[1] = false;
-    }
+    Compare( OUString* p1, OUString* p2 );
 };
 
 struct CompareOptions