1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682
|
/* This file is part of the KDE project
Copyright (C) 1998-2002 The KSpread Team <calligra-devel@kde.org>
Copyright (C) 2005 Tomas Mecir <mecirt@gmail.com>
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation; only
version 2 of the License.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Library General Public License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.
*/
// built-in reference functions
#include "ReferenceModule.h"
#include "Cell.h"
#include "Region.h"
#include "Sheet.h"
#include "Util.h"
#include "Value.h"
#include "Map.h"
#include "CalculationSettings.h"
#include "CellStorage.h"
#include "Formula.h"
#include "Function.h"
#include "FunctionModuleRegistry.h"
#include "ValueCalc.h"
#include "ValueConverter.h"
#include <KLocale>
using namespace Calligra::Sheets;
// prototypes (sorted alphabetically)
Value func_address(valVector args, ValueCalc *calc, FuncExtra *);
Value func_areas(valVector args, ValueCalc *calc, FuncExtra *);
Value func_cell(valVector args, ValueCalc *calc, FuncExtra *e);
Value func_choose(valVector args, ValueCalc *calc, FuncExtra *);
Value func_column(valVector args, ValueCalc *calc, FuncExtra *);
Value func_columns(valVector args, ValueCalc *calc, FuncExtra *);
Value func_hlookup(valVector args, ValueCalc *calc, FuncExtra *);
Value func_index(valVector args, ValueCalc *calc, FuncExtra *);
Value func_indirect(valVector args, ValueCalc *calc, FuncExtra *);
Value func_lookup(valVector args, ValueCalc *calc, FuncExtra *);
Value func_match(valVector args, ValueCalc *calc, FuncExtra *);
Value func_multiple_operations(valVector args, ValueCalc *calc, FuncExtra *);
Value func_offset(valVector args, ValueCalc *calc, FuncExtra *);
Value func_row(valVector args, ValueCalc *calc, FuncExtra *);
Value func_rows(valVector args, ValueCalc *calc, FuncExtra *);
Value func_sheet(valVector args, ValueCalc *calc, FuncExtra *);
Value func_sheets(valVector args, ValueCalc *calc, FuncExtra *);
Value func_vlookup(valVector args, ValueCalc *calc, FuncExtra *);
CALLIGRA_SHEETS_EXPORT_FUNCTION_MODULE("reference", ReferenceModule)
ReferenceModule::ReferenceModule(QObject* parent, const QVariantList&)
: FunctionModule(parent)
{
Function *f;
f = new Function("ADDRESS", func_address);
f->setParamCount(2, 5);
add(f);
f = new Function("AREAS", func_areas);
f->setParamCount(1);
f->setNeedsExtra(true);
f->setAcceptArray();
add(f);
f = new Function("CELL", func_cell);
f->setParamCount(1, 2);
f->setAcceptArray();
f->setNeedsExtra(true);
add(f);
f = new Function("CHOOSE", func_choose);
f->setParamCount(2, -1);
f->setAcceptArray();
add(f);
f = new Function("COLUMN", func_column);
f->setParamCount(0, 1);
add(f);
f = new Function("COLUMNS", func_columns);
f->setParamCount(1);
f->setAcceptArray();
f->setNeedsExtra(true);
add(f);
f = new Function("HLOOKUP", func_hlookup);
f->setParamCount(3, 4);
f->setAcceptArray();
add(f);
f = new Function("INDEX", func_index);
f->setParamCount(3);
f->setAcceptArray();
add(f);
f = new Function("INDIRECT", func_indirect);
f->setParamCount(1, 2);
f->setNeedsExtra(true);
add(f);
f = new Function("LOOKUP", func_lookup);
f->setParamCount(3);
f->setAcceptArray();
add(f);
f = new Function("MATCH", func_match);
f->setParamCount(2, 3);
f->setAcceptArray();
f->setNeedsExtra(true);
add(f);
f = new Function("MULTIPLE.OPERATIONS", func_multiple_operations);
f->setParamCount(3, 5);
f->setNeedsExtra(true);
add(f);
f = new Function("OFFSET", func_offset);
f->setParamCount(3, 5);
f->setNeedsExtra(true);
add(f);
f = new Function("ROW", func_row);
f->setParamCount(0, 1);
add(f);
f = new Function("ROWS", func_rows);
f->setParamCount(1);
f->setAcceptArray();
f->setNeedsExtra(true);
add(f);
f = new Function("SHEET", func_sheet);
f->setParamCount(0, 1);
f->setNeedsExtra(true);
add(f);
f = new Function("SHEETS", func_sheets);
f->setParamCount(0, 1);
f->setAcceptArray();
f->setNeedsExtra(true);
add(f);
f = new Function("VLOOKUP", func_vlookup);
f->setParamCount(3, 4);
f->setAcceptArray();
add(f);
}
QString ReferenceModule::descriptionFileName() const
{
return QString("reference.xml");
}
//
// Function: ADDRESS
//
Value func_address(valVector args, ValueCalc *calc, FuncExtra *)
{
bool r1c1 = false;
QString sheetName;
int absNum = 1;
if (args.count() > 2)
absNum = calc->conv()->asInteger(args[2]).asInteger();
if (args.count() > 3)
r1c1 = !(calc->conv()->asBoolean(args[3]).asBoolean());
if (args.count() == 5)
sheetName = calc->conv()->asString(args[4]).asString();
QString result;
int row = calc->conv()->asInteger(args[0]).asInteger();
int col = calc->conv()->asInteger(args[1]).asInteger();
if (!sheetName.isEmpty()) {
result += sheetName;
result += '!';
}
if (r1c1) {
// row first
bool abs = false;
if (absNum == 1 || absNum == 2)
abs = true;
result += 'R';
if (!abs)
result += '[';
result += QString::number(row);
if (!abs)
result += ']';
// column
abs = false;
if (absNum == 1 || absNum == 3)
abs = true;
result += 'C';
if (!abs)
result += '[';
result += QString::number(col);
if (!abs)
result += ']';
} else {
bool abs = false;
if (absNum == 1 || absNum == 3)
abs = true;
if (abs)
result += '$';
result += Cell::columnName(col);
abs = false;
if (absNum == 1 || absNum == 2)
abs = true;
if (abs)
result += '$';
result += QString::number(row);
}
return Value(result);
}
//
// Function: AREAS
//
Value func_areas(valVector args, ValueCalc *calc, FuncExtra *e)
{
if (e) {
if (e->regions[0].isValid())
return Value(e->regions[0].rects().size());
if ((e->ranges[0].col1 != -1) && (e->ranges[0].row1 != -1) &&
(e->ranges[0].col2 != -1) && (e->ranges[0].row2 != -1))
// we have a range reference - return 1
return Value(1);
}
QString s = calc->conv()->asString(args[0]).asString();
if (s[0] != '(' || s[s.length() - 1] != ')')
return Value::errorVALUE();
int l = s.length();
int num = 0;
QString ref;
for (int i = 1; i < l; ++i) {
if (s[i] == ',' || s[i] == ')') {
if (!Calligra::Sheets::Region(ref).isValid())
return Value::errorVALUE();
else {
++num;
ref = "";
}
} else
ref += s[i];
}
return Value(num);
}
//
// Function: CELL
//
Value func_cell(valVector args, ValueCalc *calc, FuncExtra *e)
{
const QString type = calc->conv()->asString(args[0]).asString().toLower();
args.pop_front();
FuncExtra extra(*e);
extra.ranges.pop_front();
extra.regions.pop_front();
if (type == "col") {
return func_column(args, calc, &extra);
}
if (type == "row") {
return func_row(args, calc, &extra);
}
if (type == "sheet") {
return func_sheet(args, calc, &extra);
}
if (type == "address") {
const Calligra::Sheets::Region ®ion = args.count() ? extra.regions[0] : Calligra::Sheets::Region(QPoint(e->mycol, e->myrow), e->sheet);
QString s;
if (region.firstSheet() && region.firstSheet() != e->sheet)
s += "'" + region.firstSheet()->sheetName() + "'!";
s += "$" + Cell::columnName(region.firstRange().x()) + "$" + QString::number(region.firstRange().y());
if (region.firstRange() != region.lastRange())
s += ":$" + Cell::columnName(region.lastRange().x()) + "$" + QString::number(region.lastRange().y());
return Value(s);
}
if (type == "filename") {
return Value(calc->settings()->fileName());
}
/*TODO
if (type == "contents")
if (type == "color")
if (type == "format")
if (type == "width")
if (type == "type")
if (type == "protect")
if (type == "parenthese")
if (type == "prefix")
*/
return Value::errorVALUE();
}
//
// Function: CHOOSE
//
Value func_choose(valVector args, ValueCalc *calc, FuncExtra *)
{
int cnt = args.count() - 1;
int num = calc->conv()->asInteger(args[0]).asInteger();
if ((num <= 0) || (num > cnt))
return Value::errorVALUE();
return args[num];
}
//
// Function: COLUMN
//
Value func_column(valVector args, ValueCalc *, FuncExtra *e)
{
int col = e ? e->mycol : 0;
if (e && args.count())
col = e->ranges[0].col1;
if (col > 0)
return Value(col);
return Value::errorVALUE();
}
//
// Function: COLUMNS
//
Value func_columns(valVector, ValueCalc *, FuncExtra *e)
{
int col1 = e->ranges[0].col1;
int col2 = e->ranges[0].col2;
if ((col1 == -1) || (col2 == -1))
return Value::errorVALUE();
return Value(col2 - col1 + 1);
}
//
// Function: HLOOKUP
//
Value func_hlookup(valVector args, ValueCalc *calc, FuncExtra *)
{
const Value key = args[0];
const Value data = args[1];
const int row = calc->conv()->asInteger(args[2]).asInteger();
const int cols = data.columns();
const int rows = data.rows();
if (row < 1 || row > rows)
return Value::errorVALUE();
const bool rangeLookup = (args.count() > 3) ? calc->conv()->asBoolean(args[3]).asBoolean() : true;
// now traverse the array and perform comparison
Value r;
Value v = Value::errorNA();
for (int col = 0; col < cols; ++col) {
// search in the first row
const Value le = data.element(col, 0);
if (calc->naturalEqual(key, le)) {
return data.element(col, row - 1);
}
// optionally look for the next largest value that is less than key
if (rangeLookup && calc->naturalLower(le, key) && calc->naturalLower(r, le)) {
r = le;
v = data.element(col, row - 1);
}
}
return v;
}
//
// Function: INDEX
//
Value func_index(valVector args, ValueCalc *calc, FuncExtra *)
{
// first argument can be either a range, then we return a given cell's
// value, or a single cell containing an array - then we return the array
// element. In any case, this function can assume that the given value
// is the same. Because it is.
Value val = args[0];
unsigned row = calc->conv()->asInteger(args[1]).asInteger() - 1;
unsigned col = calc->conv()->asInteger(args[2]).asInteger() - 1;
if ((row >= val.rows()) || (col >= val.columns()))
return Value::errorREF();
return val.element(col, row);
}
//
// Function: INDIRECT
//
Value func_indirect(valVector args, ValueCalc *calc, FuncExtra *e)
{
bool r1c1 = false;
QString ref = calc->conv()->asString(args[0]).asString();
if (args.count() == 2)
r1c1 = !(calc->conv()->asBoolean(args[1]).asBoolean());
if (ref.isEmpty())
return Value::errorVALUE();
if (r1c1) {
// TODO: translate the r1c1 style to a1 style
ref = ref;
}
const Calligra::Sheets::Region region(ref, e->sheet->map(), e->sheet);
if (!region.isValid() || !region.isSingular())
return Value::errorVALUE();
const Cell cell(region.firstSheet(), region.firstRange().topLeft());
if (!cell.isNull())
return cell.value();
return Value::errorVALUE();
}
//
// Function: LOOKUP
//
Value func_lookup(valVector args, ValueCalc *calc, FuncExtra *)
{
Value num = calc->conv()->asNumeric(args[0]);
if (num.isArray())
return Value::errorVALUE();
Value lookup = args[1];
Value rr = args[2];
unsigned cols = lookup.columns();
unsigned rows = lookup.rows();
if ((cols != rr.columns()) || (rows != rr.rows()))
return Value::errorVALUE();
Value res = Value::errorNA();
// now traverse the array and perform comparison
for (unsigned r = 0; r < rows; ++r)
for (unsigned c = 0; c < cols; ++c) {
// update the result, return if we cross the line
Value le = lookup.element(c, r);
if (calc->lower(le, num) || calc->equal(num, le))
res = rr.element(c, r);
else
return res;
}
return res;
}
//
// Function: MATCH
//
Value func_match(valVector args, ValueCalc *calc, FuncExtra* e)
{
int matchType = 1;
if (args.count() == 3) {
bool ok = true;
matchType = calc->conv()->asInteger(args[2], &ok).asInteger();
if (!ok)
return Value::errorVALUE(); // invalid matchtype
}
const Value& searchValue = args[0];
const Value& searchArray = args[1];
if (e->ranges[1].rows() != 1 && e->ranges[1].columns() != 1)
return Value::errorNA();
int dr = 1, dc = 0;
if (searchArray.columns() != 1) {
dr = 0; dc = 1;
}
int n = qMax(searchArray.rows(), searchArray.columns());
if (matchType == 0) {
// linear search
for (int r = 0, c = 0; r < n && c < n; r += dr, c += dc) {
if (calc->naturalEqual(searchValue, searchArray.element(c, r), false)) {
return Value(qMax(r, c) + 1);
}
}
return Value::errorNA();
} else if (matchType > 0) {
// binary search
int l = -1;
int h = n;
while (l+1 < h) {
int m = (l+h)/2;
if (calc->naturalLequal(searchArray.element(m*dc, m*dr), searchValue, false)) {
l = m;
} else {
h = m;
}
}
if (l == -1) return Value::errorNA();
return Value(l+1);
} else /* matchType < 0 */ {
// binary search
int l = -1;
int h = n;
while (l+1 < h) {
int m = (l+h)/2;
if (calc->naturalGequal(searchArray.element(m*dc, m*dr), searchValue, false)) {
l = m;
} else {
h = m;
}
}
if (l == -1) return Value::errorNA();
return Value(l+1);
}
}
//
// Function: MULTIPLE.OPERATIONS
//
Value func_multiple_operations(valVector args, ValueCalc *, FuncExtra *e)
{
if (args.count() != 3 && args.count() != 5)
return Value::errorVALUE(); // invalid number of parameters
for (int i = 0; i < args.count(); i++) {
if (e->ranges[i].col1 == -1 || e->ranges[i].row1 == -1)
return Value::errorVALUE();
}
CellStorage *s = e->sheet->cellStorage();
// get formula to evaluate
int formulaCol = e->ranges[0].col1;
int formulaRow = e->ranges[0].row1;
Formula formula = s->formula(formulaCol, formulaRow);
if (!formula.isValid())
return Value::errorVALUE();
CellIndirection cellIndirections;
cellIndirections.insert(Cell(e->sheet, e->ranges[1].col1, e->ranges[1].row1), Cell(e->sheet, e->ranges[2].col1, e->ranges[2].row1));
if (args.count() > 3) {
cellIndirections.insert(Cell(e->sheet, e->ranges[3].col1, e->ranges[3].row1), Cell(e->sheet, e->ranges[4].col1, e->ranges[4].row1));
}
return formula.eval(cellIndirections);
}
//
// Function: OFFSET
//
Value func_offset(valVector args, ValueCalc *calc, FuncExtra *e)
{
const int rowPlus = calc->conv()->asInteger(args[1]).asInteger();
const int colPlus = calc->conv()->asInteger(args[2]).asInteger();
//const int rowNew = args.count() >= 4 ? calc->conv()->asInteger(args[3]).asInteger() : -1;
//const int colNew = args.count() >= 5 ? calc->conv()->asInteger(args[4]).asInteger() : -1;
//if (colNew == 0 || rowNew == 0) return Value::errorVALUE();
// Doesn't take references to other sheets into account
//const QRect rect(e->ranges[0].col1, e->ranges[0].row1, e->ranges[0].col2, e->ranges[0].row2);
//const Calligra::Sheets::Region region(rect, e->sheet);
if (e->regions.isEmpty())
return Value::errorVALUE();
const Calligra::Sheets::Region ®ion = e->regions[0];
if (!region.isValid() /* || !region.isSingular() */)
return Value::errorVALUE();
QPoint p = region.firstRange().topLeft() + QPoint(colPlus, rowPlus);
const Cell cell(region.firstSheet(), p);
if (!cell.isNull())
return cell.value();
return Value::errorVALUE();
}
//
// Function: ROW
//
Value func_row(valVector args, ValueCalc *, FuncExtra *e)
{
int row = e ? e->myrow : 0;
if (e && args.count())
row = e->ranges[0].row1;
if (row > 0)
return Value(row);
return Value::errorVALUE();
}
//
// Function: ROWS
//
Value func_rows(valVector, ValueCalc *, FuncExtra *e)
{
int row1 = e->ranges[0].row1;
int row2 = e->ranges[0].row2;
if ((row1 == -1) || (row2 == -1))
return Value::errorVALUE();
return Value(row2 - row1 + 1);
}
//
// Function: SHEET
//
Value func_sheet(valVector args, ValueCalc *, FuncExtra *e)
{
Sheet *sheet = e->sheet;
if (!e->regions.isEmpty()) {
const Calligra::Sheets::Region ®ion = e->regions[0];
if (region.isValid())
sheet = region.firstSheet();
}
return Value(sheet->map()->indexOf(sheet) + 1);
}
//
// Function: SHEETS
//
Value func_sheets(valVector args, ValueCalc *, FuncExtra *e)
{
if (!e->regions.isEmpty()) {
const Calligra::Sheets::Region ®ion = e->regions[0];
if (region.isValid()) {
QList<Calligra::Sheets::Sheet*> sheets;
Calligra::Sheets::Region::ConstIterator it(region.constBegin()), end(region.constEnd());
for(; it != end; ++it)
if (!sheets.contains((*it)->sheet()))
sheets.append((*it)->sheet());
return Value(sheets.count());
}
}
return Value(e->sheet->map()->count());
}
//
// Function: VLOOKUP
//
Value func_vlookup(valVector args, ValueCalc *calc, FuncExtra *)
{
const Value key = args[0];
const Value data = args[1];
const int col = calc->conv()->asInteger(args[2]).asInteger();
const int cols = data.columns();
const int rows = data.rows();
if (col < 1 || col > cols)
return Value::errorVALUE();
const bool rangeLookup = (args.count() > 3) ? calc->conv()->asBoolean(args[3]).asBoolean() : true;
// now traverse the array and perform comparison
Value r;
Value v = Value::errorNA();
for (int row = 0; row < rows; ++row) {
// search in the first column
const Value le = data.element(0, row);
if (calc->naturalEqual(key, le)) {
return data.element(col - 1, row);
}
// optionally look for the next largest value that is less than key
if (rangeLookup && calc->naturalLower(le, key) && calc->naturalLower(r, le)) {
r = le;
v = data.element(col - 1, row);
}
}
return v;
}
#include "ReferenceModule.moc"
|