03efde6cab
git-svn-id: https://svn.code.sf.net/p/lazarus-ccr/svn@3943 8e941d3f-bd1b-0410-a28a-d453659cc2b4
58 lines
1.4 KiB
ObjectPascal
58 lines
1.4 KiB
ObjectPascal
{ This demo is a test for recursive calculation of cells. The cell formulas
|
|
are constructed such that the first cell depends on the second, and the second
|
|
cell depends on the third one. Only the third cell contains a number.
|
|
Therefore calculation has to be done recursively until the independent third
|
|
cell is found. }
|
|
|
|
program demo_recursive_calc;
|
|
|
|
{$mode objfpc}{$H+}
|
|
|
|
uses
|
|
{$IFDEF UNIX}
|
|
{$IFDEF UseCThreads}
|
|
cthreads,
|
|
{$ENDIF}
|
|
{$ENDIF}
|
|
Classes, Math,
|
|
fpstypes, fpspreadsheet, fpsfunc, xlsbiff8;
|
|
|
|
var
|
|
workbook: TsWorkbook;
|
|
worksheet: TsWorksheet;
|
|
const
|
|
OutputFile='test_recursive.xls';
|
|
|
|
begin
|
|
writeln('Starting program.');
|
|
workbook := TsWorkbook.Create;
|
|
try
|
|
workbook.Options := workbook.Options + [boCalcBeforeSaving];
|
|
|
|
worksheet := workbook.AddWorksheet('Calc_test');
|
|
worksheet.WriteColWidth(0, 20);
|
|
|
|
// A1
|
|
worksheet.WriteUTF8Text(0, 0, '=B2+1');
|
|
// B1
|
|
worksheet.WriteFormula(0, 1, 'B2+1');
|
|
// A2
|
|
worksheet.WriteUTF8Text(1, 0, '=B3+1');
|
|
// B2
|
|
worksheet.WriteFormula(1, 1, 'B3+1');
|
|
// A3
|
|
worksheet.WriteUTF8Text(2, 0, '(not dependent)');
|
|
// B3
|
|
worksheet.WriteNumber(2, 1, 1);
|
|
|
|
workbook.WriteToFile(OutputFile, sfExcel8, true);
|
|
writeln('Finished.');
|
|
writeln;
|
|
writeln('Please open "'+OutputFile+'" in "fpsgrid".');
|
|
writeLn('It should show calculation results in cells B1 and B2.');
|
|
finally
|
|
workbook.Free;
|
|
end;
|
|
end.
|
|
|