[prev in list] [next in list] [prev in thread] [next in thread] 

List:       kde-commits
Subject:    koffice/kspread/functions
From:       Sebastian Sauer <mail () dipe ! org>
Date:       2010-06-03 22:22:21
Message-ID: 20100603222221.6BD3DAC8C9 () svn ! kde ! org
[Download RAW message or body]

SVN commit 1134327 by sebsauer:

followup of r1134326; better naming

 M  +4 -4      reference.cpp  


--- trunk/koffice/kspread/functions/reference.cpp #1134326:1134327
@@ -304,7 +304,7 @@
     const int rows = data.rows();
     if (row < 1 || row > rows)
         return Value::errorVALUE();
-    const bool sorted = (args.count() > 3) ? calc->conv()->asBoolean(args[3]).asBoolean() : true;
+    const bool rangeLookup = (args.count() > 3) ? calc->conv()->asBoolean(args[3]).asBoolean() : true;
 
     // now traverse the array and perform comparison
     Value r;
@@ -316,7 +316,7 @@
             return data.element(col, row - 1);
         }
         // optionally look for the next largest value that is less than key
-        if (sorted && calc->naturalLower(le, key) && calc->naturalLower(r, le)) {
+        if (rangeLookup && calc->naturalLower(le, key) && calc->naturalLower(r, le)) {
             r = le;
             v = data.element(col, row - 1);
         }
@@ -472,7 +472,7 @@
     const int rows = data.rows();
     if (col < 1 || col > cols)
         return Value::errorVALUE();
-    const bool sorted = (args.count() > 3) ? calc->conv()->asBoolean(args[3]).asBoolean() : true;
+    const bool rangeLookup = (args.count() > 3) ? calc->conv()->asBoolean(args[3]).asBoolean() : true;
 
     // now traverse the array and perform comparison
     Value r;
@@ -484,7 +484,7 @@
             return data.element(col - 1, row);
         }
         // optionally look for the next largest value that is less than key
-        if (sorted && calc->naturalLower(le, key) && calc->naturalLower(r, le)) {
+        if (rangeLookup && calc->naturalLower(le, key) && calc->naturalLower(r, le)) {
             r = le;
             v = data.element(col - 1, row);
         }
[prev in list] [next in list] [prev in thread] [next in thread]