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
|
/* This file is part of the KDE project
Copyright (C) 2003,2004 Ariya Hidayat <ariya@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; either
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.
*/
#include "formula.h"
#include "functions.h"
#include "valuecalc.h"
#include <tqdict.h>
#include <tqdom.h>
#include <tqfile.h>
#include <tqvaluevector.h>
#include <kdebug.h>
#include <tdelocale.h>
#include <kstandarddirs.h>
#include <kstaticdeleter.h>
#include "kspread_factory.h"
namespace KSpread
{
class Function::Private
{
public:
TQString name;
FunctionPtr ptr;
int paramMin, paramMax;
bool acceptArray;
bool ne; // need FunctionExtra* when called ?
};
class FunctionRepository::Private
{
public:
TQDict<Function> functions;
TQDict<FunctionDescription> funcs;
};
} // namespace KSpread
using namespace KSpread;
Function::Function( const TQString& name, FunctionPtr ptr )
{
d = new Private;
d->name = name;
d->ptr = ptr;
d->acceptArray = false;
d->paramMin = 1;
d->paramMax = 1;
d->ne = false;
}
Function::~Function()
{
delete d;
}
TQString Function::name() const
{
return d->name;
}
void Function::setParamCount (int min, int max)
{
d->paramMin = min;
d->paramMax = (max == 0) ? min : max;
}
bool Function::paramCountOkay (int count)
{
// less than needed
if (count < d->paramMin) return false;
// no upper limit
if (d->paramMax == -1) return true;
// more than needed
if (count > d->paramMax) return false;
// okay otherwise
return true;
}
void Function::setAcceptArray (bool accept) {
d->acceptArray = accept;
}
bool Function::needsExtra () {
return d->ne;
}
void Function::setNeedsExtra (bool extra) {
d->ne = extra;
}
Value Function::exec (valVector args, ValueCalc *calc, FuncExtra *extra)
{
// check number of parameters
if (!paramCountOkay (args.count()))
return Value::errorVALUE();
// do we need to perform array expansion ?
bool mustExpandArray = false;
if (!d->acceptArray)
for (unsigned int i = 0; i < args.count(); ++i) {
if (args[i].isArray())
mustExpandArray = true;
}
if( !d->ptr ) return Value::errorVALUE();
// perform the actual array expansion if need be
if (mustExpandArray) {
// compute number of rows/cols of the result
int rows = 0;
int cols = 0;
for (unsigned int i = 0; i < args.count(); ++i) {
int x = (args[i].type() == Value::Array) ? args[i].rows() : 1;
if (x > rows) rows = x;
x = (args[i].type() == Value::Array) ? args[i].columns() : 1;
if (x > cols) cols = x;
}
// allocate the resulting array
Value res (cols, rows);
// perform the actual computation for each element of the array
for (int row = 0; row < rows; ++row)
for (int col = 0; col < cols; ++col) {
// fill in the parameter vector
valVector vals (args.count());
for (unsigned int i = 0; i < args.count(); ++i) {
int r = args[i].rows();
int c = args[i].columns();
vals[i] = args[i].isArray() ?
args[i].element (col % c, row % r): args[i];
}
// execute the function on each element
res.setElement (col, row, exec (vals, calc, extra));
}
return res;
}
else
// call the function
return (*d->ptr) (args, calc, extra);
}
// these are defined in kspread_function_*.cpp
void RegisterConversionFunctions();
void RegisterDatabaseFunctions();
void RegisterDateTimeFunctions();
void RegisterEngineeringFunctions();
void RegisterFinancialFunctions();
void RegisterInformationFunctions();
void RegisterLogicFunctions();
void RegisterMathFunctions();
void RegisterReferenceFunctions();
void RegisterStatisticalFunctions();
void RegisterTextFunctions();
void RegisterTrigFunctions();
static KStaticDeleter<FunctionRepository> fr_sd;
FunctionRepository* FunctionRepository::s_self = 0;
FunctionRepository* FunctionRepository::self()
{
if( !s_self )
{
kdDebug() << "Creating function repository" << endl;
fr_sd.setObject( s_self, new FunctionRepository() );
kdDebug() << "Registering functions" << endl;
// register all existing functions
RegisterConversionFunctions();
RegisterDatabaseFunctions();
RegisterDateTimeFunctions();
RegisterEngineeringFunctions();
RegisterFinancialFunctions();
RegisterInformationFunctions();
RegisterLogicFunctions();
RegisterMathFunctions();
RegisterReferenceFunctions();
RegisterStatisticalFunctions();
RegisterTextFunctions();
RegisterTrigFunctions();
kdDebug() << "Functions registered, loading descriptions" << endl;
// find all XML description files
TQStringList files = Factory::global()->dirs()->findAllResources
("extensions", "*.xml", TRUE);
// load desc/help from XML file
for( TQStringList::Iterator it = files.begin(); it != files.end(); ++it )
s_self->loadFile (*it);
kdDebug() << "All ok, repository ready" << endl;
}
return s_self;
}
FunctionRepository::FunctionRepository()
{
d = new Private;
d->functions.setAutoDelete( true );
d->funcs.setAutoDelete( true );
}
FunctionRepository::~FunctionRepository()
{
delete d;
s_self = 0;
}
void FunctionRepository::add( Function* function )
{
if( !function ) return;
d->functions.insert( function->name().upper(), function );
}
Function *FunctionRepository::function (const TQString& name)
{
return d->functions.find (name.upper());
}
FunctionDescription *FunctionRepository::functionInfo (const TQString& name)
{
return d->funcs.find (name.upper());
}
// returns names of function in certain group
TQStringList FunctionRepository::functionNames( const TQString& group )
{
TQStringList lst;
TQDictIterator<FunctionDescription> it (d->funcs);
for(; it.current(); ++it) {
if (group.isNull() || (it.current()->group() == group))
lst.append (it.current()->name());
}
lst.sort();
return lst;
}
void FunctionRepository::loadFile (const TQString& filename)
{
TQFile file (filename);
if (!file.open (IO_ReadOnly))
return;
TQDomDocument doc;
doc.setContent( &file );
file.close();
TQString group = "";
TQDomNode n = doc.documentElement().firstChild();
for (; !n.isNull(); n = n.nextSibling())
{
if (!n.isElement())
continue;
TQDomElement e = n.toElement();
if (e.tagName() == "Group")
{
group = i18n (e.namedItem ("GroupName").toElement().text().utf8());
m_groups.append( group );
m_groups.sort();
TQDomNode n2 = e.firstChild();
for (; !n2.isNull(); n2 = n2.nextSibling())
{
if (!n2.isElement())
continue;
TQDomElement e2 = n2.toElement();
if (e2.tagName() == "Function")
{
FunctionDescription* desc = new FunctionDescription( e2 );
desc->setGroup (group);
if (d->functions.find (desc->name()))
d->funcs.insert (desc->name(), desc);
}
}
group = "";
}
}
}
// ------------------------------------------------------------
static ParameterType toType( const TQString& type )
{
if ( type == "Boolean" )
return KSpread_Boolean;
if ( type == "Int" )
return KSpread_Int;
if ( type == "String" )
return KSpread_String;
if ( type == "Any" )
return KSpread_Any;
return KSpread_Float;
}
static TQString toString (ParameterType type, bool range = FALSE)
{
if ( !range )
{
switch(type) {
case KSpread_String:
return i18n("Text");
case KSpread_Int:
return i18n("Whole number (like 1, 132, 2344)");
case KSpread_Boolean:
return i18n("A truth value (TRUE or FALSE)" );
case KSpread_Float:
return i18n("A floating point value (like 1.3, 0.343, 253 )" );
case KSpread_Any:
return i18n("Any kind of value");
}
}
else
{
switch(type) {
case KSpread_String:
return i18n("A range of strings");
case KSpread_Int:
return i18n("A range of whole numbers (like 1, 132, 2344)");
case KSpread_Boolean:
return i18n("A range of truth values (TRUE or FALSE)" );
case KSpread_Float:
return i18n("A range of floating point values (like 1.3, 0.343, 253 )" );
case KSpread_Any:
return i18n("A range of any kind of values");
}
}
return TQString();
}
FunctionParameter::FunctionParameter()
{
m_type = KSpread_Float;
m_range = FALSE;
}
FunctionParameter::FunctionParameter (const FunctionParameter& param)
{
m_help = param.m_help;
m_type = param.m_type;
m_range = param.m_range;
}
FunctionParameter::FunctionParameter (const TQDomElement& element)
{
m_type = KSpread_Float;
m_range = FALSE;
TQDomNode n = element.firstChild();
for( ; !n.isNull(); n = n.nextSibling() )
if ( n.isElement() )
{
TQDomElement e = n.toElement();
if ( e.tagName() == "Comment" )
m_help = i18n( e.text().utf8() );
else if ( e.tagName() == "Type" )
{
m_type = toType( e.text() );
if ( e.hasAttribute( "range" ))
{
if (e.attribute("range").lower() == "true")
m_range = TRUE;
}
}
}
}
FunctionDescription::FunctionDescription()
{
m_type = KSpread_Float;
}
FunctionDescription::FunctionDescription (const TQDomElement& element)
{
TQDomNode n = element.firstChild();
for( ; !n.isNull(); n = n.nextSibling() )
{
if (!n.isElement())
continue;
TQDomElement e = n.toElement();
if ( e.tagName() == "Name" )
m_name = e.text();
else if ( e.tagName() == "Type" )
m_type = toType( e.text() );
else if ( e.tagName() == "Parameter" )
m_params.append (FunctionParameter (e));
else if ( e.tagName() == "Help" )
{
TQDomNode n2 = e.firstChild();
for( ; !n2.isNull(); n2 = n2.nextSibling() )
{
if (!n2.isElement())
continue;
TQDomElement e2 = n2.toElement();
if ( e2.tagName() == "Text" )
m_help.append ( i18n( e2.text().utf8() ) );
else if ( e2.tagName() == "Syntax" )
m_syntax.append( i18n( e2.text().utf8() ) );
else if ( e2.tagName() == "Example" )
m_examples.append( i18n( e2.text().utf8() ) );
else if ( e2.tagName() == "Related" )
m_related.append( i18n( e2.text().utf8() ) );
}
}
}
}
FunctionDescription::FunctionDescription( const FunctionDescription& desc )
{
m_examples = desc.m_examples;
m_related = desc.m_related;
m_syntax = desc.m_syntax;
m_help = desc.m_help;
m_name = desc.m_name;
m_type = desc.m_type;
}
TQString FunctionDescription::toTQML() const
{
TQString text( "<qt><h1>" );
text += name();
text += "</h1>";
if( !m_help.isEmpty() )
{
text += i18n("<p>");
TQStringList::ConstIterator it = m_help.begin();
for( ; it != m_help.end(); ++it )
{
text += *it;
text += "<p>";
}
text += "</p>";
}
text += i18n("<p><b>Return type: </b>");
text += toString( type() );
text += "</p>";
if ( !m_syntax.isEmpty() )
{
text += i18n("<h2>Syntax</h2><ul>");
TQStringList::ConstIterator it = m_syntax.begin();
for( ; it != m_syntax.end(); ++it )
{
text += "<li>";
text += *it;
}
text += "</ul>";
}
if ( !m_params.isEmpty() )
{
text += i18n("<h2>Parameters</h2><ul>");
TQValueList<FunctionParameter>::ConstIterator it = m_params.begin();
for( ; it != m_params.end(); ++it )
{
text += i18n("<li><b>Comment:</b> ");
text += (*it).helpText();
text += i18n("<br><b>Type:</b> ");
text += toString( (*it).type(), (*it).hasRange() );
}
text += "</ul>";
}
if ( !m_examples.isEmpty() )
{
text += i18n("<h2>Examples</h2><ul>");
TQStringList::ConstIterator it = m_examples.begin();
for( ; it != m_examples.end(); ++it )
{
text += "<li>";
text += *it;
}
text += "</ul>";
}
if ( !m_related.isEmpty() )
{
text += i18n("<h2>Related Functions</h2><ul>");
TQStringList::ConstIterator it = m_related.begin();
for( ; it != m_related.end(); ++it )
{
text += "<li>";
text += "<a href=\"" + *it + "\">";
text += *it;
text += "</a>";
}
text += "</ul>";
}
text += "</qt>";
return text;
}
|