qmapshack-1.10.0/test/ 000755 001750 000144 00000000000 13216664442 015711 5 ustar 00oeichlerx users 000000 000000 qmapshack-1.10.0/test/unittest/ 000755 001750 000144 00000000000 13216664442 017570 5 ustar 00oeichlerx users 000000 000000 qmapshack-1.10.0/test/unittest/CKnownExtension.cpp 000644 001750 000144 00000007362 13023451227 023367 0 ustar 00oeichlerx users 000000 000000 /**********************************************************************************************
Copyright (C) 2016 Christian Eichler code@christian-eichler.de
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see .
**********************************************************************************************/
#include "TestHelper.h"
#include "test_QMapShack.h"
#include "gis/gpx/CGpxProject.h"
#include "gis/trk/CGisItemTrk.h"
#include "gis/trk/CKnownExtension.h"
static QStringList GarminTPX1Exts = {"atemp", "wtemp", "depth", "hr", "cad"};
void test_QMapShack::readExtGarminTPX1(const QString &file, const QString &ns)
{
CGpxProject *proj = dynamic_cast(readProjFile(file));
VERIFY_EQUAL(1, proj->childCount());
for(int i = 0; i < proj->childCount(); i++)
{
IGisItem *item = dynamic_cast(proj->child(i));
CGisItemTrk *itemTrk = dynamic_cast(item);
if(nullptr != itemTrk)
{
const CTrackData &trk = itemTrk->getTrackData();
// filter all internal extensions (starting with ::ql:)
QStringList extensions = itemTrk->getExistingDataSources().filter(QRegExp("^((?!::ql:).)*$"));
VERIFY_EQUAL(GarminTPX1Exts.size(), extensions.size());
for(const QString &exp : GarminTPX1Exts)
{
const QString &fullExp = ns + ":TrackPointExtension|" + ns + ":" + exp;
SUBVERIFY(extensions.contains(fullExp), "Missing extension " + fullExp)
}
const fTrkPtGetVal &getAtemp = CKnownExtension::get(ns + ":TrackPointExtension|" + ns + ":atemp").valueFunc;
const fTrkPtGetVal &getWtemp = CKnownExtension::get(ns + ":TrackPointExtension|" + ns + ":wtemp").valueFunc;
const fTrkPtGetVal &getDepth = CKnownExtension::get(ns + ":TrackPointExtension|" + ns + ":depth").valueFunc;
const fTrkPtGetVal &getHR = CKnownExtension::get(ns + ":TrackPointExtension|" + ns + ":hr").valueFunc;
const fTrkPtGetVal &getCad = CKnownExtension::get(ns + ":TrackPointExtension|" + ns + ":cad").valueFunc;
int i = 0;
for(const trkpt_t &trkpt : trk)
{
SUBVERIFY((0. != trkpt.lat) || (0. != trkpt.lon), "Trackpoint has position 0/0");
for(const QString &ext : trkpt.extensions.keys())
{
VERIFY_EQUAL(true, CKnownExtension::isKnown(ext));
}
// try to read values from the file, they start at a specific value and are incremented from trkpt to trkpt
VERIFY_EQUAL( 20 + i, getAtemp(trkpt));
VERIFY_EQUAL( 10 + i, getWtemp(trkpt));
VERIFY_EQUAL(100 + i, getDepth(trkpt));
VERIFY_EQUAL( 90 + i, getHR(trkpt));
VERIFY_EQUAL( 60 + i, getCad(trkpt));
++i;
}
}
}
delete proj;
}
void test_QMapShack::_readExtGarminTPX1_tp1()
{
readExtGarminTPX1(testInput + "gpx/gpx_ext_GarminTPX1_tp1.gpx", "tp1");
}
void test_QMapShack::_readExtGarminTPX1_gpxtpx()
{
readExtGarminTPX1(testInput + "gpx/gpx_ext_GarminTPX1_gpxtpx.gpx", "gpxtpx");
}
qmapshack-1.10.0/test/unittest/CGisItemTrk.cpp 000644 001750 000144 00000003624 12727447634 022436 0 ustar 00oeichlerx users 000000 000000 /**********************************************************************************************
Copyright (C) 2016 Christian Eichler code@christian-eichler.de
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see .
**********************************************************************************************/
#include "TestHelper.h"
#include "test_QMapShack.h"
#include "gis/gpx/CGpxProject.h"
#include "gis/trk/CGisItemTrk.h"
#include
void test_QMapShack::_filterDeleteExtension()
{
for(const QString &file : inputFiles)
{
IGisProject *proj = readProjFile(file);
expectedGisProject exp = TestHelper::readExpProj(fileToPath(file) + ".xml");
exp.changed = true; // filtering changes a project
for(int i = 0; i < proj->childCount(); i++)
{
CGisItemTrk *trk = dynamic_cast(proj->child(i));
if(nullptr != trk)
{
expectedTrack &expTrk = exp.trks[trk->getName()];
while(!expTrk.extensions.empty())
{
expectedExtension expExt = expTrk.extensions.take(expTrk.extensions.keys().first());
trk->filterDeleteExtension(expExt.name);
verify(exp, *proj);
}
}
}
delete proj;
}
}
qmapshack-1.10.0/test/unittest/CFitProject.cpp 000644 001750 000144 00000002357 12727447634 022467 0 ustar 00oeichlerx users 000000 000000 /**********************************************************************************************
Copyright (C) 2016 Christian Eichler code@christian-eichler.de
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see .
**********************************************************************************************/
#include
#include "TestHelper.h"
#include "test_QMapShack.h"
#include "gis/prj/IGisProject.h"
#include "gis/fit/CFitProject.h"
void test_QMapShack::_readValidFitFiles()
{
delete readProjFile("2015-05-07-22-03-17.fit");
delete readProjFile("Warisouderghem_course.fit");
delete readProjFile("2016-03-12_15-16-50_4_20.fit");
}
qmapshack-1.10.0/test/unittest/TestHelper.h 000644 001750 000144 00000004561 12727447634 022036 0 ustar 00oeichlerx users 000000 000000 /**********************************************************************************************
Copyright (C) 2015-2016 Christian Eichler code@christian-eichler.de
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see .
**********************************************************************************************/
#ifndef TESTHELPER_H
#define TESTHELPER_H
#include
#define SUBVERIFY(EXPR, MSG) { \
if(!(EXPR)) { \
throw QString("Verification of `%1` failed: %2 (%3:%4)").arg(#EXPR).arg(MSG).arg(__FILE__).arg(__LINE__); \
} \
}
#define VERIFY_EQUAL(EXP, ACT) \
SUBVERIFY( (EXP == ACT), QTest::toString(QString("Expected `%1`, got `%2`").arg(EXP).arg(ACT)) );
struct expectedWaypoint
{
QString name;
};
struct expectedExtension
{
QString name; //< the name as used in the file
bool known; //< if true, the value has to be known (e.g. CKnownExtension::isKnown() returns true)
bool everyPoint; //< if true, the value has to be set for every single trkpt
bool derived; //< if true, the value is derived by QMS
};
struct expectedTrack
{
QString name;
int colorIdx;
int segCount;
int ptCount;
QHash extensions;
};
struct expectedRoute
{
QString name;
int ptCount;
};
struct expectedArea
{
QString name;
int colorIdx;
int ptCount;
};
struct expectedGisProject
{
QString name;
QString desc;
bool changed;
QHash wpts;
QHash trks;
QHash rtes;
QHash ovls;
};
class TestHelper
{
public:
static QString getTempFileName(const QString &ext);
static expectedGisProject readExpProj(const QString &file);
};
#endif // TESTHELPER_H
qmapshack-1.10.0/test/unittest/CGpxProject.cpp 000644 001750 000144 00000003226 13015033052 022447 0 ustar 00oeichlerx users 000000 000000 /**********************************************************************************************
Copyright (C) 2015 Christian Eichler code@christian-eichler.de
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see .
**********************************************************************************************/
#include "TestHelper.h"
#include "test_QMapShack.h"
#include "gis/gpx/CGpxProject.h"
void test_QMapShack::writeReadGpxFile(const QString &file)
{
IGisProject *proj = readProjFile(file);
QString tmpFile = TestHelper::getTempFileName("gpx");
CGpxProject::saveAs(tmpFile, *proj, false);
delete proj;
proj = readProjFile(tmpFile, true, false);
verify(file, *proj);
delete proj;
QFile(tmpFile).remove();
}
void test_QMapShack::_writeReadGpxFile()
{
writeReadGpxFile("qtt_gpx_file0.gpx");
writeReadGpxFile("gpx_ext_GarminTPX1_gpxtpx.gpx");
writeReadGpxFile("gpx_ext_GarminTPX1_tp1.gpx");
writeReadGpxFile("gpx_ext_GarminTPX1_cns.gpx");
writeReadGpxFile("V1.6.0_file1.qms");
writeReadGpxFile("V1.6.0_file2.qms");
}
qmapshack-1.10.0/test/unittest/input/ 000755 001750 000144 00000000000 13216664442 020727 5 ustar 00oeichlerx users 000000 000000 qmapshack-1.10.0/test/unittest/input/qms/ 000755 001750 000144 00000000000 13216664442 021527 5 ustar 00oeichlerx users 000000 000000 qmapshack-1.10.0/test/unittest/input/qms/V1.6.0_file1.qms.xml 000644 001750 000144 00000001472 12727447634 024734 0 ustar 00oeichlerx users 000000 000000 1.6.0 Test1
qmapshack-1.10.0/test/unittest/input/qms/V1.6.0_file2.qms 000644 001750 000144 00000014030 12727447634 024130 0 ustar 00oeichlerx users 000000 000000 QMProj b / h o m e / c h r i s / g p s _ t r a c k s / m i g r a t e D B / V 1 . 6 . 0 _ f i l e 2 . q m s 1 . 6 . 0 T e s t 2 l% { @ a 6 7 7 6 0 5 f c 1 a 0 2 8 4 d e 3 0 d 9 a 8 d a d 6 d c a 5 0 l% 0 : / / i c o n s / 4 8 x 4 8 / S t a r t . p n g I n i t i a l v e r s i o n . Q M a p S h a c k l% 6 : / / i c o n s / 4 8 x 4 8 / E d i t T e x t . p n g C h a n g e d n a m e Q M a p S h a c k l% 0 6 : / / i c o n s / 4 8 x 4 8 / E d i t T e x t . p n g C h a n g e d n a m e | QMTrk m A
xڽyT I$FEIC=("*)RQPWQՇ h`qAAA uAM o售-=2moj
eW2R >,N
eld dl\ [W&}20ЛCqs PiwPx9";?ӴRŊ$O 5ިxA:x^S\2Z 7eH=IN ƥ6dxKUo9gokqjڵ7'!*!M]0P-
<^( B>
>,@[rdvpl^xHT\JJV*9~yO| /ߝTɾ7J/Ժx(Au(|P@/|F^n? eMuf!c)Dyǀʠq3]`L*eEʓV<̬Rv~8T&FPnFlH*Q*-C|۬z
:ER&J/]~2p>
m!@QJ{O1p&wԹ[j1DR}5鸔Sد)|d'E|+\j2Z J-p\MNA\ܺ) ,jOW;j T(ޗ|B!JEZ7
ƣ% ~Tp:VԑD@ã)@ :xj1Pgf]~Tf8.q)ݛFR/ uҽl.u7ugW=Fy1E@ ]rExL}<4! 5W!l5!KP
ԋ Vt*=
nmSĶw\c .555PSZE6-Bܺw
.c6dUR76Me 5I|
Qu*P- )b"zO3`%suf`f}4@ 3 5 b 9 e 9 c b 3 b 0 d 0 c 4 f 9 b e 5 a 2 3 b 7 1 9 5 4 0 1 2 Q M a p S h a c k @ 3 5 b 9 e 9 c b 3 b 0 d 0 c 4 f 9 b e 5 a 2 3 b 7 1 9 5 4 0 1 2 l% T0 : / / i c o n s / 4 8 x 4 8 / S t a r t . p n g I n i t i a l v e r s i o n . QMRte xs```Hf0d0aHd0 Җ@2!!
-%'jMb @ (^ 0 H3Aj0HvrIq .A@Z 9-9@#H50c{[?PP5$8?<(\/3/89 U/(};).!%YޟJF+ږmYOһ h[l>;`V36h M6qon׆$ Z Kxo-/'WbuSN>ϟZ0 }ʰ;֯(XsHyMQK'2\(|K΄s~w+/{o& X\P^E?WJ Wm tClM ۺ=6.=~8QP{Ҕ}~Ye5ڽ9k״iZRUѫ
噚6c`}IV^WeXTՐ5,o bK!C :V>wkΓr-~0E=VWtCAãguFֱ-ųqцS3%e4f(Aߗœl;A^S}۶,[S8fVe~3n^sYd;KӁ^|yӻ=>Tͻ8<[.IH9Iˈ ŚWj`1oޜ\Syh[a*.M?Y:->?z+he *BcNcTP*[u3;B}br|cߺ ֪
ǦE{2U1_Iɵ_m-,Y%$G>VV;KluyڦK??d@]´ee\$PAaJ
y
m//55a_@ǭ ^ 韽(6C C [~.7/^ݭ?c82 ;aߺ![lRr w2*#]H pc6^Ԏ&` oG'mnځNyvu1ĭoOzYl t.>߾?df=~r'"Oi IS/;Qq %(YS(tOѳw|vm_nP玎T3O|&}X27#q'곎znMf6-/gmlh6pKdZyEG^Vsҷ7m{*t 7N^>&1[5M6F 4ij꤮[f?}XL8ۿwOL3I+Rr
ɓ~lMgq(m{yݳ4s-2LN =S]fz0L{(C 3e,9u&28i/ ]sZƜGy0:V]N0~6ߴ õ_}8 %o="O b#~٩cz%.-<1E/c(Ӝ-xbTtsYĸEfb?5_jSrz(^t c Mu0hE0ZVhE@l< &:9VhE0ZV#"`k\ojyhE0ZVȪ|anf
jV"@k .rRE@ 8 1 8 f 7 6 6 b c 3 e 1 5 f 2 1 5 9 2 b 0 b d b 6 c 5 d 2 f e a Q M a p S h a c k @ 8 1 8 f 7 6 6 b c 3 e 1 5 f 2 1 5 9 2 b 0 b d b 6 c 5 d 2 f e a l% T0 : / / i c o n s / 4 8 x 4 8 / S t a r t . p n g I n i t i a l v e r s i o n . QMWpt xs```0f0e0c0 @ڂ! (
$ R i@Y # 6 &iL*P Mub1.6.0 Test2
qmapshack-1.10.0/test/unittest/input/qms/V1.6.0_file1.qms 000644 001750 000144 00000017514 12727447634 024141 0 ustar 00oeichlerx users 000000 000000 QMProj b / h o m e / c h r i s / g p s _ t r a c k s / m i g r a t e D B / V 1 . 6 . 0 _ f i l e 1 . q m s 1 . 6 . 0 T e s t 1 l% @ 2 c a e 8 6 e 0 5 0 b 4 8 b 0 4 d f 0 b f 7 e 5 e 6 1 a 7 7 c a l%
0 : / / i c o n s / 4 8 x 4 8 / S t a r t . p n g I n i t i a l v e r s i o n . Q M a p S h a c k l% pL 6 : / / i c o n s / 4 8 x 4 8 / E d i t T e x t . p n g C h a n g e d n a m e Q M a p S h a c k l% (4 : / / i c o n s / 4 8 x 4 8 / A c t F o o t . p n g X C h a n g e d a c t i v i t y t o ' F o o t ' f o r r a n g e ( 0 . . 2 9 ) . Q M a p S h a c k l% 6 : / / i c o n s / 4 8 x 4 8 / A c t C y c l e . p n g b C h a n g e d a c t i v i t y t o ' B i c y c l e ' f o r r a n g e ( 3 0 . . 1 2 7 ) . C QMTrk 4 6xڽyXG nPq B<#r 4A`rE#!* \rC+Vm||}NwW]U
CQ.KSfa @c2!z~'Kw#X6\b3% P
|h lnj57 7 Sg Q0GKޮԟC-4% ǶMfhZ
3FR!07bX #E`雯Z2a ;95__ ׃ ݪ7P)>gU?
UvP=UR=K@P\6\={=qO`RЉPRrBLGG5q*QAP!T]CH]i v&0c@e., 5Z
<
Tzx^M՟X8 T >ueaxT`lPxԀV#k'Z?|3T Pqxތ* L¥r[I}%ќВK-]-ܫTu*{YGRb^KmmU]Hj`h7IƢ(Zh)
|(-f EXnrЫػzNK F Ce(Jᡊ
j3kAL~soX0:Pxjdh[$^[R5đ\[T2K}Q*&a_vL]5j[
ZBv[`_5W@"p{YaT_M)ڢje\Jr8^
>-Ev
vy5D)R&Rwd*J0/lZ$lYρ**mJ!Pʔ .%6N7CMktebE\**SW@]R^):ҐpQoTe% ]J5ir{JDPE":\ìP&⭸ԓ39M@䰺Jq)W$|c5˲ou'R]KKh Mp@=}@=.Y R+QoJUS
:3U䈚W[@mwef D 5U=ICMeY/q3@j깢Ik)BtR"҃b}PQw/k/UD
5(g<\T}P[n_tC='#.Uy i R5M '_54j+fɼ;ģ||&jy8<3rPT;@klx
T8=O/WĥJe^fCˠw [ G9So/@ڭD
%@h䉚{W:YmKE=ӛʹ5,bTi]z
2stA ->B>@}ew.uZ\E ^UScӱG^Zj9ھ>Pmw (57*uO0h1Xa DrD0FBfA
8ǃ6H0>Gy j=
3Bf@
%z6Q֩=X&^|{vҒ1<
S>}Ϟ:AטHor D 2\{-" 1Խޙ6=gƙXۭA1KS T<J>
o$`Dɠ1
Yzm`"*Ozb
= LV9kb g
Hď!,Qd,Yۈ _q(0it6Ʊbe r Ђ6V
] 0*fYD
ИjB`lXQO p[|0]Q-~rhL8ئlXFO3 hUAWX ;U>eS h
UN"PQ /J$ @,[:@ t@-1--82/nӴ~ړ+ я
jX8VsGXk! TΰsiwG =qC2*k?v{e捵2fpI 5w녻VZ=OPaⴠ2ӳ["* hO80z4^ 7,?!#>E>oץ i=\UTM;qyIu'^Zs'}y' !mLݕUMVrD j:ϊkg;j?skwrn7qr%bH=`*Wx}b[ڇu7 ]2O*S!m.壘t6%)iߩ 9ν:rLe-gfTV<|ٽ>5 -z*1q
ӞiyEM+oɆ[yxuWTM '+s02O`V]ҹ-fYK] ]/OpZ ][?wl`Ӌ-JRL U?e*'ޞҙ/h{o.gV;|/)`VbrR[ԚcxWy2V% ڿUF_=+th⨓&GtTZӔ5{wD\2KR WE*t]B&o>=d@(%5ĿTj A2# a m,(?fq*Ehh U߾J=UWZӴ!隩: Lnqޥ戦n Nh Eo(=Pk̮up8P%80G"uT;zWesC {b>,yi(笜oJ-iho
61q;=!~C_#^m$Τ$\cܸ^A<%ugÅs4[H3JPֽܶU9LZ3'wa~bb%Cdw&|-E'Z۪îɏZw7u\ $0CAMlIh9$ڠ~&˔vD?~܇/.QV ̽r(rxlԖAq{'32H/+^@cMgWu,vDD% $\n:*3={,
!{[rbh*fB4\O5ϊ_^9V;uضA-k;рh+i}Wp?괙=HhyKrD۶5JL)
Y$37 K}wN+Oe*jȗ Ŵ%V #0"AAO(Xybk `DF|XDu- ߚ,'!`DF|XDp/B"y1" #0"`U@ 1URbmxaDF`DaS!,S[cy
dZY/jZE@ d 6 d 6 1 5 b 6 8 b 9 6 c 9 e 9 4 c 2 1 1 f 0 5 c 5 e b c f 8 2 Q M a p S h a c k @ d 6 d 6 1 5 b 6 8 b 9 6 c 9 e 9 4 c 2 1 1 f 0 5 c 5 e b c f 8 2 l% o T0 : / / i c o n s / 4 8 x 4 8 / S t a r t . p n g I n i t i a l v e r s i o n . QMWpt xmN;@[
?h@P$6j,[Q&2ޛJ #L1UH8 $RDƛp`L=vg}y:/, Y V
|pEŞS 9tM.q@AV8;OMuQZh?T@ a 5 7 e 9 3 a 8 6 5 8 1 a 1 5 2 9 7 5 9 2 d 6 1 3 0 3 8 6 5 c 3 Q M a p S h a c k @ a 5 7 e 9 3 a 8 6 5 8 1 a 1 5 2 9 7 5 9 2 d 6 1 3 0 3 8 6 5 c 3 l% (0 : / / i c o n s / 4 8 x 4 8 / S t a r t . p n g I n i t i a l v e r s i o n . Q M a p S h a c k l% < : / / i c o n s / 4 8 x 4 8 / S e l e c t C o l o r . p n g C h a n g e d c o l o r Q M a p S h a c k l% 4 : / / i c o n s / 4 8 x 4 8 / P a t t e r n . p n g * C h a n g e d f i l l p a t t e r n . Q M a p S h a c k l% 4 : / / i c o n s / 4 8 x 4 8 / O p a c i t y . p n g C h a n g e d o p a c i t y . Q M a p S h a c k l%
4 : / / i c o n s / 4 8 x 4 8 / O p a c i t y . p n g C h a n g e d o p a c i t y . Q M a p S h a c k l% 6 : / / i c o n s / 4 8 x 4 8 / T e x t B o l d . p n g * C h a n g e d b o r d e r w i d t h . Q M a p S h a c k l% x6 : / / i c o n s / 4 8 x 4 8 / T e x t B o l d . p n g * C h a n g e d b o r d e r w i d t h . QMArea xs```HeHc0 bcS#3d md%2T -rI `F`Yfl@ Ő 54-'p( M(^U 覡 cÌ'zmHߔƘF8umЊhÍsҤ*h4AvK6YE Z=y&]>:e`/ #@P $ G"q@ d e d 5 f f f d 3 3 f 3 9 8 8 3 0 e f 3 4 c 2 f 5 2 8 b 7 d d 2 Q M a p S h a c k @ d e d 5 f f f d 3 3 f 3 9 8 8 3 0 e f 3 4 c 2 f 5 2 8 b 7 d d 2 qmapshack-1.10.0/test/unittest/input/slf/ 000755 001750 000144 00000000000 13216664442 021513 5 ustar 00oeichlerx users 000000 000000 qmapshack-1.10.0/test/unittest/input/slf/qtt_slf_file0.slf 000644 001750 000144 00006072215 12727447634 025001 0 ustar 00oeichlerx users 000000 000000
133718414AB7-C76E-6520-7FD5-D380A550FE0C5040004730004121430000000197.3949828422673005.1816674690724940020.615264465743586bike10-1420000g0049508.760000000058429.9899999999948327.8800000000031407190male30010015020025030049.54503349.70060310.66342810.55627813604720000017-9170024593.33333333333213.98888888888888928.4kmh35500000-800-52348.33333333334015.356820001411912312613012000367121155602180505-1Mon Jul 27 09:29:52 GMT+0200 2015true00000001406990140699000955460fitZone15500000000
qmapshack-1.10.0/test/unittest/input/slf/qtt_slf_file0.slf.xml 000644 001750 000144 00000002346 12727447634 025570 0 ustar 00oeichlerx users 000000 000000 qttest slf file 0QTTest .slf input file 0
qmapshack-1.10.0/test/unittest/input/gpx/ 000755 001750 000144 00000000000 13216664442 021525 5 ustar 00oeichlerx users 000000 000000 qmapshack-1.10.0/test/unittest/input/gpx/gpx_ext_GarminTPX1_gpxtpx.gpx 000644 001750 000144 00000007036 12727447634 027325 0 ustar 00oeichlerx users 000000 000000
Garmin TPX1 Test NS gpxtpxTrack52520.010.0100.0906052621.011.0101.0916152722.012.0102.0926252823.013.0103.0936352924.014.0104.0946453025.015.0105.0956553126.016.0106.0966653127.017.0107.09767
qmapshack-1.10.0/test/unittest/input/gpx/qtt_gpx_file0.gpx.xml 000644 001750 000144 00000002147 12727447634 025625 0 ustar 00oeichlerx users 000000 000000 QTTest gpx file 0QTTest gpx input file 0
qmapshack-1.10.0/test/unittest/input/gpx/gpx_ext_GarminTPX1_cns.gpx 000644 001750 000144 00000007023 12727447634 026552 0 ustar 00oeichlerx users 000000 000000
Garmin TPX1 Test NS cnsTrack52520.010.0100.0906052621.011.0101.0916152722.012.0102.0926252823.013.0103.0936352924.014.0104.0946453025.015.0105.0956553126.016.0106.0966653127.017.0107.09767
qmapshack-1.10.0/test/unittest/input/gpx/gpx_ext_GarminTPX1_tp1.gpx.xml 000644 001750 000144 00000002627 12727447634 027277 0 ustar 00oeichlerx users 000000 000000 Garmin TPX1 Test NS tp1
qmapshack-1.10.0/test/unittest/input/gpx/gpx_ext_GarminTPX1_cns.gpx.xml 000644 001750 000144 00000002627 12727447634 027356 0 ustar 00oeichlerx users 000000 000000 Garmin TPX1 Test NS cns
qmapshack-1.10.0/test/unittest/input/gpx/gpx_ext_GarminTPX1_gpxtpx.gpx.xml 000644 001750 000144 00000002720 12727447634 030117 0 ustar 00oeichlerx users 000000 000000 Garmin TPX1 Test NS gpxtpx
qmapshack-1.10.0/test/unittest/input/gpx/qtt_gpx_file0.gpx 000644 001750 000144 00000517467 12727447634 025046 0 ustar 00oeichlerx users 000000 000000
QTTest gpx file 0QTTest gpx input file 0Track9a180f190e7dcf7dbda0f2fcbf3c70783://icons/48x48/Start.png2015-11-19T18:50:31ZInitial version.://icons/48x48/EditText.png2015-11-19T18:50:55ZChanged nameDarkBlue525018.000000123526018.000000129527018.000000184528018.000000115529018.000000158530018.000000119531018.000000181531018.000000117532018.000000148532018.000000115533018.000000136533018.000000149534018.000000191534018.000000126534018.000000189535018.000000122535018.000000163535018.000000157536018.000000133536018.000000110536018.000000150536018.000000156536018.000000185536018.000000104536018.000000110536017.000000163536018.000000101536018.000000172536018.000000110536018.000000148536017.000000125536018.000000167537017.000000189537017.000000175537017.000000172537017.000000190537017.000000192537017.000000137537017.000000189538017.000000177538017.000000132539017.000000119539017.000000199539017.000000116539017.000000170539017.000000150539017.000000193539017.000000171539017.000000110539017.000000120539017.000000155539017.000000170539017.000000107539017.000000151539017.000000119539017.000000127539017.000000163539017.000000144539017.000000103539017.000000146539017.000000107539017.000000103539017.000000116540017.000000139540017.000000168540017.000000153540017.000000168540017.000000127540017.000000146540017.000000127540017.000000145540017.000000193540017.000000108540017.000000145540017.000000194540017.000000185540017.000000112540017.000000101538017.000000123538017.000000186538017.000000143538017.000000176538017.000000187538017.000000137538017.000000194538017.000000179538017.000000183538017.000000194538017.000000158538017.000000159538017.000000131538017.000000142539017.000000190539017.000000115539017.000000183539017.000000173539017.000000149539017.000000121539017.000000111538017.000000104538017.000000142538017.000000132538017.000000110538017.000000142538017.000000162538017.000000161538017.000000177538017.000000148538017.000000198538017.000000192538017.000000164538017.000000174538017.000000195538017.000000151538017.000000122538017.000000129538017.000000181538017.000000100538017.000000128533019.000000191533020.000000136533020.000000140533020.000000187533020.000000195533020.000000199533020.000000115533020.000000154533020.000000123533020.000000177533020.000000145533020.000000173533020.000000119533020.000000147533020.000000192533020.000000185533019.000000194533020.000000139533019.000000134533020.000000120533020.000000132533019.000000133533020.000000157533019.000000143533020.000000187533020.000000164533019.000000151533020.000000189533019.000000183533020.000000163533020.000000147533019.000000142533019.000000100533019.000000160533019.000000192533019.000000134533019.000000125533019.000000141533019.000000124533019.000000197533019.000000147533019.000000168533019.000000180533019.000000185533019.000000127533019.000000160533019.000000170533019.000000113533019.000000175533019.000000137533019.000000115533019.000000164533019.000000163533019.000000156533019.000000120533019.000000195533019.000000190533019.000000142533019.000000164533019.000000194533019.000000175533019.000000176533019.000000104533019.000000196533019.000000132533019.000000173533019.000000160533019.000000156533019.000000155533019.000000170533019.000000125533019.000000148533019.000000125533019.000000171533019.000000144533019.000000164533019.000000112533019.000000104533019.000000190533019.000000184533019.000000124533019.000000159533019.000000179533019.000000111533019.000000145533019.000000102533019.000000146533019.000000133533019.000000197533019.000000149533019.000000139533019.000000123533019.000000186533019.000000134533019.000000176533019.000000177533019.000000138533019.000000131533019.000000166533019.000000191533019.000000132533019.000000157533019.000000155533019.000000102533019.000000170533019.000000150533019.000000135533019.000000163533019.000000123533019.000000194533019.000000107533019.000000183533019.000000121533019.000000137533019.000000101533019.000000165533019.000000121533019.000000141533019.000000136533019.000000127533019.000000169533019.000000134533019.000000128533019.000000104533019.000000180533019.000000184533019.000000180533019.000000113533019.000000186533019.000000147533019.000000103533019.000000159533019.000000129533019.000000154533019.000000103533019.000000129533019.000000101533019.000000146533019.000000110533019.000000122533019.000000127534019.000000117534019.000000102534019.000000127534019.000000186535019.000000166535019.000000178535019.000000123535019.000000125535019.000000171535019.000000105535018.000000103535019.000000153535019.000000192535019.000000115535019.000000102535018.000000137535019.000000113535019.000000191535018.000000130535018.000000161536018.000000127536018.000000119536018.000000151536018.000000108536018.000000164536018.000000166536018.000000136536018.000000187536018.000000122536018.000000185536018.000000109536018.000000103536018.000000111536018.000000194536018.000000116536018.000000153536018.000000155536018.000000120536018.000000141536018.000000183536018.000000120536018.000000148536018.000000117536018.000000152536018.000000180536018.000000185536018.000000165535018.000000149535018.000000130535018.000000143535018.000000129535018.000000177535018.000000181535018.000000140535018.000000169535018.000000124535018.000000127535018.000000156535018.000000157535018.000000104535018.000000114535018.000000137535018.000000164535018.000000182535018.000000185535018.000000112535018.000000199535018.000000165535018.000000143534018.000000167532018.000000193530018.000000165528018.000000170526018.000000174525018.000000127523018.000000119521018.000000135518018.000000137513017.000000174511017.000000188508017.000000180504017.000000110502017.000000171501017.000000199501017.000000118500017.000000170500017.000000179500017.000000143499017.000000109498017.000000146496017.000000133494017.000000155494017.000000141494017.000000151494017.000000154493017.000000165493017.000000160493017.000000177493017.000000130493017.000000186493017.000000106493017.000000148493017.000000132493017.000000152493017.000000100493017.000000118493017.000000170493017.000000151493017.000000136493017.000000101493017.000000151494017.000000181495017.000000124496017.000000154497017.000000132498017.000000113499017.000000154500017.000000124501017.000000148502017.000000176502017.000000132502017.000000190503017.000000194503017.000000109505017.000000147505017.000000112505016.000000194505017.000000180505017.000000192506017.000000192506016.000000157506016.000000101506016.000000169506016.000000162506016.000000127506016.000000198506016.000000172506016.000000199506016.000000119506016.000000155506016.000000192506016.000000167506016.000000156506016.000000136506016.000000146506016.000000118506016.000000118507016.000000136507016.000000107507016.000000186507016.000000129507016.000000139507016.000000185507016.000000118507016.000000174507016.000000116507016.000000167507016.000000122507016.000000188507016.000000149507016.000000126507016.000000157507016.000000143507016.000000149507016.000000198507016.000000130507016.000000183507016.000000184507016.000000102507016.000000173507016.000000125507016.000000161507016.000000163507016.000000115507016.000000196507016.000000121507016.000000175507016.000000108507016.000000121507016.000000176506016.000000100506016.000000148506016.000000124504016.000000157504016.000000148504016.000000143505016.000000153505016.000000100506016.000000112507016.000000107508016.000000187508016.000000180508016.000000172508016.000000130508016.000000132509016.000000101509016.000000163510016.000000191511016.000000190511016.000000162511016.000000162511016.000000182511016.000000137511016.000000130511016.000000197511016.000000153511016.000000190511016.000000136511016.000000155511016.000000173511016.000000110511016.000000117511016.000000103511016.000000133511016.000000173511016.000000159511016.000000178511016.000000153511016.000000169511016.000000137511016.000000160511016.000000148511016.000000197511016.000000124511016.000000181511016.000000124511016.000000174511016.000000173511016.000000104512016.000000187513016.000000171513016.000000174514016.000000148514016.000000173514016.000000135515016.000000199515016.000000114516016.000000110516016.000000131516016.000000107517016.000000115517016.000000137517015.000000113517016.000000113517016.000000162517016.000000187517016.000000144517015.000000193517016.000000137517016.000000190517015.000000191517016.000000104517015.000000112517016.000000199517016.000000180518016.000000152518016.000000182518015.000000115518016.000000116518015.000000180518016.000000172737731bbb1294a15d0b19b63a32faa9a01
qmapshack-1.10.0/test/unittest/input/gpx/gpx_ext_GarminTPX1_tp1.gpx 000644 001750 000144 00000006373 12727447634 026502 0 ustar 00oeichlerx users 000000 000000
Garmin TPX1 Test NS tp1Track52520.010.0100.0906052621.011.0101.0916152722.012.0102.0926252823.013.0103.0936352924.014.0104.0946453025.015.0105.0956553126.016.0106.0966653127.017.0107.09767
qmapshack-1.10.0/test/unittest/input/fit/ 000755 001750 000144 00000000000 13216664442 021511 5 ustar 00oeichlerx users 000000 000000 qmapshack-1.10.0/test/unittest/input/fit/2016-03-12_15-16-50_4_20.fit.xml 000644 001750 000144 00000002371 12727447634 025556 0 ustar 00oeichlerx users 000000 000000 2016-12-03-15-13-03
qmapshack-1.10.0/test/unittest/input/fit/Warisouderghem_course.fit 000644 001750 000144 00000112343 12727447634 026576 0 ustar 00oeichlerx users 000000 000000 tӔ .FIT @ c. A 1 B 2 Warisouderghem
^$ YK(p.c XQs $ c(AC 8
)bfghijk
!"`ac H [\]^_delm c. c.
#o,w "$%xѿ nZ ""$o,w
#% r D c. E c.
#o,w ^
c. #w _
r
c.0#w _
rc.7# v% a
rc.#v2 a
r"c.##vi@ `
r&c.)#_vG _
r*c.0#?vN ^
s1c.>#4v/\ [
r9c.L#*vi Y
r@c.
[#!vv V
rFc.e#wv$ T
sKc.p#ϫvM U
sRc.|#Iv U
sSc.g#ve V
t[c.5#v U
rbc.#v T
ric.Х#v, U
rqc.#zv V
rxc.k#ov\ Y
rc.9#dv Z
rc.#Yv [
rc.#Nv$ Y
rc.#Cv S
rc.#@v Q
tc.`#m
sc.n#up =
sc. #Oub~ <
sc.6+#u ;
sc.8#u` =
sc.E#Juߦ @
sc.bS#u^ A
sc.`#u B
sc.*n#Eu\ C
sc.{#u B
s c.#uZ @
sc.V#Au <
sc.#vuX ;
s c. #mu :
s'c.#
rc.^#P4u3 :
rc.#)6uv+ 5
rc.#7u8 4
rc.#-uE 3
rc.#-#uhR 0
rc.#u?_ -
rc.#[ul )
rc. #ux #
rc.+*#tŅ
rc.A6# t
rc.WB#tt
rc.lN#NtK
rc.bZ#t"
r c. Y#t
sc.W# t
sc.N#Lt "
r c.F#t #
r&c.=#ut $
r-c.04#2et %
r4c.F+#Tt &
r;c.x"#Ct (
rBc.G.#
rc._#&tK
rc.*n# twY
rc.|# s#g
rc.[#st
rc.# tf
rc.i# t
r c.# t
rc.w# t, rc.#tø r!c.#
t[ r(c.# t r0c.M#Cs r7c.#s5 r>c.#s rFc./#sx
rMc.z#Rs rUc.#s% r\c.#ls]3 rcc.]# Vs@ rkc.#`?sN rrc.#(sA\ rzc.?
#si rc. #+rw rc.#or% rc.!#rǒ rc.O#rh rc. #Sr rc.&#r rc.0#r] rc.9#Our rc.FC#dr rc.L#SrR rc.vV#JCr rc.
`#2r
rc.i#!rF rc.=s#Er% rc.|# r2 rc.m#q;@ rc.#@qM rc.#qZ rc.4#q0h r c.̬#;qu rc.c#qӂ rc.#q% r c.#5{qv r(c.+#jqȪ r/c.#Yq r6c.Z#0Iqk r=c.#8q rDc.#'q rLc.!#*q` rSc. #}q rZc.Q#p rac.a #pT rhc.*#npy" rpc.4#p/ rwc.N?#Kp< r~c.I#pI rc.T#)p W rc.;_#p1d rc.i#pVq rc.t#tqp{~ rc.(#bp rc.̉#QTpĘ rc.A# Fp rc.F#Ppf rc.E#,[p rc.#Np rc.#ApH rc.<#85pz rc.#(p rc.y# p rc.X# pt sc.7#o
sc.#o sc.#o7+ sc.#o6 sc.#opC s c.C#5oP sc.#Ϛo\ sc.#joWi s c.L#zou s'c.#io s.c.#:Yo> s5c.U#Ho s sJc. #3m7L sRc.g# mpY sYc.#
mf s`c.$#ls sgc.#jl snc.#QlU suc.@#8l s}c.# lǨ sc.#l sc.[#l: sc.#tls sc.
#al sc.v#Nl sc.#;l sc.3##p(lX sc.*#Wl sc.1#>l sc.8#k- sc.2#fkn: sc.,#kG sc.kDU sc. #kb sc.#kp sc.#etk} sc.#_k sc.#2KkY sc.#6kĥ s
c.#!k/ sc.# k s c.#Sk s#c.#jD s*c. #j s1c.*#Mj s8c.7#jC s@c.uD#j sGc.`Q#Gj sNc.K^#jC+ sUc.7k#j8 s]c."x#AjE
sdc.#jBS
skc.#j` src.#;jm syc.Ы#jB{ sc.#|j sc.#4sj sc.#ijA
sc.}#_j
sc.i#.Vj
sc.T#LjA
sc.?#Bj
sc.+#'9j
sc. #z/j@
sc.,# &j
sc.7#j4 rc.B#hj rc.}M# ir) rc.jX#i7 rc.Vc#iD rc.Cn#9iOR rc./y#i_ rc. #im rc.#Ui,{ r c.#
iˈ rc.#}ij rc.ͯ#rni
r"c.#&_i r)c.#OiH r0c.#@i r8c.#B1i r?c.l#!i% rGc.X#i rNc.E#^ic rUc.1#h r]c. #h rdc. # h@, rkc.f(#hy9 ssc.(4#hF szc.?#hS sc.K#i%a sc.$Y#iZn sc.f#?i{ sc.5t#iĈ sc.#~"i sc.F# )i/ sc.Μ#/id sc.V#^6i sc.߷#[#ib sc.h#]io sc.Uv#Äi| sc.#)iԉ sc.l#yi sc.؞# ti sc.#Zi sc.#i sc.#i" sc.#cik rc.#Ƹi rc.# i rc.#>i sc.x#}i7 sc.:#i sc.#is sc.#:i% sc.~ #xi2 sc.@#iL@ sc.%#iM s c.2#5i[ s%c.@#s|i&i s-c.FN#tiv s4c.\#lib si shc.S#6i soc.#.iP swc.#%'i s~c.#c i sc.Z#i* sc. $ i' sc.o $qh4 sc. $h6B sc. $UhlO sc.! $ǽh\ sc. $9hi sc.C" $hw sc.' $ hH sc.F- $ lh sc.(3 $1Wh rc.
9 $cBho rc.> $-h rc.D $h_ rc.J $h rc.P $*gN rc.vV $\g rc.7\ $ g> rc.Y $ gf
sc. W $;g sc.T $Xg$ s c.
R $vng1 s$c.~O $Xg? s+c.L $Bg,L s2c.gJ $,gTY s:c.G $g{f sAc.PE $ gs sHc.B $'fˀ sOc.N@ $ f sVc.F $sf$ s\c.K $fV scc.zQ $Zf sic.$W $ f spc.O ${f rwc. V $mgf4 rc.\ $Rf rc.Fc $G>fs rc.i $)f rc.pp $!f rc.w $ fR rc.} $e) rc./ $ie7 rc.Ċ $e0E rc.Y $CeR rc. $eo` rc. $ en rc. $pe{ rc. $[eN rc.B $dGe rc. $2e rc.l $> e- rc. $ e̿ rc. $dl rc.+ $d r c. $d rc.U $_dJ rc. $ d r!c. $d r(c. $wd r0c. $ad, r7c. $KdF: r?c. $5dG rFc. $ dtU rMc.#$ d c rUc.:$}cp r\c.Q $mc9~ rcc.h$\cЋ rkc.$Lcg rrc.$;c ryc.$+c rc. $oc, rc. )$dc/ sc.2$Yc2 sc.-<$Nc5 sc.E$Cc8 sc.UQ$;c sc.]$3c sc.h$+c sc.`t$#c sc.$ c) sc.G$ cQ4 rc.$b? rc.Ӄ$bI rc.$ bT rc.p$b_ rc.̑$bj rc.'$bv rc.s$bB rc.c$5b sc.S$kb sc.C$b: sc.2$b s c."$
b sc.$Bb2 sc.$xb s c.$b s&c. $b+ s-c.$ b s4c.
$b
r;c.i"$bT rCc.($ؽb' rJc. /$˩b4 rQc.|5$bB rXc.;$bVO r_c.4B$mb\ rfc.nH$Ybi rmc.P$dIb_v stc.#Y$8b s{c.}a$.(bm sc.i$b sc.2r$b{ sc.z$]a sc.ǂ$a sc.F$sa rc.Ɖ$a) rc.F$[ax rc.$ a rc.$pa[ sc.u$|a sc.Ҏ$Qia
sc.1$ Va sc.$rAa& sc.׀$,ac4 sc.*z$Wa B sc.s$ aO sc.{$`\ rc.$`i rc.Ћ$g`w r c.$4`9 rc.$`\ rc.$Ζ`~ rc.($` r c.>$gr`ø r#c.T$4`` r*c.i$N` r1c.$;`* r9c.$)`M r@c.$h`o rGc.$5`
rNc.$_ rUc.$_! r\c.$_. rcc.$h_< rjc./
$4_>I rqc.E$_`V ryc.Z $΅_c rc.p%$s_p rc.-$ga_} rc.5$4O_ rc.:=$ >_ rc.tB$+_B sc.G$ _w sc.L$._ sc.$R$=^ sc.^W$M^ sc.\$\^M sc.a$l^ sc.g${^ sc.'l$^ sc.u$q^? rc.$r^ rc.?$Tb^- rc.$Q^5; rc.$7A^H rc.V$0^U rc. $ ^,c r
c.$^~p rc.n$]} rc. $o]" r c.$]t r'c.$R]ƥ r/c.8$ü] r6c.$5]j r=c.$] rDc.O$] rKc.$z]` rSc.$i] rZc. $$Y] r`c./$b] sgc.Q;$Yk] smc.F$t]' stc.R$|]2 szc.9^$_]> sc.i$ ]J sc.nj$w]>X sc.k$1a]~e sc.k$J]r sc.Wl$c4] sc.l$ ]@ sc.m$] sc.t$\S rc.D|$L\$ rc.$\ rc.$\ rc.D$?\ rc.$\k rc.$\< rc.D$2u\! rc.$b\
! rc.$~P\! rc.E$%>\'! rc.$+\T4! rc.$ \%A! rc.L$R\N! sc.$\_\! s c.y$[i! s$c.$H[w! s+c. $[5! s3c.=$[Ғ! s:c.$$>[o! sAc.k1$[ ! sIc.>$[! sPc.J$5[E! sWc./W$[! s_c.c$ [! sfc.g$Vx[! smc.k$b[2! suc.o$M[ " s|c.s$Y7[" sc.w$![?'" sc.2v$~
[x3" sc.t$Z?" sc.r$zZK" sc. q$Z!X" sc.io$vZYd" sc.m$Zp" sc.l$rZ|" sc.Sj$}Z" sc.h$ jZ;" sc.@h$|SZ" sc.g$X<$ rc.'$*XI$ rc.$ XW$ rc.S$Xb$ sc. $Wn$ sc.$Wz$ sc.$W$ sc.z$Wb$ sc.E$W=$ sc.$WH$ rc.$sWS$ rc.9$]W^$ rc.$ HWi$ rc.M$U2W<$ rc.$ W$ r
c.ԧ$W$ rc.$TV% rc.W$V% r c.$VG % s&c.n$V,% s-c.$aV8% s4c.$,VE% s;c.$qVJR% sBc.$\V _% sIc.$ HVk% sPc.s$3V)y% rWc.$s V% r^c.)$- V% rec.$UA% rmc.$U% rtc.;$ZU% r{c.$UY% rc.$ͥU% rc.&$U% rc.$ }U{% sc.a$8hU% sc.$TSUK & sc.
$q>U& sc.:$)U '& sc.$U4& sc.u$TA& sc.!$TTO& sc.&$T\& sc.M,$T$j& sc.1$6Tw& sc.X7$ T& ~ sc.C$TV& | sc.N$}T& w sc.Z$pT& s sc.8f$cT~& q sc.q$VT& n s c.}$pITB& m sc.`$X' _ sLc.)$SJ' Z sSc.$SV' V sYc.$Slb' Q s_c.+$YSJn' Q sfc.
$S(z' Q slc.$ S' S ssc.$>Sk' T szc. $|xSϞ' S sc.$fS4' R sc.m$TS' Q sc.Y$7CS' L sc.E$v1Sb' D sc.N$ S' : sc.'$S' 2 sc.$
S}' ) sc.$SY' ' sc.$R4( & sc.m$sR( $ rc. $R#( ) rc.$YR,1( ( rc.$R>( ) rc.1$?R|L( ! rc. $R$Z( rc.$%Rg( rc.D#$Rtu( rc./$ R (
rc.<$~RĐ( rc.WI$|Rl( r c.V$dqR( rc.b$eR( rc.^$ORO( s"c. [$9R( s)c.eW$W#Ru( s1c.S$
R ( s8c.O$Q( s?c.?L$Q0 ) sGc.H$vQ) sNc.D$>QW&) sUc.A$Q3) s]c.b=$͇Q}A) sdc.9$qQO) skc.5$][Q\) ssc.^2$ FQ8j) syc.5$2Qu) sc.8$ Q) sc..$Q) sc.U#$Q/) sc.$P) sc.
$P) sc.E$P6) sc.$P) sc.$ӶP) sc.5$ͧP<)
sc.$ƘP) sc.$P* sc.%$zPC* sc.$ lP!* sc.˳$IZP-* sc.$HPl8* sc. $6PC* sc.,$$%P=O* sc.M$mPZ* sc.$ Pf* # sc.$Or* % r c.$O,* ( rc.O$QO* ) rc.u$OI* , r c.l$Oؤ* . r%c.Qr$Oa* 5 s,c.
x$O* ; s3c.}$vOs* ? s;c.{$aO* B sBc.3$LO* G sIc.$7O* K sQc.$"O+ M sXc.]$
O + Q s_c.$}N + T sgc.$N2,+ V smc.ί$N8+ ] ssc.$NC+ d szc. $NO+ j sc.F$N[+ l sc.\$ N[g+ l sc.
$Nr+ l sc.$N~+ n sc.e$}N+ p sc.$oN+ r sc.$aNA+ q sc.V $ TN֬+ p sc. $|HN+ u sc.$M'p, r c.)d$xM}, r%c.L]$dMJ, r,c.oV$}PMۘ, r4c.O$= s)c.d
$X-H2 F s/c.e
$ 2H '2 M s6c.%
$0'H32 R r=c.|1
$` H#@2 V rDc.=
$HL2 W rJc.H
$H)Y2 T rQc. T
$Ge2 K rXc._
$!G/r2 G r_c.6k
$QG~2 D rfc.v
$G62 ? rlc.M
$G2 ; rsc.
$ G<2 7 rzc.M
$wG2 4 sc.
$G2 0 sc.z
$gG/2 3 sc.
$kG2 5 sc.
$WUG2 5 sc.=
$>G#2 7 sc.ӑ
$G(Gt3 : sc.i
$G3 = sc.
$6F 3 ? sc.
$Fh)3 = sc.,
$&F63 ; sc.Ô
$F
D3 8 sc.Q
$F[Q3 9 sc.ܗ
$]F]3 : sc.g
$xF/j3 < sc.
$dFv3 < sc.|
$wOF3 = sc.
$:Fl3 : sc.
$2&F֛3 : s c.
$F@3 8 sc.
$+Fе3 6 rc.ݺ
$VEa3 4 rc.
$E3 . r c.
$E3 ( r%c.z
$ E3 # r,c.
$!Ei3 $ s3c.
$CE4 & s;c.
$dE4 ( sBc.9
$nEo!4 ' sIc.i
$ZE.4 $ sPc.
$FE <4 sWc.ɨ
$2EuI4 s_c.
$
EV4 $ sfc.(
$/ E$d4 0 smc.X
$PD{q4 = stc.
$D~4 H s{c.ǀ
$DƋ4 L sc.s
$D4 K sc.f
$D4 H sc.Y
$D4 G sc.M
$ D4 F sc.
P
$aD4 J rc.S
$D4 L rc.U
$#{D4 L rc.X
$eD4 H rc.[
$OD 5 G rc.^
$G:D
5 D rc.a
$$D5 F rc.d
$ D(5 G rc.g
$ C&55 L rc.m
$CB5 G sc.9t
$-CxP5 ? sc.|z
$DC!^5 9 sc.
$ZCk5 6 sc.
$qCry5 1 sc.F
$|C5 , s c.
$gCĔ5 * sc.̙
$RCm5 & sc.
$=C5 s!c.S
$(C5 s)c.
$Cg5 s0c.ٲ
$B5 s7c.
$%B5 s?c."
$ Ba5 sEc.
$B5 rKc.
$Bh 6 rRc.H
$ B6 rXc.
$*B #6 s_c.
$TBT/6 sec.D
$~vB;6 slc.
$bBG6 ssc.
$NBS6 syc.A
$:B$`6 sc.
$&'BXl6 sc.
$PBx6 sc.U
$ B6 sc.v
$A6 sc.
$A6 sc.
$GAA6 } sc.
$
Am6 a sc.
$̤A6 C sc.
$A6 % sc.;
$QA6 sc.\
$nA6 sc.} $[AD6 sc.o $ JAo7
sc. $O4A7
rc.I $ A"7
rc. $A#07
rc.#
$=@_=7
rc.
$@J7
r c.
$@W7
rc.j
$,@e7
rc.
$|@Or7
rc.E
$ˆ@7
r c.
$q@ƌ7
r#c.
$j[@7
r+c.
$E@>7
r2c.
$ 0@z7
r9c.f
$Y@7
r@c.
$@7
rGc.i
$?.7
rMc.
$?87
sRc.
$?B7
sXc.8
$?L7
s_c.*
$?u8
sfc. $ ?8
smc. $?!8
stc. " $?.8
s{c./ $?<8
sc.= $?CI8
sc.K $?lV8
sc.Y $?c8
sc.yY $?o8
sc.8Y $@;|8
sc.X $&@8
sc.X $u;@8
sc.vX $O@28
sc.=e $)Z@8
sc.r $Sd@8
sc.~ $}n@68
sc. $x@8
sc.] $Ђ@8
sc.% $@:8
sc. $$@8
sc. $N@ 9
sc.| $x@>9
sc.D $@&9
sc. $˿@39
s c. $@AA9
sc.r $ @N9
sc. $@[9
s c.6 $R@ i9
s&c.& $@5v9
s-c.3 $@i9
s4c.\A $N@9
s;c.N $@ҝ9
sBc. \ $@9
sIc.i $J@;9
sQc.v $@o9
sWc.q $@9
r^c.`k $
; Y r
c.
$o>; \ rc.
$a>(; Y rc.
$R>5; e r c.P
$D>xC; m r'c.
$5>P; r r.c.#
$&r>p^; r r6c. )
$]>k; w r=c..
$ H>gy; rDc.R4
$2>; rKc.9
$ >^; rSc.?
$>ڡ; rZc.!E
$=U; rac.`J
$ =Ѽ; ric.X
$= ; rpc.f
$=o; rwc.t
$=; r~c.
$=
; rc.#
$=]; rc.@
$= < rc.̬
$=< sc.W
$=j&< sc.
$>=I3< sc.n
$=(@< sc.
$=M< sc.
$}=Y< sc.
$<=f< sc. $=s< sc.($=< sc.&$z=c< sc.?4$:=B< sc.A$=!< sc.VO$= < sc.\$x=< sc.mj$8=< sc.w$=< sc.$=< s
c.4$=< sc.$z=$< sc.$u=Q = s c.9$p=~= s$c.$k=#= s+c.$f=/= s1c./$ b=<= s8c.$W=H= s?c.$@M=PU= sFc. $B=a= sMc. $8=n= sSc.$!.=@{= sZc.k$$#== sac.J0$a== shc.*<$=1= soc. H$=֭= svc.S$A<|= s}c._$<!= sc.j$I<H= rc.u$<o= rc.$<= rc.!$'<= rc.@$q<> rc._$< > rc.$<0#> rc.$N<W0> rc.$t<}=> rc.$f<J> rc.$+Y<W> rc.$uK<d> rc.$ ><r> rc.$wT<> rc.!$j<n> rc.$f<> rc.>$ݗ<è> rc.$<n> rc.C$<\> r c. $ <J> rc.K*$1<7> rc.7$A<%> r!c.SE$R<> r(c.R$b<? r/c.[`$s<? r6c.m$< ? r=c.c{$<*? rDc.$|<7? rKc.k$w<D? rRc.$r<Q? rYc.r$m<^? r`c.$h<pk? rgc.]$c<^x? roc.2$V<? rvc.$I<? r~c.$;<+? rc.$.<Ů? rc.$ <_? rc._$<? rc.4 $<? rc.
+$ ;,? rc.6$;? rc.B$(;_ @ rc.N$;
@ rc.aZ$0;@ rc.6f$;-)@ rc. r$7;6@ rc.}$ ;`D@ rc.$;P@ sc.$;\@ h sc.$>;"i@ O sc.$;cu@ 9 sc.$;@ - sc.$};@ # sc.$=;&@ s c.v$ ;f@ sc.$}u;{@
sc.-$j;@
s c.
$w`;@
s'c.$ V;@
s.c. $f;K@
s5c.($v;@ n
sC$';A
sPc. L$/;#&A
sWc. U$7;2A
s^c.]$ ;F?A
sec.@k$;KA
rlc.x$;XA
rsc.F$;7eA
ryc.ȓ$;qA
rc.K$;~A
rc.ή$;(A
rc.P$;ΗA
rc.$;sA
rc.H$;A
rc.
$;uA
rc.$;A
rc.$;-A
rc.S$;A rc.$;8A ! rc.>$7y;A ' rc.$e;B ) rc.$Y;B 2 rc.;$M;w B I rc.q $A;)B \ rc.($R;H6B j sc.0$b;BB j sc.!9$r;OB k sc.A$ ;h[B h sc.JD$l;2hB e sc.F$xW;tB i s
c.I$5B;ŁB q sc.JL$,;B w sc.N$;YB | s"c.Q$j;#B s)c.JT$&:B s/c.V$:B s6c.Y$:B s=c.4\$:JB sDc.e$L:(B rKc.m$:B rRc.v${:C rXc.$dt: C s^c.$l:C sdc.z$.e:2#C sjc.`$]:L.C spc.9$ V:g9C swc.$C:9FC s~c.8$1: SC sc.$T :_C sc.7$
:lC sc.$9yC sc.5$9VC sc.$n9(C sc.4$59C sc.$9̬C sc.3$9C sc.$ 9qC sc. $9C sc.$49\C sc.'$Θ9C sc.04$h9GC sc.SA$9D sc. M$R9XD rc.X$9 D rc.}d$9*D rc.5p$Iu9-7D rc.{$j9CD rc.$_9ePD rc._$@U9]D rc.$J9iD r c.Ъ$?9:vD r#c.$859ւD r*c.B$*9rD r1c.$ 9D r8c.U$9tD r?c.$8ڶD rFc.[$8@D rNc.$8D rUc.a$8 D r\c.$8rD rcc.f$Ũ8D rkc.$8>E rrc.l#$8E ryc.,$u8
"E rc.r6$d8p/E rc.?$ T8H r1c.1;$ l4LH r8c.@$yV4ZH r?c.D$@4zgH rFc.I$k+4tH rNc.{N$4iH rUc.NS$] 4H r\c. X$3WH rdc.\$O3ΪH rkc.a$ȿ3FH rrc.f$A3H rzc.jk$34H rc.=p$33H rc.u$i3#H rc.y$%T3H rc.~$>3 I rc.P$)3I rc.$3\#I sc.$300I sc.ޛ$2=I sc.$2II sc.=$2VI sc.l$ 2cI sc.$2UpI sc.$2*}I sc.$2I sc.*${2ҖI sc.&$ j2I sc.$P]2eI sc.$P2#I sc.K$C2I sc.$A72I s
c.
$*2_I sc.Y$ 2 I sc.$$
2I s c. $|1iJ s$c. $:1
J s*c."$1J s0c.D%$ 1\$J s7c.X!$1@1J s>c.l $1%>J sEc.$1
KJ sLc.$ j1WJ sSc.$%U1dJ sZc.
$-@1qJ sac. $5+1~J shc.$<1J soc.$D1fJ svc.
$K0JJ s}c.@$0/J sc. $0hJ rc.$0J rc.$V0J rc.$ 0J rc.$r0JJ rc.v$^0K rc.U$uJ0K rc.3$=60K rc.$"0,)K rc.$
0e6K rc.϶$/CK rc.ݰ$/PK rc.$/]K rc.J$j/9jK rc.$ /vK rc.$հ/K rc.n$/MK rc.$$?/K rc.$/K r
c.${/aK rc.H$_n/K rc.$a/K r c.&$ T/uK r&c.3$H/K s-c.?$=/;K s5c.6L$2/L s$B.; M sc.l$4.wM sc.$"'.#M sc.$]./M w sc.$ .,$ +O s1c.I$+vO s7c.T$+O s>c.R`$+\O sEc.k$+O sLc.j$p+qO rTc.i$Y+O r[c.h$B+O rbc.g$++U P ric.q$x +GP spc.{$ +9#P swc.U$j*+0P s~c.$ * =P sc. $*GP sc.*$;*WRP sc.;$ *\P sc.$%*|hP rc.Ԍ$J*tP rc. $o*P rc.m$n*P rc.$[*P rc.$MK*P sc.D$:*ذP sc.$)*P sc.$*DP sc.$*P sc.H$)P sc.$)4P sc.w$) Q sc.$Ľ)
Q sc.$)#Q sc.>$)s(Q sc.$)5Q s
c.$q)SCQ rc.$[)PQ rc. $E)s^Q r#c.)$/)lQ r*c.H$)yQ r1c.h$)"Q r9c. $(Q r@c. $(BQ rGc.+$D({Q rNc.6$(Q rVc.7B$̮(Q r]c.oM$((Q rdc.X$T(aQ rkc.c$(Q rrc.n$ x(Q ryc.z$j( R sc.*$](cR sc.$P(&R sc.Z$C(3R sc.$6(9AR sc.$o)(NR
sc."$W ([R sc.$?(iR
sc.R$'(WvR sc.$'R sc.$'R sc.$'-R sc.~$'uR sc.'$W' R rc. $'R rc.z+$'lR rc.#8$]'R rc.D$'R rc.vQ$ 'dR rc. ^$b|' S
r c.j$p'S rc.rw$e'\&S rc.$gY'4S r!c.Ő$M'AS r)c.n$B'SOS & r0c.$m6'\S + r7c.$*'jS / r?c.j$ 'KxS 2 rFc.$r'S / rNc.~$'S 2 rTc.w$'gS = sZc.p$i)'2S H sac.h$ :'S S sgc.a$J'S ^ snc.Z$['S k stc.: $ l'bS x s{c.* $:t'aS sc. $u|'`S sc.
- $'_T sc.9 $'^T sc.F $$'^T sc.S $_'](T sc.` $'\5T sc.m $ԭ'[BT sc.z $'ZOT sc. $'\T sc. $'jT sc.ˤ $'WwT sc.߲ $'T sc. $'T sc. $'ST sc. $'T ~ sc. $'T | sc.l $h'yT { rc. $М'T z rc. $9'tT w r
c.\$ $'T k rc.2 $
'nT ` rc.@ $r'
U \ r c.LO $ۭ'iU ^ r(c.] $C'%U ` r/c.k $'d3U a r6c.c. $}'_NU b rEc.ܖ $'[U ` rLc., $N'YiU ^ rTc.| $'vU \ r[c. $ 'TU Y rbc. $'ёU V ric.k $'OU Q rqc. $X'̬U I rxc. $'JU A rc.[ $)'U = rc. $'DU 8 rc.% $'U 5 rc.K4 $c'?U 0 rc.B $'U + rc.P $4': V $ rc.;_ $'V rc.m $'5&V rc.{ $n'3V rc.+ $'/AV rc.{ $?'NV rc.˦ $'*\V rc. $(iV rc.j $y($wV rc. $ (V
rc.
$J
( V rc.Z $(V rc. $(V rc.
$(V r
c.J $(V rc.' $U (V rc.5 $!(V r c.:D $'%(V r(c.R $((
V r/c.` $+( W r6c.*o $a/(W r>c.z} $2(&W rEc.ʋ $26( 4W rLc. $9(}AW rTc.i $=(NW r[c. $l@(x\W rbc. $C(iW ric.Y $>G(swW rqc. $J(W rxc. $M(mW r~c.? $X()W sc. $*c(W sc. $m(W sc.@ $Ux(^W sc.$ $(W sc./ $(W sc.): $ (W sc.D $Т('W sc.N $(W sc.KY $p(QX sc.c $A(X sc.m $(z X sc.y $(+X rc. $(9X rc. $S([FX rc. $(SX rc. $(`X rc. $(c.9!$,'u Y rFc.E!$'
Y rMc.|Q!$' Y rTc.m\!$''Y r[c.]g!$'4Y rbc.Mr!$'PAY } ric.=}!$'NY x roc..!$'ZY o rvc. !$'gY c r}c.!$'WtY Y rc.!$}'Y M rc.!$p'ڍY C rc.߾!$c'Y ; rc.!$V']Y 5 rc.!$I' Y , rc.!$<'Y rc.h!$ 0'Y rc.y!$2 'Y rc.!$e
'Y rc.!$&Y
rc.!$&Y
rc."$& Z
rc."$1&Z
rc.
"$d&!Z
rc."$ &-Z
rc."$o& ;Z
rc.s"$n&NHZ
rc.A "$OY&}UZ
rc.""$C&bZ
rc. "$q/&oZ
s
c.="$&|Z
sc."$T&Z
sc. "$%Z
sc.
qmapshack-1.10.0/test/unittest/input/fit/2015-05-07-22-03-17.fit 000644 001750 000144 00000153303 12727447634 024155 0 ustar 00oeichlerx users 000000 000000 .FIT @ 㦍y/ A 1 hB y/ C
y/㦍 h y/ y/ y/}-yT y^D y/ E O y/' <2F
4 5 2 G
edge810 < ( 6H
Gm< I J
y/~#tv 9
K h y/;
y/ #9`v 7
6
y/ #Fv# 9
8
y/
#uDv_% =
2
y/ #KDv & =
$[
y/9 #JEv& <
~[
y/ #KvU+ 8
5
y/O#Ov- 6
y<
"y/#rVv+3 3
H
%y/#cvl< .
N Q
,y/#ҁvS *
S
-y/#1v3V )
C E
0y/#&v.^ .
B
1y/#v_ 2
2y/!#pv,a 6
5
3y/#Zvb 8
4y/#vc 9
6y/#͙vg 6
.
7y/#yvDj 3
4?
8y/#Ovl 1
F
:y/I#vr ,
z O
;y/#vv +
U
?y/#v '
"Z
Ay/N#hv? %
!X
Dy/#xv &
T
Gy/#'v: )
H
Hy/#Ivʞ *
Iy/}#-v# ,
/
Jy/Ⱥ#.vJ .
n
My/#7v .
B
Ny/Z#vY -
C
Uy/#v /
?
Xy/%#vz 3
l
Yy/#v7 4
Zy/D#v 7
[y/#v 8
=
\y/W#vL 8
?
by/4#vY ;
ey/<#pvY >
hy/<#pvY A
qy/<#pvY @
y/<#pvY @
y/#v ?
y/#=v :
y/#v 9
y/#v 7
y/'#"v 4
m
y/#LvT 4
%
y/x#v 3
m-
y/#v 2
0
y/#v 1
3
y/q#v /
6
y/#Zvq 0
w7
y/ø#Zvs 0
7
y/#v 1
<
y/^#:vt 1
%;
y/n#fv"
/
A
y/#v .
2A
y/#0v /
@
y/#v3 /
@
y/#v" /
=
y/#v/ 4
q
y/#6v6 4
6
y/Z#Mv8 4
8
y//#.tvJ 2
a>
y/#8Svb 5
@>
y/#&7vRw 6
B;
y/ #o vΉ 5
<
y/$#
v 6
<
y/'#2v} 6
:
y/~2#cu 5
Y=
y/7#9u$ 4
m=
y/D;#Mu 4
G?
z/SC#ua 3
?
z/%E#Zu 4
>
z/F#uj 4
;
z/ M#qu 3
:
z/&R#u 3
8;
z/[#u 5
:
z/l#u 7
a8
z/t# u 6
?
z/z#_ug 5
NF
&z/_#muH 5
F
+z/#7ui 9
G
,z/#DuB! :
IC
/z/# up& ?
A
1z/#u) A
:
2z/i#u+ D
: 2z/;
4z/W# uN. G
~;
7z/S#u3 J
>
9z/p#NuR7 L
@
=z/#u> O
@
Cz/#uJ Q
N
Fz/#,uR I
L
Iz/?#vuZ[ D
Jz/M#Hu ^ A
Lz/W#Fub @
Nz/'#u f >
L
Oz/#"uh <
M
Pz/Y#unk ;
-N
Sz/w#uv 8
3 ;
Uz/#+uE} 7
g <
]z/g#u 5
=
^z/|#u0 5
>
ez/#3v 2
z @
mz/#4vJ 3
K @
nz/h#8v 4
Y ?
vz/#Yv@ 2
?
~z/S/#Suv 5
G <
z/4#yvo 8
K
z/):#Z|v <
?H
z/?#}v >
~D
z/D#~v @
C
z/gG#~v8 A
B
z/FO#~v C
pB
z/Y#7~v* D
6F
z/b#{v3 D
A
z/xe#Ryv5 C
@ A
z/j#nvN> >
z/m#%fvC =
z/t#UvzO 9
E
z/v#QvR 8
T E
z/ۀ#?va 3
v
z/Ћ#0
2
z/#v >
4
z/>#yvs =
6
z/#v[ =
5
z/#Uv> =
5
z/L#<-v >
5
z/#Gv ?
6
z/\#[v ;
g8
z/^#[v
<
6
z/i
#ZvJ =
6
z/# Xv =
3
z/g # Wvn >
5
z/%#wUv[) >
5
z/b(#Tv+ =
5
z/2#7Rv^5 <
K6
{/KE#?NvF <
8
{/mY#GvZ @
?
{/{]#Ev^ C
$A
{/e#EBvoe H
e@
{/f#Av0g I
@
{/q#)=vq M
?
{/zs#
P{/#P3v t
8
Q{/]#R3vS t
#9
Z{/I#3v- t
= ^{/:
`{/<#4v2 m
O
a{/I#4v
k
J L
b{/f#3v h
O
d{/#0v* b
R
f{/0#@+v* `
N
h{/##v$ a
[ F
j{/#>v f
B
k{/#0vX j
C
n{/#> v j
?
o{/#v i
0
q{/#ius d
9
s{/#wu `
9
t{/ #uu! ^
!
v{/Q#u( W
#
w{/|#u+ R
x{/3#u'/ M
!
y{/#5u72 K
A
{{/#u8 J
z =
|{/#Bu: J
P =
{/#"uEI K
9
{/2#>uK K
$8
{/#uS Q
4
{/E# u+V R
2
{/ #u5[ V
0
{/# #@u] W
Q0
{/##ub X
u1
{/B&#
uae W
X1
{/O8#fu?y V
1
{/?#Bu4 W
3
{/MF# u, W
{/X#uu8 X
1
{/j#cuM Z
1
{/Qm#>bu Z
;1
{/Av#V[u ]
.
{/|#Vu _
,
{/#Pu `
.
{/҆#Iu c
6
{/#Fu c
7
{/#tr e
D
|/ߗ#x)t" g
>
|/#t m
;
|/#
tT o
+;
|/ʠ#t o
>
|/K#s] l
5@
|/#
D|/#\Hs i
;
J|/!#2s j
<
R|/#/s// i
n=
[|/4#rtD i
?
a|/#rR l
:
b|/ #Nr,T m
:
c|/#r_V n
:
g|/|#r._ p
9
i|/#$r4c r
8
m|/f#_rj t
6
n|/#+rl u
7
q|/H#rr v
7
w|//#r@ v
4
}|/1#
}r w
w:
|/w#
|/?#Ecr u
E
|/#brM u
zH
|/9
|/B#cr| x
JJ
|/i#drȥ }
B
|/B#ier
=
|/]#fhrG
Z 9
|/#lr-
6
|/#mr~
M 6
|/#
|/yr
>
|/.+#Jxr
>
|/=1#%wr
| A
|/g;#ur;
m?
|/cI#vrG
?
|/U#yr
A
|/;^#j|r
A
|/a#}r`
B
|/Rc#Z~r
B
|/np#r+
A
|/|#r@8
A
|/#rXF
@
|/#r[H
?
|/#Gr#S
|@
}/#r[
A
}/u#r^
B
}/
#ܸr1i
wC
}/P#ru
cA
}/#r7w
A
}/#
r
A
}/z#r
@
&}/8#Pr{
A
-}/6#sG
@
/}/#s
A
8}/# s
@
9}/# s
?
A}/#1s
=
G}/#T?s
O?
H}/#As
^>
P}/#QSs
'=
U}/#G^s
=
Y}/ #,gs
>
`}/v#wsy
=
h}/ #هs
<
l}/Y!#esJ
<
n}/##sZ
<
u}/w-#)s_"
=
{}/6#sH-
<
}/C#s<
=
}/I#9sC
=
}/O#sK
<
}/W#/sU
=
}/OZ#sQY
<
}/d#s0f
=<
}/2i#s#k
!;
}/j#sl
<
}/r#sru
@
}/y#:sp}
=
}/#
tڈ
?
}/̄#8 t_
> }/9
}/h#t
?
}/;#X"tP
?
}/#b-t
(
>
}/Ȧ#9t3 @
}/#PAt =
}/X#Jt =
}/}#Yt p?
}/#ct! =
}/#^ft_ &=
}/#}pt]
x<
}/^#^xt
=<
}/;#t L;
}/~#"t^
;
}/I#:t
<
~/.#ٌt
<
~/O#t
e:
~/#t
:
~/#CtN,
<
~/ #et93
U;
~/T##st 8
9
!~/a.#t~B
! m
9
#~/1#htE
# 9
)~/<#tP
% :
/~/FF#3t Y
' -
:
1~/I#ӡt\
( -
;
7~/S#te
*
:
=~/]#էtn
+
<
A~/d#\tu
- 7<
D~/i#qtiz
- J<
K~/u#3tv
/ ==
Q~/ƀ#t
1 +<
T~/y#tN
3 E<
V~/ #t
3 <
^~/#t
7 /;
b~/#ۿt
8
;
e~/#Kt?
9 >
<
k~/L#t
9 hH
q~/#t
= kF
r~/w#tw
= D
v~/#tC
> >
|~/#(t
@ >
~//#{t
C =
~/?#0t
D ;
~/#t^
F X:
~/#tW
G 9
~/#t I A
~/#t K ?
~/ #t) M @
~/l#tR N X<
~/M#Nt Q <
~/: #t& S ;
~/ #tY( T P;
~/ &#ot. U <
~/*-#t5 X :
~/,.#t7 Y j
:
~/i4#tK= X 4=
~/=#tKG [ =
~/E#ugO \
=
~/L# uW ^ ?=
~/S#u_ `
>
~/ [#+ ui b >
~/yb#*ur d A
~/ d#,ut d kA
~/n#+?u f C
~/u#Kum g A ~/9
~/~x#Ou i z
B
~/}#Zu i ZC
~/#ku m A
~/:#$pu n C
~/#|xu p
@
~/#uٸ s O>
/# u u H=
/#'u. y ;
/J#u z *;
/#Zu } X=
/#ku ~ =
#/#u g?
%/#u ?
*/#&u @
+/#lu C
-/"#|ug %@
0/#uF B
8/ # u-, H
9/#| v. G
@/u#v9 gF
D/6# vl@ H
H/ #vF K
O/$#HvQ I
Q/#bvU J
U/H!#v.\ A
[/+#9v(f A
`/5#vgo 7B
c/;# v u tB
j/{I# v A
p/U#!vv @
q/W#?"v @
y/Vh#"%v tA
/%t#T'v5 @
/ v#'v A
/#*v ?
/R#,v H?
/#i-v j=
/#/v @
/͟#0vP >
/#1v <
/#4v ?
/w#6v 7@
/X#e7v @
/#;v>
B
/#3>vL
pA
/y#@v7
A
/#Cv)
A
/x#rCvp+
1A
/ #Ev8
@
/v#6Gv8>
=
/J #IvrH
aB
/'##JvN
KA
/)#(Lv9U
B
/6#Ov\a
D
/>#Qvi
>
/A#KRvk
>
/ M#pTvv
@
/HS#
UvB|
>
/Y#Vv
0?
/d#WvԌ
D?
/r#}[vQ
4A
/z#V\v
>
/|#c\vd
A /8
/#=_v
A
/X#bvw
AA
/h#(dvQ
A
%/K#gv3
yF
-/F#Fkv-
A
//#`lv
A
4/!#nvG
C
/#qv ;
р/#v K:
׀/s#v \8
/%#v f<
ۀ/љ#v
I
/#\vN A
怮/#kvs ?
耮/O#vD
퀮/T#vv 7
/#9v f7
/ҿ#v 6
/ #v7 Y6
/K#ؚv ;
/#v ;
/#(v ;
/W#Ov9 ):
/#ڏv 18
/#vq <
/#8v" (:
/:#v;$ 9
/;#vf0 p9
!/U#\v8 >
"/#vz: >
&/=#v\@ E<
*/ #vE s :
+/d # v2G 9
0/##֑vZM 9
4/)#v3R " 8
5/^*#:vpS # 7 8 :/8
;/d2#Jv[ ) 7
=/4#vh] , 7
@/8#v` . Y 6
E/>#vif 4
5
G/@#[vh 5 4
L/F#=vn : Q
6
O/J#v%q < 5
T/qO#rv3v ? 5
X/S#v_z A
8
]/:Y#yv B B >
d/_# v D ~ 8
n/g#xv H 6
p/h#v@ I 6
u/k#v K
;
/ r#v3 N
=
/s#Uv O
>
/ x#WvL P '<
/}#v K
/#5w I pE
/##w G J
/#s w F K
/t#/ w F H
/}# w G lG
/j#w G |F
/ҡ#w G EC/ /
/e#pvG J (B
/#v2 K +B
/#v: K A
/#v L C
/k#^vJ# M C
ȁ/#vn, O nB
Ё/#ʹv9 T >
/ئ#vyH X =;
ہ/#vM Y z;
߁/נ#;vT Z &>
聮/#wv\e Y \B
쁮/F#kvl Y ;
/#\evp Y ;
/q#/_vt Y R<
/p#Svb| Z }=
/ٞ#$QvT~ Z >
/#LvC Z ?
/a#Ev< \ D<
/߮#"Av _ [<
/ #;vՕ b <
/#8v b (<
/#2vu d =
/2# ,vX e <
/# v_ j :
/q#v j ;
/#v{ o ;
"/7#@u t 9;
#/#~u t ;
)/B#Hub z 4
+/$#0u { ^4
0/# u ~ 4
1/S#Cu 4
5/1#\u% 3
>/+#u o3
G/"#u 5
Q/3#u" 6
R/p5#Hug$ 6
Y/A#}v0 9
`/>P#v= 5 f/7
i/?e#jv;Q F4
k/i#dvcU ~ m6
r/y# vd | :
u/ۀ# vNk { ;
x/#u
vr z t>
y/q#( vtt y >
|/h#2v{ v ;
}/# vn~ u D
/#u҃ s d4
/g#u n 7
/#uj k 8
/#uD g :
/#u a s
/I#@u ` ^
/f#{u [
/#u' X
/m#u X
/#?u: V I7
/#nu U =6
/#(u Q
/R#u R 1
/# u R "
/a#˺u J 4
/ #4u C ;
/#8u > ;
/#u = + <
/%#u[ = @
/4#u) C <
/#u0+ E ?
/#)v:- H ?
/l #.v4 O :
/> #Zv6 O <
ɂ/##U(vE U <
Ђ/ )#F#:v _ 9
/?#)v ` 9
/CF#wv b 3
/+N#v̲ a H3
/ U#?vw ] ^:
/\#1w9 Z
/^#Wwo Z g
/d#nw W
/j#w T
/r# w N
%/|#!w H p
./#'w D I
//ɢ#m(wG D H
0/#!)w C I
9/i#.wQ7 B WE
B/#4w1L C k
H/V#6wbV E
O/#9wda E /
U/#n=whl D
V/a#2>w+n D
Y/4#=;w5s D "
[/I#B5wCw B k4
]/#.w{ @ {8
e/\ #Sw A o3
h/ #w E
,
i/
#3wɑ F { ,
l/#wk I 4"
m/0#w I
s/#w J {
y/O#twZ K
/;#wZ I
/ #wZ J
/#w K /6
/#w K
/#w K
/#w K
̓/#w K
⃮/#w K
/#w K
/#w L
/#w K
/#w K
)/#w K
7/#w K
A/#w J
Q/#w J
R/#w J
_/#w K
l/#w K
x/#w J
/#w J
/#w J / L
/#w J /#w J /#w J /6 ΄/#w I ڄ/#w˗ J 脮/#w˗ J /#wΗ J /#wΗ I /#wΗ I 3/#wΗ I I/~#rwΗ I \/~#rwΗ I j/~#rwΗ I q/x#iwΗ I /x#iwΗ I /x#iwΗ I /l#cwΗ I /l#cwΗ I υ/Y#WwΗ J ᅮ/Y#WwΗ I 녮/5 /d#qwؗ I /d#qwؗ J /m#|wߗ J +/m#|wߗ J ;/#lw I I/#w I [/#w J o/#w J /#w K
/#w K
/#w J
/#w K
Ն/#w J
醮/#w< K
/#w< K
/#w< K
/#wF K
/5
!/#wF L
//#wF L
=/#wk M
M/#wk M
]/#ws M
l/#ws M
y/#ws M
/# wx M
/# wx N
/# wx N
/# wx M
/%#w N
·/%#w N
懮/#9w N
/#Lw N
/#Lw N
'//#dw M
@//#dw N
C/4
X/.#w M
q/.#w M
/,#w M
/1#w N
/1#w N
ˈ/-#w N ߈/-#w N /8#w N /8#w N /8#w N /C#sw N -/C#sw N w W /#>w W /#"w X /#"w W ̚/#w X /#w X /# w' X /. /# w' X /# w' X '/#w' X >/#w' Y V/#w( Y m/#w, Y /#w, Z /#w7 Z /#w7 Z /#w= Z ӛ/#w= [ 䛮/#wE [ /#wE [
/#DwE \ /#DwE \ -/#DwE \ 1/- =/#FwE \ L/#FwE ] Y/#GwE \ k/#GwE \ ~/#GwE \ /#RwE \ /#RwE \ /#DwE \ /#DwE \ Μ/#DwE \ ޜ/#PwE ] /#PwE \ /#TwE \ /#TwE ] !/#IwE \ 3/#IwE \ F/#IwE \ V/#awE \ ]/- j/#awE ] s/#wE ] /#wE ] /#wE \ /#wE ] /#wE ] Ɲ/#iwK ] ؝/#iwK ] 蝮/#w ^ /#w ^ /#w ^ /#w ^ //#w ^ C/#w _ W/#w _ l/#w _ ~/#w _ /, /|#Sw _ /|#Sw ^ /m#w ^ Ξ/m#w ^ ឮ/i#w ^ /i#w ^
/Z#w ] /Z#w ] 5/Z#w ] G/Z#w ] V/]#w ] f/]#w ] |/#wÛ ] /#wÛ ] /#wɛ ] /, /#wɛ ] ˟/#wޛ ] ޟ/#wޛ ] 쟮/#wޛ ] /#w ] /#w ] /#w ^ //#w ] E/#w1 ] Z/#w1 ^ h/ #w> ^ |/ #w> ] /#wG ] /#wG ^ /#wJ ^ ˠ/#wJ ] ޠ/#wJ ^ ᠮ/+ /#wJ ^ /#wJ ^ / #wO ^ )/ #wO ^ ?/.#w] ^ S/.#w] _ h/-#w] _ /.#w^ _ /.#w^ _ /=#wl ` á/=#wl ` ֡/B#wq ` /B#wq ` /=#wq a
/+ /=#wq a (/3#wq a 9/3#wq a G/-#wq a Y/-#wq a m/-#wq a /,#wq a /,#wq a /*#wq a /*#wq a /# wq a Ѣ/# wq a 墮/# wq a / #2wx ` / #2wx a / #Awx ` &/ #Awx a 7/#*wx ` 9/* F/#*wx ` X/#*wx ` g/#<wx ` y/#<wx a /#Lwx ` /#Lwx a /#Lwx a /#Vwx b ʣ/#Vwx b ף/#Kwx b ߣ/#Kwx b /#Kwx c /#Awx c /#Awx c #/#Awx c 5/#%wy d J/#%wy d ^/#w e e/* p/#w d /#!w e /#!w e /#)w e /#)w e ͤ/#Qw e ܤ/#Qw e /#Qw f /#Iw f /#w f */#w f @/ #wÜ e S/ #wÜ f f/ #wÜ e t/2#&w e /2#&w e /) /D#,w e /D#,w e /;#w e ѥ/;#w e 楮/,#w d /,#w e /(# w d /(# w d 1/#w c C/#w d T/#w d h/#w c {/#w c /#!w d /#!w c /#%w c /( ʦ/#%w d ম/#w c /#w c /#w d /#w c #/#w d 1/#w d C/#w d X/ #
w d h/ #
w d x/#w% d /#w% d /#w% e / #w0 e / #w0 e ħ/#w0 e Ч/#w0 e 䧮/#w0 f ꧮ/( / #w9 f / #w9 f /$#w@ f #/$#w@ f ./$#w@ f >/'#wD g F/'#wD g J/'#wD g V/'#wD g i/#wD g z/#wD g /#wG g /#wG h /#wG g Ш/#wG g 樮/#wG h /#wG h /#wL h /( %/#wL h ;/,#w^ i Q/I#wx i f/I#wx i y/Z#w i /Z#w i /Z#w i /i#w i Ʃ/i#w i ֩/#w i /#w i /#wɝ i /#wɝ i +/#wɝ i 9/#wɝ i B/' J/#wɝ h Y/#wɝ h j/#wɝ h /#wɝ h /#wם h /#wם h /#wם h Ī/#wם h Ӫ/#wם g 誮/#wם g /#wם g /#wם g /#wٝ g (/#wٝ g :/#wٝ g L/#wٝ g b/#w g n/' w/#w g /#w g /#w g /x#w g ū/x#w h ۫/x#w h /x#w h /`#w i '/T#w h ?/T#w h R/K#w i g/K#w h {/B#w i /B#w i /' /H# w i /H# w j ì/C# w k լ/C# w j 묮/;#w k /;#w k
/;#w k /5# w k 8/5#
w k L/5#
w k W/5#
w l [/5#
w l i/8#w l y/8#w l /@# w l /@# w m /G# w m ĭ/G# w m ƭ/& խ/G# w m 筮/`#:w m /`#:w n /i#Kw n /i#Kw n 3/o#Ew! n F/o#Ew! n ^/n#!w" n o/n#!w" n /_#w" n /_#w" n /_#w" o /Y#w" n /Y#w" o ̮/E#w" o ߮/E#w" o 쮮/E#w" o /% / #w" o / #w" o !/#w" n -/#w" o >/#w" n L/#w" o Y/#w" o i/#w" o y/#w" o /#w" n /#w" n /#w" n /#w" n ů/#w" o ԯ/#w" o 篮/#w" n /#w" o
/#w$ p /% !/#w$ o 3/#w3 o F/#w3 p Z/#wF q m/#wF q /#wF q /#wF r /#wF r /#wF r /#wF r ̰/#wF r ۰/#wH s 鰮/#wH s /#wI s /#wI t $/#wI t 9/#wI u K/$ N/#wI u g/#wI u /#wS v /#wS v /+#w v /+#w v /V#w w ұ/V#w w 汮/V#w w /\#w v /\#w w /Y#w v -/Y#w w >/l#wÞ w K/l#wÞ w ^/l#wÞ w k/u#wɞ w w/$ |/u#wɞ v /l#wɞ w /l#wɞ w /l#wɞ w /O#wɞ w Ӳ/O#wɞ x 岮/?#wɞ w /?#wɞ w /9#wɞ w /9#wɞ w -/E#wӞ w @/E#wӞ w O/E#wӞ w _/F#wԞ w l/F#wԞ w }/7#wԞ w /7#wԞ v /D#w v /# /D#w v /D#w v ӳ/\#w u 糮/\#w v /`#w u /`#w u +/U#w v E/[#w v Y/[#w v p/a#w v /a#w w /_#w w /\#gw w ϴ/\#gw w ϴ/# 㴮/b#Xw x /b#Xw x
/a#Rw w /a#Rw w 3/S#Mw w G/S#Mw w ^/H#<w v u/H#<w v /C#:w v /C#:w v /+#?w v Ե/ #3w v 赮/ #3w v /" /#Ew w /#Ew w 0/#hw w C/#hw w T/ #cw x d/ #cw w v/'#Xw& x /'#Xw& x /'#Xw& x / #Sw& x / #Sw& x ̶/#Rw& x ߶/#Rw& y / #Ww& y / #Ww& y /#Sw& y '/! 6/#Sw& y K/#Yw) y \/#Yw) y t/#w) y /#w0 y /#w0 y /#w; y ɷ/#w; z ۷/#w= z /#w= z /#w= { /#w@ { /#w@ { 2/ #wD | 3/ #wD | G/ #wD { S/! Y/
#wD | l/
#wD | /#wD | /#wD | /#xwD | /#xwD | ϸ/#zwD | ⸮/#zwD | /#qwD | /#qwD | /#twI | 4/#twI | G/#ZwQ | ]/#ZwQ | o/ #Ew^ | /! / #Ew^ | /#Dwh | /#Dwh } /#Gwl | ѹ/#Gwl } Ṯ/ #9ws } / #9ws } //# w } //# w } &//# w } :/ #w ~ H/ #w ~ Z/#w } k/#w ~ |/#w ~ /#w ~ /#w } / /#w ~ /#w ~ Һ/#w ~ 亮/#w ~ /#w /#w /#w /#w ,/#w =/#w J/#w ]/#w n/#w ~/#w /#w /#w /#w /#w Ȼ/#w / ڻ/#w /#w /#w /#w /'#w 5/'#w J/-#w \/-#w l/.#wß /.#wß /X#w /X#w /x#w ȼ/x#w ؼ/#w 鼮/#w /#w / /#w '/#w >/#w V/#w j/#w y/#w /#w /#w /#w /#w Ž/#w ؽ/#w 齮/#w /#w#
/#w# /#w, 0/#w, 0/ E/#w, Y/#w, l/#w4 /#w4 /#wA /#wA Ͼ/#wN 侮/#wQ /#wQ /#wQ #/#wQ 6/#wS H/#wS U/#wS \/ e/#wS t/#wS /#wS /#wS /#wS /#wZ /#1wy /#1wy ̿/#1wy ܿ/#w 濮/#w /#w /#w /#w )/#w ~ 2/#w >/#w ~ O/#w ~ `/#w ~ q/#w /$#wϠ / /$#wϠ ~ /$#wϠ ~ / ##wϠ / ##wϠ ~ / ##wϠ /#"wϠ /#"wϠ /##wϠ /##wϠ /#!wϠ +/#!wϠ B/#DwϠ S/#DwϠ d/#DwϠ r/#>wϠ /#>wϠ /#=wϠ /#=wϠ /#=wϠ / /#AwϠ /#AwϠ /#FwϠ ®/#FwϠ ®/#NwϠ #®/#NwϠ 5®/#UwϠ I®/#UwϠ [®/#dwϠ n®/#dwϠ ®/#^wϠ ®/#^wϠ ®/#^wϠ ®/#cwР ®/#cwР ®/#owР ®/ ®/#owР ®/#owР î/#wР î/#wР )î/}#wР 5î/}#wР Bî/}#wР Qî/x#wР cî/x#wР mî/x#wР yî/#}wޠ î/#}wޠ î/#}wޠ î/#wޠ î/#wޠ î/#wޠ î/#wޠ î/#wޠ î/#w Į/#w Į/ Į/t#{w &Į/t#{w 4Į/t#{w AĮ/|#ow TĮ/|#ow bĮ/#pw rĮ/#pw Į/#pw Į/}#w Į/}#w Į/}#w Į/#w Į/#w Į/#w Į/#ew Į/#ew Į/#ew Į/#ew Ů/#lw
Ů/#lw
+Ů/#aw
8Ů/ 9Ů/#aw
EŮ/#aw
RŮ/#bw
aŮ/#bw
qŮ/#bw
Ů/p#Zw
Ů/p#Zw
Ů/p#Zw
Ů/v#aw Ů/v#aw Ů/v#aw Ů/s#ew Ů/s#ew Ů/x#nw Ʈ/x#nw Ʈ/x#nw *Ʈ/{#w 7Ʈ/{#w EƮ/#w0 \Ʈ/#w0 dƮ/ oƮ/#w9 |Ʈ/#w9 Ʈ/#w9 Ʈ/#w9 Ʈ/#w9 Ʈ/#wA Ʈ/#wA Ʈ/#wB Ʈ/#wB Ǯ/#wL Ǯ/#wL /Ǯ/#wL DǮ/#wQ ZǮ/#wQ pǮ/#wQ Ǯ/#wQ Ǯ/ Ǯ/#w\ Ǯ/#wh Ǯ/#wh Ǯ/#wh Ǯ/#w Ǯ/#w Ǯ/#w Ȯ/#w Ȯ/#w $Ȯ/#w 6Ȯ/#w HȮ/#w TȮ/#w bȮ/#w uȮ/#w Ȯ/#w Ȯ/#w Ȯ/#w Ȯ/#w Ȯ/ Ȯ/#+w Ȯ/#+w Ȯ/#+w Ȯ/#,w ɮ/#,w ɮ/#Ew /ɮ/#Ew Aɮ/#@w Sɮ/#@w aɮ/#@w bɮ/#Ew mɮ/#Ew }ɮ/#Ew ɮ/#w ɮ/#w ɮ/#w ɮ/#w ɮ/#w ɮ/#w ɮ/ ɮ/#w ɮ/#w ʮ/#w ʮ/#w "ʮ/#w 2ʮ/#w Dʮ/#w Oʮ/#w bʮ/#w vʮ/#w ʮ/#wš ʮ/#wš ʮ/#wš ʮ/#wѡ ʮ/#wѡ ʮ/ #(w
ˮ/ #(w ˮ/ $ˮ/ #@w <ˮ/ #@w Kˮ/ #Bw ^ˮ/ #Bw qˮ/ #7w yˮ/ #7w ˮ/ #7w ˮ/ #7w ˮ/$#;w ˮ/$#;w ˮ/ #>w ˮ/ #>w ˮ/##<w ̮/##<w ̮/w *̮/w <̮/,#3w
A̮/ O̮/,#3w
c̮/(#)w
w̮/(#)w
̮/#9w
̮/#9w
̮/#/w
̮/#/w
̮/ #6w
̮/ #6w
̮/ #6w
ͮ/# w
ͮ/# w
2ͮ/#w
Gͮ/#w
\ͮ/#w
jͮ/#w
mͮ/ |ͮ/#w
ͮ/#w
ͮ/#w
ͮ/#w
ͮ/#w
ͮ/#w
ͮ/#w
ͮ/#w
ή/#w
ή/#w
.ή/#w
Cή/#w
Xή/#w
lή/#w {ή/#w ή/#w ή/ ή/#w ή/#w ή/#w ή/#w ή/#w ή/#w
Ϯ/#w Ϯ/#w -Ϯ/#w @Ϯ/#w PϮ/#w ]Ϯ/#w pϮ/#w Ϯ/# w Ϯ/# w Ϯ/# w Ϯ/#w Ϯ/#w Ϯ/~ Ϯ/#w" Ϯ/#w" Ϯ/#w0 Ю/#w0 Ю/#w0 )Ю/#Ew1 <Ю/#Ew1 PЮ/#Nw< _Ю/#Nw< rЮ/#2w< Ю/#2w< Ю/#$w< Ю/#$w< Ю/#w< Ю/#w< Ю/#w< Ю/#w< Ю/{ Ю/#w<
Ѯ/#w< !Ѯ/#w< 5Ѯ/#w< DѮ/#w< TѮ/#w< dѮ/t#w< qѮ/t#w< Ѯ/u#$w= Ѯ/u#$w= Ѯ/u#$w= Ѯ/r#1w= Ѯ/r#1w= Ѯ/h#"w= Ѯ/h#"w= Ү/[#7w= Ү/[#7w= Ү/w !Ү/[#7w= 2Ү/B#3w= @Ү/B#3w= OҮ/ ##w= ]Ү/ ##w= kҮ/ ##w= yҮ/#Iw= Ү/#Iw= Ү/#>w= Ү/#>w= Ү/#>w= Ү/#+w= Ү/#+w= Ү/#+w= Ү/#w= Ү/#w= Ӯ/#w= Ӯ/#w= 2Ӯ/#w= CӮ/#w= JӮ/s VӮ/#w= iӮ/#wP yӮ/#wP Ӯ/#wP Ӯ/#wc Ӯ/#wc Ӯ/#wl Ӯ/#wl Ӯ/#wl Ӯ/ #wv Ӯ/ #wv Ԯ/#@wz $Ԯ/#@wz 1Ԯ/%#7w EԮ/%#7w WԮ//#(w mԮ//#(w vԮ/o Ԯ/.#w Ԯ/.#w Ԯ/<#w Ԯ/<#w Ԯ/<#w Ԯ/,#w Ԯ/,#w Ԯ//#w ծ//#w ծ/# w 1ծ/# w Cծ/# w Uծ/# w kծ/#w ծ/#w ծ/#w ծ/j ծ/#w ծ/#w ծ/
#w ծ/
#w ծ/#w ֮/#w ֮/#wƢ *֮/#wƢ ?֮/-#wߢ R֮/-#wߢ d֮/.#w t֮/.#w ֮/4#w ֮/4#w ֮/4#w ֮/D#w ֮/D#w ֮/e ֮/Y#w ֮/Y#w ֮/Y#w ֮/X#w /X#w #/Y#w
9/Y#w
H/Y#w
_/V#w
s/:#w
/:#w
/:#w
/+#w
/+#w
/!#w
/!#w
/_ /#w
خ/#w
خ/ #w
/خ/ #w
Aخ/#w
Sخ/#w
dخ/#w yخ/#w خ/#w خ/#w خ/ #w" خ/ #w" خ//#w5 خ//#w5 خ//#w5 ٮ/<#wA $ٮ/<#wA &ٮ/Y 0ٮ/<#wB >ٮ/<#wB Kٮ/<#wB ]ٮ/4#wB jٮ/4#wB yٮ/4#wB ٮ/4#wB ٮ/4#wB ٮ/B#wN ٮ/B#wN ٮ/B#wN ٮ/N#wW ٮ/N#wW ٮ/N#wW ٮ/Y#wb ڮ/Y#wb ڮ/Z#wb +ڮ/Z#wb @ڮ/Z#wb Rڮ/V Vڮ/t#4wy kڮ/#\w ڮ/#\w ڮ/#]w ڮ/#]w ڮ/#]w ڮ/#]w ڮ/#_w ڮ/#_w ڮ/#Xw ڮ/#Xw ۮ/#Xw ۮ/#Hw &ۮ/#Hw 7ۮ/#Pw Lۮ/#Pw ^ۮ/#Jw nۮ/#Jw {ۮ/#Jw ~ۮ/Q ۮ/#Rw ۮ/#Rw ۮ/#^w ۮ/#^w ۮ/#Nw ۮ/#Nw ۮ/#Lw ܮ/#Lw #ܮ/#Pw <ܮ/#Pw Rܮ/#@w jܮ/#@w ܮ/#5w ܮ/#5w ܮ/R
ܮ/#7wʣ ܮ/#7wʣ ܮ/#;wӣ ܮ/#;wӣ ܮ/#;wӣ ܮ/#=wԣ ݮ/#=wԣ ݮ/#Ow *ݮ/#Ow 9ݮ/#Ow Jݮ/#Sw `ݮ/#Sw tݮ/#cw ݮ/#cw ݮ/#rw ݮ/#rw ݮ/#_w ݮ/#_w ݮ/Q
ݮ/#pw ݮ/#pw ݮ/#pw ޮ/#uw 'ޮ/#uw 8ޮ/#uw Lޮ/#uw Qޮ/#uw aޮ/#ww wޮ/#ww ޮ/#lw ޮ/#aw ޮ/#aw ޮ/#fw ޮ/#fw ޮ/#uw ߮/P ߮/#uw &߮/#xw :߮/#xw P߮/#|w g߮/#|w }߮/#~w ߮/#~w ߮/#ww ߮/#uw ߮/#uw ߮/#uw /#uw /#cw !/#cw //P 2/#rw F/#rw \/#Xw o/#Xw /#Iw /#Iw /#Iw /x#3w /x#3w /X#w /X#w /X#w /X#w /># w /># w &/,#w 3/,#w E/,#w Y/"#w [/O k/"#w /#w /#w /#w /#w /#w /#w /#w /#w /#w 4/#w L/#w9 a/#w9 w/#w9 /N /#w: /#w: /#w: / #wA / #wA / #wA / # wA / # wA $/ # wA :/#'wA M/#'wA ^/# wA q/# wA /#wA /#wA /#wn /N /#wn /#wz /#wz /#wz /
#wz /
#wz /5#w ./5#w ?/5#w F/C#w Q/C#w a/C#w q/A#w /A#w /1#w /1#w /1#w /9#w /9#w /N
/8#w /8#w /9#w /9#w 6/6#w K/6#w b/+#w u/+#w /2#w /2#w / #w / #w / #w /#
w /#
w /
#,w /
#,w /M
/
#,w ,/#Nw ;/#Nw K/#[w [/#[w e/#[w s/#mw /#mw /#mw /#tw /#tw /#tw /#w /#w /#w /#w /#w /#wä %/#wä 7/K 9/#wƤ J/#wƤ \/#wƤ n/#wƤ /#wƤ /#wǤ /#wǤ /#wˤ /#wˤ /#wˤ /#wˤ /# wФ !/# wФ 5/#w٤ G/#w٤ W/#w d/I h/#w |/#w /#w /# w /# w /#w /#w /#w /#w /#w /#w +/#w ;/#w I/#w \/#w n/#w /#w /#w /G /#w /#w /#w /#w /#w /#w /#_w /#w /#w !/7#w ,/;#Ww :/;#Ww I/;#Ww X/4#Nw l/N#w |/N#w /M#w /M#w /M#w /D /{#w /{#w /#w /#w /#w /#w )/#w w#br # % =[/ N <
0ptuvwxy
"#$%-jklq Q efghirsz{/y/~#tv {.{ ,#2>w#br # % =[ O " /. /
Л qmapshack-1.10.0/test/unittest/input/fit/Warisouderghem_course.fit.xml 000644 001750 000144 00000001577 12727447634 027403 0 ustar 00oeichlerx users 000000 000000 Warisouderghem
qmapshack-1.10.0/test/unittest/input/fit/2015-05-07-22-03-17.fit.xml 000644 001750 000144 00000002411 12727447634 024745 0 ustar 00oeichlerx users 000000 000000 2015-07-05-22-03-17
qmapshack-1.10.0/test/unittest/input/fit/2016-03-12_15-16-50_4_20.fit 000644 001750 000144 00000005436 12727447634 024764 0 ustar 00oeichlerx users 000000 000000 .FIT @ @TF1 AA 1 ,B F1 C
F1@T A, F1 8SN F1Qx^ xdF1jy + yaD
F1E O F1X3 $<F F1'!Q sG h F1iNF1x! vF1'! pwF1H F1!i * w0F12!' v F1! p Ny F1!= Nz F1! t
zCF1 !Z O}SF1! - O~T F1h! pT F1!V e yTF1X! pPF1!? $ OF1,! - OR F1! 5 P F1C! <7 E#F1!G& @ M$F1 !( bB 2N'F1 !O1 G T+F1!!= nO P2F1!uP n\ Q6F1 I 7F1!?] e eP:F1:F1[!hd 3k O=F1B!j p zR>F1x!-l r RBF1]!s y RCF1!u { SDF1M!w } REF1 !y zRJF1! X UENF1!z 'OF1o!Oy Ð RF1 TF1!;t 0
XF1!Ts J >AYF1^F1v!Vr Φ K_F1]!r ObF1!r ~QdF1=!s # fF1!r ! iF1p!Gq g mF1A!)m d
nF1!j ' 1 qF1h!|a sF1!Z uF1!T * vF1%!]Q 0 zF12!C G }F1!9 ~F1!6 F1C!v, p F1Y!\$ X F1F1![ F1F1F1! F1+! F1!
F1! }F1! zF1w!y xF1 F1@T A, F1 8SN F1Qx xdF1jy W y`F1 F1F1!F wF1! z F1! | F1 F1@T A, F1 8SN F1Qx xdF1jy$ X y`J !
F1F1'!Q ! g pV !ŀ !y % p HUF1 K "
F1F1'!Q g pV !ŀ !y % p HU L " F1pV F1iN qmapshack-1.10.0/test/unittest/input/randomize_hr.awk 000644 001750 000144 00000000607 12727447634 024127 0 ustar 00oeichlerx users 000000 000000 #!/bin/gawk -f
function randint(start, end)
{
return start + int((end - start) * rand())
}
function randfloat(start, end)
{
return start + ((end - start) * rand())
}
// {
matched=0;
}
match($0, /^(\s*)([0-9]+(\.[0-9]+)?)<\/gpxtpx:hr>\s*$/, ary) {
print ary[1] "" randint(100, 200) "";
matched=1;
}
// {
if(0 == matched)
{
print $0;
}
}
qmapshack-1.10.0/test/unittest/CMakeLists.txt 000644 001750 000144 00000003616 13025704317 022330 0 ustar 00oeichlerx users 000000 000000 # Find includes in corresponding build directories
set(CMAKE_INCLUDE_CURRENT_DIR ON)
# Instruct CMake to run moc automatically when needed.
set(CMAKE_AUTOMOC ON)
find_package(Qt5Test)
find_package(Qt5Widgets)
find_package(Qt5Core)
find_package(Qt5Xml)
find_package(Qt5Script)
find_package(Qt5Sql)
find_package(Qt5WebKitWidgets)
find_package(Qt5LinguistTools)
find_package(Qt5PrintSupport)
if(UNIX)
if(Qt5DBus_FOUND)
find_package(Qt5DBus)
endif(Qt5DBus_FOUND)
endif(UNIX)
find_package(GDAL REQUIRED)
find_package(PROJ REQUIRED)
find_package(ROUTINO REQUIRED)
if(UNIX)
if(Qt5DBus_FOUND)
set(DBUS_LIB Qt5::DBus)
endif(Qt5DBus_FOUND)
else(UNIX)
set(DBUS_LIB)
endif(UNIX)
if(UNIX)
set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++11")
endif(UNIX)
include_directories(
${CMAKE_BINARY_DIR}
${CMAKE_CURRENT_SOURCE_DIR}/../../src
)
include_directories(
SYSTEM # this prevents warnings from non-QMS headers
${GDAL_INCLUDE_DIRS}
${PROJ_INCLUDE_DIRS}
${ROUTINO_INCLUDE_DIRS}
${ALGLIB_INCLUDE_DIRS}
)
qt5_add_resources(RC_SRCS ./../../src/resources.qrc)
add_executable(qttest EXCLUDE_FROM_ALL
main.cpp
test_QMapShack.h
CGpxProject.cpp
CFitProject.cpp
CQmsProject.cpp
CSlfReader.cpp
CKnownExtension.cpp
TestHelper.cpp
CGisItemTrk.cpp
${RC_SRCS})
# copy the input files required by the unittests to ./bin/input
file(COPY input DESTINATION ${CMAKE_BINARY_DIR}/bin/)
target_link_libraries(qttest
Qt5::Widgets
Qt5::Xml
Qt5::Script
Qt5::Sql
Qt5::WebKitWidgets
Qt5::PrintSupport
Qt5::Test
QMS
${DBUS_LIB}
${GDAL_LIBRARIES}
${PROJ_LIBRARIES}
${ROUTINO_LIBRARIES}
${ALGLIB_LIBRARIES}
)
add_custom_command(
OUTPUT tests_run.log
COMMAND qttest
DEPENDS qttest
COMMENT "Executing the Unittests"
VERBATIM
)
add_custom_target(
run_tests
DEPENDS tests_run.log
)
qmapshack-1.10.0/test/unittest/TestHelper.cpp 000644 001750 000144 00000012130 12727447634 022360 0 ustar 00oeichlerx users 000000 000000 /**********************************************************************************************
Copyright (C) 2015-2016 Christian Eichler code@christian-eichler.de
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see .
**********************************************************************************************/
#include
#include
#include
#include
#include "TestHelper.h"
QString TestHelper::getTempFileName(const QString &ext)
{
QTemporaryFile tmp("qtt_XXXXXX." + ext);
tmp.open();
QString tempFile = tmp.fileName();
tmp.remove();
return tempFile;
}
static QString getAttribute(const QDomNode &node, const QString &name)
{
const QDomNamedNodeMap &attrs = node.attributes();
if(!attrs.contains(name))
{
QWARN( QString("Attribute `%1` does not exist in DomNode `%2`").arg(name).arg(node.nodeName()).toStdString().c_str() );
return QString();
}
return attrs.namedItem(name).nodeValue();
}
static QHash getExpectedAreas(const QDomNode &exp)
{
QHash expOvls;
const QDomNodeList &ovlList = exp.namedItem("areas").childNodes();
for(int i = 0; i < ovlList.length(); i++)
{
const QDomNode &node = ovlList.item(i);
expectedArea ovl;
ovl.name = getAttribute(node, "name");
ovl.colorIdx = getAttribute(node, "colorIdx").toInt();
ovl.ptCount = getAttribute(node, "pointcount").toInt();
expOvls.insert(ovl.name, ovl);
}
return expOvls;
}
static QHash getExpectedRoutes(const QDomNode &exp)
{
QHash expRtes;
const QDomNodeList &rteList = exp.namedItem("routes").childNodes();
for(int i = 0; i < rteList.length(); i++)
{
const QDomNode &node = rteList.item(i);
expectedRoute rte;
rte.name = getAttribute(node, "name");
rte.ptCount = getAttribute(node, "pointcount").toInt();
expRtes.insert(rte.name, rte);
}
return expRtes;
}
static QHash getExpectedTracks(const QDomNode &exp)
{
QHash expTrks;
const QDomNodeList &trkList = exp.namedItem("tracks").childNodes();
for(int i = 0; i < trkList.length(); i++)
{
const QDomNode &node = trkList.item(i);
expectedTrack trk;
trk.name = getAttribute(node, "name");
trk.segCount = getAttribute(node, "segcount" ).toInt();
trk.ptCount = getAttribute(node, "pointcount").toInt();
trk.colorIdx = getAttribute(node, "colorIdx" ).toInt();
QHash extensions;
const QDomNodeList &extList = node.namedItem("colorSources").childNodes();
for(int j = 0; j < extList.length(); j++)
{
expectedExtension ext;
ext.name = getAttribute(extList.item(j), "name");
ext.known = getAttribute(extList.item(j), "known") == "true";
ext.everyPoint = getAttribute(extList.item(j), "everypoint") == "true";
ext.derived = getAttribute(extList.item(j), "derived") == "true";
extensions.insert(ext.name, ext);
}
trk.extensions = extensions;
expTrks.insert(trk.name, trk);
}
return expTrks;
}
static QHash getExpectedWaypoints(const QDomNode &exp)
{
QHash expWpts;
const QDomNodeList &wptList = exp.namedItem("waypoints").childNodes();
for(int i = 0; i < wptList.length(); i++)
{
const QDomNode &node = wptList.item(i);
expectedWaypoint wpt;
wpt.name = node.attributes().namedItem("name").nodeValue();
expWpts.insert(wpt.name, wpt);
}
return expWpts;
}
expectedGisProject TestHelper::readExpProj(const QString &fileName)
{
QFile file(fileName);
QDomDocument xml;
QString msg;
int line;
int column;
SUBVERIFY(xml.setContent(&file, false, &msg, &line, &column), QString("[%1:%2] %3").arg(fileName).arg(line).arg(msg));
const QDomNode &exp = xml.namedItem("expected");
expectedGisProject proj;
proj.changed = false; //< projects should never be changed after loading
proj.name = exp.namedItem("name").firstChild().nodeValue();
proj.desc = exp.namedItem("desc").firstChild().nodeValue();
proj.wpts = getExpectedWaypoints(exp);
proj.trks = getExpectedTracks(exp);
proj.rtes = getExpectedRoutes(exp);
proj.ovls = getExpectedAreas(exp);
return proj;
}
qmapshack-1.10.0/test/unittest/test_QMapShack.h 000644 001750 000144 00000005630 12727447634 022624 0 ustar 00oeichlerx users 000000 000000 /**********************************************************************************************
Copyright (C) 2015-2016 Christian Eichler code@christian-eichler.de
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see .
**********************************************************************************************/
#include
#include
#include "TestHelper.h"
class IGisProject;
class CGpxProject;
class CQmsProject;
class CSlfProject;
extern QString testInput;
#define TCWRAPPER( CALL ) { try { CALL; } catch(QString &error) { QFAIL(error.toStdString().c_str()); } \
}
class test_QMapShack : public QObject
{
Q_OBJECT
QString testInput;
QList inputFiles;
void verify(const QString &expectFile, const IGisProject &proj);
void verify(expectedGisProject exp, const IGisProject &proj);
void verify(const QString &projFile);
QString fileToPath(const QString &file);
IGisProject* readProjFile(const QString &file, bool valid = true, bool forceVerify = true);
// CSlfReader
void _readValidSLFFile();
void _readNonExistingSLFFile();
// CGpxProject
void writeReadGpxFile(const QString &file);
void _writeReadGpxFile();
// CKnownExtension
void _readExtGarminTPX1_tp1();
void _readExtGarminTPX1_gpxtpx();
void readExtGarminTPX1(const QString &file, const QString &ns);
// CQmsProject
void _readQmsFile_1_6_0();
void _writeReadQmsFile();
// CFitProject
void _readValidFitFiles();
// CGisItemTrk
void _filterDeleteExtension();
private slots:
void initTestCase();
void testreadValidSLFFile() { TCWRAPPER( _readValidSLFFile() ) }
void testreadNonExistingSLFFile() { TCWRAPPER( _readNonExistingSLFFile() ) }
void testwriteReadGpxFile() { TCWRAPPER( _writeReadGpxFile() ) }
void testreadQmsFile_1_6_0() { TCWRAPPER( _readQmsFile_1_6_0() ) }
void testwriteReadQmsFile() { TCWRAPPER( _writeReadQmsFile() ) }
void testreadExtGarminTPX1_gpxtpx() { TCWRAPPER( _readExtGarminTPX1_gpxtpx() ) }
void testreadExtGarminTPX1_tp1() { TCWRAPPER( _readExtGarminTPX1_tp1() ) }
void testreadValidFitFiles() { TCWRAPPER( _readValidFitFiles() ) }
void testfilterDeleteExtension() { TCWRAPPER( _filterDeleteExtension() ) }
};
qmapshack-1.10.0/test/unittest/main.cpp 000644 001750 000144 00000022301 13023451227 021205 0 ustar 00oeichlerx users 000000 000000 /**********************************************************************************************
Copyright (C) 2015-2016 Christian Eichler code@christian-eichler.de
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see .
**********************************************************************************************/
#include
#include
#include "TestHelper.h"
#include "test_QMapShack.h"
#include "gis/gpx/CGpxProject.h"
#include "gis/ovl/CGisItemOvlArea.h"
#include "gis/prj/IGisProject.h"
#include "gis/fit/CFitProject.h"
#include "gis/qms/CQmsProject.h"
#include "gis/rte/CGisItemRte.h"
#include "gis/slf/CSlfProject.h"
#include "gis/slf/CSlfReader.h"
#include "gis/trk/CGisItemTrk.h"
#include "gis/trk/CKnownExtension.h"
#include "gis/wpt/CGisItemWpt.h"
#include "helpers/CSettings.h"
#include "setup/IAppSetup.h"
QString testInput;
void test_QMapShack::initTestCase()
{
IAppSetup* env = IAppSetup::getPlatformInstance();
env->processArguments();
env->initLogHandler();
env->initQMapShack();
SETTINGS;
IUnit::self().setUnitType((IUnit::type_e)cfg.value("MainWindow/units",IUnit::eTypeMetric).toInt(), nullptr);
CKnownExtension::init(IUnit::self());
testInput = QCoreApplication::applicationDirPath() + "/input/";
inputFiles =
{
"qtt_gpx_file0.gpx"
, "gpx_ext_GarminTPX1_gpxtpx.gpx"
, "gpx_ext_GarminTPX1_tp1.gpx"
, "V1.6.0_file1.qms"
, "V1.6.0_file2.qms"
};
}
void test_QMapShack::verify(expectedGisProject exp, const IGisProject &proj)
{
VERIFY_EQUAL(true, proj.isValid());
VERIFY_EQUAL(exp.changed, proj.isChanged());
VERIFY_EQUAL(exp.name, proj.getName());
VERIFY_EQUAL(exp.desc, proj.getDescription());
VERIFY_EQUAL(exp.wpts.count(), proj.getItemCountByType(IGisItem::eTypeWpt));
VERIFY_EQUAL(exp.trks.count(), proj.getItemCountByType(IGisItem::eTypeTrk));
VERIFY_EQUAL(exp.rtes.count(), proj.getItemCountByType(IGisItem::eTypeRte));
VERIFY_EQUAL(exp.ovls.count(), proj.getItemCountByType(IGisItem::eTypeOvl));
for(int i = 0; i < proj.childCount(); i++)
{
IGisItem *item = dynamic_cast(proj.child(i));
CGisItemWpt *wpt = dynamic_cast(item);
if(nullptr != wpt)
{
VERIFY_EQUAL(true, exp.wpts.contains(wpt->getName()));
exp.wpts.remove(wpt->getName());
SUBVERIFY(wpt->getPosition() != QPointF(0., 0.), "Waypoint has position 0/0");
}
CGisItemTrk *itemTrk = dynamic_cast(item);
if(nullptr != itemTrk)
{
const CTrackData &trk = itemTrk->getTrackData();
SUBVERIFY(exp.trks.contains(itemTrk->getName()), QString("Found track `%1`, there shouldn't be any track with that name").arg(itemTrk->getName()));
const expectedTrack &expTrk = exp.trks.take(itemTrk->getName());
int trkptCount = 0;
for(const trkseg_t &seg : trk.segs)
{
trkptCount += seg.pts.count();
for(const trkpt_t &trkpt : seg.pts)
{
SUBVERIFY((0. != trkpt.lat) || (0. != trkpt.lon), "Trackpoint has position 0/0");
for(const QString &key : expTrk.extensions.keys())
{
VERIFY_EQUAL(expTrk.extensions[key].known, CKnownExtension::isKnown(key));
if(expTrk.extensions[key].everyPoint)
{
SUBVERIFY(trkpt.extensions.contains(key), QString("Missing extension `%1`on trackpoint").arg(key));
}
}
}
}
VERIFY_EQUAL(expTrk.segCount, trk.segs.count());
VERIFY_EQUAL(expTrk.ptCount, trkptCount);
VERIFY_EQUAL(expTrk.colorIdx, itemTrk->getColorIdx());
QStringList existingSources = itemTrk->getExistingDataSources();
for(const QString &ext : expTrk.extensions.keys())
{
SUBVERIFY(existingSources.contains(ext), QString("Missing extension `%1`").arg(ext));
existingSources.removeOne(ext);
}
auto accuFunc = [](const QString &accu, const QString &b) { return accu.isEmpty() ? b : QString("%1, %2").arg(accu).arg(b); };
QString remainingExts = std::accumulate(existingSources.cbegin(), existingSources.cend(), QString(), accuFunc);
SUBVERIFY(existingSources.isEmpty(), QString("existingSources still contains: ") + remainingExts);
}
CGisItemRte *itemRte = dynamic_cast(item);
if(nullptr != itemRte)
{
SUBVERIFY(exp.rtes.contains(itemRte->getName()), QString("Found route `%1`, there shouldn't be any route with that name").arg(itemRte->getName()));
const CGisItemRte::rte_t &rte = itemRte->getRoute();
const expectedRoute &expRte = exp.rtes.take(itemRte->getName());
VERIFY_EQUAL(expRte.ptCount, rte.pts.size());
}
CGisItemOvlArea *itemOvl = dynamic_cast(item);
if(nullptr != itemOvl)
{
SUBVERIFY(exp.ovls.contains(itemOvl->getName()), QString("Found area `%1`, there shouldn't be any area with that name").arg(itemOvl->getName()));
const expectedArea &expOvl = exp.ovls.take(itemOvl->getName());
VERIFY_EQUAL(expOvl.colorIdx, itemOvl->getColorIdx());
const CGisItemOvlArea::area_t &area = itemOvl->getAreaData();
VERIFY_EQUAL(expOvl.ptCount, area.pts.size());
}
}
// ensure all expected waypoints/tracks actually exist
SUBVERIFY(exp.wpts.isEmpty(), "Not all expected waypoints found");
SUBVERIFY(exp.trks.isEmpty(), "Not all expected tracks found");
SUBVERIFY(exp.rtes.isEmpty(), "Not all expected routes found");
SUBVERIFY(exp.ovls.isEmpty(), "Not all expected areas found");
}
void test_QMapShack::verify(const QString &projFile, const IGisProject &proj)
{
expectedGisProject exp = TestHelper::readExpProj(fileToPath(projFile) + ".xml");
verify(exp, proj);
}
void test_QMapShack::verify(const QString &projFile)
{
IGisProject *proj = readProjFile(projFile);
expectedGisProject exp = TestHelper::readExpProj(fileToPath(projFile) + ".xml");
verify(exp, *proj);
delete proj;
}
QString test_QMapShack::fileToPath(const QString &file)
{
if(!QFileInfo(file).exists())
{
return testInput + "/" + file.right(3) + "/" + file;
}
return file;
}
IGisProject* test_QMapShack::readProjFile(const QString &file, bool valid, bool forceVerify)
{
IGisProject *proj = nullptr;
try
{
if(file.endsWith(".gpx"))
{
CGpxProject *gpxProj = new CGpxProject("a very random string to prevent loading via constructor", (CGisListWks*) nullptr);
gpxProj->blockUpdateItems(true);
CGpxProject::loadGpx(fileToPath(file), gpxProj);
gpxProj->blockUpdateItems(false);
proj = gpxProj;
SUBVERIFY(IGisProject::eTypeGpx == proj->getType(), "Project has invalid type");
}
else if(file.endsWith(".qms"))
{
proj = new CQmsProject(fileToPath(file), (CGisListWks*) nullptr);
SUBVERIFY(IGisProject::eTypeQms == proj->getType(), "Project has invalid type");
}
else if(file.endsWith(".slf"))
{
CSlfProject *slfProj = new CSlfProject("a very random string to prevent loading via constructor", false);
proj = slfProj;
CSlfReader::readFile(fileToPath(file), slfProj);
SUBVERIFY(IGisProject::eTypeSlf == proj->getType(), "Project has invalid type");
}
else if(file.endsWith(".fit"))
{
proj = new CFitProject(fileToPath(file), (CGisListWks*) nullptr);
SUBVERIFY(IGisProject::eTypeFit == proj->getType(), "Project has invalid type");
}
else
{
SUBVERIFY(false, "Internal error: Can't read project file `" + file + "`");
}
}
catch(QString &errormsg)
{
SUBVERIFY(!valid, "Expected `" + file + "` to be valid, error while reading: " + errormsg);
delete proj;
proj = nullptr;
}
SUBVERIFY(valid || nullptr == proj, "File is neither valid, nor an exception was thrown");
if(nullptr != proj)
{
const QString &projPath = fileToPath(file);
SUBVERIFY(QFile(projPath + ".xml").exists() || !forceVerify, "Can't verify file `" + file + "`, .xml does not exist");
if(QFile(projPath + ".xml").exists())
{
verify(file, *proj);
}
}
return proj;
}
QTEST_MAIN(test_QMapShack)
qmapshack-1.10.0/test/unittest/CQmsProject.cpp 000644 001750 000144 00000003326 12727447634 022502 0 ustar 00oeichlerx users 000000 000000 /**********************************************************************************************
Copyright (C) 2016 Christian Eichler code@christian-eichler.de
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see .
**********************************************************************************************/
#include
#include "TestHelper.h"
#include "test_QMapShack.h"
#include "gis/gpx/CGpxProject.h"
#include "gis/qms/CQmsProject.h"
void test_QMapShack::_readQmsFile_1_6_0()
{
IGisProject *proj1 = readProjFile("V1.6.0_file1.qms");
verify("V1.6.0_file1.qms", *proj1);
delete proj1;
IGisProject *proj2 = readProjFile("V1.6.0_file2.qms");
verify("V1.6.0_file2.qms", *proj2);
delete proj2;
}
void test_QMapShack::_writeReadQmsFile()
{
for(const QString &file : inputFiles)
{
IGisProject *proj = readProjFile(file);
QString tmpFile = TestHelper::getTempFileName("qms");
CQmsProject::saveAs(tmpFile, *proj);
delete proj;
proj = readProjFile(tmpFile, true, false);
verify(file, *proj);
delete proj;
QFile(tmpFile).remove();
}
}
qmapshack-1.10.0/test/unittest/CSlfReader.cpp 000644 001750 000144 00000002231 12727447634 022254 0 ustar 00oeichlerx users 000000 000000 /**********************************************************************************************
Copyright (C) 2015 Christian Eichler code@christian-eichler.de
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see .
**********************************************************************************************/
#include "test_QMapShack.h"
#include "gis/prj/IGisProject.h"
void test_QMapShack::_readValidSLFFile()
{
verify("qtt_slf_file0.slf");
}
void test_QMapShack::_readNonExistingSLFFile()
{
delete readProjFile("qtt_slf_DOES_NOT_EXIST.slf", false, false);
}
qmapshack-1.10.0/test/OSX_uitest/ 000755 001750 000144 00000000000 13216664442 017757 5 ustar 00oeichlerx users 000000 000000 qmapshack-1.10.0/test/OSX_uitest/suite.py 000755 001750 000144 00000003417 12727447634 021502 0 ustar 00oeichlerx users 000000 000000 #!/usr/bin/python
# -*- coding: utf-8 -*-
"""
/**********************************************************************************************
Copyright (C) 2016 Ivo Kronenberg
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see .
**********************************************************************************************/
"""
from testtools import ToolsTestCase
from testroute import RouteTestCase
from testdatabase import DatabaseTestCase
from testmaps import MapsTestCase
from qmstestcase import *
class TestTest(QmsTestCase):
def __init__(self, methodName):
QmsTestCase.__init__(self, methodName)
def testT(self):
t = MapsTestCase('testLoadDem')
t.getAppHandle()
t.testLoadDem()
t.testLoadMaps()
def suite():
t = unittest.TestSuite()
t.addTest(TestTest('testT'))
#return t
suiteMaps = MapsTestCase.suite()
suiteDatbase = DatabaseTestCase.suite()
suiteRoute = RouteTestCase.suite()
suiteToos = ToolsTestCase.suite()
alltests = unittest.TestSuite([suiteMaps, suiteDatbase, suiteRoute, suiteToos])
#alltests = unittest.TestSuite([suiteMaps, suiteRoute])
#return suiteRoute
return alltests
unittest.TextTestRunner(verbosity=2).run(suite())
qmapshack-1.10.0/test/OSX_uitest/uitest.cfg 000644 001750 000144 00000000506 12727447634 021766 0 ustar 00oeichlerx users 000000 000000 [directory]
out.test.dir=/data/GPS/out
vrt.out.file=test.vrt
routing.out.file=test
cache.dir=
dem.dir.ch=/data/GPS/Relief/L32
dem.dir=/data/GPS/Relief
dem.name=l32 ch
map.dir=/data/GPS/Karten
map.name=raumbezug ch
pbf.dir.ch=/data/GPS/Routing
pdf.file.ch=switzerland-latest.osm.pbf
mem.dir.ch=/data/GPS/Routing
[flow]
wait=1.0 qmapshack-1.10.0/test/OSX_uitest/testroute.py 000644 001750 000144 00000016520 12727447634 022403 0 ustar 00oeichlerx users 000000 000000 #!/usr/bin/python
# -*- coding: utf-8 -*-
"""
/**********************************************************************************************
Copyright (C) 2016 Ivo Kronenberg
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see .
**********************************************************************************************/
"""
from qmstestcase import *
class RouteTestCase(QmsTestCase):
def __init__(self, methodName):
QmsTestCase.__init__(self, methodName)
def testConfigRoutino(self):
self.showRoute()
# first dropdown Routino (offline)
res = self.appWin().find('AXPopUpButton').selectPopupElement('Routino (offline)')
self.assertTrue(res, 'set routino popup button failed')
routeButton = self.app.findAllR('AXRadioButton', 'Route')[0]
groups = self.appWin().findAll('AXGroup', '')
group = self._findNeighbour(groups, routeButton)
# setup database
group.find('AXButton', '...').click()
dlgRoutinoDb = self.app.find('AXWindow')
pathes = dlgRoutinoDb.find('AXList').findAll('AXStaticText')
routinoPath = config.get('directory', 'mem.dir.ch')
routinoPathAdded = False
for path in pathes:
if path.getText() == routinoPath:
routinoPathAdded = True
logger.info('routino path ' + routinoPath + ' already added')
break
if routinoPathAdded == False:
logger.info('adding routino path ' + routinoPath)
dlgRoutinoDb.find('AXButton', '...').click()
res = self.safeDirectoryDlg(routinoPath)
self.assertTrue(res, 'set directory dialog failed')
dlgRoutinoDb.find('AXGroup').find('AXButton', 'OK').click()
# the group for the Routino Route settings
dropdowns = group.findAll('AXPopUpButton')
for dropdown in dropdowns:
dropdown.selectPopupElement('Fahrrad')
dropdown.selectPopupElement('Deutsch')
dropdown.selectPopupElement('Schnellste')
dropdown.selectPopupElement('Europa')
dropdown.selectPopupElement('Switzerland')
def testSearchGoogle(self):
# --> search google
self.showDaten()
town = 'Grindelwald'
grid = self.datenProjectGrid()
if len(grid) < 2 or grid[1].getText() <> '':
# click menu
self.app.selectMenuItem('Projekt', 'Mit Google suchen')
googleInput = self.datenProjectGrid()[1]
else:
googleInput = grid[1]
googleInput.click()
waitShort()
self.app.sendKey("a", [COMMAND])
self.app.sendSingleKey(BACKSPACE)
self.app.sendKey(town)
self.app.sendSingleKey(RETURN)
#self.app.sendKey('\n')
waitShort()
resultTown = self.datenProjectGrid()[3]
self.assertRegexpMatches(resultTown.getText(), town)
resultTown.doubleClick()
waitShort()
map = self.mapArea()
map.click()
waitShort()
# --> position in status bar
coordField = self.appWin().find('AXStaticText').find('AXStaticText')
logger.debug(unicode(coordField.getText()).encode('utf8'))
self.assertRegexpMatches(coordField.getText(), u'N46\xb0 37.\d{3} E008\xb0 02.\d{3}')
# \xb0 °
map.click()
def testRoute(self):
# relies on testSearchGoogle
#self.startApp()
self.showMaps()
# --> routing with routino
# click to center of map, where the searched place is
map = self.mapArea()
map.click()
waitShort()
# auto routing
self.app.sendKey('a', [CONTROL])
waitShort()
map.selectPopupMenu(2)
waitShort()
map.moveAndClick(10, 112)
waitShort()
map.click()
waitShort()
map.clickRight()
text = map.find('AXStaticText', 'Track*')
self.assertTrue(text.valid())
logger.debug(unicode(text.getText()).encode('utf8'))
self.assertRegexpMatches(text.getText(), "35\d m")
def testSaveRoute(self):
projName='uitest'
# --> save route
map = self.mapArea()
map.find('AXButton', 'Als neu speichern').click()
#map.find('AXButton', 'Abbrechen').click()
projDlg = self.app.find('AXWindow', u'Ein Projekt auswählen...')
self.assertTrue(projDlg.valid())
# FIXME here is a bug in the GUI
#projDlg.find('AXList').findAll('AXStaticText')[0].click()
#projDlg.find('AXTextField').click()
self.app.sendSingleKey(TAB)
self.app.sendKey('uitest')
# *.qms, *.gpx, Datenbank
projDlg.find('AXRadioButton', '*.gpx').click()
projDlg.find('AXGroup').find('AXButton', 'OK').click()
nameDlg = self.app.find('AXWindow', u'Name bearbeiten...')
self.assertTrue(nameDlg.valid())
# FIXME here is a bug in the GUI
#nameDlg.find('AXTextField').click()
self.app.sendKey(projName)
nameDlg.find('AXGroup').find('AXButton', 'OK').click()
waitShort()
self.showDaten()
# somehow the app reference has been lost, get it again
self.getAppHandle()
grid = self.datenProjectGrid(projName)
self.assertIs(len(grid), 1)
grid[0].doubleClick()
grid = self.datenProjectGrid(projName)
self.assertIs(len(grid), 2)
grid[1].clickRight()
grid[1].selectPopupMenu(1)
buttonView = self.appWin().findR('AXRadioButton', projName)
groups = self.appWin().findAll('AXGroup', '')
detailView = self._findNeighbour(groups, buttonView, Direction.below).find('AXSplitGroup')
detailView.findAll('AXGroup')[1].find('AXRadioButton', 'Punkte').click()
table = detailView.findAll('AXGroup')[0].find('AXGroup').findAll('AXGroup')
# 10 columns per row
self.assertEqual(table[2].getText(), '1045 m')
# the next lines are for a route
if False:
trkDlg = self.app.find('AXWindow', projName)
self.assertTrue(trkDlg.valid())
self.assertEqual(trkDlg.find('AXGroup').find('AXTextField').getText(), projName)
# close dialog
trkDlg.find('AXButton').click()
# close track
grid[0].selectPopupMenu(8)
waitShort()
questionDlg = self.app.find('AXWindow', '')
questionDlg.find('AXGroup').find('AXButton', 'Nein').click()
def testEditRoute(self):
# TODO
pass
@staticmethod
def suite():
suite = unittest.TestSuite()
suite.addTest(RouteTestCase('testConfigRoutino'))
suite.addTest(RouteTestCase('testSearchGoogle'))
suite.addTest(RouteTestCase('testRoute'))
suite.addTest(RouteTestCase('testSaveRoute'))
suite.addTest(RouteTestCase('testEditRoute'))
return suite qmapshack-1.10.0/test/OSX_uitest/qmstestcase.py 000644 001750 000144 00000020066 12727447634 022701 0 ustar 00oeichlerx users 000000 000000 #!/usr/bin/python
# -*- coding: utf-8 -*-
"""
/**********************************************************************************************
Copyright (C) 2016 Ivo Kronenberg
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see .
**********************************************************************************************/
"""
from uiautomator import *
import unittest
import os
dirCache = os.path.expanduser("~") + "/.QMapShack/"
class Direction:
above, below, left, right = range(1, 5)
class EntryList:
def __init__(self, app):
self.app = app
def grid(self, name=None): pass
def showList(self): pass
def focusList(self): pass
def _isEntryActivated(self, entry, name):
entry.click()
self.app.sendSingleKey(DOWN)
self.app.sendSingleKey(UP)
self.app.sendSingleKey(RIGHT)
waitShort()
# check if map has not bean activated before
g = self.grid()
activated = False
i = 0
posEntry = -2
while i < len(g):
e = g[i]
if e.getText() == name:
posEntry = i
if e.getText() == '' and posEntry == i - 1:
activated = True
break
i += 1
return activated
def _findEntry(self, name):
entry = None
firstChar=name[0]
# break for infinite loop
b = 0
while (entry is None) or (b < 15):
b = b + 1
self.app.sendKey(firstChar)
grid = self.grid(name)
if len(grid) > 0:
entry = grid[0]
break
return entry
def activateEntry(self, name, activate=True):
self.showList()
self.focusList()
entry = self._findEntry(name)
if entry is None:
return False
# check if map has not bean activated before
activated = self._isEntryActivated(entry, name)
logger.info('entry ' + name + ' is activated ' + str(activated))
entry.click()
if (not activate and activated) or (activate and not activated):
logger.debug('popup 1')
entry.selectPopupMenu(1)
if activate and activated:
logger.debug('popup 2')
entry.selectPopupMenu(1)
# map will be reorder after deactivate, thus search it again
entry = self._findEntry(name)
# if map has already been activated, make sure tiles will be loaded again
logger.debug('popup 3')
entry.selectPopupMenu(1)
return True
class MapList(EntryList):
def __init__(self, gui):
EntryList.__init__(self, gui.app)
self.gui = gui
def grid(self, name=None):
return self.gui.mapGrid(name)
def showList(self):
self.gui.showMaps()
def focusList(self):
self.gui.focusMapGrid()
class DemList(EntryList):
def __init__(self, gui):
EntryList.__init__(self, gui.app)
self.gui = gui
def grid(self, name=None):
return self.gui.demGrid(name)
def showList(self):
self.gui.showDem()
def focusList(self):
self.gui.focusDemGrid()
class QmsGui(UIAutomator):
def __init__(self):
UIAutomator.__init__(self)
def showRoute(self):
self.app.findR('AXRadioButton', 'Route', False).click()
waitShort()
def showDaten(self):
self.app.findR('AXRadioButton', 'Daten', False).click()
waitShort()
def showMaps(self):
self.app.findR('AXRadioButton', 'Karten', False).click()
waitShort()
def showDem(self):
self.app.findR('AXRadioButton', u'Dig. Höhenmodell (DEM)', False).click()
waitShort()
def datenProjectGrid(self, match = None):
return self.appWin().findAll('AXSplitGroup')[0].findAll('AXGroup')[1].findAll('AXGroup', match)
def datenDbGrid(self, match = None):
return self.appWin().findAll('AXSplitGroup')[0].findAll('AXGroup')[0].findAll('AXGroup', match)
def _findNeighbour(self, elements, beside, direction=Direction.above):
x, y = beside.ax.AXPosition
w, h = beside.ax.AXSize
threshold = 10
for e in elements:
if e.valid() and e.visible():
gx, gy = e.ax.AXPosition
gw, gh = e.ax.AXSize
# TODO add left / right aspect
if direction == Direction.above:
if (gh + gy + threshold > y) and (gh + gy - threshold < y):
return e
if direction == Direction.below:
if (gy + threshold > y + h) and (gy - threshold < y + h):
return e
def _anyElementOf(self, elements, types):
if not isinstance(elements, list):
elements = [elements]
if not isinstance(types, list):
types = [types]
for element in elements:
if element.ax.AXRole in types:
return True
return False
def mapGrid(self, match = None):
mapButton = self.app.findR('AXRadioButton', 'Karten', False)
groups = self.appWin().findAll('AXGroup', '', False)
group = self._findNeighbour(groups, mapButton)
return group.findAll('AXGroup')[0].findAll('AXGroup', match)
#return self.appWin().findAll('AXGroup', '')[1].findAll('AXGroup')[0].findAll('AXGroup', match)
def focusMapGrid(self):
self.mapGrid()[0].parent().click()
#self.appWin().findAll('AXGroup', '')[1].findAll('AXGroup')[0].click()
def demGrid(self, match = None):
demButton = self.app.findR('AXRadioButton', u'Dig. Höhenmodell (DEM)', False)
groups = self.appWin().findAll('AXGroup', '', False)
group = self._findNeighbour(groups, demButton)
return group.find('AXGroup').findAll('AXGroup', match)
def focusDemGrid(self):
self.demGrid()[0].parent().click()
def mapArea(self):
groups = self.appWin(True).findAll('AXGroup', '', True)
mapGroup = None
for group in groups:
if group.valid() and group.visible():
children = group.children()
if len(children) == 0 or not self._anyElementOf(children, ['AXGroup', 'AXSplitGroup', 'AXPopUpButton']):
mapGroup = group
break
#UIAutomator.debug(mapGroup, 1)
return mapGroup
def selectMap(self, name, activate=True):
return MapList(self).activateEntry(name, activate)
def selectDem(self, name, activate=True):
return DemList(self).activateEntry(name, activate)
class QmsTestCase(QmsGui, unittest.TestCase):
def __init__(self, methodName):
QmsGui.__init__(self)
unittest.TestCase.__init__(self, methodName)
def _cleanDir(self, dirPath):
try:
if os.path.isdir(dirPath):
fileList = os.listdir(dirPath)
[ os.remove(os.path.abspath(os.path.join(dirPath,fileName))) for fileName in fileList ]
except OSError:
pass
def _cleanFiles(self):
try:
os.remove(config.get('directory', 'out.test.dir') + "/" + config.get('directory', 'vrt.out.file'))
except OSError:
pass
self._cleanDir(dirCache+'WorldSat')
self._cleanDir(dirCache+'OSM')
self._cleanDir(dirCache+'OSM_Topo')
self._cleanDir(config.get('directory', 'out.test.dir'))
def setUp(self):
self._cleanFiles()
res = self.getAppHandle()
self.assertTrue(res)
self._cleanFiles()
def tearDown(self):
pass
qmapshack-1.10.0/test/OSX_uitest/testtools.py 000644 001750 000144 00000007346 12727447634 022413 0 ustar 00oeichlerx users 000000 000000 #!/usr/bin/python
# -*- coding: utf-8 -*-
"""
/**********************************************************************************************
Copyright (C) 2016 Ivo Kronenberg
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see .
**********************************************************************************************/
"""
from qmstestcase import *
class ToolsTestCase(QmsTestCase):
def __init__(self, methodName):
QmsTestCase.__init__(self, methodName)
def testVrtBuilder(self):
self.app.selectMenuItem('Werkzeug', 'VRT Builder')
group = self.app.findR('AXStaticText', 'Quelldateien*').parent()
group.findAll('AXButton', '...')[0].click()
res = self.openFileDlg(config.get('directory', 'dem.dir.ch'))
self.assertTrue(res)
group.findAll('AXButton', '...')[1].click()
res = self.safeFileDlg(config.get('directory', 'out.test.dir') , config.get('directory', 'vrt.out.file'))
self.assertTrue(res)
group.find('AXButton', 'Start').click()
wait(1.0)
group = self.app.findR('AXStaticText', 'Quelldateien*').parent()
# test result
resultField = group.find('AXStaticText', '')
resultField.click()
self.app.sendKey('a', [COMMAND])
self.assertRegexpMatches(resultField.ax.AXSelectedText, '0...10...20...30...40...50...60...70...80...90...100 - done')
self.assertTrue(os.path.isfile(config.get('directory', 'out.test.dir') + '/' + config.get('directory', 'vrt.out.file')))
def testRoutinoDatabaseBuilder(self):
self.app.selectMenuItem('Werkzeug', 'Routino Datenbank erstellen')
group = self.app.findR('AXStaticText', 'Quelldateien*').parent()
group.findAll('AXButton', '...')[0].click()
res = self.openFileDlg(config.get('directory', 'pbf.dir.ch'), config.get('directory', 'pdf.file.ch'))
self.assertTrue(res)
group.findAll('AXButton', '...')[1].click()
res = self.safeDirectoryDlg(config.get('directory', 'out.test.dir'))
self.assertTrue(res)
# FIXME here is a bug in the GUI
group.find('AXStaticText', '').click()
self.app.sendSingleKey(TAB)
self.app.sendKey(config.get('directory', 'routing.out.file'))
waitShort()
group.find('AXButton', 'Starten').click()
i = 1
text = None
while i < 15:
i = i + 1
wait(10)
group = self.app.findR('AXStaticText', 'Quelldateien*').parent()
# test result
resultField = group.find('AXStaticText', '')
resultField.click()
self.app.sendKey('a', [COMMAND])
text = resultField.ax.AXSelectedText
if text.endswith('!!! erledigt !!!'): break
self.assertRegexpMatches(text, '!!! erledigt !!!')
file = config.get('directory', 'out.test.dir') + '/' + config.get('directory', 'routing.out.file')+ "-nodes.mem"
self.assertTrue(os.path.isfile(file), file + " not fould")
@staticmethod
def suite():
suite = unittest.TestSuite()
suite.addTest(ToolsTestCase('testVrtBuilder'))
suite.addTest(ToolsTestCase('testRoutinoDatabaseBuilder'))
return suite qmapshack-1.10.0/test/OSX_uitest/testdatabase.py 000644 001750 000144 00000003440 12727447634 023006 0 ustar 00oeichlerx users 000000 000000 #!/usr/bin/python
# -*- coding: utf-8 -*-
"""
/**********************************************************************************************
Copyright (C) 2016 Ivo Kronenberg
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see .
**********************************************************************************************/
"""
from qmstestcase import *
class DatabaseTestCase(QmsTestCase):
def __init__(self, methodName):
QmsTestCase.__init__(self, methodName)
def testConfigDatabase(self):
self.showDaten()
dbGroup = self.appWin().findAll('AXSplitGroup')[0].findAll('AXGroup')[0]
# for the case an already existing db has been selected
dbGroup.click()
dbGroup.clickRight()
waitShort()
self.app.findAllR('AXMenu', '')[0].click()
waitShort()
dlg = self.app.find('AXWindow', 'Datenbank*')
self.assertEqual(dlg.getText(), u'Datenbank hinzufügen...')
# TODO configure
#dlg.find('AXGroup').find('AXButton', 'OK').click()
dlg.find('AXGroup').find('AXButton', 'Abbrechen').click()
@staticmethod
def suite():
suite = unittest.TestSuite()
suite.addTest(DatabaseTestCase('testConfigDatabase'))
return suite qmapshack-1.10.0/test/OSX_uitest/testmaps.py 000644 001750 000144 00000007365 12727447634 022214 0 ustar 00oeichlerx users 000000 000000 #!/usr/bin/python
# -*- coding: utf-8 -*-
"""
/**********************************************************************************************
Copyright (C) 2016 Ivo Kronenberg
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see .
**********************************************************************************************/
"""
from qmstestcase import *
import datetime
class MapsTestCase(QmsTestCase):
def __init__(self, methodName):
QmsTestCase.__init__(self, methodName)
def testLoadDem(self):
dirDem = config.get('directory', 'dem.dir')
self.app.selectMenuItem('Datei', 'DEM Verzeichnisse angeben')
demPathDlg = self.app.find('AXWindow', u'Pfad für DEM Dateien setzen')
pathes = demPathDlg.find('AXList').findAll('AXStaticText')
mapThere = False
for path in pathes:
if path.getText() == dirDem:
mapThere = True
if mapThere == False:
demPathDlg.findAll('AXButton', '...')[0].click()
waitShort()
self.safeDirectoryDlg(dirDem)
waitShort()
self.assertTrue(demPathDlg.find('AXList').find('AXStaticText', dirDem).valid())
demPathDlg.find('AXGroup').find('AXButton', 'OK').click()
waitShort()
self.getAppHandle()
# activate map
demName = config.get('directory', 'dem.name')
res = self.selectDem(demName, True)
self.assertTrue(res)
def testLoadMaps(self):
mapDir = config.get('directory', 'map.dir')
self.app.selectMenuItem('Datei', 'Kartenverzeichnisse angeben')
mapPathDlg = self.app.find('AXWindow', 'Kartenpfad einrichten')
pathes = mapPathDlg.find('AXList').findAll('AXStaticText')
mapThere = False
for path in pathes:
if path.getText() == mapDir:
mapThere = True
if mapThere == False:
mapPathDlg.findAll('AXButton', '...')[1].click()
self.safeDirectoryDlg(mapDir)
waitShort()
self.assertTrue(mapPathDlg.find('AXList').find('AXStaticText', mapDir).valid())
mapPathDlg.find('AXGroup').find('AXButton', 'OK').click()
waitShort()
self.getAppHandle()
# activate map
mapName = config.get('directory', 'map.name')
res = self.selectMap(mapName, True)
self.assertTrue(res)
def testOnlineMap(self):
type = 'OSM'
self.selectMap('OSM', True)
# check downloaded tiles
dateCreated = datetime.datetime.now() - datetime.timedelta(minutes=1)
dirPath = dirCache+type
tiles = 0
wait(3.0)
fileList = os.listdir(dirPath)
for fileName in fileList:
t = os.path.getmtime(os.path.abspath(os.path.join(dirPath,fileName)))
dateFile = datetime.datetime.fromtimestamp(t)
if dateCreated < dateFile:
tiles = tiles + 1
self.assertTrue(tiles > 8, 'only %s tiles found' % tiles)
@staticmethod
def suite():
suite = unittest.TestSuite()
suite.addTest(MapsTestCase('testLoadDem'))
suite.addTest(MapsTestCase('testLoadMaps'))
suite.addTest(MapsTestCase('testOnlineMap'))
return suite
qmapshack-1.10.0/test/OSX_uitest/uiautomator.py 000644 001750 000144 00000033107 12727447634 022716 0 ustar 00oeichlerx users 000000 000000 #!/usr/bin/python
# -*- coding: utf-8 -*-
"""
/**********************************************************************************************
Copyright (C) 2016 Ivo Kronenberg
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see .
**********************************************************************************************/
"""
import atomac
import atomac.AXKeyboard as AXKeyboard
from collections import deque
import time
import logging
import ConfigParser
def initConfig():
config = ConfigParser.ConfigParser()
config.read('uitest.cfg')
return config
def initLogger():
FORMAT = '%(asctime)-15s %(message)s'
logging.basicConfig(format=FORMAT)
log = logging.getLogger('uitest')
log.setLevel(logging.INFO)
return log
logger = initLogger()
config = initConfig()
def waitShort():
time.sleep(config.getfloat('flow', 'wait'))
def wait(sec):
time.sleep(sec)
class UIBase:
def __init__(self, ax, app):
self.ax = ax
self.cache = {}
if app is None:
self.app = self
else:
self.app = app
if ax is None:
raise ReferenceError()
def _lookup(self, find, type, match, clear):
key = find + '#' + type
if match is not None:
key = key + '#' + match
logger.debug(unicode(key).encode('utf8'))
if key in self.cache:
if clear:
del self.cache[key]
return None
logger.debug('match')
return self.cache[key]
logger.debug('no match')
return None
def _put(self, element, find, type, match):
key = find + '#' + type
if match is not None:
key = key + '#' + match
self.cache[key] = element
return element
def centreCoordinates(self):
x, y = self.ax.AXPosition
width, height = self.ax.AXSize
return (x + width / 2, y + height / 2)
def valid(self):
return self.ax is not None
def enabled(self):
return self.valid() and self.ax.AXEnabled
def _measureEnter(self, method):
self.start = time.time()
self.methodname = method
def _measureLeave(self):
end = time.time()
logger.debug("exec time " + self.methodname + " " + str(end - self.start))
def find(self, type, textmatch=None, refresh=True):
self._measureEnter("find")
try:
v = self._lookup('find', type, textmatch, refresh)
if v is not None: return v
if textmatch is not None:
e = UIElement(self.ax.findFirst(AXRole=type, AXTitle=textmatch), self.app)
return self._put(e, 'find', type, textmatch)
else:
e = UIElement(self.ax.findFirst(AXRole=type), self.app)
return self._put(e, 'find', type, textmatch)
finally:
self._measureLeave()
def findNr(self, type, textmatch, nr, refresh=True):
return self.findAll(type, textmatch, refresh)[nr]
def findAll(self, type, textmatch=None, refresh=True):
self._measureEnter("findAll")
try:
v = self._lookup('findAll', type, textmatch, refresh)
if v is not None: return v
if textmatch is not None:
axs = self.ax.findAll(AXRole=type, AXTitle=textmatch)
else:
axs = self.ax.findAll(AXRole=type)
e = []
if axs is not None and len(axs) > 0:
for ax in axs:
e.append(UIElement(ax, self.app))
return self._put(e, 'findAll', type, textmatch)
finally:
self._measureLeave()
def findAllR(self, type, textmatch=None, refresh=True):
self._measureEnter("findAllR")
try:
v = self._lookup('findAllR', type, textmatch, refresh)
if v is not None: return v
if textmatch is not None:
axs = self.ax.findAllR(AXRole=type, AXTitle=textmatch)
else:
axs = self.ax.findAllR(AXRole=type)
e = []
if axs is not None and len(axs) > 0:
for ax in axs:
e.append(UIElement(ax, self.app))
return self._put(e, 'findAllR', type, textmatch)
finally:
self._measureLeave()
def findR(self, type, textmatch=None, refresh=True):
self._measureEnter("findR")
try:
v = self._lookup('findR', type, textmatch, refresh)
if v is not None: return v
if textmatch is not None:
e = UIElement(self.ax.findFirstR(AXRole=type, AXTitle=textmatch), self.app)
return self._put(e, 'findR', type, textmatch)
else:
e = UIElement(self.ax.findFirstR(AXRole=type), self.app)
return self._put(e, 'findR', type, textmatch)
finally:
self._measureLeave()
def parent(self):
return UIElement(self.ax.AXParent, self.app)
def children(self):
e = []
axs = self.ax.AXChildren
if axs is not None and len(axs) > 0:
for ax in axs:
e.append(UIElement(ax, self.app))
return e
def visible(self):
x, y = self.ax.AXPosition
return x >= 0 and y >= 0
# Special keys
TAB = ''
RETURN = ''
ESCAPE = ''
CAPS_LOCK = ''
DELETE = ''
NUM_LOCK = ''
SCROLL_LOCK = ''
PAUSE = ''
BACKSPACE = ''
INSERT = ''
# Cursor movement
UP = ''
DOWN = ''
LEFT = ''
RIGHT = ''
PAGE_UP = ''
PAGE_DOWN = ''
HOME = ''
END = ''
# Modifier keys
COMMAND_L = ''
SHIFT_L = ''
OPTION_L = ''
CONTROL_L = ''
COMMAND_R = ''
SHIFT_R = ''
OPTION_R = ''
CONTROL_R = ''
# Default modifier keys -> left:
COMMAND = COMMAND_L
SHIFT = SHIFT_L
OPTION = OPTION_L
CONTROL = CONTROL_L
class KeyboardHandler (UIBase):
def __init__(self, ax, app):
UIBase.__init__(self, ax, app)
def _replace(self, str):
return str.replace(u'ö', '\xd6')
def sendKey(self, key, modifiers = []):
if len(modifiers) == 0:
self.app.ax.sendKeys(key)
else:
self.app.ax.sendKeyWithModifiers(key, modifiers)
def sendSingleKey(self, key):
self.app.ax.sendKey(key)
class MouseHandler(UIBase):
def __init__(self, ax, app):
UIBase.__init__(self, ax, app)
self.dx = 0
self.dy = 0
def _coordinates(self):
(x, y) = self.centreCoordinates()
return (x+self.dx, y+self.dy)
def click(self):
#self.ax.Press()
self.app.ax.clickMouseButtonLeft(self._coordinates())
def doubleClick(self):
self.app.ax.doubleClickMouse(self._coordinates())
def clickRight(self):
self.app.ax.clickMouseButtonRight(self._coordinates())
def moveAndClick(self, dx, dy):
self.dx = dx
self.dy = dy
self.app.ax.clickMouseButtonLeft(self._coordinates())
class UIElement(UIBase, MouseHandler):
def __init__(self, ax, app):
UIBase.__init__(self, ax, app)
MouseHandler.__init__(self, ax, app)
def setValue(self, value):
self.ax.AXValue = value
def getText(self):
if self.ax.AXValue is not None:
return self.ax.AXValue
return self.ax.AXTitle
def selectPopupElement(self, title):
langElements = self.find('AXList').findAll('AXStaticText', title)
if len(langElements) == 1:
self.click()
waitShort()
langElements[0].click()
return True
return False
def selectPopupMenu(self, nr):
self.clickRight()
waitShort()
i = 0
while i < nr:
self.app.sendSingleKey(DOWN)
i = i + 1
self.app.sendSingleKey(RETURN)
class UIApp(UIElement, KeyboardHandler):
def __init__(self, app):
UIElement.__init__(self, app, None)
KeyboardHandler.__init__(self, app, None)
# bugfixes for event queue
self.app.keyboard = AXKeyboard.loadKeyboard()
self.app.eventList = deque()
@staticmethod
def getApp(bundleName):
ax = None
try:
ax = atomac.getAppRefByBundleId(bundleName)
except ValueError:
ax = atomac.launchAppByBundleId(bundleName)
if ax is None:
ax = atomac.getAppRefByBundleId(bundleName)
while ax.AXTitle is None:
ax = atomac.getAppRefByBundleId(bundleName)
ax.activate()
return UIApp(ax)
def selectMenuItem(self, menuText, menuItemText):
# AXMenuBar -> AXMenuBarItem -> AXMenu -> AXMenuItem
menu = self.app.ax.AXMenuBar.findFirst(AXRole='AXMenuBarItem', AXTitle=menuText)
menuitem = menu.findFirstR(AXRole='AXMenuItem', AXTitle=menuItemText)
menu.Press()
menuitem.Press()
class UIAutomator:
def __init__(self):
self.app = None
self.appName = 'QMapShack*'
self.bundleId = 'org.qlandkarte.QMapShack'
def appWin(self, reload=False):
return self.app.find('AXWindow', None, reload)
def openFileDlg(self, dirname, filename=None):
fileDlg = self.app.find('AXWindow', 'Dateien*')
if fileDlg.valid() == False:
return False
# input for directory
self.app.sendKey('7', [SHIFT]) # /
waitShort()
dirInput = fileDlg.find('AXSheet')
dirInput.find('AXTextField').setValue(dirname)
waitShort()
dirInput.findNr('AXButton', None, 1).click()
# select file
subelement = fileDlg.find('AXGroup').find('AXSplitGroup').find('AXSplitGroup').find('AXScrollArea').find('AXOutline')
files = subelement.findAllR('AXTextField')
found = False
if filename is not None:
for f in files:
if f.ax.AXFilename == filename:
f.click()
break
if found == False:
files[0].click()
# open
fileDlg.find('AXButton', '\xd6ffnen').click()
waitShort()
return True
def safeFileDlg(self, dirname, filename = None):
fileDlg = self.app.find('AXWindow', 'Zieldatei*')
if fileDlg.valid() == False:
return False
# input for directory
self.app.sendKey('7', [SHIFT])
waitShort()
dirInput = fileDlg.find('AXSheet')
dirInput.find('AXTextField').setValue(dirname)
self.app.sendKey('\n')
waitShort()
# set filename
fileDlg.find('AXTextField').setValue(filename)
waitShort()
fileDlg.find('AXButton', 'Sichern').click()
waitShort()
return True
def safeDirectoryDlg(self, dirname):
# 'Zielpfad*'
fileDlg = self.app.find('AXWindow')
if fileDlg.valid() == False:
return False
# input for directory
self.app.sendKey('7', [SHIFT])
waitShort()
dirInput = fileDlg.find('AXSheet')
dirInput.find('AXTextField').setValue(dirname)
self.app.sendKey('\n')
waitShort()
fileDlg.find('AXButton', u'Öffnen').click()
waitShort()
return True
def getAppHandle(self):
self.app = UIApp.getApp(self.bundleId)
return self.app.valid()
def closeApp(self):
self.app.sendKey('q', [COMMAND])
# TODO assert
return True
@staticmethod
def debug(element, depth=1, nr=0, inv=0, typeMap=None):
if depth <= inv and depth > 0:
return
if element is None:
print "None element"
elif isinstance(element, list):
i = 0
ctypeMap = {}
for e in element:
UIAutomator.debug(e, depth, i, inv, ctypeMap)
i = i+1
else:
if typeMap is None: typeMap = {}
type = element.ax.AXRole
tcount = 0
if type in typeMap:
tcount = tcount + typeMap[type]
typeMap[type] = tcount
pre = "".ljust(inv*4)
print pre + str(nr) + " (" + str(typeMap[type]) +") " + str(element.ax)
print pre +" attributes " + str(element.ax.getAttributes())
print pre +" actions: " + str(element.ax.getActions())
print pre +" Pos / Size: " + str(element.ax.AXPosition) + " " + str(element.ax.AXSize)
print pre +" parent: "+ str(element.parent().ax)
print pre +" children: "
if element.ax.AXChildren is not None:
c = 0
cinv = inv+1
ctypeMap = {}
for child in element.ax.AXChildren:
UIAutomator.debug(UIElement(child, element.app), depth, c, cinv, ctypeMap)
c = c + 1
qmapshack-1.10.0/mkfile 000755 001750 000144 00000001464 12540525371 016130 0 ustar 00oeichlerx users 000000 000000 #!/usr/bin/python
import sys
import os
if len(sys.argv) != 2:
print "bad number of arguments"
sys.exit(-1)
path = sys.argv[0][:-6]
fn = sys.argv[1]
if os.path.exists(fn):
print "file already exists."
sys.exit(-1)
pathTemplates = os.path.join(path, "templates")
name, ext = os.path.splitext(fn)
if ext == ".h":
template = os.path.join(pathTemplates, "header.h")
elif ext == ".cpp":
template = os.path.join(pathTemplates, "source.cpp")
elif ext == ".c":
template = os.path.join(pathTemplates, "source.c")
else:
print "unknown file type"
sys.exit(-1)
fid = file(template,"r")
text = fid.read()
fid.close()
text = text.replace("CLASSNAME_H", name.upper() + "_H")
text = text.replace("CLASSNAME", name)
fid = file(fn,"w")
fid.write(text)
fid.close()
qmapshack-1.10.0/cmake/ 000755 001750 000144 00000000000 13216664442 016012 5 ustar 00oeichlerx users 000000 000000 qmapshack-1.10.0/cmake/Modules/ 000755 001750 000144 00000000000 13216664442 017422 5 ustar 00oeichlerx users 000000 000000 qmapshack-1.10.0/cmake/Modules/MacroCopyFile.cmake 000644 001750 000144 00000002157 12374350216 023120 0 ustar 00oeichlerx users 000000 000000 # - macro_copy_file(_src _dst)
# Copies a file to ${_dst} only if ${_src} is different (newer) than ${_dst}
#
# Example:
# macro_copy_file(${CMAKE_CURRENT_SOURCE_DIR}/icon.png ${CMAKE_CURRENT_BINARY_DIR}/.)
# Copies file icon.png to ${CMAKE_CURRENT_BINARY_DIR} directory
#
# Copyright (c) 2006-2007 Wengo
# Copyright (c) 2006-2008 Andreas Schneider
#
# Redistribution and use is allowed according to the terms of the BSD license.
# For details see the accompanying COPYING file.
macro (macro_copy_file _src _dst)
# Removes all path containing .svn or CVS or CMakeLists.txt during the copy
if (NOT ${_src} MATCHES ".*\\.svn|CVS|CMakeLists\\.txt.*")
if (CMAKE_VERBOSE_MAKEFILE)
message(STATUS "Copy file from ${_src} to ${_dst}")
endif (CMAKE_VERBOSE_MAKEFILE)
# Creates directory if necessary
get_filename_component(_path ${_dst} PATH)
file(MAKE_DIRECTORY ${_path})
execute_process(
COMMAND
${CMAKE_COMMAND} -E copy_if_different ${_src} ${_dst}
OUTPUT_QUIET
)
endif (NOT ${_src} MATCHES ".*\\.svn|CVS|CMakeLists\\.txt.*")
endmacro (macro_copy_file)
qmapshack-1.10.0/cmake/Modules/FindALGLIB.cmake 000644 001750 000144 00000003474 13024173403 022154 0 ustar 00oeichlerx users 000000 000000 # - Try to find ALGLIB
# Once done this will define
#
# ALGLIB_FOUND - system has ALGLIB
# ALGLIB_INCLUDE_DIRS - the ALGLIB include directory
# ALGLIB_LIBRARIES - Link these to use ALGLIB
# ALGLIB_DEFINITIONS - Compiler switches required for using ALGLIB
#
# Copyright (c) 2009 Andreas Schneider
#
# Redistribution and use is allowed according to the terms of the New
# BSD license.
# For details see the accompanying COPYING-CMAKE-SCRIPTS file.
#
if (ALGLIB_LIBRARIES AND ALGLIB_INCLUDE_DIRS)
# in cache already
set(ALGLIB_FOUND TRUE)
else (ALGLIB_LIBRARIES AND ALGLIB_INCLUDE_DIRS)
find_path(ALGLIB_INCLUDE_DIR
NAMES
interpolation.h
PATHS
/usr/include
/usr/local/include
/opt/local/include
/sw/include
${CMAKE_INSTALL_PREFIX}/include
PATH_SUFFIXES
alglib
libalglib
)
mark_as_advanced(ALGLIB_INCLUDE_DIR)
find_library(ALGLIB_LIBRARY
NAMES
alglib
PATHS
/usr/lib64
/usr/lib
/usr/local/lib
/opt/local/lib
/sw/lib
${CMAKE_INSTALL_PREFIX}/lib
)
mark_as_advanced(ALGLIB_LIBRARY)
set(ALGLIB_INCLUDE_DIRS
${ALGLIB_INCLUDE_DIR}
)
set(ALGLIB_LIBRARIES
${ALGLIB_LIBRARY}
)
if (ALGLIB_INCLUDE_DIRS AND ALGLIB_LIBRARIES)
set(ALGLIB_FOUND TRUE)
endif (ALGLIB_INCLUDE_DIRS AND ALGLIB_LIBRARIES)
if (ALGLIB_FOUND)
if (NOT ALGLIB_FIND_QUIETLY)
message(STATUS "Found ALGLIB: ${ALGLIB_LIBRARIES}")
endif (NOT ALGLIB_FIND_QUIETLY)
else (ALGLIB_FOUND)
message(STATUS "Could not find ALGLIB using internal code.")
endif (ALGLIB_FOUND)
# show the PROJ_INCLUDE_DIRS and PROJ_LIBRARIES variables only in the advanced view
mark_as_advanced(ALGLIB_INCLUDE_DIRS ALGLIB_LIBRARIES)
endif (ALGLIB_LIBRARIES AND ALGLIB_INCLUDE_DIRS)
qmapshack-1.10.0/cmake/Modules/FindQuaZip.cmake 000644 001750 000144 00000005207 13066132137 022434 0 ustar 00oeichlerx users 000000 000000 # - Try to find QUAZIP
# Once done this will define
#
# QUAZIP_FOUND - system has QUAZIP
# QUAZIP_INCLUDE_DIRS - the QUAZIP include directory
# QUAZIP_LIBRARIES - Link these to use QUAZIP
# QUAZIP_DEFINITIONS - Compiler switches required for using QUAZIP
#
# Redistribution and use is allowed according to the terms of the New
# BSD license.
# For details see the accompanying COPYING-CMAKE-SCRIPTS file.
#
if (QUAZIP_LIBRARIES AND QUAZIP_INCLUDE_DIRS)
# in cache already
set(QUAZIP_FOUND TRUE)
else (QUAZIP_LIBRARIES AND QUAZIP_INCLUDE_DIRS)
find_path(QUAZIP_INCLUDE_DIR
NAMES
quazip.h
PATHS
/usr/include
/usr/local/include
/opt/local/include
/sw/include
/usr/include/quazip5
/usr/local/include/quazip5
/opt/local/include/quazip5
/usr/include/quazip
/usr/local/include/quazip
/opt/local/include/quazip
/sw/include/quazip5
${CMAKE_INSTALL_PREFIX}/include
${QUAZIP_DEV_PATH}/include/
)
mark_as_advanced(QUAZIP_INCLUDE_DIR)
IF (WIN32)
FIND_PATH(QUAZIP_ZLIB_INCLUDE_DIR NAMES zlib.h HINTS ${QT_DEV_PATH}/include/QtZlib/)
ENDIF (WIN32)
find_library(LIBQUAZIP_LIBRARY
NAMES
quazip5
PATHS
/usr/lib
/usr/local/lib
/opt/local/lib
/sw/lib
${CMAKE_INSTALL_PREFIX}/include
${QUAZIP_DEV_PATH}/lib
)
mark_as_advanced(LIBQUAZIP_LIBRARY)
if (LIBQUAZIP_LIBRARY)
set(LIBQUAZIP_FOUND TRUE)
endif (LIBQUAZIP_LIBRARY)
set(QUAZIP_INCLUDE_DIRS
${QUAZIP_INCLUDE_DIR}
IF (WIN32)
${QUAZIP_ZLIB_INCLUDE_DIR}
ENDIF (WIN32)
)
if (LIBQUAZIP_FOUND)
set(QUAZIP_LIBRARIES ${QUAZIP_LIBRARIES} ${LIBQUAZIP_LIBRARY})
endif (LIBQUAZIP_FOUND)
if (QUAZIP_INCLUDE_DIRS AND QUAZIP_LIBRARIES)
set(QUAZIP_FOUND TRUE)
endif (QUAZIP_INCLUDE_DIRS AND QUAZIP_LIBRARIES)
if (QUAZIP_FOUND)
if (NOT QUAZIP_FIND_QUIETLY)
message(STATUS "Found QUAZIP: ${QUAZIP_LIBRARIES}")
message(STATUS "Found QUAZIP: ${QUAZIP_INCLUDE_DIR}")
endif (NOT QUAZIP_FIND_QUIETLY)
else (QUAZIP_FOUND)
if (QUAZIP_FIND_REQUIRED)
message(FATAL_ERROR "Could not find QUAZIP")
endif (QUAZIP_FIND_REQUIRED)
endif (QUAZIP_FOUND)
# show the QUAZIP_INCLUDE_DIRS and QUAZIP_LIBRARIES variables only in the advanced view
mark_as_advanced(QUAZIP_INCLUDE_DIRS QUAZIP_LIBRARIES)
endif (QUAZIP_LIBRARIES AND QUAZIP_INCLUDE_DIRS)
qmapshack-1.10.0/cmake/Modules/FindEXIF.cmake 000644 001750 000144 00000003360 12374350216 021755 0 ustar 00oeichlerx users 000000 000000 # - Try to find EXIF
# Once done this will define
#
# EXIF_FOUND - system has EXIF
# EXIF_INCLUDE_DIRS - the EXIF include directory
# EXIF_LIBRARIES - Link these to use EXIF
# EXIF_DEFINITIONS - Compiler switches required for using EXIF
#
# Copyright (c) 2006 Andreas Schneider
#
# Redistribution and use is allowed according to the terms of the New
# BSD license.
# For details see the accompanying COPYING-CMAKE-SCRIPTS file.
#
if (EXIF_LIBRARIES AND EXIF_INCLUDE_DIRS)
# in cache already
set(EXIF_FOUND TRUE)
else (EXIF_LIBRARIES AND EXIF_INCLUDE_DIRS)
find_path(EXIF_INCLUDE_DIRS
NAMES
exif-data.h
PATHS
/usr/include
/usr/local/include
/opt/local/include
/sw/include
/usr/include/libexif
/usr/local/include/libexif
/opt/local/include/libexif
/sw/include/libexif
)
# debian uses version suffixes
# add suffix evey new release
find_library(EXIF_LIBRARIES
NAMES
exif
PATHS
/usr/lib
/usr/local/lib
/opt/local/lib
/sw/lib
)
if (EXIF_INCLUDE_DIRS AND EXIF_LIBRARIES)
set(EXIF_FOUND TRUE)
endif (EXIF_INCLUDE_DIRS AND EXIF_LIBRARIES)
if (EXIF_FOUND)
if (NOT EXIF_FIND_QUIETLY)
message(STATUS "Found EXIF: ${EXIF_LIBRARIES}")
endif (NOT EXIF_FIND_QUIETLY)
else (EXIF_FOUND)
if (EXIF_FIND_REQUIRED)
message(FATAL_ERROR "Could not find EXIF")
endif (EXIF_FIND_REQUIRED)
endif (EXIF_FOUND)
# show the EXIF_INCLUDE_DIRS and EXIF_LIBRARIES variables only in the advanced view
mark_as_advanced(EXIF_INCLUDE_DIRS EXIF_LIBRARIES)
endif (EXIF_LIBRARIES AND EXIF_INCLUDE_DIRS)
if (WIN32)
set(EXIF_FOUND TRUE)
set(EXIF_LIBRARIES "")
set(EXIF_INCLUDE_DIRS "")
endif (WIN32)
qmapshack-1.10.0/cmake/Modules/FindQtSoap.cmake 000644 001750 000144 00000003561 12374350216 022434 0 ustar 00oeichlerx users 000000 000000 # - Try to find QtSoap
# Once done this will define
#
# QTSOAP_FOUND - system has QTSOAP
# QTSOAP_INCLUDE_DIRS - the QTSOAP include directory
# QTSOAP_LIBRARIES - Link these to use QTSOAP
# QTSOAP_DEFINITIONS - Compiler switches required for using QTSOAP
#
# Copyright (c) 2006 Andreas Schneider
# updated for QtSoap by Dan Horák
#
# Redistribution and use is allowed according to the terms of the New
# BSD license.
# For details see the accompanying COPYING-CMAKE-SCRIPTS file.
#
if (QTSOAP_LIBRARIES AND QTSOAP_INCLUDE_DIRS)
# in cache already
set(QTSOAP_FOUND TRUE)
else (QTSOAP_LIBRARIES AND QTSOAP_INCLUDE_DIRS)
find_path(QTSOAP_INCLUDE_DIRS
NAMES
qtsoap.h
PATHS
/usr/include
/usr/local/include
/opt/local/include
/sw/include
/usr/include/QtSoap
/usr/local/include/QtSoap
/opt/local/include/QtSoap
/sw/include/QtSoap
)
# debian uses version suffixes
# add suffix evey new release
find_library(QTSOAP_LIBRARIES
NAMES
qtsoap
PATHS
/usr/lib64
/usr/lib
/usr/local/lib
/opt/local/lib
/sw/lib
)
if (QTSOAP_INCLUDE_DIRS AND QTSOAP_LIBRARIES)
set(QTSOAP_FOUND TRUE)
endif (QTSOAP_INCLUDE_DIRS AND QTSOAP_LIBRARIES)
if (QTSOAP_FOUND)
if (NOT QTSOAP_FIND_QUIETLY)
message(STATUS "Found QtSoap: ${QTSOAP_LIBRARIES}")
endif (NOT QTSOAP_FIND_QUIETLY)
else (QTSOAP_FOUND)
if (QTSOAP_FIND_REQUIRED)
message(FATAL_ERROR "Could not find QtSoap")
endif (QTSOAP_FIND_REQUIRED)
endif (QTSOAP_FOUND)
# show the QTSOAP_INCLUDE_DIRS and QTSOAP_LIBRARIES variables only in the advanced view
mark_as_advanced(QTSOAP_INCLUDE_DIRS QTSOAP_LIBRARIES)
endif (QTSOAP_LIBRARIES AND QTSOAP_INCLUDE_DIRS)
if (WIN32)
set(QTSOAP_FOUND FALSE)
set(QTSOAP_LIBRARIES "")
set(QTSOAP_INCLUDE_DIRS "")
endif (WIN32)
qmapshack-1.10.0/cmake/Modules/MacroEnsureOutOfSourceBuild.cmake 000644 001750 000144 00000001227 12374350216 025762 0 ustar 00oeichlerx users 000000 000000 # - MACRO_ENSURE_OUT_OF_SOURCE_BUILD()
# MACRO_ENSURE_OUT_OF_SOURCE_BUILD()
# Copyright (c) 2006, Alexander Neundorf,
#
# Redistribution and use is allowed according to the terms of the BSD license.
# For details see the accompanying COPYING-CMAKE-SCRIPTS file.
macro (MACRO_ENSURE_OUT_OF_SOURCE_BUILD _errorMessage)
string(COMPARE EQUAL "${CMAKE_SOURCE_DIR}" "${CMAKE_BINARY_DIR}" _insource)
if (_insource)
message(SEND_ERROR "${_errorMessage}")
message(FATAL_ERROR "Remove the file CMakeCache.txt in ${CMAKE_SOURCE_DIR} first.")
endif (_insource)
endmacro (MACRO_ENSURE_OUT_OF_SOURCE_BUILD)
qmapshack-1.10.0/cmake/Modules/DefineInstallationPaths.cmake 000644 001750 000144 00000007132 12374350216 025176 0 ustar 00oeichlerx users 000000 000000 if (UNIX)
IF (NOT APPLICATION_NAME)
MESSAGE(STATUS "${PROJECT_NAME} is used as APPLICATION_NAME")
SET(APPLICATION_NAME ${PROJECT_NAME})
ENDIF (NOT APPLICATION_NAME)
STRING(TOLOWER ${APPLICATION_NAME} _APPLICATION_NAME)
# Suffix for Linux
SET(LIB_SUFFIX
CACHE STRING "Define suffix of directory name (32/64)"
)
SET(EXEC_INSTALL_PREFIX
"${CMAKE_INSTALL_PREFIX}"
CACHE PATH "Base directory for executables and libraries"
FORCE
)
SET(SHARE_INSTALL_PREFIX
"${CMAKE_INSTALL_PREFIX}/share"
CACHE PATH "Base directory for files which go to share/"
FORCE
)
SET(DATA_INSTALL_PREFIX
"${SHARE_INSTALL_PREFIX}/"
CACHE PATH "The parent directory where applications can install their data" FORCE)
# The following are directories where stuff will be installed to
SET(BIN_INSTALL_DIR
"${EXEC_INSTALL_PREFIX}/bin"
CACHE PATH "The ${_APPLICATION_NAME} binary install dir (default prefix/bin)"
FORCE
)
SET(SBIN_INSTALL_DIR
"${EXEC_INSTALL_PREFIX}/sbin"
CACHE PATH "The ${_APPLICATION_NAME} sbin install dir (default prefix/sbin)"
FORCE
)
SET(LIB_INSTALL_DIR
"${EXEC_INSTALL_PREFIX}/lib${LIB_SUFFIX}"
CACHE PATH "The subdirectory relative to the install prefix where libraries will be installed (default is prefix/lib)"
FORCE
)
SET(LIBEXEC_INSTALL_DIR
"${EXEC_INSTALL_PREFIX}/libexec"
CACHE PATH "The subdirectory relative to the install prefix where libraries will be installed (default is prefix/libexec)"
FORCE
)
SET(PLUGIN_INSTALL_DIR
"${LIB_INSTALL_DIR}/${_APPLICATION_NAME}"
CACHE PATH "The subdirectory relative to the install prefix where plugins will be installed (default is prefix/lib/${_APPLICATION_NAME})"
FORCE
)
SET(INCLUDE_INSTALL_DIR
"${CMAKE_INSTALL_PREFIX}/include"
CACHE PATH "The subdirectory to the header prefix (default prefix/include)"
FORCE
)
SET(DATA_INSTALL_DIR
"${DATA_INSTALL_PREFIX}"
CACHE PATH "The parent directory where applications can install their data (default prefix/share/${_APPLICATION_NAME})"
FORCE
)
SET(HTML_INSTALL_DIR
"${DATA_INSTALL_PREFIX}/doc/HTML"
CACHE PATH "The HTML install dir for documentation (default data/doc/html)"
FORCE
)
SET(ICON_INSTALL_DIR
"${DATA_INSTALL_PREFIX}/icons"
CACHE PATH "The icon install dir (default data/icons/)"
FORCE
)
SET(SOUND_INSTALL_DIR
"${DATA_INSTALL_PREFIX}/sounds"
CACHE PATH "The install dir for sound files (default data/sounds)"
FORCE
)
SET(LOCALE_INSTALL_DIR
"${SHARE_INSTALL_PREFIX}/locale"
CACHE PATH "The install dir for translations (default prefix/share/locale)"
FORCE
)
SET(XDG_APPS_DIR
"${SHARE_INSTALL_PREFIX}/applications/"
CACHE PATH "The XDG apps dir"
FORCE
)
SET(XDG_DIRECTORY_DIR
"${SHARE_INSTALL_PREFIX}/desktop-directories"
CACHE PATH "The XDG directory"
FORCE
)
SET(SYSCONF_INSTALL_DIR
"${EXEC_INSTALL_PREFIX}/etc"
CACHE PATH "The ${_APPLICATION_NAME} sysconfig install dir (default prefix/etc)"
FORCE
)
SET(MAN_INSTALL_DIR
"${SHARE_INSTALL_PREFIX}/man"
CACHE PATH "The ${_APPLICATION_NAME} man install dir (default prefix/man)"
FORCE
)
SET(INFO_INSTALL_DIR
"${SHARE_INSTALL_PREFIX}/info"
CACHE PATH "The ${_APPLICATION_NAME} info install dir (default prefix/info)"
FORCE
)
endif (UNIX)
if (WIN32)
# Same same
SET(BIN_INSTALL_DIR .)
SET(SBIN_INSTALL_DIR .)
SET(LIB_INSTALL_DIR .)
SET(PLUGIN_INSTALL_DIR plugins)
SET(HTML_INSTALL_DIR doc/HTML)
SET(ICON_INSTALL_DIR .)
SET(SOUND_INSTALL_DIR .)
SET(LOCALE_INSTALL_DIR lang)
endif (WIN32)
qmapshack-1.10.0/cmake/Modules/Qt5PatchedLinguistToolsMacros.cmake 000644 001750 000144 00000011172 12705713523 026272 0 ustar 00oeichlerx users 000000 000000 #=============================================================================
# Copyright 2005-2011 Kitware, Inc.
# All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions
# are met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
#
# * Redistributions in binary form must reproduce the above copyright
# notice, this list of conditions and the following disclaimer in the
# documentation and/or other materials provided with the distribution.
#
# * Neither the name of Kitware, Inc. nor the names of its
# contributors may be used to endorse or promote products derived
# from this software without specific prior written permission.
#
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
# HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#=============================================================================
include(CMakeParseArguments)
function(QT5_PATCHED_CREATE_TRANSLATION _qm_files)
set(options)
set(oneValueArgs)
set(multiValueArgs OPTIONS)
cmake_parse_arguments(_LUPDATE "${options}" "${oneValueArgs}" "${multiValueArgs}" ${ARGN})
set(_lupdate_files ${_LUPDATE_UNPARSED_ARGUMENTS})
set(_lupdate_options ${_LUPDATE_OPTIONS})
set(_my_sources)
set(_my_tsfiles)
foreach(_file ${_lupdate_files})
get_filename_component(_ext ${_file} EXT)
get_filename_component(_abs_FILE ${_file} ABSOLUTE)
if(_ext MATCHES "ts")
list(APPEND _my_tsfiles ${_abs_FILE})
else()
list(APPEND _my_sources ${_abs_FILE})
endif()
endforeach()
foreach(_ts_file ${_my_tsfiles})
if(_my_sources)
# make a list file to call lupdate on, so we don't make our commands too
# long for some systems
# get_filename_component(_ts_name ${_ts_file} NAME_WE)
get_filename_component(_name ${_ts_file} NAME)
string(REGEX REPLACE "^(.+)(\\.[^.]+)$" "\\1" _ts_name ${_name})
set(_ts_lst_file "${CMAKE_CURRENT_BINARY_DIR}${CMAKE_FILES_DIRECTORY}/${_ts_name}_lst_file")
set(_lst_file_srcs)
foreach(_lst_file_src ${_my_sources})
set(_lst_file_srcs "${_lst_file_src}\n${_lst_file_srcs}")
endforeach()
get_directory_property(_inc_DIRS INCLUDE_DIRECTORIES)
foreach(_pro_include ${_inc_DIRS})
get_filename_component(_abs_include "${_pro_include}" ABSOLUTE)
set(_lst_file_srcs "-I${_pro_include}\n${_lst_file_srcs}")
endforeach()
file(WRITE ${_ts_lst_file} "${_lst_file_srcs}")
endif()
add_custom_command(OUTPUT ${_ts_file}
COMMAND ${Qt5_LUPDATE_EXECUTABLE}
ARGS ${_lupdate_options} "@${_ts_lst_file}" -ts ${_ts_file}
DEPENDS ${_my_sources} ${_ts_lst_file} VERBATIM)
endforeach()
qt5_patched_add_translation(${_qm_files} ${_my_tsfiles})
set(${_qm_files} ${${_qm_files}} PARENT_SCOPE)
endfunction()
function(QT5_PATCHED_ADD_TRANSLATION _qm_files)
foreach(_current_FILE ${ARGN})
get_filename_component(_abs_FILE ${_current_FILE} ABSOLUTE)
# get_filename_component(qm ${_abs_FILE} NAME_WE)
get_filename_component(_name ${_abs_FILE} NAME)
string(REGEX REPLACE "^(.+)(\\.[^.]+)$" "\\1" qm ${_name})
get_source_file_property(output_location ${_abs_FILE} OUTPUT_LOCATION)
if(output_location)
file(MAKE_DIRECTORY "${output_location}")
set(qm "${output_location}/${qm}.qm")
else()
set(qm "${CMAKE_CURRENT_BINARY_DIR}/${qm}.qm")
endif()
add_custom_command(OUTPUT ${qm}
COMMAND ${Qt5_LRELEASE_EXECUTABLE}
ARGS ${_abs_FILE} -qm ${qm}
DEPENDS ${_abs_FILE} VERBATIM
)
list(APPEND ${_qm_files} ${qm})
endforeach()
set(${_qm_files} ${${_qm_files}} PARENT_SCOPE)
endfunction()
qmapshack-1.10.0/cmake/Modules/TranslateTs.cmake 000644 001750 000144 00000012767 12705713523 022702 0 ustar 00oeichlerx users 000000 000000 #=============================================================================
# Copyright 2014 Luís Pereira
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions
# are met:
#
# 1. Redistributions of source code must retain the copyright
# notice, this list of conditions and the following disclaimer.
# 2. Redistributions in binary form must reproduce the copyright
# notice, this list of conditions and the following disclaimer in the
# documentation and/or other materials provided with the distribution.
# 3. The name of the author may not be used to endorse or promote products
# derived from this software without specific prior written permission.
#
# THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
# IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
# OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
# IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
# INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
# NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
# THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#=============================================================================
#
# funtion translate_ts(qmFiles
# [USE_QT5 [Yes | No]]
# [UPDATE_TRANSLATIONS [Yes | No]]
# [UPDATE_OPTIONS] update_options
# SOURCES
# [TEMPLATE] translation_template
# [TRANSLATION_DIR] translation_directory
# [INSTALL_DIR] install_directory
# [COMPONENT] component
# )
# Output:
# qmFiles The generated compiled translations (.qm) files
#
# Input:
# USE_QT5 Optional flag to choose between Qt4 and Qt5. Defaults to Qt5
#
# UPDATE_TRANSLATIONS Optional flag. Setting it to Yes, extracts and
# compiles the translations. Setting it No, only
# compiles them.
#
# UPDATE_OPTIONS Optional options to lupdate when UPDATE_TRANSLATIONS
# is True.
#
# TEMPLATE Optional translations files base name. Defaults to
# ${PROJECT_NAME}. An .ts extensions is added.
#
# TRANSLATION_DIR Optional path to the directory with the .ts files,
# relative to the CMakeList.txt. Defaults to
# "translations".
#
# INSTALL_DIR Optional destination of the file compiled files (qmFiles).
# If not present no installation is performed
#
# COMPONENT Optional install component. Only effective if INSTALL_DIR
# present. Defaults to "Runtime".
# CMake v2.8.3 needed to use the CMakeParseArguments module
cmake_minimum_required(VERSION 2.8.3 FATAL_ERROR)
# We use our patched version to round a annoying bug.
include(Qt5PatchedLinguistToolsMacros)
function(translate_ts qmFiles)
set(oneValueArgs USE_QT5 UPDATE_TRANSLATIONS TEMPLATE TRANSLATION_DIR INSTALL_DIR COMPONENT)
set(multiValueArgs SOURCES UPDATE_OPTIONS)
cmake_parse_arguments(TR "${options}" "${oneValueArgs}" "${multiValueArgs}" ${ARGN})
if (NOT DEFINED TR_UPDATE_TRANSLATIONS)
set(TR_UPDATE_TRANSLATIONS "No")
endif()
if (NOT DEFINED TR_UPDATE_OPTIONS)
set(TR_UPDATE_OPTIONS "")
endif()
message(STATUS "")
if (NOT DEFINED TR_USE_QT5)
set(TR_USE_QT5 "Yes")
endif()
if(NOT DEFINED TR_TEMPLATE)
set(TR_TEMPLATE "${PROJECT_NAME}")
endif()
if (NOT DEFINED TR_TRANSLATION_DIR)
set(TR_TRANSLATION_DIR "translations")
endif()
file(GLOB tsFiles "${TR_TRANSLATION_DIR}/${TR_TEMPLATE}_*.ts")
set(templateFile "${TR_TRANSLATION_DIR}/${TR_TEMPLATE}.ts")
if(TR_USE_QT5)
# Qt5
if (TR_UPDATE_TRANSLATIONS)
qt5_patched_create_translation(QMS
${TR_SOURCES}
${templateFile}
OPTIONS ${TR_UPDATE_OPTIONS}
)
qt5_patched_create_translation(QM
${TR_SOURCES}
${tsFiles}
OPTIONS ${TR_UPDATE_OPTIONS}
)
else()
qt5_patched_add_translation(QM ${tsFiles})
endif()
else()
# Qt4
if(TR_UPDATE_TRANSLATIONS)
qt4_create_translation(QMS
${TR_SOURCES}
${templateFile}
OPTIONS ${TR_UPDATE_OPTIONS}
)
qt4_create_translation(QM
${TR_SOURCES}
${tsFiles}
OPTIONS ${TR_UPDATE_OPTIONS}
)
else()
qt4_add_translation(QM ${tsFiles})
endif()
endif()
if(TR_UPDATE_TRANSLATIONS)
add_custom_target("update_${TR_TEMPLATE}_ts" ALL DEPENDS ${QMS})
endif()
if(DEFINED TR_INSTALL_DIR)
if(NOT DEFINED TR_COMPONENT)
set(TR_COMPONENT "Runtime")
endif()
install(FILES ${QM}
DESTINATION "${TR_INSTALL_DIR}"
COMPONENT "${TR_COMPONENT}"
)
endif()
set(${qmFiles} ${QM} PARENT_SCOPE)
endfunction()
qmapshack-1.10.0/cmake/Modules/FindJPEG.cmake 000644 001750 000144 00000004110 12374350216 021741 0 ustar 00oeichlerx users 000000 000000 # - Try to find LIBJPEG
# Once done this will define
#
# JPEG_FOUND - system has LIBJPEG
# JPEG_INCLUDE_DIRS - the LIBJPEG include directory
# JPEG_LIBRARIES - Link these to use LIBJPEG
# JPEG_DEFINITIONS - Compiler switches required for using LIBJPEG
#
# Copyright (c) 2009 Andreas Schneider
#
# Redistribution and use is allowed according to the terms of the New
# BSD license.
# For details see the accompanying COPYING-CMAKE-SCRIPTS file.
#
# NOTE: For Windows, please adapt the path (currently E:/qlgt/tools/libjpeg/win32)
# to your local installation directory
if (JPEG_LIBRARIES AND JPEG_INCLUDE_DIRS)
# in cache already
set(JPEG_FOUND TRUE)
else (JPEG_LIBRARIES AND JPEG_INCLUDE_DIRS)
find_path(JPEG_INCLUDE_DIR
NAMES
jpeglib.h
PATHS
/usr/include
/usr/local/include
/opt/local/include
/sw/include
${CMAKE_SOURCE_DIR}/Win32/GDAL/include
)
mark_as_advanced(JPEG_INCLUDE_DIR)
find_library(LIBJPEG_LIBRARY
NAMES
if (WIN32)
libjpeg
else (WIN32)
jpeg
endif (WIN32)
PATHS
/usr/lib
/usr/local/lib
/opt/local/lib
/sw/lib
${CMAKE_SOURCE_DIR}/Win32/GDAL/lib
)
mark_as_advanced(LIBJPEG_LIBRARY)
if (LIBJPEG_LIBRARY)
set(LIBJPEG_FOUND TRUE)
endif (LIBJPEG_LIBRARY)
set(JPEG_INCLUDE_DIRS
${JPEG_INCLUDE_DIR}
)
if (LIBJPEG_FOUND)
set(JPEG_LIBRARIES
${JPEG_LIBRARIES}
${LIBJPEG_LIBRARY}
)
endif (LIBJPEG_FOUND)
if (JPEG_INCLUDE_DIRS AND JPEG_LIBRARIES)
set(JPEG_FOUND TRUE)
endif (JPEG_INCLUDE_DIRS AND JPEG_LIBRARIES)
if (JPEG_FOUND)
if (NOT JPEG_FIND_QUIETLY)
message(STATUS "Found LIBJPEG: ${JPEG_LIBRARIES}")
endif (NOT JPEG_FIND_QUIETLY)
else (JPEG_FOUND)
if (JPEG_FIND_REQUIRED)
message(FATAL_ERROR "Could not find LIBJPEG")
endif (JPEG_FIND_REQUIRED)
endif (JPEG_FOUND)
# show the JPEG_INCLUDE_DIRS and JPEG_LIBRARIES variables only in the advanced view
mark_as_advanced(JPEG_INCLUDE_DIRS JPEG_LIBRARIES)
endif (JPEG_LIBRARIES AND JPEG_INCLUDE_DIRS)
qmapshack-1.10.0/cmake/Modules/FindDMTX.cmake 000644 001750 000144 00000003425 12374350216 022000 0 ustar 00oeichlerx users 000000 000000 # - Try to find DMTX
# Once done this will define
#
# DMTX_FOUND - system has DMTX
# DMTX_INCLUDE_DIRS - the DMTX include directory
# DMTX_LIBRARIES - Link these to use DMTX
# DMTX_DEFINITIONS - Compiler switches required for using DMTX
#
# Copyright (c) 2006 Andreas Schneider
#
# Redistribution and use is allowed according to the terms of the New
# BSD license.
# For details see the accompanying COPYING-CMAKE-SCRIPTS file.
#
if (DMTX_LIBRARIES AND DMTX_INCLUDE_DIRS)
# in cache already
set(DMTX_FOUND TRUE)
else (DMTX_LIBRARIES AND DMTX_INCLUDE_DIRS)
find_path(DMTX_INCLUDE_DIRS
NAMES
dmtx.h
PATHS
/usr/include
/usr/local/include
/opt/local/include
/sw/include
/usr/include/libdmtx
/usr/local/include/libdmtx
/opt/local/include/libdmtx
/sw/include/libdmtx
../../tools/libdmtx
)
# debian uses version suffixes
# add suffix evey new release
find_library(DMTX_LIBRARIES
NAMES
if (WIN32)
libdmtx
else (WIN32)
dmtx
endif (WIN32)
PATHS
/usr/lib64
/usr/lib
/usr/local/lib
/opt/local/lib
/sw/lib
../../tools/libdmtx
)
if (DMTX_INCLUDE_DIRS AND DMTX_LIBRARIES)
set(DMTX_FOUND TRUE)
endif (DMTX_INCLUDE_DIRS AND DMTX_LIBRARIES)
if (DMTX_FOUND)
if (NOT DMTX_FIND_QUIETLY)
message(STATUS "Found DMTX: ${DMTX_LIBRARIES}")
endif (NOT DMTX_FIND_QUIETLY)
else (DMTX_FOUND)
if (DMTX_FIND_REQUIRED)
message(FATAL_ERROR "Could not find DMTX")
endif (DMTX_FIND_REQUIRED)
endif (DMTX_FOUND)
# show the DMTX_INCLUDE_DIRS and DMTX_LIBRARIES variables only in the advanced view
mark_as_advanced(DMTX_INCLUDE_DIRS DMTX_LIBRARIES)
endif (DMTX_LIBRARIES AND DMTX_INCLUDE_DIRS)
qmapshack-1.10.0/cmake/Modules/FindPROJ.cmake 000644 001750 000144 00000004140 12765457042 022002 0 ustar 00oeichlerx users 000000 000000 # - Try to find PROJ
# Once done this will define
#
# PROJ_FOUND - system has PROJ
# PROJ_INCLUDE_DIRS - the PROJ include directory
# PROJ_LIBRARIES - Link these to use PROJ
# PROJ_DEFINITIONS - Compiler switches required for using PROJ
#
# Copyright (c) 2009 Andreas Schneider
#
# Redistribution and use is allowed according to the terms of the New
# BSD license.
# For details see the accompanying COPYING-CMAKE-SCRIPTS file.
#
if (PROJ_LIBRARIES AND PROJ_INCLUDE_DIRS)
# in cache already
set(PROJ_FOUND TRUE)
else (PROJ_LIBRARIES AND PROJ_INCLUDE_DIRS)
find_path(PROJ_INCLUDE_DIR
NAMES
proj_api.h
PATHS
if(WIN32)
${PROJ_DEV_PATH}/include
endif(WIN32)
/usr/include
/usr/local/include
/opt/local/include
/sw/include
${CMAKE_INSTALL_PREFIX}/include
${CMAKE_SOURCE_DIR}/Win32/GDAL/include
PATH_SUFFIXES
proj4
)
mark_as_advanced(PROJ_INCLUDE_DIR)
find_library(LIBPROJ_LIBRARY
NAMES
proj
proj_i
PATHS
if(WIN32)
${PROJ_DEV_PATH}/lib
endif(WIN32)
/usr/lib
/usr/local/lib
/opt/local/lib
/sw/lib
${CMAKE_INSTALL_PREFIX}/lib
${CMAKE_SOURCE_DIR}/Win32/GDAL/lib
)
mark_as_advanced(LIBPROJ_LIBRARY)
if (LIBPROJ_LIBRARY)
set(LIBPROJ_FOUND TRUE)
endif (LIBPROJ_LIBRARY)
set(PROJ_INCLUDE_DIRS
${PROJ_INCLUDE_DIR}
)
if (LIBPROJ_FOUND)
set(PROJ_LIBRARIES
${PROJ_LIBRARIES}
${LIBPROJ_LIBRARY}
)
endif (LIBPROJ_FOUND)
if (PROJ_INCLUDE_DIRS AND PROJ_LIBRARIES)
set(PROJ_FOUND TRUE)
endif (PROJ_INCLUDE_DIRS AND PROJ_LIBRARIES)
if (PROJ_FOUND)
if (NOT PROJ_FIND_QUIETLY)
message(STATUS "Found PROJ: ${PROJ_LIBRARIES}")
endif (NOT PROJ_FIND_QUIETLY)
else (PROJ_FOUND)
if (PROJ_FIND_REQUIRED)
message(FATAL_ERROR "Could not find PROJ")
endif (PROJ_FIND_REQUIRED)
endif (PROJ_FOUND)
# show the PROJ_INCLUDE_DIRS and PROJ_LIBRARIES variables only in the advanced view
mark_as_advanced(PROJ_INCLUDE_DIRS PROJ_LIBRARIES)
endif (PROJ_LIBRARIES AND PROJ_INCLUDE_DIRS)
qmapshack-1.10.0/cmake/Modules/FindGPSD.cmake 000644 001750 000144 00000003353 12374350216 021761 0 ustar 00oeichlerx users 000000 000000 # - Try to find GPSD
# Once done this will define
#
# GPSD_FOUND - system has GPSD
# GPSD_INCLUDE_DIRS - the GPSD include directory
# GPSD_LIBRARIES - Link these to use GPSD
# GPSD_DEFINITIONS - Compiler switches required for using GPSD
#
# Copyright (c) 2006 Andreas Schneider
#
# Redistribution and use is allowed according to the terms of the New
# BSD license.
# For details see the accompanying COPYING-CMAKE-SCRIPTS file.
#
if (GPSD_LIBRARIES AND GPSD_INCLUDE_DIRS)
# in cache already
set(GPSD_FOUND TRUE)
else (GPSD_LIBRARIES AND GPSD_INCLUDE_DIRS)
find_path(GPSD_INCLUDE_DIRS
NAMES
gps.h
PATHS
/usr/include
/usr/local/include
/opt/local/include
/sw/include
/usr/include/gps
/usr/local/include/gps
/opt/local/include/gps
/sw/include/gps
)
# debian uses version suffixes
# add suffix evey new release
find_library(GPSD_LIBRARIES
NAMES
gps
PATHS
/usr/lib64
/usr/lib
/usr/local/lib
/opt/local/lib
/sw/lib
)
if (GPSD_INCLUDE_DIRS AND GPSD_LIBRARIES)
set(GPSD_FOUND TRUE)
endif (GPSD_INCLUDE_DIRS AND GPSD_LIBRARIES)
if (GPSD_FOUND)
if (NOT GPSD_FIND_QUIETLY)
message(STATUS "Found GPSD: ${GPSD_LIBRARIES}")
endif (NOT GPSD_FIND_QUIETLY)
else (GPSD_FOUND)
if (GPSD_FIND_REQUIRED)
message(FATAL_ERROR "Could not find GPSD")
endif (GPSD_FIND_REQUIRED)
endif (GPSD_FOUND)
# show the GPSD_INCLUDE_DIRS and GPSD_LIBRARIES variables only in the advanced view
mark_as_advanced(GPSD_INCLUDE_DIRS GPSD_LIBRARIES)
endif (GPSD_LIBRARIES AND GPSD_INCLUDE_DIRS)
if (WIN32)
set(GPSD_FOUND FALSE)
set(GPSD_LIBRARIES "")
set(GPSD_INCLUDE_DIRS "")
endif (WIN32)
qmapshack-1.10.0/cmake/Modules/DefineCMakeDefaults.cmake 000644 001750 000144 00000001611 12374350216 024201 0 ustar 00oeichlerx users 000000 000000 # Always include srcdir and builddir in include path
# This saves typing ${CMAKE_CURRENT_SOURCE_DIR} ${CMAKE_CURRENT_BINARY} in
# about every subdir
# since cmake 2.4.0
set(CMAKE_INCLUDE_CURRENT_DIR ON)
# Put the include dirs which are in the source or build tree
# before all other include dirs, so the headers in the sources
# are prefered over the already installed ones
# since cmake 2.4.1
set(CMAKE_INCLUDE_DIRECTORIES_PROJECT_BEFORE ON)
# Use colored output
# since cmake 2.4.0
set(CMAKE_COLOR_MAKEFILE ON)
# Define the generic version of the libraries here
set(GENERIC_LIB_VERSION "0.1.0")
set(GENERIC_LIB_SOVERSION "0")
# Set the default build type to release with debug info
if (NOT CMAKE_BUILD_TYPE)
set(CMAKE_BUILD_TYPE RelWithDebInfo
CACHE STRING
"Choose the type of build, options are: None Debug Release RelWithDebInfo MinSizeRel."
FORCE
)
endif (NOT CMAKE_BUILD_TYPE)
qmapshack-1.10.0/cmake/Modules/FindGDAL.cmake 000644 001750 000144 00000004265 12765457042 021747 0 ustar 00oeichlerx users 000000 000000 # - Try to find GDAL
# Once done this will define
#
# GDAL_FOUND - system has GDAL
# GDAL_INCLUDE_DIRS - the GDAL include directory
# GDAL_LIBRARIES - Link these to use GDAL
# GDAL_DEFINITIONS - Compiler switches required for using GDAL
#
# Copyright (c) 2006 Andreas Schneider
#
# Redistribution and use is allowed according to the terms of the New
# BSD license.
# For details see the accompanying COPYING-CMAKE-SCRIPTS file.
#
if (GDAL_LIBRARIES AND GDAL_INCLUDE_DIRS)
# in cache already
set(GDAL_FOUND TRUE)
else (GDAL_LIBRARIES AND GDAL_INCLUDE_DIRS)
find_path(GDAL_INCLUDE_DIR
NAMES
gdal.h
PATHS
if(WIN32)
${GDAL_DEV_PATH}/include
endif(WIN32)
/usr/include
/usr/local/include
/opt/local/include
/sw/include
${CMAKE_INSTALL_PREFIX}/include
/usr/include/gdal
/usr/local/include/gdal
/opt/local/include/gdal
/sw/include/gdal
${CMAKE_INSTALL_PREFIX}/include/gdal
${CMAKE_SOURCE_DIR}/Win32/GDAL/include
PATH_SUFFIXES
gdal
)
# debian uses version suffixes
# add suffix evey new release
find_library(GDAL_LIBRARY
NAMES
gdal
gdal1.3.2
gdal1.4.0
gdal1.5.0
gdal1.6.0
gdal1.7.0
gdal1.8.0
gdal
gdal_i
PATHS
if(WIN32)
${GDAL_DEV_PATH}/lib
endif(WIN32)
/usr/lib
/usr/local/lib
/opt/local/lib
/sw/lib
${CMAKE_INSTALL_PREFIX}/lib
${CMAKE_SOURCE_DIR}/Win32/GDAL/lib
)
set(GDAL_INCLUDE_DIRS
${GDAL_INCLUDE_DIR}
)
set(GDAL_LIBRARIES
${GDAL_LIBRARY}
)
if (GDAL_INCLUDE_DIRS AND GDAL_LIBRARIES)
set(GDAL_FOUND TRUE)
endif (GDAL_INCLUDE_DIRS AND GDAL_LIBRARIES)
if (GDAL_FOUND)
if (NOT GDAL_FIND_QUIETLY)
message(STATUS "Found GDAL: ${GDAL_LIBRARIES}")
endif (NOT GDAL_FIND_QUIETLY)
else (GDAL_FOUND)
if (GDAL_FIND_REQUIRED)
message(FATAL_ERROR "Could not find GDAL")
endif (GDAL_FIND_REQUIRED)
endif (GDAL_FOUND)
# show the GDAL_INCLUDE_DIRS and GDAL_LIBRARIES variables only in the advanced view
mark_as_advanced(GDAL_INCLUDE_DIRS GDAL_LIBRARIES)
endif (GDAL_LIBRARIES AND GDAL_INCLUDE_DIRS)
qmapshack-1.10.0/cmake/Modules/FindXercesC.cmake 000644 001750 000144 00000004775 12374350216 022571 0 ustar 00oeichlerx users 000000 000000 # - Try to find XercesC
# Once done this will define
#
# XERCESC_FOUND - system has XercesC
# XERCESC_INCLUDE_DIRS - the XercesC include directory
# XERCESC_LIBRARIES - Link these to use XercesC
# XERCESC_DEFINITIONS - Compiler switches required for using XercesC
#
# Copyright (c) 2009 Andreas Schneider
#
# Redistribution and use is allowed according to the terms of the New
# BSD license.
# For details see the accompanying COPYING-CMAKE-SCRIPTS file.
#
if (XERCESC_LIBRARIES AND XERCESC_INCLUDE_DIRS)
# in cache already
set(XERCESC_FOUND TRUE)
else (XERCESC_LIBRARIES AND XERCESC_INCLUDE_DIRS)
find_path(XERCESC_INCLUDE_DIR
NAMES
xercesc/util/XercesVersion.hpp
PATHS
/usr/include
/usr/local/include
/opt/local/include
/sw/include
C:/progra~1/xerces-c_2_8_0/include
)
mark_as_advanced(XERCESC_INCLUDE_DIR)
find_library(XERCES-C_LIBRARY
NAMES
xerces-c
xerces-c_2
PATHS
/usr/lib
/usr/local/lib
/opt/local/lib
/sw/lib
C:/progra~1/xerces-c_2_8_0/lib
)
mark_as_advanced(XERCES-C_LIBRARY)
find_library(XERCES-DEPDOM_LIBRARY
NAMES
xerces-depdom
xerces-depdom_2
PATHS
/usr/lib
/usr/local/lib
/opt/local/lib
/sw/lib
C:/progra~1/xerces-c_2_8_0/lib
)
mark_as_advanced(XERCES-DEPDOM_LIBRARY)
if (XERCES-C_LIBRARY)
set(XERCES-C_FOUND TRUE)
endif (XERCES-C_LIBRARY)
if (XERCES-DEPDOM_LIBRARY)
set(XERCES-DEPDOM_FOUND TRUE)
endif (XERCES-DEPDOM_LIBRARY)
set(XERCESC_INCLUDE_DIRS
${XERCESC_INCLUDE_DIR}
)
if (XERCES-C_FOUND)
set(XERCESC_LIBRARIES
${XERCESC_LIBRARIES}
${XERCES-C_LIBRARY}
)
endif (XERCES-C_FOUND)
if (XERCES-DEPDOM_FOUND)
set(XERCESC_LIBRARIES
${XERCESC_LIBRARIES}
${XERCES-DEPDOM_LIBRARY}
)
endif (XERCES-DEPDOM_FOUND)
if (XERCESC_INCLUDE_DIRS AND XERCESC_LIBRARIES)
set(XERCESC_FOUND TRUE)
endif (XERCESC_INCLUDE_DIRS AND XERCESC_LIBRARIES)
if (XERCESC_FOUND)
if (NOT XercesC_FIND_QUIETLY)
message(STATUS "Found XercesC: ${XERCESC_LIBRARIES}")
endif (NOT XercesC_FIND_QUIETLY)
else (XERCESC_FOUND)
if (XercesC_FIND_REQUIRED)
message(FATAL_ERROR "Could not find XercesC")
endif (XercesC_FIND_REQUIRED)
endif (XERCESC_FOUND)
# show the XERCESC_INCLUDE_DIRS and XERCESC_LIBRARIES variables only in the advanced view
mark_as_advanced(XERCESC_INCLUDE_DIRS XERCESC_LIBRARIES)
endif (XERCESC_LIBRARIES AND XERCESC_INCLUDE_DIRS)
qmapshack-1.10.0/cmake/Modules/FindQextSerialPort.cmake 000644 001750 000144 00000004363 12374350216 024154 0 ustar 00oeichlerx users 000000 000000 # - Try to find QextSerialPort
# Once done this will define
#
# QEXTSERIALPORT_FOUND - system has QEXTSERIALPORT
# QEXTSERIALPORT_INCLUDE_DIRS - the QEXTSERIALPORT include directory
# QEXTSERIALPORT_LIBRARIES - Link these to use QEXTSERIALPORT
# QEXTSERIALPORT_DEFINITIONS - Compiler switches required for using QEXTSERIALPORT
#
# Copyright (c) 2006 Andreas Schneider
# updated for QextSerialPort by Dan Horák
#
# Redistribution and use is allowed according to the terms of the New
# BSD license.
# For details see the accompanying COPYING-CMAKE-SCRIPTS file.
#
if (QEXTSERIALPORT_LIBRARIES AND QEXTSERIALPORT_INCLUDE_DIRS)
# in cache already
set(QEXTSERIALPORT_FOUND TRUE)
else (QEXTSERIALPORT_LIBRARIES AND QEXTSERIALPORT_INCLUDE_DIRS)
find_path(QEXTSERIALPORT_INCLUDE_DIRS
NAMES
qextserialport.h
PATHS
/usr/include
/usr/local/include
/opt/local/include
/sw/include
/usr/include/QtExtSerialPort
/usr/local/include/QtExtSerialPort
/opt/local/include/QtExtSerialPort
/sw/include/QtExtSerialPort
)
# debian uses version suffixes
# add suffix evey new release
find_library(QEXTSERIALPORT_LIBRARIES
NAMES
qextserialport-1.2
PATHS
/usr/lib64
/usr/lib
/usr/local/lib
/opt/local/lib
/sw/lib
)
if (QEXTSERIALPORT_INCLUDE_DIRS AND QEXTSERIALPORT_LIBRARIES)
set(QEXTSERIALPORT_FOUND TRUE)
endif (QEXTSERIALPORT_INCLUDE_DIRS AND QEXTSERIALPORT_LIBRARIES)
if (QEXTSERIALPORT_FOUND)
if (NOT QEXTSERIALPORT_FIND_QUIETLY)
message(STATUS "Found QtExtSerialPort: ${QEXTSERIALPORT_LIBRARIES}")
endif (NOT QEXTSERIALPORT_FIND_QUIETLY)
else (QEXTSERIALPORT_FOUND)
if (QEXTSERIALPORT_FIND_REQUIRED)
message(FATAL_ERROR "Could not find QtExtSerialPort")
endif (QEXTSERIALPORT_FIND_REQUIRED)
endif (QEXTSERIALPORT_FOUND)
# show the QEXTSERIALPORT_INCLUDE_DIRS and QEXTSERIALPORT_LIBRARIES variables only in the advanced view
mark_as_advanced(QEXTSERIALPORT_INCLUDE_DIRS QEXTSERIALPORT_LIBRARIES)
endif (QEXTSERIALPORT_LIBRARIES AND QEXTSERIALPORT_INCLUDE_DIRS)
if (WIN32)
set(QEXTSERIALPORT_FOUND FALSE)
set(QEXTSERIALPORT_LIBRARIES "")
set(QEXTSERIALPORT_INCLUDE_DIRS "")
endif (WIN32)
qmapshack-1.10.0/cmake/Modules/CMakeLists.txt 000644 001750 000144 00000001556 13024173403 022156 0 ustar 00oeichlerx users 000000 000000 # install the cmake files
file(GLOB cmakeFiles "${CMAKE_CURRENT_SOURCE_DIR}/*.cmake")
set(module_install_dir ${DATA_INSTALL_DIR}/cmake/modules )
install(
FILES
${cmakeFiles}
DESTINATION
${module_install_dir}
)
# the files listed here will be removed by remove_obsoleted_cmake_files.cmake, Alex
set(FILES_TO_REMOVE
)
install(SCRIPT ${CMAKE_CURRENT_BINARY_DIR}/remove_files.cmake )
file(WRITE ${CMAKE_CURRENT_BINARY_DIR}/remove_files.cmake "#generated by cmake, don't edit\n\n")
foreach ( _current_FILE ${FILES_TO_REMOVE})
file(APPEND ${CMAKE_CURRENT_BINARY_DIR}/remove_files.cmake "message(STATUS \"Removing ${module_install_dir}/${_current_FILE}\" )\n" )
file(APPEND ${CMAKE_CURRENT_BINARY_DIR}/remove_files.cmake "exec_program( ${CMAKE_COMMAND} ARGS -E remove ${module_install_dir}/${_current_FILE} OUTPUT_VARIABLE _dummy)\n" )
endforeach ( _current_FILE)
qmapshack-1.10.0/cmake/Modules/DefineCompilerFlags.cmake 000644 001750 000144 00000000531 12374350216 024260 0 ustar 00oeichlerx users 000000 000000 # define system dependent compiler flags
include(CheckCXXCompilerFlag)
# with -fPIC
if(UNIX AND NOT WIN32)
if(CMAKE_SYSTEM_PROCESSOR MATCHES "x86_64")
check_cxx_compiler_flag("-fPIC" WITH_FPIC)
if(WITH_FPIC)
ADD_DEFINITIONS(-fPIC)
endif(WITH_FPIC)
endif(CMAKE_SYSTEM_PROCESSOR MATCHES "x86_64")
endif(UNIX AND NOT WIN32)
qmapshack-1.10.0/cmake/Modules/TranslateDesktop.cmake 000644 001750 000144 00000006132 12705713523 023712 0 ustar 00oeichlerx users 000000 000000 #=============================================================================
# The translate_desktop() function was copied from the
# LXQt LXQtTranslate.cmake
#
# Original Author: Alexander Sokolov
#
# funtion translate_desktop(_RESULT
# SOURCES
# [TRANSLATION_DIR] translation_directory
# )
# Output:
# _RESULT The generated .desktop (.desktop) files
#
# Input:
#
# SOURCES List of input desktop files (.destktop.in) to be translated
# (merged), relative to the CMakeList.txt.
#
# TRANSLATION_DIR Optional path to the directory with the .ts files,
# relative to the CMakeList.txt. Defaults to
# "translations".
#
#=============================================================================
function(translate_desktop _RESULT)
# Parse arguments ***************************************
set(oneValueArgs TRANSLATION_DIR)
set(multiValueArgs SOURCES)
cmake_parse_arguments(_ARGS "${options}" "${oneValueArgs}" "${multiValueArgs}" ${ARGN})
# check for unknown arguments
set(_UNPARSED_ARGS ${_ARGS_UNPARSED_ARGUMENTS})
if (NOT ${_UNPARSED_ARGS} STREQUAL "")
MESSAGE(FATAL_ERROR
"Unknown arguments '${_UNPARSED_ARGS}'.\n"
"See translate_desktop() documentation for more information.\n"
)
endif()
if (NOT DEFINED _ARGS_SOURCES)
set(${_RESULT} "" PARENT_SCOPE)
return()
else()
set(_sources ${_ARGS_SOURCES})
endif()
if (NOT DEFINED _ARGS_TRANSLATION_DIR)
set(_translationDir "translations")
else()
set(_translationDir ${_ARGS_TRANSLATION_DIR})
endif()
get_filename_component (_translationDir ${_translationDir} ABSOLUTE)
foreach (_inFile ${_sources})
get_filename_component(_inFile ${_inFile} ABSOLUTE)
get_filename_component(_fileName ${_inFile} NAME_WE)
#Extract the real extension ............
get_filename_component(_fileExt ${_inFile} EXT)
string(REPLACE ".in" "" _fileExt ${_fileExt})
#.......................................
set(_outFile "${CMAKE_CURRENT_BINARY_DIR}/${_fileName}${_fileExt}")
file(GLOB _translations
${_translationDir}/${_fileName}_*${_fileExt}
)
set(_pattern "'\\[.*]\\s*='")
if (_translations)
list(SORT _translations)
add_custom_command(OUTPUT ${_outFile}
COMMAND grep -v -a "'#TRANSLATIONS_DIR='" ${_inFile} > ${_outFile}
COMMAND grep -h -a ${_pattern} ${_translations} >> ${_outFile}
COMMENT "Generating ${_fileName}${_fileExt}"
)
else()
add_custom_command(OUTPUT ${_outFile}
COMMAND grep -v -a "'#TRANSLATIONS_DIR='" ${_inFile} > ${_outFile}
COMMENT "Generating ${_fileName}${_fileExt}"
)
endif()
set(__result ${__result} ${_outFile})
endforeach()
set(${_RESULT} ${__result} PARENT_SCOPE)
endfunction(translate_desktop)
qmapshack-1.10.0/cmake/Modules/COPYING-CMAKE-SCRIPTS 000644 001750 000144 00000002457 12374350216 022423 0 ustar 00oeichlerx users 000000 000000 Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The name of the author may not be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
qmapshack-1.10.0/cmake/Modules/FindROUTINO.cmake 000644 001750 000144 00000005645 12765457042 022402 0 ustar 00oeichlerx users 000000 000000 # - Try to find ROUTINO
# Once done this will define
#
# ROUTINO_FOUND - system has ROUTINO
# ROUTINO_INCLUDE_DIRS - the ROUTINO include directory
# ROUTINO_LIBRARIES - Link these to use ROUTINO
# ROUTINO_DEFINITIONS - Compiler switches required for using ROUTINO
# ROUTINO_XML_PATH - Path to profile.xml and translation.xml
#
# Copyright (c) 2009 Andreas Schneider
#
# Redistribution and use is allowed according to the terms of the New
# BSD license.
# For details see the accompanying COPYING-CMAKE-SCRIPTS file.
#
if (ROUTINO_LIBRARIES AND ROUTINO_INCLUDE_DIRS AND ROUTINO_XML_PATH)
# in cache already
set(ROUTINO_FOUND TRUE)
else (ROUTINO_LIBRARIES AND ROUTINO_INCLUDE_DIRS AND ROUTINO_XML_PATH)
find_path(ROUTINO_INCLUDE_DIR
NAMES
routino.h
PATHS
/usr/include
/usr/local/include
/opt/local/include
/sw/include
${CMAKE_INSTALL_PREFIX}/include
${ROUTINO_DEV_PATH}/include/
)
mark_as_advanced(ROUTINO_INCLUDE_DIR)
find_library(LIBROUTINO_LIBRARY
NAMES
routino
PATHS
/usr/lib
/usr/local/lib
/opt/local/lib
/sw/lib
${CMAKE_INSTALL_PREFIX}/include
${ROUTINO_DEV_PATH}/lib
)
mark_as_advanced(LIBROUTINO_LIBRARY)
find_path(ROUTINO_XML_PATH
NAMES
profiles.xml
translations.xml
tagging.xml
PATHS
/usr/share/routino
/usr/local/share/routino
/opt/local/share/routino
${CMAKE_INSTALL_PREFIX}/share/routino
${ROUTINO_DEV_PATH}/xml/
)
mark_as_advanced(ROUTINO_XML_PATH)
if (LIBROUTINO_LIBRARY)
set(LIBROUTINO_FOUND TRUE)
endif (LIBROUTINO_LIBRARY)
set(ROUTINO_INCLUDE_DIRS
${ROUTINO_INCLUDE_DIR}
)
if (LIBROUTINO_FOUND)
set(ROUTINO_LIBRARIES ${ROUTINO_LIBRARIES} ${LIBROUTINO_LIBRARY})
endif (LIBROUTINO_FOUND)
if (ROUTINO_INCLUDE_DIRS AND ROUTINO_LIBRARIES AND ROUTINO_XML_PATH)
set(ROUTINO_FOUND TRUE)
endif (ROUTINO_INCLUDE_DIRS AND ROUTINO_LIBRARIES AND ROUTINO_XML_PATH)
if (ROUTINO_FOUND)
if (NOT ROUTINO_FIND_QUIETLY)
message(STATUS "Found ROUTINO: ${ROUTINO_LIBRARIES}")
message(STATUS "Found ROUTINO: ${ROUTINO_INCLUDE_DIR}")
message(STATUS "Found ROUTINO: ${ROUTINO_XML_PATH}")
endif (NOT ROUTINO_FIND_QUIETLY)
else (ROUTINO_FOUND)
if (ROUTINO_FIND_REQUIRED)
message(FATAL_ERROR "Could not find ROUTINO")
endif (ROUTINO_FIND_REQUIRED)
endif (ROUTINO_FOUND)
# show the ROUTINO_INCLUDE_DIRS and ROUTINO_LIBRARIES variables only in the advanced view
mark_as_advanced(ROUTINO_INCLUDE_DIRS ROUTINO_LIBRARIES ROUTINO_XML_PATH)
endif (ROUTINO_LIBRARIES AND ROUTINO_INCLUDE_DIRS AND ROUTINO_XML_PATH)
qmapshack-1.10.0/cmake/CMakeLists.txt 000644 001750 000144 00000000032 12374350216 020540 0 ustar 00oeichlerx users 000000 000000 add_subdirectory(Modules)
qmapshack-1.10.0/3rdparty/ 000755 001750 000144 00000000000 13216664442 016502 5 ustar 00oeichlerx users 000000 000000 qmapshack-1.10.0/3rdparty/alglib/ 000755 001750 000144 00000000000 13216664442 017734 5 ustar 00oeichlerx users 000000 000000 qmapshack-1.10.0/3rdparty/alglib/src/ 000755 001750 000144 00000000000 13216664442 020523 5 ustar 00oeichlerx users 000000 000000 qmapshack-1.10.0/3rdparty/alglib/src/alglibinternal.h 000755 001750 000144 00000106405 13015033052 023654 0 ustar 00oeichlerx users 000000 000000 /*************************************************************************
ALGLIB 3.10.0 (source code generated 2015-08-19)
Copyright (c) Sergey Bochkanov (ALGLIB project).
>>> SOURCE LICENSE >>>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation (www.fsf.org); either version 2 of the
License, or (at your option) any later version.
This program 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 General Public License for more details.
A copy of the GNU General Public License is available at
http://www.fsf.org/licensing/licenses
>>> END OF LICENSE >>>
*************************************************************************/
#ifndef _alglibinternal_pkg_h
#define _alglibinternal_pkg_h
#include "ap.h"
/////////////////////////////////////////////////////////////////////////
//
// THIS SECTION CONTAINS COMPUTATIONAL CORE DECLARATIONS (DATATYPES)
//
/////////////////////////////////////////////////////////////////////////
namespace alglib_impl
{
typedef struct
{
ae_vector ba0;
ae_vector ia0;
ae_vector ia1;
ae_vector ia2;
ae_vector ia3;
ae_vector ra0;
ae_vector ra1;
ae_vector ra2;
ae_vector ra3;
ae_matrix rm0;
ae_matrix rm1;
} apbuffers;
typedef struct
{
ae_bool val;
} sboolean;
typedef struct
{
ae_vector val;
} sbooleanarray;
typedef struct
{
ae_int_t val;
} sinteger;
typedef struct
{
ae_vector val;
} sintegerarray;
typedef struct
{
double val;
} sreal;
typedef struct
{
ae_vector val;
} srealarray;
typedef struct
{
ae_complex val;
} scomplex;
typedef struct
{
ae_vector val;
} scomplexarray;
typedef struct
{
ae_int_t chunksize;
ae_int_t ntotal;
ae_int_t nin;
ae_int_t nout;
ae_int_t wcount;
ae_vector batch4buf;
ae_vector hpcbuf;
ae_matrix xy;
ae_matrix xy2;
ae_vector xyrow;
ae_vector x;
ae_vector y;
ae_vector desiredy;
double e;
ae_vector g;
ae_vector tmp0;
} mlpbuffers;
typedef struct
{
ae_bool brackt;
ae_bool stage1;
ae_int_t infoc;
double dg;
double dgm;
double dginit;
double dgtest;
double dgx;
double dgxm;
double dgy;
double dgym;
double finit;
double ftest1;
double fm;
double fx;
double fxm;
double fy;
double fym;
double stx;
double sty;
double stmin;
double stmax;
double width;
double width1;
double xtrapf;
} linminstate;
typedef struct
{
ae_bool needf;
ae_vector x;
double f;
ae_int_t n;
ae_vector xbase;
ae_vector s;
double stplen;
double fcur;
double stpmax;
ae_int_t fmax;
ae_int_t nfev;
ae_int_t info;
rcommstate rstate;
} armijostate;
typedef struct
{
ae_matrix entries;
ae_vector buffer;
ae_vector precr;
ae_vector preci;
ae_shared_pool bluesteinpool;
} fasttransformplan;
}
/////////////////////////////////////////////////////////////////////////
//
// THIS SECTION CONTAINS C++ INTERFACE
//
/////////////////////////////////////////////////////////////////////////
namespace alglib
{
}
/////////////////////////////////////////////////////////////////////////
//
// THIS SECTION CONTAINS COMPUTATIONAL CORE DECLARATIONS (FUNCTIONS)
//
/////////////////////////////////////////////////////////////////////////
namespace alglib_impl
{
ae_bool seterrorflag(ae_bool* flag, ae_bool cond, ae_state *_state);
ae_bool seterrorflagdiff(ae_bool* flag,
double val,
double refval,
double tol,
double s,
ae_state *_state);
void touchint(ae_int_t* a, ae_state *_state);
void touchreal(double* a, ae_state *_state);
double coalesce(double a, double b, ae_state *_state);
double inttoreal(ae_int_t a, ae_state *_state);
double logbase2(double x, ae_state *_state);
ae_bool approxequalrel(double a, double b, double tol, ae_state *_state);
void taskgenint1d(double a,
double b,
ae_int_t n,
/* Real */ ae_vector* x,
/* Real */ ae_vector* y,
ae_state *_state);
void taskgenint1dequidist(double a,
double b,
ae_int_t n,
/* Real */ ae_vector* x,
/* Real */ ae_vector* y,
ae_state *_state);
void taskgenint1dcheb1(double a,
double b,
ae_int_t n,
/* Real */ ae_vector* x,
/* Real */ ae_vector* y,
ae_state *_state);
void taskgenint1dcheb2(double a,
double b,
ae_int_t n,
/* Real */ ae_vector* x,
/* Real */ ae_vector* y,
ae_state *_state);
ae_bool aredistinct(/* Real */ ae_vector* x,
ae_int_t n,
ae_state *_state);
ae_bool aresameboolean(ae_bool v1, ae_bool v2, ae_state *_state);
void bvectorsetlengthatleast(/* Boolean */ ae_vector* x,
ae_int_t n,
ae_state *_state);
void ivectorsetlengthatleast(/* Integer */ ae_vector* x,
ae_int_t n,
ae_state *_state);
void rvectorsetlengthatleast(/* Real */ ae_vector* x,
ae_int_t n,
ae_state *_state);
void rmatrixsetlengthatleast(/* Real */ ae_matrix* x,
ae_int_t m,
ae_int_t n,
ae_state *_state);
void rmatrixresize(/* Real */ ae_matrix* x,
ae_int_t m,
ae_int_t n,
ae_state *_state);
void imatrixresize(/* Integer */ ae_matrix* x,
ae_int_t m,
ae_int_t n,
ae_state *_state);
ae_bool isfinitevector(/* Real */ ae_vector* x,
ae_int_t n,
ae_state *_state);
ae_bool isfinitecvector(/* Complex */ ae_vector* z,
ae_int_t n,
ae_state *_state);
ae_bool apservisfinitematrix(/* Real */ ae_matrix* x,
ae_int_t m,
ae_int_t n,
ae_state *_state);
ae_bool apservisfinitecmatrix(/* Complex */ ae_matrix* x,
ae_int_t m,
ae_int_t n,
ae_state *_state);
ae_bool isfinitertrmatrix(/* Real */ ae_matrix* x,
ae_int_t n,
ae_bool isupper,
ae_state *_state);
ae_bool apservisfinitectrmatrix(/* Complex */ ae_matrix* x,
ae_int_t n,
ae_bool isupper,
ae_state *_state);
ae_bool apservisfiniteornanmatrix(/* Real */ ae_matrix* x,
ae_int_t m,
ae_int_t n,
ae_state *_state);
double safepythag2(double x, double y, ae_state *_state);
double safepythag3(double x, double y, double z, ae_state *_state);
ae_int_t saferdiv(double x, double y, double* r, ae_state *_state);
double safeminposrv(double x, double y, double v, ae_state *_state);
void apperiodicmap(double* x,
double a,
double b,
double* k,
ae_state *_state);
double randomnormal(ae_state *_state);
void randomunit(ae_int_t n, /* Real */ ae_vector* x, ae_state *_state);
void swapi(ae_int_t* v0, ae_int_t* v1, ae_state *_state);
void swapr(double* v0, double* v1, ae_state *_state);
double maxreal3(double v0, double v1, double v2, ae_state *_state);
void inc(ae_int_t* v, ae_state *_state);
void dec(ae_int_t* v, ae_state *_state);
void countdown(ae_int_t* v, ae_state *_state);
double boundval(double x, double b1, double b2, ae_state *_state);
void alloccomplex(ae_serializer* s, ae_complex v, ae_state *_state);
void serializecomplex(ae_serializer* s, ae_complex v, ae_state *_state);
ae_complex unserializecomplex(ae_serializer* s, ae_state *_state);
void allocrealarray(ae_serializer* s,
/* Real */ ae_vector* v,
ae_int_t n,
ae_state *_state);
void serializerealarray(ae_serializer* s,
/* Real */ ae_vector* v,
ae_int_t n,
ae_state *_state);
void unserializerealarray(ae_serializer* s,
/* Real */ ae_vector* v,
ae_state *_state);
void allocintegerarray(ae_serializer* s,
/* Integer */ ae_vector* v,
ae_int_t n,
ae_state *_state);
void serializeintegerarray(ae_serializer* s,
/* Integer */ ae_vector* v,
ae_int_t n,
ae_state *_state);
void unserializeintegerarray(ae_serializer* s,
/* Integer */ ae_vector* v,
ae_state *_state);
void allocrealmatrix(ae_serializer* s,
/* Real */ ae_matrix* v,
ae_int_t n0,
ae_int_t n1,
ae_state *_state);
void serializerealmatrix(ae_serializer* s,
/* Real */ ae_matrix* v,
ae_int_t n0,
ae_int_t n1,
ae_state *_state);
void unserializerealmatrix(ae_serializer* s,
/* Real */ ae_matrix* v,
ae_state *_state);
void copyintegerarray(/* Integer */ ae_vector* src,
/* Integer */ ae_vector* dst,
ae_state *_state);
void copyrealarray(/* Real */ ae_vector* src,
/* Real */ ae_vector* dst,
ae_state *_state);
void copyrealmatrix(/* Real */ ae_matrix* src,
/* Real */ ae_matrix* dst,
ae_state *_state);
ae_int_t recsearch(/* Integer */ ae_vector* a,
ae_int_t nrec,
ae_int_t nheader,
ae_int_t i0,
ae_int_t i1,
/* Integer */ ae_vector* b,
ae_state *_state);
void splitlengtheven(ae_int_t tasksize,
ae_int_t* task0,
ae_int_t* task1,
ae_state *_state);
void splitlength(ae_int_t tasksize,
ae_int_t chunksize,
ae_int_t* task0,
ae_int_t* task1,
ae_state *_state);
ae_int_t chunkscount(ae_int_t tasksize,
ae_int_t chunksize,
ae_state *_state);
void _apbuffers_init(void* _p, ae_state *_state);
void _apbuffers_init_copy(void* _dst, void* _src, ae_state *_state);
void _apbuffers_clear(void* _p);
void _apbuffers_destroy(void* _p);
void _sboolean_init(void* _p, ae_state *_state);
void _sboolean_init_copy(void* _dst, void* _src, ae_state *_state);
void _sboolean_clear(void* _p);
void _sboolean_destroy(void* _p);
void _sbooleanarray_init(void* _p, ae_state *_state);
void _sbooleanarray_init_copy(void* _dst, void* _src, ae_state *_state);
void _sbooleanarray_clear(void* _p);
void _sbooleanarray_destroy(void* _p);
void _sinteger_init(void* _p, ae_state *_state);
void _sinteger_init_copy(void* _dst, void* _src, ae_state *_state);
void _sinteger_clear(void* _p);
void _sinteger_destroy(void* _p);
void _sintegerarray_init(void* _p, ae_state *_state);
void _sintegerarray_init_copy(void* _dst, void* _src, ae_state *_state);
void _sintegerarray_clear(void* _p);
void _sintegerarray_destroy(void* _p);
void _sreal_init(void* _p, ae_state *_state);
void _sreal_init_copy(void* _dst, void* _src, ae_state *_state);
void _sreal_clear(void* _p);
void _sreal_destroy(void* _p);
void _srealarray_init(void* _p, ae_state *_state);
void _srealarray_init_copy(void* _dst, void* _src, ae_state *_state);
void _srealarray_clear(void* _p);
void _srealarray_destroy(void* _p);
void _scomplex_init(void* _p, ae_state *_state);
void _scomplex_init_copy(void* _dst, void* _src, ae_state *_state);
void _scomplex_clear(void* _p);
void _scomplex_destroy(void* _p);
void _scomplexarray_init(void* _p, ae_state *_state);
void _scomplexarray_init_copy(void* _dst, void* _src, ae_state *_state);
void _scomplexarray_clear(void* _p);
void _scomplexarray_destroy(void* _p);
ae_int_t getrdfserializationcode(ae_state *_state);
ae_int_t getkdtreeserializationcode(ae_state *_state);
ae_int_t getmlpserializationcode(ae_state *_state);
ae_int_t getmlpeserializationcode(ae_state *_state);
ae_int_t getrbfserializationcode(ae_state *_state);
void tagsort(/* Real */ ae_vector* a,
ae_int_t n,
/* Integer */ ae_vector* p1,
/* Integer */ ae_vector* p2,
ae_state *_state);
void tagsortbuf(/* Real */ ae_vector* a,
ae_int_t n,
/* Integer */ ae_vector* p1,
/* Integer */ ae_vector* p2,
apbuffers* buf,
ae_state *_state);
void tagsortfasti(/* Real */ ae_vector* a,
/* Integer */ ae_vector* b,
/* Real */ ae_vector* bufa,
/* Integer */ ae_vector* bufb,
ae_int_t n,
ae_state *_state);
void tagsortfastr(/* Real */ ae_vector* a,
/* Real */ ae_vector* b,
/* Real */ ae_vector* bufa,
/* Real */ ae_vector* bufb,
ae_int_t n,
ae_state *_state);
void tagsortfast(/* Real */ ae_vector* a,
/* Real */ ae_vector* bufa,
ae_int_t n,
ae_state *_state);
void tagsortmiddleir(/* Integer */ ae_vector* a,
/* Real */ ae_vector* b,
ae_int_t offset,
ae_int_t n,
ae_state *_state);
void tagheappushi(/* Real */ ae_vector* a,
/* Integer */ ae_vector* b,
ae_int_t* n,
double va,
ae_int_t vb,
ae_state *_state);
void tagheapreplacetopi(/* Real */ ae_vector* a,
/* Integer */ ae_vector* b,
ae_int_t n,
double va,
ae_int_t vb,
ae_state *_state);
void tagheappopi(/* Real */ ae_vector* a,
/* Integer */ ae_vector* b,
ae_int_t* n,
ae_state *_state);
ae_int_t lowerbound(/* Real */ ae_vector* a,
ae_int_t n,
double t,
ae_state *_state);
ae_int_t upperbound(/* Real */ ae_vector* a,
ae_int_t n,
double t,
ae_state *_state);
void rankx(/* Real */ ae_vector* x,
ae_int_t n,
ae_bool iscentered,
apbuffers* buf,
ae_state *_state);
ae_bool cmatrixrank1f(ae_int_t m,
ae_int_t n,
/* Complex */ ae_matrix* a,
ae_int_t ia,
ae_int_t ja,
/* Complex */ ae_vector* u,
ae_int_t iu,
/* Complex */ ae_vector* v,
ae_int_t iv,
ae_state *_state);
ae_bool rmatrixrank1f(ae_int_t m,
ae_int_t n,
/* Real */ ae_matrix* a,
ae_int_t ia,
ae_int_t ja,
/* Real */ ae_vector* u,
ae_int_t iu,
/* Real */ ae_vector* v,
ae_int_t iv,
ae_state *_state);
ae_bool cmatrixmvf(ae_int_t m,
ae_int_t n,
/* Complex */ ae_matrix* a,
ae_int_t ia,
ae_int_t ja,
ae_int_t opa,
/* Complex */ ae_vector* x,
ae_int_t ix,
/* Complex */ ae_vector* y,
ae_int_t iy,
ae_state *_state);
ae_bool rmatrixmvf(ae_int_t m,
ae_int_t n,
/* Real */ ae_matrix* a,
ae_int_t ia,
ae_int_t ja,
ae_int_t opa,
/* Real */ ae_vector* x,
ae_int_t ix,
/* Real */ ae_vector* y,
ae_int_t iy,
ae_state *_state);
ae_bool cmatrixrighttrsmf(ae_int_t m,
ae_int_t n,
/* Complex */ ae_matrix* a,
ae_int_t i1,
ae_int_t j1,
ae_bool isupper,
ae_bool isunit,
ae_int_t optype,
/* Complex */ ae_matrix* x,
ae_int_t i2,
ae_int_t j2,
ae_state *_state);
ae_bool cmatrixlefttrsmf(ae_int_t m,
ae_int_t n,
/* Complex */ ae_matrix* a,
ae_int_t i1,
ae_int_t j1,
ae_bool isupper,
ae_bool isunit,
ae_int_t optype,
/* Complex */ ae_matrix* x,
ae_int_t i2,
ae_int_t j2,
ae_state *_state);
ae_bool rmatrixrighttrsmf(ae_int_t m,
ae_int_t n,
/* Real */ ae_matrix* a,
ae_int_t i1,
ae_int_t j1,
ae_bool isupper,
ae_bool isunit,
ae_int_t optype,
/* Real */ ae_matrix* x,
ae_int_t i2,
ae_int_t j2,
ae_state *_state);
ae_bool rmatrixlefttrsmf(ae_int_t m,
ae_int_t n,
/* Real */ ae_matrix* a,
ae_int_t i1,
ae_int_t j1,
ae_bool isupper,
ae_bool isunit,
ae_int_t optype,
/* Real */ ae_matrix* x,
ae_int_t i2,
ae_int_t j2,
ae_state *_state);
ae_bool cmatrixherkf(ae_int_t n,
ae_int_t k,
double alpha,
/* Complex */ ae_matrix* a,
ae_int_t ia,
ae_int_t ja,
ae_int_t optypea,
double beta,
/* Complex */ ae_matrix* c,
ae_int_t ic,
ae_int_t jc,
ae_bool isupper,
ae_state *_state);
ae_bool rmatrixsyrkf(ae_int_t n,
ae_int_t k,
double alpha,
/* Real */ ae_matrix* a,
ae_int_t ia,
ae_int_t ja,
ae_int_t optypea,
double beta,
/* Real */ ae_matrix* c,
ae_int_t ic,
ae_int_t jc,
ae_bool isupper,
ae_state *_state);
ae_bool rmatrixgemmf(ae_int_t m,
ae_int_t n,
ae_int_t k,
double alpha,
/* Real */ ae_matrix* a,
ae_int_t ia,
ae_int_t ja,
ae_int_t optypea,
/* Real */ ae_matrix* b,
ae_int_t ib,
ae_int_t jb,
ae_int_t optypeb,
double beta,
/* Real */ ae_matrix* c,
ae_int_t ic,
ae_int_t jc,
ae_state *_state);
ae_bool cmatrixgemmf(ae_int_t m,
ae_int_t n,
ae_int_t k,
ae_complex alpha,
/* Complex */ ae_matrix* a,
ae_int_t ia,
ae_int_t ja,
ae_int_t optypea,
/* Complex */ ae_matrix* b,
ae_int_t ib,
ae_int_t jb,
ae_int_t optypeb,
ae_complex beta,
/* Complex */ ae_matrix* c,
ae_int_t ic,
ae_int_t jc,
ae_state *_state);
void cmatrixgemmk(ae_int_t m,
ae_int_t n,
ae_int_t k,
ae_complex alpha,
/* Complex */ ae_matrix* a,
ae_int_t ia,
ae_int_t ja,
ae_int_t optypea,
/* Complex */ ae_matrix* b,
ae_int_t ib,
ae_int_t jb,
ae_int_t optypeb,
ae_complex beta,
/* Complex */ ae_matrix* c,
ae_int_t ic,
ae_int_t jc,
ae_state *_state);
void rmatrixgemmk(ae_int_t m,
ae_int_t n,
ae_int_t k,
double alpha,
/* Real */ ae_matrix* a,
ae_int_t ia,
ae_int_t ja,
ae_int_t optypea,
/* Real */ ae_matrix* b,
ae_int_t ib,
ae_int_t jb,
ae_int_t optypeb,
double beta,
/* Real */ ae_matrix* c,
ae_int_t ic,
ae_int_t jc,
ae_state *_state);
void rmatrixgemmk44v00(ae_int_t m,
ae_int_t n,
ae_int_t k,
double alpha,
/* Real */ ae_matrix* a,
ae_int_t ia,
ae_int_t ja,
/* Real */ ae_matrix* b,
ae_int_t ib,
ae_int_t jb,
double beta,
/* Real */ ae_matrix* c,
ae_int_t ic,
ae_int_t jc,
ae_state *_state);
void rmatrixgemmk44v01(ae_int_t m,
ae_int_t n,
ae_int_t k,
double alpha,
/* Real */ ae_matrix* a,
ae_int_t ia,
ae_int_t ja,
/* Real */ ae_matrix* b,
ae_int_t ib,
ae_int_t jb,
double beta,
/* Real */ ae_matrix* c,
ae_int_t ic,
ae_int_t jc,
ae_state *_state);
void rmatrixgemmk44v10(ae_int_t m,
ae_int_t n,
ae_int_t k,
double alpha,
/* Real */ ae_matrix* a,
ae_int_t ia,
ae_int_t ja,
/* Real */ ae_matrix* b,
ae_int_t ib,
ae_int_t jb,
double beta,
/* Real */ ae_matrix* c,
ae_int_t ic,
ae_int_t jc,
ae_state *_state);
void rmatrixgemmk44v11(ae_int_t m,
ae_int_t n,
ae_int_t k,
double alpha,
/* Real */ ae_matrix* a,
ae_int_t ia,
ae_int_t ja,
/* Real */ ae_matrix* b,
ae_int_t ib,
ae_int_t jb,
double beta,
/* Real */ ae_matrix* c,
ae_int_t ic,
ae_int_t jc,
ae_state *_state);
ae_bool rmatrixsyrkmkl(ae_int_t n,
ae_int_t k,
double alpha,
/* Real */ ae_matrix* a,
ae_int_t ia,
ae_int_t ja,
ae_int_t optypea,
double beta,
/* Real */ ae_matrix* c,
ae_int_t ic,
ae_int_t jc,
ae_bool isupper,
ae_state *_state);
ae_bool cmatrixherkmkl(ae_int_t n,
ae_int_t k,
double alpha,
/* Complex */ ae_matrix* a,
ae_int_t ia,
ae_int_t ja,
ae_int_t optypea,
double beta,
/* Complex */ ae_matrix* c,
ae_int_t ic,
ae_int_t jc,
ae_bool isupper,
ae_state *_state);
ae_bool rmatrixgemmmkl(ae_int_t m,
ae_int_t n,
ae_int_t k,
double alpha,
/* Real */ ae_matrix* a,
ae_int_t ia,
ae_int_t ja,
ae_int_t optypea,
/* Real */ ae_matrix* b,
ae_int_t ib,
ae_int_t jb,
ae_int_t optypeb,
double beta,
/* Real */ ae_matrix* c,
ae_int_t ic,
ae_int_t jc,
ae_state *_state);
ae_bool cmatrixgemmmkl(ae_int_t m,
ae_int_t n,
ae_int_t k,
ae_complex alpha,
/* Complex */ ae_matrix* a,
ae_int_t ia,
ae_int_t ja,
ae_int_t optypea,
/* Complex */ ae_matrix* b,
ae_int_t ib,
ae_int_t jb,
ae_int_t optypeb,
ae_complex beta,
/* Complex */ ae_matrix* c,
ae_int_t ic,
ae_int_t jc,
ae_state *_state);
ae_bool cmatrixlefttrsmmkl(ae_int_t m,
ae_int_t n,
/* Complex */ ae_matrix* a,
ae_int_t i1,
ae_int_t j1,
ae_bool isupper,
ae_bool isunit,
ae_int_t optype,
/* Complex */ ae_matrix* x,
ae_int_t i2,
ae_int_t j2,
ae_state *_state);
ae_bool cmatrixrighttrsmmkl(ae_int_t m,
ae_int_t n,
/* Complex */ ae_matrix* a,
ae_int_t i1,
ae_int_t j1,
ae_bool isupper,
ae_bool isunit,
ae_int_t optype,
/* Complex */ ae_matrix* x,
ae_int_t i2,
ae_int_t j2,
ae_state *_state);
ae_bool rmatrixlefttrsmmkl(ae_int_t m,
ae_int_t n,
/* Real */ ae_matrix* a,
ae_int_t i1,
ae_int_t j1,
ae_bool isupper,
ae_bool isunit,
ae_int_t optype,
/* Real */ ae_matrix* x,
ae_int_t i2,
ae_int_t j2,
ae_state *_state);
ae_bool rmatrixrighttrsmmkl(ae_int_t m,
ae_int_t n,
/* Real */ ae_matrix* a,
ae_int_t i1,
ae_int_t j1,
ae_bool isupper,
ae_bool isunit,
ae_int_t optype,
/* Real */ ae_matrix* x,
ae_int_t i2,
ae_int_t j2,
ae_state *_state);
ae_bool spdmatrixcholeskymkl(/* Real */ ae_matrix* a,
ae_int_t offs,
ae_int_t n,
ae_bool isupper,
ae_bool* cholresult,
ae_state *_state);
ae_bool rmatrixplumkl(/* Real */ ae_matrix* a,
ae_int_t offs,
ae_int_t m,
ae_int_t n,
/* Integer */ ae_vector* pivots,
ae_state *_state);
ae_bool rmatrixbdmkl(/* Real */ ae_matrix* a,
ae_int_t m,
ae_int_t n,
/* Real */ ae_vector* d,
/* Real */ ae_vector* e,
/* Real */ ae_vector* tauq,
/* Real */ ae_vector* taup,
ae_state *_state);
ae_bool rmatrixbdmultiplybymkl(/* Real */ ae_matrix* qp,
ae_int_t m,
ae_int_t n,
/* Real */ ae_vector* tauq,
/* Real */ ae_vector* taup,
/* Real */ ae_matrix* z,
ae_int_t zrows,
ae_int_t zcolumns,
ae_bool byq,
ae_bool fromtheright,
ae_bool dotranspose,
ae_state *_state);
ae_bool rmatrixhessenbergmkl(/* Real */ ae_matrix* a,
ae_int_t n,
/* Real */ ae_vector* tau,
ae_state *_state);
ae_bool rmatrixhessenbergunpackqmkl(/* Real */ ae_matrix* a,
ae_int_t n,
/* Real */ ae_vector* tau,
/* Real */ ae_matrix* q,
ae_state *_state);
ae_bool smatrixtdmkl(/* Real */ ae_matrix* a,
ae_int_t n,
ae_bool isupper,
/* Real */ ae_vector* tau,
/* Real */ ae_vector* d,
/* Real */ ae_vector* e,
ae_state *_state);
ae_bool smatrixtdunpackqmkl(/* Real */ ae_matrix* a,
ae_int_t n,
ae_bool isupper,
/* Real */ ae_vector* tau,
/* Real */ ae_matrix* q,
ae_state *_state);
ae_bool hmatrixtdmkl(/* Complex */ ae_matrix* a,
ae_int_t n,
ae_bool isupper,
/* Complex */ ae_vector* tau,
/* Real */ ae_vector* d,
/* Real */ ae_vector* e,
ae_state *_state);
ae_bool hmatrixtdunpackqmkl(/* Complex */ ae_matrix* a,
ae_int_t n,
ae_bool isupper,
/* Complex */ ae_vector* tau,
/* Complex */ ae_matrix* q,
ae_state *_state);
ae_bool rmatrixbdsvdmkl(/* Real */ ae_vector* d,
/* Real */ ae_vector* e,
ae_int_t n,
ae_bool isupper,
/* Real */ ae_matrix* u,
ae_int_t nru,
/* Real */ ae_matrix* c,
ae_int_t ncc,
/* Real */ ae_matrix* vt,
ae_int_t ncvt,
ae_bool* svdresult,
ae_state *_state);
ae_bool rmatrixinternalschurdecompositionmkl(/* Real */ ae_matrix* h,
ae_int_t n,
ae_int_t tneeded,
ae_int_t zneeded,
/* Real */ ae_vector* wr,
/* Real */ ae_vector* wi,
/* Real */ ae_matrix* z,
ae_int_t* info,
ae_state *_state);
ae_bool rmatrixinternaltrevcmkl(/* Real */ ae_matrix* t,
ae_int_t n,
ae_int_t side,
ae_int_t howmny,
/* Real */ ae_matrix* vl,
/* Real */ ae_matrix* vr,
ae_int_t* m,
ae_int_t* info,
ae_state *_state);
ae_bool smatrixtdevdmkl(/* Real */ ae_vector* d,
/* Real */ ae_vector* e,
ae_int_t n,
ae_int_t zneeded,
/* Real */ ae_matrix* z,
ae_bool* evdresult,
ae_state *_state);
double vectornorm2(/* Real */ ae_vector* x,
ae_int_t i1,
ae_int_t i2,
ae_state *_state);
ae_int_t vectoridxabsmax(/* Real */ ae_vector* x,
ae_int_t i1,
ae_int_t i2,
ae_state *_state);
ae_int_t columnidxabsmax(/* Real */ ae_matrix* x,
ae_int_t i1,
ae_int_t i2,
ae_int_t j,
ae_state *_state);
ae_int_t rowidxabsmax(/* Real */ ae_matrix* x,
ae_int_t j1,
ae_int_t j2,
ae_int_t i,
ae_state *_state);
double upperhessenberg1norm(/* Real */ ae_matrix* a,
ae_int_t i1,
ae_int_t i2,
ae_int_t j1,
ae_int_t j2,
/* Real */ ae_vector* work,
ae_state *_state);
void copymatrix(/* Real */ ae_matrix* a,
ae_int_t is1,
ae_int_t is2,
ae_int_t js1,
ae_int_t js2,
/* Real */ ae_matrix* b,
ae_int_t id1,
ae_int_t id2,
ae_int_t jd1,
ae_int_t jd2,
ae_state *_state);
void inplacetranspose(/* Real */ ae_matrix* a,
ae_int_t i1,
ae_int_t i2,
ae_int_t j1,
ae_int_t j2,
/* Real */ ae_vector* work,
ae_state *_state);
void copyandtranspose(/* Real */ ae_matrix* a,
ae_int_t is1,
ae_int_t is2,
ae_int_t js1,
ae_int_t js2,
/* Real */ ae_matrix* b,
ae_int_t id1,
ae_int_t id2,
ae_int_t jd1,
ae_int_t jd2,
ae_state *_state);
void matrixvectormultiply(/* Real */ ae_matrix* a,
ae_int_t i1,
ae_int_t i2,
ae_int_t j1,
ae_int_t j2,
ae_bool trans,
/* Real */ ae_vector* x,
ae_int_t ix1,
ae_int_t ix2,
double alpha,
/* Real */ ae_vector* y,
ae_int_t iy1,
ae_int_t iy2,
double beta,
ae_state *_state);
double pythag2(double x, double y, ae_state *_state);
void matrixmatrixmultiply(/* Real */ ae_matrix* a,
ae_int_t ai1,
ae_int_t ai2,
ae_int_t aj1,
ae_int_t aj2,
ae_bool transa,
/* Real */ ae_matrix* b,
ae_int_t bi1,
ae_int_t bi2,
ae_int_t bj1,
ae_int_t bj2,
ae_bool transb,
double alpha,
/* Real */ ae_matrix* c,
ae_int_t ci1,
ae_int_t ci2,
ae_int_t cj1,
ae_int_t cj2,
double beta,
/* Real */ ae_vector* work,
ae_state *_state);
void hermitianmatrixvectormultiply(/* Complex */ ae_matrix* a,
ae_bool isupper,
ae_int_t i1,
ae_int_t i2,
/* Complex */ ae_vector* x,
ae_complex alpha,
/* Complex */ ae_vector* y,
ae_state *_state);
void hermitianrank2update(/* Complex */ ae_matrix* a,
ae_bool isupper,
ae_int_t i1,
ae_int_t i2,
/* Complex */ ae_vector* x,
/* Complex */ ae_vector* y,
/* Complex */ ae_vector* t,
ae_complex alpha,
ae_state *_state);
void generatereflection(/* Real */ ae_vector* x,
ae_int_t n,
double* tau,
ae_state *_state);
void applyreflectionfromtheleft(/* Real */ ae_matrix* c,
double tau,
/* Real */ ae_vector* v,
ae_int_t m1,
ae_int_t m2,
ae_int_t n1,
ae_int_t n2,
/* Real */ ae_vector* work,
ae_state *_state);
void applyreflectionfromtheright(/* Real */ ae_matrix* c,
double tau,
/* Real */ ae_vector* v,
ae_int_t m1,
ae_int_t m2,
ae_int_t n1,
ae_int_t n2,
/* Real */ ae_vector* work,
ae_state *_state);
void complexgeneratereflection(/* Complex */ ae_vector* x,
ae_int_t n,
ae_complex* tau,
ae_state *_state);
void complexapplyreflectionfromtheleft(/* Complex */ ae_matrix* c,
ae_complex tau,
/* Complex */ ae_vector* v,
ae_int_t m1,
ae_int_t m2,
ae_int_t n1,
ae_int_t n2,
/* Complex */ ae_vector* work,
ae_state *_state);
void complexapplyreflectionfromtheright(/* Complex */ ae_matrix* c,
ae_complex tau,
/* Complex */ ae_vector* v,
ae_int_t m1,
ae_int_t m2,
ae_int_t n1,
ae_int_t n2,
/* Complex */ ae_vector* work,
ae_state *_state);
void symmetricmatrixvectormultiply(/* Real */ ae_matrix* a,
ae_bool isupper,
ae_int_t i1,
ae_int_t i2,
/* Real */ ae_vector* x,
double alpha,
/* Real */ ae_vector* y,
ae_state *_state);
void symmetricrank2update(/* Real */ ae_matrix* a,
ae_bool isupper,
ae_int_t i1,
ae_int_t i2,
/* Real */ ae_vector* x,
/* Real */ ae_vector* y,
/* Real */ ae_vector* t,
double alpha,
ae_state *_state);
void applyrotationsfromtheleft(ae_bool isforward,
ae_int_t m1,
ae_int_t m2,
ae_int_t n1,
ae_int_t n2,
/* Real */ ae_vector* c,
/* Real */ ae_vector* s,
/* Real */ ae_matrix* a,
/* Real */ ae_vector* work,
ae_state *_state);
void applyrotationsfromtheright(ae_bool isforward,
ae_int_t m1,
ae_int_t m2,
ae_int_t n1,
ae_int_t n2,
/* Real */ ae_vector* c,
/* Real */ ae_vector* s,
/* Real */ ae_matrix* a,
/* Real */ ae_vector* work,
ae_state *_state);
void generaterotation(double f,
double g,
double* cs,
double* sn,
double* r,
ae_state *_state);
void rmatrixinternalschurdecomposition(/* Real */ ae_matrix* h,
ae_int_t n,
ae_int_t tneeded,
ae_int_t zneeded,
/* Real */ ae_vector* wr,
/* Real */ ae_vector* wi,
/* Real */ ae_matrix* z,
ae_int_t* info,
ae_state *_state);
ae_bool upperhessenbergschurdecomposition(/* Real */ ae_matrix* h,
ae_int_t n,
/* Real */ ae_matrix* s,
ae_state *_state);
void internalschurdecomposition(/* Real */ ae_matrix* h,
ae_int_t n,
ae_int_t tneeded,
ae_int_t zneeded,
/* Real */ ae_vector* wr,
/* Real */ ae_vector* wi,
/* Real */ ae_matrix* z,
ae_int_t* info,
ae_state *_state);
void rmatrixtrsafesolve(/* Real */ ae_matrix* a,
ae_int_t n,
/* Real */ ae_vector* x,
double* s,
ae_bool isupper,
ae_bool istrans,
ae_bool isunit,
ae_state *_state);
void safesolvetriangular(/* Real */ ae_matrix* a,
ae_int_t n,
/* Real */ ae_vector* x,
double* s,
ae_bool isupper,
ae_bool istrans,
ae_bool isunit,
ae_bool normin,
/* Real */ ae_vector* cnorm,
ae_state *_state);
ae_bool rmatrixscaledtrsafesolve(/* Real */ ae_matrix* a,
double sa,
ae_int_t n,
/* Real */ ae_vector* x,
ae_bool isupper,
ae_int_t trans,
ae_bool isunit,
double maxgrowth,
ae_state *_state);
ae_bool cmatrixscaledtrsafesolve(/* Complex */ ae_matrix* a,
double sa,
ae_int_t n,
/* Complex */ ae_vector* x,
ae_bool isupper,
ae_int_t trans,
ae_bool isunit,
double maxgrowth,
ae_state *_state);
void hpcpreparechunkedgradient(/* Real */ ae_vector* weights,
ae_int_t wcount,
ae_int_t ntotal,
ae_int_t nin,
ae_int_t nout,
mlpbuffers* buf,
ae_state *_state);
void hpcfinalizechunkedgradient(mlpbuffers* buf,
/* Real */ ae_vector* grad,
ae_state *_state);
ae_bool hpcchunkedgradient(/* Real */ ae_vector* weights,
/* Integer */ ae_vector* structinfo,
/* Real */ ae_vector* columnmeans,
/* Real */ ae_vector* columnsigmas,
/* Real */ ae_matrix* xy,
ae_int_t cstart,
ae_int_t csize,
/* Real */ ae_vector* batch4buf,
/* Real */ ae_vector* hpcbuf,
double* e,
ae_bool naturalerrorfunc,
ae_state *_state);
ae_bool hpcchunkedprocess(/* Real */ ae_vector* weights,
/* Integer */ ae_vector* structinfo,
/* Real */ ae_vector* columnmeans,
/* Real */ ae_vector* columnsigmas,
/* Real */ ae_matrix* xy,
ae_int_t cstart,
ae_int_t csize,
/* Real */ ae_vector* batch4buf,
/* Real */ ae_vector* hpcbuf,
ae_state *_state);
void _mlpbuffers_init(void* _p, ae_state *_state);
void _mlpbuffers_init_copy(void* _dst, void* _src, ae_state *_state);
void _mlpbuffers_clear(void* _p);
void _mlpbuffers_destroy(void* _p);
void xdot(/* Real */ ae_vector* a,
/* Real */ ae_vector* b,
ae_int_t n,
/* Real */ ae_vector* temp,
double* r,
double* rerr,
ae_state *_state);
void xcdot(/* Complex */ ae_vector* a,
/* Complex */ ae_vector* b,
ae_int_t n,
/* Real */ ae_vector* temp,
ae_complex* r,
double* rerr,
ae_state *_state);
void linminnormalized(/* Real */ ae_vector* d,
double* stp,
ae_int_t n,
ae_state *_state);
void mcsrch(ae_int_t n,
/* Real */ ae_vector* x,
double* f,
/* Real */ ae_vector* g,
/* Real */ ae_vector* s,
double* stp,
double stpmax,
double gtol,
ae_int_t* info,
ae_int_t* nfev,
/* Real */ ae_vector* wa,
linminstate* state,
ae_int_t* stage,
ae_state *_state);
void armijocreate(ae_int_t n,
/* Real */ ae_vector* x,
double f,
/* Real */ ae_vector* s,
double stp,
double stpmax,
ae_int_t fmax,
armijostate* state,
ae_state *_state);
ae_bool armijoiteration(armijostate* state, ae_state *_state);
void armijoresults(armijostate* state,
ae_int_t* info,
double* stp,
double* f,
ae_state *_state);
void _linminstate_init(void* _p, ae_state *_state);
void _linminstate_init_copy(void* _dst, void* _src, ae_state *_state);
void _linminstate_clear(void* _p);
void _linminstate_destroy(void* _p);
void _armijostate_init(void* _p, ae_state *_state);
void _armijostate_init_copy(void* _dst, void* _src, ae_state *_state);
void _armijostate_clear(void* _p);
void _armijostate_destroy(void* _p);
void findprimitiverootandinverse(ae_int_t n,
ae_int_t* proot,
ae_int_t* invproot,
ae_state *_state);
void ftcomplexfftplan(ae_int_t n,
ae_int_t k,
fasttransformplan* plan,
ae_state *_state);
void ftapplyplan(fasttransformplan* plan,
/* Real */ ae_vector* a,
ae_int_t offsa,
ae_int_t repcnt,
ae_state *_state);
void ftbasefactorize(ae_int_t n,
ae_int_t tasktype,
ae_int_t* n1,
ae_int_t* n2,
ae_state *_state);
ae_bool ftbaseissmooth(ae_int_t n, ae_state *_state);
ae_int_t ftbasefindsmooth(ae_int_t n, ae_state *_state);
ae_int_t ftbasefindsmootheven(ae_int_t n, ae_state *_state);
double ftbasegetflopestimate(ae_int_t n, ae_state *_state);
void _fasttransformplan_init(void* _p, ae_state *_state);
void _fasttransformplan_init_copy(void* _dst, void* _src, ae_state *_state);
void _fasttransformplan_clear(void* _p);
void _fasttransformplan_destroy(void* _p);
double nulog1p(double x, ae_state *_state);
double nuexpm1(double x, ae_state *_state);
double nucosm1(double x, ae_state *_state);
}
#endif
qmapshack-1.10.0/3rdparty/alglib/src/specialfunctions.h 000755 001750 000144 00000174747 13015033052 024254 0 ustar 00oeichlerx users 000000 000000 /*************************************************************************
ALGLIB 3.10.0 (source code generated 2015-08-19)
Copyright (c) Sergey Bochkanov (ALGLIB project).
>>> SOURCE LICENSE >>>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation (www.fsf.org); either version 2 of the
License, or (at your option) any later version.
This program 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 General Public License for more details.
A copy of the GNU General Public License is available at
http://www.fsf.org/licensing/licenses
>>> END OF LICENSE >>>
*************************************************************************/
#ifndef _specialfunctions_pkg_h
#define _specialfunctions_pkg_h
#include "ap.h"
#include "alglibinternal.h"
/////////////////////////////////////////////////////////////////////////
//
// THIS SECTION CONTAINS COMPUTATIONAL CORE DECLARATIONS (DATATYPES)
//
/////////////////////////////////////////////////////////////////////////
namespace alglib_impl
{
}
/////////////////////////////////////////////////////////////////////////
//
// THIS SECTION CONTAINS C++ INTERFACE
//
/////////////////////////////////////////////////////////////////////////
namespace alglib
{
/*************************************************************************
Gamma function
Input parameters:
X - argument
Domain:
0 < X < 171.6
-170 < X < 0, X is not an integer.
Relative error:
arithmetic domain # trials peak rms
IEEE -170,-33 20000 2.3e-15 3.3e-16
IEEE -33, 33 20000 9.4e-16 2.2e-16
IEEE 33, 171.6 20000 2.3e-15 3.2e-16
Cephes Math Library Release 2.8: June, 2000
Original copyright 1984, 1987, 1989, 1992, 2000 by Stephen L. Moshier
Translated to AlgoPascal by Bochkanov Sergey (2005, 2006, 2007).
*************************************************************************/
double gammafunction(const double x);
/*************************************************************************
Natural logarithm of gamma function
Input parameters:
X - argument
Result:
logarithm of the absolute value of the Gamma(X).
Output parameters:
SgnGam - sign(Gamma(X))
Domain:
0 < X < 2.55e305
-2.55e305 < X < 0, X is not an integer.
ACCURACY:
arithmetic domain # trials peak rms
IEEE 0, 3 28000 5.4e-16 1.1e-16
IEEE 2.718, 2.556e305 40000 3.5e-16 8.3e-17
The error criterion was relative when the function magnitude
was greater than one but absolute when it was less than one.
The following test used the relative error criterion, though
at certain points the relative error could be much higher than
indicated.
IEEE -200, -4 10000 4.8e-16 1.3e-16
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1989, 1992, 2000 by Stephen L. Moshier
Translated to AlgoPascal by Bochkanov Sergey (2005, 2006, 2007).
*************************************************************************/
double lngamma(const double x, double &sgngam);
/*************************************************************************
Error function
The integral is
x
-
2 | | 2
erf(x) = -------- | exp( - t ) dt.
sqrt(pi) | |
-
0
For 0 <= |x| < 1, erf(x) = x * P4(x**2)/Q5(x**2); otherwise
erf(x) = 1 - erfc(x).
ACCURACY:
Relative error:
arithmetic domain # trials peak rms
IEEE 0,1 30000 3.7e-16 1.0e-16
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1988, 1992, 2000 by Stephen L. Moshier
*************************************************************************/
double errorfunction(const double x);
/*************************************************************************
Complementary error function
1 - erf(x) =
inf.
-
2 | | 2
erfc(x) = -------- | exp( - t ) dt
sqrt(pi) | |
-
x
For small x, erfc(x) = 1 - erf(x); otherwise rational
approximations are computed.
ACCURACY:
Relative error:
arithmetic domain # trials peak rms
IEEE 0,26.6417 30000 5.7e-14 1.5e-14
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1988, 1992, 2000 by Stephen L. Moshier
*************************************************************************/
double errorfunctionc(const double x);
/*************************************************************************
Normal distribution function
Returns the area under the Gaussian probability density
function, integrated from minus infinity to x:
x
-
1 | | 2
ndtr(x) = --------- | exp( - t /2 ) dt
sqrt(2pi) | |
-
-inf.
= ( 1 + erf(z) ) / 2
= erfc(z) / 2
where z = x/sqrt(2). Computation is via the functions
erf and erfc.
ACCURACY:
Relative error:
arithmetic domain # trials peak rms
IEEE -13,0 30000 3.4e-14 6.7e-15
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1988, 1992, 2000 by Stephen L. Moshier
*************************************************************************/
double normaldistribution(const double x);
/*************************************************************************
Inverse of the error function
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1988, 1992, 2000 by Stephen L. Moshier
*************************************************************************/
double inverf(const double e);
/*************************************************************************
Inverse of Normal distribution function
Returns the argument, x, for which the area under the
Gaussian probability density function (integrated from
minus infinity to x) is equal to y.
For small arguments 0 < y < exp(-2), the program computes
z = sqrt( -2.0 * log(y) ); then the approximation is
x = z - log(z)/z - (1/z) P(1/z) / Q(1/z).
There are two rational functions P/Q, one for 0 < y < exp(-32)
and the other for y up to exp(-2). For larger arguments,
w = y - 0.5, and x/sqrt(2pi) = w + w**3 R(w**2)/S(w**2)).
ACCURACY:
Relative error:
arithmetic domain # trials peak rms
IEEE 0.125, 1 20000 7.2e-16 1.3e-16
IEEE 3e-308, 0.135 50000 4.6e-16 9.8e-17
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1988, 1992, 2000 by Stephen L. Moshier
*************************************************************************/
double invnormaldistribution(const double y0);
/*************************************************************************
Incomplete gamma integral
The function is defined by
x
-
1 | | -t a-1
igam(a,x) = ----- | e t dt.
- | |
| (a) -
0
In this implementation both arguments must be positive.
The integral is evaluated by either a power series or
continued fraction expansion, depending on the relative
values of a and x.
ACCURACY:
Relative error:
arithmetic domain # trials peak rms
IEEE 0,30 200000 3.6e-14 2.9e-15
IEEE 0,100 300000 9.9e-14 1.5e-14
Cephes Math Library Release 2.8: June, 2000
Copyright 1985, 1987, 2000 by Stephen L. Moshier
*************************************************************************/
double incompletegamma(const double a, const double x);
/*************************************************************************
Complemented incomplete gamma integral
The function is defined by
igamc(a,x) = 1 - igam(a,x)
inf.
-
1 | | -t a-1
= ----- | e t dt.
- | |
| (a) -
x
In this implementation both arguments must be positive.
The integral is evaluated by either a power series or
continued fraction expansion, depending on the relative
values of a and x.
ACCURACY:
Tested at random a, x.
a x Relative error:
arithmetic domain domain # trials peak rms
IEEE 0.5,100 0,100 200000 1.9e-14 1.7e-15
IEEE 0.01,0.5 0,100 200000 1.4e-13 1.6e-15
Cephes Math Library Release 2.8: June, 2000
Copyright 1985, 1987, 2000 by Stephen L. Moshier
*************************************************************************/
double incompletegammac(const double a, const double x);
/*************************************************************************
Inverse of complemented imcomplete gamma integral
Given p, the function finds x such that
igamc( a, x ) = p.
Starting with the approximate value
3
x = a t
where
t = 1 - d - ndtri(p) sqrt(d)
and
d = 1/9a,
the routine performs up to 10 Newton iterations to find the
root of igamc(a,x) - p = 0.
ACCURACY:
Tested at random a, p in the intervals indicated.
a p Relative error:
arithmetic domain domain # trials peak rms
IEEE 0.5,100 0,0.5 100000 1.0e-14 1.7e-15
IEEE 0.01,0.5 0,0.5 100000 9.0e-14 3.4e-15
IEEE 0.5,10000 0,0.5 20000 2.3e-13 3.8e-14
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1995, 2000 by Stephen L. Moshier
*************************************************************************/
double invincompletegammac(const double a, const double y0);
/*************************************************************************
Airy function
Solution of the differential equation
y"(x) = xy.
The function returns the two independent solutions Ai, Bi
and their first derivatives Ai'(x), Bi'(x).
Evaluation is by power series summation for small x,
by rational minimax approximations for large x.
ACCURACY:
Error criterion is absolute when function <= 1, relative
when function > 1, except * denotes relative error criterion.
For large negative x, the absolute error increases as x^1.5.
For large positive x, the relative error increases as x^1.5.
Arithmetic domain function # trials peak rms
IEEE -10, 0 Ai 10000 1.6e-15 2.7e-16
IEEE 0, 10 Ai 10000 2.3e-14* 1.8e-15*
IEEE -10, 0 Ai' 10000 4.6e-15 7.6e-16
IEEE 0, 10 Ai' 10000 1.8e-14* 1.5e-15*
IEEE -10, 10 Bi 30000 4.2e-15 5.3e-16
IEEE -10, 10 Bi' 30000 4.9e-15 7.3e-16
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1989, 2000 by Stephen L. Moshier
*************************************************************************/
void airy(const double x, double &ai, double &aip, double &bi, double &bip);
/*************************************************************************
Bessel function of order zero
Returns Bessel function of order zero of the argument.
The domain is divided into the intervals [0, 5] and
(5, infinity). In the first interval the following rational
approximation is used:
2 2
(w - r ) (w - r ) P (w) / Q (w)
1 2 3 8
2
where w = x and the two r's are zeros of the function.
In the second interval, the Hankel asymptotic expansion
is employed with two rational functions of degree 6/6
and 7/7.
ACCURACY:
Absolute error:
arithmetic domain # trials peak rms
IEEE 0, 30 60000 4.2e-16 1.1e-16
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1989, 2000 by Stephen L. Moshier
*************************************************************************/
double besselj0(const double x);
/*************************************************************************
Bessel function of order one
Returns Bessel function of order one of the argument.
The domain is divided into the intervals [0, 8] and
(8, infinity). In the first interval a 24 term Chebyshev
expansion is used. In the second, the asymptotic
trigonometric representation is employed using two
rational functions of degree 5/5.
ACCURACY:
Absolute error:
arithmetic domain # trials peak rms
IEEE 0, 30 30000 2.6e-16 1.1e-16
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1989, 2000 by Stephen L. Moshier
*************************************************************************/
double besselj1(const double x);
/*************************************************************************
Bessel function of integer order
Returns Bessel function of order n, where n is a
(possibly negative) integer.
The ratio of jn(x) to j0(x) is computed by backward
recurrence. First the ratio jn/jn-1 is found by a
continued fraction expansion. Then the recurrence
relating successive orders is applied until j0 or j1 is
reached.
If n = 0 or 1 the routine for j0 or j1 is called
directly.
ACCURACY:
Absolute error:
arithmetic range # trials peak rms
IEEE 0, 30 5000 4.4e-16 7.9e-17
Not suitable for large n or x. Use jv() (fractional order) instead.
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 2000 by Stephen L. Moshier
*************************************************************************/
double besseljn(const ae_int_t n, const double x);
/*************************************************************************
Bessel function of the second kind, order zero
Returns Bessel function of the second kind, of order
zero, of the argument.
The domain is divided into the intervals [0, 5] and
(5, infinity). In the first interval a rational approximation
R(x) is employed to compute
y0(x) = R(x) + 2 * log(x) * j0(x) / PI.
Thus a call to j0() is required.
In the second interval, the Hankel asymptotic expansion
is employed with two rational functions of degree 6/6
and 7/7.
ACCURACY:
Absolute error, when y0(x) < 1; else relative error:
arithmetic domain # trials peak rms
IEEE 0, 30 30000 1.3e-15 1.6e-16
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1989, 2000 by Stephen L. Moshier
*************************************************************************/
double bessely0(const double x);
/*************************************************************************
Bessel function of second kind of order one
Returns Bessel function of the second kind of order one
of the argument.
The domain is divided into the intervals [0, 8] and
(8, infinity). In the first interval a 25 term Chebyshev
expansion is used, and a call to j1() is required.
In the second, the asymptotic trigonometric representation
is employed using two rational functions of degree 5/5.
ACCURACY:
Absolute error:
arithmetic domain # trials peak rms
IEEE 0, 30 30000 1.0e-15 1.3e-16
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1989, 2000 by Stephen L. Moshier
*************************************************************************/
double bessely1(const double x);
/*************************************************************************
Bessel function of second kind of integer order
Returns Bessel function of order n, where n is a
(possibly negative) integer.
The function is evaluated by forward recurrence on
n, starting with values computed by the routines
y0() and y1().
If n = 0 or 1 the routine for y0 or y1 is called
directly.
ACCURACY:
Absolute error, except relative
when y > 1:
arithmetic domain # trials peak rms
IEEE 0, 30 30000 3.4e-15 4.3e-16
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 2000 by Stephen L. Moshier
*************************************************************************/
double besselyn(const ae_int_t n, const double x);
/*************************************************************************
Modified Bessel function of order zero
Returns modified Bessel function of order zero of the
argument.
The function is defined as i0(x) = j0( ix ).
The range is partitioned into the two intervals [0,8] and
(8, infinity). Chebyshev polynomial expansions are employed
in each interval.
ACCURACY:
Relative error:
arithmetic domain # trials peak rms
IEEE 0,30 30000 5.8e-16 1.4e-16
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 2000 by Stephen L. Moshier
*************************************************************************/
double besseli0(const double x);
/*************************************************************************
Modified Bessel function of order one
Returns modified Bessel function of order one of the
argument.
The function is defined as i1(x) = -i j1( ix ).
The range is partitioned into the two intervals [0,8] and
(8, infinity). Chebyshev polynomial expansions are employed
in each interval.
ACCURACY:
Relative error:
arithmetic domain # trials peak rms
IEEE 0, 30 30000 1.9e-15 2.1e-16
Cephes Math Library Release 2.8: June, 2000
Copyright 1985, 1987, 2000 by Stephen L. Moshier
*************************************************************************/
double besseli1(const double x);
/*************************************************************************
Modified Bessel function, second kind, order zero
Returns modified Bessel function of the second kind
of order zero of the argument.
The range is partitioned into the two intervals [0,8] and
(8, infinity). Chebyshev polynomial expansions are employed
in each interval.
ACCURACY:
Tested at 2000 random points between 0 and 8. Peak absolute
error (relative when K0 > 1) was 1.46e-14; rms, 4.26e-15.
Relative error:
arithmetic domain # trials peak rms
IEEE 0, 30 30000 1.2e-15 1.6e-16
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 2000 by Stephen L. Moshier
*************************************************************************/
double besselk0(const double x);
/*************************************************************************
Modified Bessel function, second kind, order one
Computes the modified Bessel function of the second kind
of order one of the argument.
The range is partitioned into the two intervals [0,2] and
(2, infinity). Chebyshev polynomial expansions are employed
in each interval.
ACCURACY:
Relative error:
arithmetic domain # trials peak rms
IEEE 0, 30 30000 1.2e-15 1.6e-16
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 2000 by Stephen L. Moshier
*************************************************************************/
double besselk1(const double x);
/*************************************************************************
Modified Bessel function, second kind, integer order
Returns modified Bessel function of the second kind
of order n of the argument.
The range is partitioned into the two intervals [0,9.55] and
(9.55, infinity). An ascending power series is used in the
low range, and an asymptotic expansion in the high range.
ACCURACY:
Relative error:
arithmetic domain # trials peak rms
IEEE 0,30 90000 1.8e-8 3.0e-10
Error is high only near the crossover point x = 9.55
between the two expansions used.
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1988, 2000 by Stephen L. Moshier
*************************************************************************/
double besselkn(const ae_int_t nn, const double x);
/*************************************************************************
Beta function
- -
| (a) | (b)
beta( a, b ) = -----------.
-
| (a+b)
For large arguments the logarithm of the function is
evaluated using lgam(), then exponentiated.
ACCURACY:
Relative error:
arithmetic domain # trials peak rms
IEEE 0,30 30000 8.1e-14 1.1e-14
Cephes Math Library Release 2.0: April, 1987
Copyright 1984, 1987 by Stephen L. Moshier
*************************************************************************/
double beta(const double a, const double b);
/*************************************************************************
Incomplete beta integral
Returns incomplete beta integral of the arguments, evaluated
from zero to x. The function is defined as
x
- -
| (a+b) | | a-1 b-1
----------- | t (1-t) dt.
- - | |
| (a) | (b) -
0
The domain of definition is 0 <= x <= 1. In this
implementation a and b are restricted to positive values.
The integral from x to 1 may be obtained by the symmetry
relation
1 - incbet( a, b, x ) = incbet( b, a, 1-x ).
The integral is evaluated by a continued fraction expansion
or, when b*x is small, by a power series.
ACCURACY:
Tested at uniformly distributed random points (a,b,x) with a and b
in "domain" and x between 0 and 1.
Relative error
arithmetic domain # trials peak rms
IEEE 0,5 10000 6.9e-15 4.5e-16
IEEE 0,85 250000 2.2e-13 1.7e-14
IEEE 0,1000 30000 5.3e-12 6.3e-13
IEEE 0,10000 250000 9.3e-11 7.1e-12
IEEE 0,100000 10000 8.7e-10 4.8e-11
Outputs smaller than the IEEE gradual underflow threshold
were excluded from these statistics.
Cephes Math Library, Release 2.8: June, 2000
Copyright 1984, 1995, 2000 by Stephen L. Moshier
*************************************************************************/
double incompletebeta(const double a, const double b, const double x);
/*************************************************************************
Inverse of imcomplete beta integral
Given y, the function finds x such that
incbet( a, b, x ) = y .
The routine performs interval halving or Newton iterations to find the
root of incbet(a,b,x) - y = 0.
ACCURACY:
Relative error:
x a,b
arithmetic domain domain # trials peak rms
IEEE 0,1 .5,10000 50000 5.8e-12 1.3e-13
IEEE 0,1 .25,100 100000 1.8e-13 3.9e-15
IEEE 0,1 0,5 50000 1.1e-12 5.5e-15
With a and b constrained to half-integer or integer values:
IEEE 0,1 .5,10000 50000 5.8e-12 1.1e-13
IEEE 0,1 .5,100 100000 1.7e-14 7.9e-16
With a = .5, b constrained to half-integer or integer values:
IEEE 0,1 .5,10000 10000 8.3e-11 1.0e-11
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1996, 2000 by Stephen L. Moshier
*************************************************************************/
double invincompletebeta(const double a, const double b, const double y);
/*************************************************************************
Binomial distribution
Returns the sum of the terms 0 through k of the Binomial
probability density:
k
-- ( n ) j n-j
> ( ) p (1-p)
-- ( j )
j=0
The terms are not summed directly; instead the incomplete
beta integral is employed, according to the formula
y = bdtr( k, n, p ) = incbet( n-k, k+1, 1-p ).
The arguments must be positive, with p ranging from 0 to 1.
ACCURACY:
Tested at random points (a,b,p), with p between 0 and 1.
a,b Relative error:
arithmetic domain # trials peak rms
For p between 0.001 and 1:
IEEE 0,100 100000 4.3e-15 2.6e-16
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1995, 2000 by Stephen L. Moshier
*************************************************************************/
double binomialdistribution(const ae_int_t k, const ae_int_t n, const double p);
/*************************************************************************
Complemented binomial distribution
Returns the sum of the terms k+1 through n of the Binomial
probability density:
n
-- ( n ) j n-j
> ( ) p (1-p)
-- ( j )
j=k+1
The terms are not summed directly; instead the incomplete
beta integral is employed, according to the formula
y = bdtrc( k, n, p ) = incbet( k+1, n-k, p ).
The arguments must be positive, with p ranging from 0 to 1.
ACCURACY:
Tested at random points (a,b,p).
a,b Relative error:
arithmetic domain # trials peak rms
For p between 0.001 and 1:
IEEE 0,100 100000 6.7e-15 8.2e-16
For p between 0 and .001:
IEEE 0,100 100000 1.5e-13 2.7e-15
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1995, 2000 by Stephen L. Moshier
*************************************************************************/
double binomialcdistribution(const ae_int_t k, const ae_int_t n, const double p);
/*************************************************************************
Inverse binomial distribution
Finds the event probability p such that the sum of the
terms 0 through k of the Binomial probability density
is equal to the given cumulative probability y.
This is accomplished using the inverse beta integral
function and the relation
1 - p = incbi( n-k, k+1, y ).
ACCURACY:
Tested at random points (a,b,p).
a,b Relative error:
arithmetic domain # trials peak rms
For p between 0.001 and 1:
IEEE 0,100 100000 2.3e-14 6.4e-16
IEEE 0,10000 100000 6.6e-12 1.2e-13
For p between 10^-6 and 0.001:
IEEE 0,100 100000 2.0e-12 1.3e-14
IEEE 0,10000 100000 1.5e-12 3.2e-14
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1995, 2000 by Stephen L. Moshier
*************************************************************************/
double invbinomialdistribution(const ae_int_t k, const ae_int_t n, const double y);
/*************************************************************************
Calculation of the value of the Chebyshev polynomials of the
first and second kinds.
Parameters:
r - polynomial kind, either 1 or 2.
n - degree, n>=0
x - argument, -1 <= x <= 1
Result:
the value of the Chebyshev polynomial at x
*************************************************************************/
double chebyshevcalculate(const ae_int_t r, const ae_int_t n, const double x);
/*************************************************************************
Summation of Chebyshev polynomials using Clenshaws recurrence formula.
This routine calculates
c[0]*T0(x) + c[1]*T1(x) + ... + c[N]*TN(x)
or
c[0]*U0(x) + c[1]*U1(x) + ... + c[N]*UN(x)
depending on the R.
Parameters:
r - polynomial kind, either 1 or 2.
n - degree, n>=0
x - argument
Result:
the value of the Chebyshev polynomial at x
*************************************************************************/
double chebyshevsum(const real_1d_array &c, const ae_int_t r, const ae_int_t n, const double x);
/*************************************************************************
Representation of Tn as C[0] + C[1]*X + ... + C[N]*X^N
Input parameters:
N - polynomial degree, n>=0
Output parameters:
C - coefficients
*************************************************************************/
void chebyshevcoefficients(const ae_int_t n, real_1d_array &c);
/*************************************************************************
Conversion of a series of Chebyshev polynomials to a power series.
Represents A[0]*T0(x) + A[1]*T1(x) + ... + A[N]*Tn(x) as
B[0] + B[1]*X + ... + B[N]*X^N.
Input parameters:
A - Chebyshev series coefficients
N - degree, N>=0
Output parameters
B - power series coefficients
*************************************************************************/
void fromchebyshev(const real_1d_array &a, const ae_int_t n, real_1d_array &b);
/*************************************************************************
Chi-square distribution
Returns the area under the left hand tail (from 0 to x)
of the Chi square probability density function with
v degrees of freedom.
x
-
1 | | v/2-1 -t/2
P( x | v ) = ----------- | t e dt
v/2 - | |
2 | (v/2) -
0
where x is the Chi-square variable.
The incomplete gamma integral is used, according to the
formula
y = chdtr( v, x ) = igam( v/2.0, x/2.0 ).
The arguments must both be positive.
ACCURACY:
See incomplete gamma function
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 2000 by Stephen L. Moshier
*************************************************************************/
double chisquaredistribution(const double v, const double x);
/*************************************************************************
Complemented Chi-square distribution
Returns the area under the right hand tail (from x to
infinity) of the Chi square probability density function
with v degrees of freedom:
inf.
-
1 | | v/2-1 -t/2
P( x | v ) = ----------- | t e dt
v/2 - | |
2 | (v/2) -
x
where x is the Chi-square variable.
The incomplete gamma integral is used, according to the
formula
y = chdtr( v, x ) = igamc( v/2.0, x/2.0 ).
The arguments must both be positive.
ACCURACY:
See incomplete gamma function
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 2000 by Stephen L. Moshier
*************************************************************************/
double chisquarecdistribution(const double v, const double x);
/*************************************************************************
Inverse of complemented Chi-square distribution
Finds the Chi-square argument x such that the integral
from x to infinity of the Chi-square density is equal
to the given cumulative probability y.
This is accomplished using the inverse gamma integral
function and the relation
x/2 = igami( df/2, y );
ACCURACY:
See inverse incomplete gamma function
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 2000 by Stephen L. Moshier
*************************************************************************/
double invchisquaredistribution(const double v, const double y);
/*************************************************************************
Dawson's Integral
Approximates the integral
x
-
2 | | 2
dawsn(x) = exp( -x ) | exp( t ) dt
| |
-
0
Three different rational approximations are employed, for
the intervals 0 to 3.25; 3.25 to 6.25; and 6.25 up.
ACCURACY:
Relative error:
arithmetic domain # trials peak rms
IEEE 0,10 10000 6.9e-16 1.0e-16
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1989, 2000 by Stephen L. Moshier
*************************************************************************/
double dawsonintegral(const double x);
/*************************************************************************
Complete elliptic integral of the first kind
Approximates the integral
pi/2
-
| |
| dt
K(m) = | ------------------
| 2
| | sqrt( 1 - m sin t )
-
0
using the approximation
P(x) - log x Q(x).
ACCURACY:
Relative error:
arithmetic domain # trials peak rms
IEEE 0,1 30000 2.5e-16 6.8e-17
Cephes Math Library, Release 2.8: June, 2000
Copyright 1984, 1987, 2000 by Stephen L. Moshier
*************************************************************************/
double ellipticintegralk(const double m);
/*************************************************************************
Complete elliptic integral of the first kind
Approximates the integral
pi/2
-
| |
| dt
K(m) = | ------------------
| 2
| | sqrt( 1 - m sin t )
-
0
where m = 1 - m1, using the approximation
P(x) - log x Q(x).
The argument m1 is used rather than m so that the logarithmic
singularity at m = 1 will be shifted to the origin; this
preserves maximum accuracy.
K(0) = pi/2.
ACCURACY:
Relative error:
arithmetic domain # trials peak rms
IEEE 0,1 30000 2.5e-16 6.8e-17
Cephes Math Library, Release 2.8: June, 2000
Copyright 1984, 1987, 2000 by Stephen L. Moshier
*************************************************************************/
double ellipticintegralkhighprecision(const double m1);
/*************************************************************************
Incomplete elliptic integral of the first kind F(phi|m)
Approximates the integral
phi
-
| |
| dt
F(phi_\m) = | ------------------
| 2
| | sqrt( 1 - m sin t )
-
0
of amplitude phi and modulus m, using the arithmetic -
geometric mean algorithm.
ACCURACY:
Tested at random points with m in [0, 1] and phi as indicated.
Relative error:
arithmetic domain # trials peak rms
IEEE -10,10 200000 7.4e-16 1.0e-16
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 2000 by Stephen L. Moshier
*************************************************************************/
double incompleteellipticintegralk(const double phi, const double m);
/*************************************************************************
Complete elliptic integral of the second kind
Approximates the integral
pi/2
-
| | 2
E(m) = | sqrt( 1 - m sin t ) dt
| |
-
0
using the approximation
P(x) - x log x Q(x).
ACCURACY:
Relative error:
arithmetic domain # trials peak rms
IEEE 0, 1 10000 2.1e-16 7.3e-17
Cephes Math Library, Release 2.8: June, 2000
Copyright 1984, 1987, 1989, 2000 by Stephen L. Moshier
*************************************************************************/
double ellipticintegrale(const double m);
/*************************************************************************
Incomplete elliptic integral of the second kind
Approximates the integral
phi
-
| |
| 2
E(phi_\m) = | sqrt( 1 - m sin t ) dt
|
| |
-
0
of amplitude phi and modulus m, using the arithmetic -
geometric mean algorithm.
ACCURACY:
Tested at random arguments with phi in [-10, 10] and m in
[0, 1].
Relative error:
arithmetic domain # trials peak rms
IEEE -10,10 150000 3.3e-15 1.4e-16
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1993, 2000 by Stephen L. Moshier
*************************************************************************/
double incompleteellipticintegrale(const double phi, const double m);
/*************************************************************************
Exponential integral Ei(x)
x
- t
| | e
Ei(x) = -|- --- dt .
| | t
-
-inf
Not defined for x <= 0.
See also expn.c.
ACCURACY:
Relative error:
arithmetic domain # trials peak rms
IEEE 0,100 50000 8.6e-16 1.3e-16
Cephes Math Library Release 2.8: May, 1999
Copyright 1999 by Stephen L. Moshier
*************************************************************************/
double exponentialintegralei(const double x);
/*************************************************************************
Exponential integral En(x)
Evaluates the exponential integral
inf.
-
| | -xt
| e
E (x) = | ---- dt.
n | n
| | t
-
1
Both n and x must be nonnegative.
The routine employs either a power series, a continued
fraction, or an asymptotic formula depending on the
relative values of n and x.
ACCURACY:
Relative error:
arithmetic domain # trials peak rms
IEEE 0, 30 10000 1.7e-15 3.6e-16
Cephes Math Library Release 2.8: June, 2000
Copyright 1985, 2000 by Stephen L. Moshier
*************************************************************************/
double exponentialintegralen(const double x, const ae_int_t n);
/*************************************************************************
F distribution
Returns the area from zero to x under the F density
function (also known as Snedcor's density or the
variance ratio density). This is the density
of x = (u1/df1)/(u2/df2), where u1 and u2 are random
variables having Chi square distributions with df1
and df2 degrees of freedom, respectively.
The incomplete beta integral is used, according to the
formula
P(x) = incbet( df1/2, df2/2, (df1*x/(df2 + df1*x) ).
The arguments a and b are greater than zero, and x is
nonnegative.
ACCURACY:
Tested at random points (a,b,x).
x a,b Relative error:
arithmetic domain domain # trials peak rms
IEEE 0,1 0,100 100000 9.8e-15 1.7e-15
IEEE 1,5 0,100 100000 6.5e-15 3.5e-16
IEEE 0,1 1,10000 100000 2.2e-11 3.3e-12
IEEE 1,5 1,10000 100000 1.1e-11 1.7e-13
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1995, 2000 by Stephen L. Moshier
*************************************************************************/
double fdistribution(const ae_int_t a, const ae_int_t b, const double x);
/*************************************************************************
Complemented F distribution
Returns the area from x to infinity under the F density
function (also known as Snedcor's density or the
variance ratio density).
inf.
-
1 | | a-1 b-1
1-P(x) = ------ | t (1-t) dt
B(a,b) | |
-
x
The incomplete beta integral is used, according to the
formula
P(x) = incbet( df2/2, df1/2, (df2/(df2 + df1*x) ).
ACCURACY:
Tested at random points (a,b,x) in the indicated intervals.
x a,b Relative error:
arithmetic domain domain # trials peak rms
IEEE 0,1 1,100 100000 3.7e-14 5.9e-16
IEEE 1,5 1,100 100000 8.0e-15 1.6e-15
IEEE 0,1 1,10000 100000 1.8e-11 3.5e-13
IEEE 1,5 1,10000 100000 2.0e-11 3.0e-12
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1995, 2000 by Stephen L. Moshier
*************************************************************************/
double fcdistribution(const ae_int_t a, const ae_int_t b, const double x);
/*************************************************************************
Inverse of complemented F distribution
Finds the F density argument x such that the integral
from x to infinity of the F density is equal to the
given probability p.
This is accomplished using the inverse beta integral
function and the relations
z = incbi( df2/2, df1/2, p )
x = df2 (1-z) / (df1 z).
Note: the following relations hold for the inverse of
the uncomplemented F distribution:
z = incbi( df1/2, df2/2, p )
x = df2 z / (df1 (1-z)).
ACCURACY:
Tested at random points (a,b,p).
a,b Relative error:
arithmetic domain # trials peak rms
For p between .001 and 1:
IEEE 1,100 100000 8.3e-15 4.7e-16
IEEE 1,10000 100000 2.1e-11 1.4e-13
For p between 10^-6 and 10^-3:
IEEE 1,100 50000 1.3e-12 8.4e-15
IEEE 1,10000 50000 3.0e-12 4.8e-14
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1995, 2000 by Stephen L. Moshier
*************************************************************************/
double invfdistribution(const ae_int_t a, const ae_int_t b, const double y);
/*************************************************************************
Fresnel integral
Evaluates the Fresnel integrals
x
-
| |
C(x) = | cos(pi/2 t**2) dt,
| |
-
0
x
-
| |
S(x) = | sin(pi/2 t**2) dt.
| |
-
0
The integrals are evaluated by a power series for x < 1.
For x >= 1 auxiliary functions f(x) and g(x) are employed
such that
C(x) = 0.5 + f(x) sin( pi/2 x**2 ) - g(x) cos( pi/2 x**2 )
S(x) = 0.5 - f(x) cos( pi/2 x**2 ) - g(x) sin( pi/2 x**2 )
ACCURACY:
Relative error.
Arithmetic function domain # trials peak rms
IEEE S(x) 0, 10 10000 2.0e-15 3.2e-16
IEEE C(x) 0, 10 10000 1.8e-15 3.3e-16
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1989, 2000 by Stephen L. Moshier
*************************************************************************/
void fresnelintegral(const double x, double &c, double &s);
/*************************************************************************
Calculation of the value of the Hermite polynomial.
Parameters:
n - degree, n>=0
x - argument
Result:
the value of the Hermite polynomial Hn at x
*************************************************************************/
double hermitecalculate(const ae_int_t n, const double x);
/*************************************************************************
Summation of Hermite polynomials using Clenshaws recurrence formula.
This routine calculates
c[0]*H0(x) + c[1]*H1(x) + ... + c[N]*HN(x)
Parameters:
n - degree, n>=0
x - argument
Result:
the value of the Hermite polynomial at x
*************************************************************************/
double hermitesum(const real_1d_array &c, const ae_int_t n, const double x);
/*************************************************************************
Representation of Hn as C[0] + C[1]*X + ... + C[N]*X^N
Input parameters:
N - polynomial degree, n>=0
Output parameters:
C - coefficients
*************************************************************************/
void hermitecoefficients(const ae_int_t n, real_1d_array &c);
/*************************************************************************
Jacobian Elliptic Functions
Evaluates the Jacobian elliptic functions sn(u|m), cn(u|m),
and dn(u|m) of parameter m between 0 and 1, and real
argument u.
These functions are periodic, with quarter-period on the
real axis equal to the complete elliptic integral
ellpk(1.0-m).
Relation to incomplete elliptic integral:
If u = ellik(phi,m), then sn(u|m) = sin(phi),
and cn(u|m) = cos(phi). Phi is called the amplitude of u.
Computation is by means of the arithmetic-geometric mean
algorithm, except when m is within 1e-9 of 0 or 1. In the
latter case with m close to 1, the approximation applies
only for phi < pi/2.
ACCURACY:
Tested at random points with u between 0 and 10, m between
0 and 1.
Absolute error (* = relative error):
arithmetic function # trials peak rms
IEEE phi 10000 9.2e-16* 1.4e-16*
IEEE sn 50000 4.1e-15 4.6e-16
IEEE cn 40000 3.6e-15 4.4e-16
IEEE dn 10000 1.3e-12 1.8e-14
Peak error observed in consistency check using addition
theorem for sn(u+v) was 4e-16 (absolute). Also tested by
the above relation to the incomplete elliptic integral.
Accuracy deteriorates when u is large.
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 2000 by Stephen L. Moshier
*************************************************************************/
void jacobianellipticfunctions(const double u, const double m, double &sn, double &cn, double &dn, double &ph);
/*************************************************************************
Calculation of the value of the Laguerre polynomial.
Parameters:
n - degree, n>=0
x - argument
Result:
the value of the Laguerre polynomial Ln at x
*************************************************************************/
double laguerrecalculate(const ae_int_t n, const double x);
/*************************************************************************
Summation of Laguerre polynomials using Clenshaws recurrence formula.
This routine calculates c[0]*L0(x) + c[1]*L1(x) + ... + c[N]*LN(x)
Parameters:
n - degree, n>=0
x - argument
Result:
the value of the Laguerre polynomial at x
*************************************************************************/
double laguerresum(const real_1d_array &c, const ae_int_t n, const double x);
/*************************************************************************
Representation of Ln as C[0] + C[1]*X + ... + C[N]*X^N
Input parameters:
N - polynomial degree, n>=0
Output parameters:
C - coefficients
*************************************************************************/
void laguerrecoefficients(const ae_int_t n, real_1d_array &c);
/*************************************************************************
Calculation of the value of the Legendre polynomial Pn.
Parameters:
n - degree, n>=0
x - argument
Result:
the value of the Legendre polynomial Pn at x
*************************************************************************/
double legendrecalculate(const ae_int_t n, const double x);
/*************************************************************************
Summation of Legendre polynomials using Clenshaws recurrence formula.
This routine calculates
c[0]*P0(x) + c[1]*P1(x) + ... + c[N]*PN(x)
Parameters:
n - degree, n>=0
x - argument
Result:
the value of the Legendre polynomial at x
*************************************************************************/
double legendresum(const real_1d_array &c, const ae_int_t n, const double x);
/*************************************************************************
Representation of Pn as C[0] + C[1]*X + ... + C[N]*X^N
Input parameters:
N - polynomial degree, n>=0
Output parameters:
C - coefficients
*************************************************************************/
void legendrecoefficients(const ae_int_t n, real_1d_array &c);
/*************************************************************************
Poisson distribution
Returns the sum of the first k+1 terms of the Poisson
distribution:
k j
-- -m m
> e --
-- j!
j=0
The terms are not summed directly; instead the incomplete
gamma integral is employed, according to the relation
y = pdtr( k, m ) = igamc( k+1, m ).
The arguments must both be positive.
ACCURACY:
See incomplete gamma function
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1995, 2000 by Stephen L. Moshier
*************************************************************************/
double poissondistribution(const ae_int_t k, const double m);
/*************************************************************************
Complemented Poisson distribution
Returns the sum of the terms k+1 to infinity of the Poisson
distribution:
inf. j
-- -m m
> e --
-- j!
j=k+1
The terms are not summed directly; instead the incomplete
gamma integral is employed, according to the formula
y = pdtrc( k, m ) = igam( k+1, m ).
The arguments must both be positive.
ACCURACY:
See incomplete gamma function
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1995, 2000 by Stephen L. Moshier
*************************************************************************/
double poissoncdistribution(const ae_int_t k, const double m);
/*************************************************************************
Inverse Poisson distribution
Finds the Poisson variable x such that the integral
from 0 to x of the Poisson density is equal to the
given probability y.
This is accomplished using the inverse gamma integral
function and the relation
m = igami( k+1, y ).
ACCURACY:
See inverse incomplete gamma function
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1995, 2000 by Stephen L. Moshier
*************************************************************************/
double invpoissondistribution(const ae_int_t k, const double y);
/*************************************************************************
Psi (digamma) function
d -
psi(x) = -- ln | (x)
dx
is the logarithmic derivative of the gamma function.
For integer x,
n-1
-
psi(n) = -EUL + > 1/k.
-
k=1
This formula is used for 0 < n <= 10. If x is negative, it
is transformed to a positive argument by the reflection
formula psi(1-x) = psi(x) + pi cot(pi x).
For general positive x, the argument is made greater than 10
using the recurrence psi(x+1) = psi(x) + 1/x.
Then the following asymptotic expansion is applied:
inf. B
- 2k
psi(x) = log(x) - 1/2x - > -------
- 2k
k=1 2k x
where the B2k are Bernoulli numbers.
ACCURACY:
Relative error (except absolute when |psi| < 1):
arithmetic domain # trials peak rms
IEEE 0,30 30000 1.3e-15 1.4e-16
IEEE -30,0 40000 1.5e-15 2.2e-16
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1992, 2000 by Stephen L. Moshier
*************************************************************************/
double psi(const double x);
/*************************************************************************
Student's t distribution
Computes the integral from minus infinity to t of the Student
t distribution with integer k > 0 degrees of freedom:
t
-
| |
- | 2 -(k+1)/2
| ( (k+1)/2 ) | ( x )
---------------------- | ( 1 + --- ) dx
- | ( k )
sqrt( k pi ) | ( k/2 ) |
| |
-
-inf.
Relation to incomplete beta integral:
1 - stdtr(k,t) = 0.5 * incbet( k/2, 1/2, z )
where
z = k/(k + t**2).
For t < -2, this is the method of computation. For higher t,
a direct method is derived from integration by parts.
Since the function is symmetric about t=0, the area under the
right tail of the density is found by calling the function
with -t instead of t.
ACCURACY:
Tested at random 1 <= k <= 25. The "domain" refers to t.
Relative error:
arithmetic domain # trials peak rms
IEEE -100,-2 50000 5.9e-15 1.4e-15
IEEE -2,100 500000 2.7e-15 4.9e-17
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1995, 2000 by Stephen L. Moshier
*************************************************************************/
double studenttdistribution(const ae_int_t k, const double t);
/*************************************************************************
Functional inverse of Student's t distribution
Given probability p, finds the argument t such that stdtr(k,t)
is equal to p.
ACCURACY:
Tested at random 1 <= k <= 100. The "domain" refers to p:
Relative error:
arithmetic domain # trials peak rms
IEEE .001,.999 25000 5.7e-15 8.0e-16
IEEE 10^-6,.001 25000 2.0e-12 2.9e-14
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 1995, 2000 by Stephen L. Moshier
*************************************************************************/
double invstudenttdistribution(const ae_int_t k, const double p);
/*************************************************************************
Sine and cosine integrals
Evaluates the integrals
x
-
| cos t - 1
Ci(x) = eul + ln x + | --------- dt,
| t
-
0
x
-
| sin t
Si(x) = | ----- dt
| t
-
0
where eul = 0.57721566490153286061 is Euler's constant.
The integrals are approximated by rational functions.
For x > 8 auxiliary functions f(x) and g(x) are employed
such that
Ci(x) = f(x) sin(x) - g(x) cos(x)
Si(x) = pi/2 - f(x) cos(x) - g(x) sin(x)
ACCURACY:
Test interval = [0,50].
Absolute error, except relative when > 1:
arithmetic function # trials peak rms
IEEE Si 30000 4.4e-16 7.3e-17
IEEE Ci 30000 6.9e-16 5.1e-17
Cephes Math Library Release 2.1: January, 1989
Copyright 1984, 1987, 1989 by Stephen L. Moshier
*************************************************************************/
void sinecosineintegrals(const double x, double &si, double &ci);
/*************************************************************************
Hyperbolic sine and cosine integrals
Approximates the integrals
x
-
| | cosh t - 1
Chi(x) = eul + ln x + | ----------- dt,
| | t
-
0
x
-
| | sinh t
Shi(x) = | ------ dt
| | t
-
0
where eul = 0.57721566490153286061 is Euler's constant.
The integrals are evaluated by power series for x < 8
and by Chebyshev expansions for x between 8 and 88.
For large x, both functions approach exp(x)/2x.
Arguments greater than 88 in magnitude return MAXNUM.
ACCURACY:
Test interval 0 to 88.
Relative error:
arithmetic function # trials peak rms
IEEE Shi 30000 6.9e-16 1.6e-16
Absolute error, except relative when |Chi| > 1:
IEEE Chi 30000 8.4e-16 1.4e-16
Cephes Math Library Release 2.8: June, 2000
Copyright 1984, 1987, 2000 by Stephen L. Moshier
*************************************************************************/
void hyperbolicsinecosineintegrals(const double x, double &shi, double &chi);
}
/////////////////////////////////////////////////////////////////////////
//
// THIS SECTION CONTAINS COMPUTATIONAL CORE DECLARATIONS (FUNCTIONS)
//
/////////////////////////////////////////////////////////////////////////
namespace alglib_impl
{
double gammafunction(double x, ae_state *_state);
double lngamma(double x, double* sgngam, ae_state *_state);
double errorfunction(double x, ae_state *_state);
double errorfunctionc(double x, ae_state *_state);
double normaldistribution(double x, ae_state *_state);
double inverf(double e, ae_state *_state);
double invnormaldistribution(double y0, ae_state *_state);
double incompletegamma(double a, double x, ae_state *_state);
double incompletegammac(double a, double x, ae_state *_state);
double invincompletegammac(double a, double y0, ae_state *_state);
void airy(double x,
double* ai,
double* aip,
double* bi,
double* bip,
ae_state *_state);
double besselj0(double x, ae_state *_state);
double besselj1(double x, ae_state *_state);
double besseljn(ae_int_t n, double x, ae_state *_state);
double bessely0(double x, ae_state *_state);
double bessely1(double x, ae_state *_state);
double besselyn(ae_int_t n, double x, ae_state *_state);
double besseli0(double x, ae_state *_state);
double besseli1(double x, ae_state *_state);
double besselk0(double x, ae_state *_state);
double besselk1(double x, ae_state *_state);
double besselkn(ae_int_t nn, double x, ae_state *_state);
double beta(double a, double b, ae_state *_state);
double incompletebeta(double a, double b, double x, ae_state *_state);
double invincompletebeta(double a, double b, double y, ae_state *_state);
double binomialdistribution(ae_int_t k,
ae_int_t n,
double p,
ae_state *_state);
double binomialcdistribution(ae_int_t k,
ae_int_t n,
double p,
ae_state *_state);
double invbinomialdistribution(ae_int_t k,
ae_int_t n,
double y,
ae_state *_state);
double chebyshevcalculate(ae_int_t r,
ae_int_t n,
double x,
ae_state *_state);
double chebyshevsum(/* Real */ ae_vector* c,
ae_int_t r,
ae_int_t n,
double x,
ae_state *_state);
void chebyshevcoefficients(ae_int_t n,
/* Real */ ae_vector* c,
ae_state *_state);
void fromchebyshev(/* Real */ ae_vector* a,
ae_int_t n,
/* Real */ ae_vector* b,
ae_state *_state);
double chisquaredistribution(double v, double x, ae_state *_state);
double chisquarecdistribution(double v, double x, ae_state *_state);
double invchisquaredistribution(double v, double y, ae_state *_state);
double dawsonintegral(double x, ae_state *_state);
double ellipticintegralk(double m, ae_state *_state);
double ellipticintegralkhighprecision(double m1, ae_state *_state);
double incompleteellipticintegralk(double phi, double m, ae_state *_state);
double ellipticintegrale(double m, ae_state *_state);
double incompleteellipticintegrale(double phi, double m, ae_state *_state);
double exponentialintegralei(double x, ae_state *_state);
double exponentialintegralen(double x, ae_int_t n, ae_state *_state);
double fdistribution(ae_int_t a, ae_int_t b, double x, ae_state *_state);
double fcdistribution(ae_int_t a, ae_int_t b, double x, ae_state *_state);
double invfdistribution(ae_int_t a,
ae_int_t b,
double y,
ae_state *_state);
void fresnelintegral(double x, double* c, double* s, ae_state *_state);
double hermitecalculate(ae_int_t n, double x, ae_state *_state);
double hermitesum(/* Real */ ae_vector* c,
ae_int_t n,
double x,
ae_state *_state);
void hermitecoefficients(ae_int_t n,
/* Real */ ae_vector* c,
ae_state *_state);
void jacobianellipticfunctions(double u,
double m,
double* sn,
double* cn,
double* dn,
double* ph,
ae_state *_state);
double laguerrecalculate(ae_int_t n, double x, ae_state *_state);
double laguerresum(/* Real */ ae_vector* c,
ae_int_t n,
double x,
ae_state *_state);
void laguerrecoefficients(ae_int_t n,
/* Real */ ae_vector* c,
ae_state *_state);
double legendrecalculate(ae_int_t n, double x, ae_state *_state);
double legendresum(/* Real */ ae_vector* c,
ae_int_t n,
double x,
ae_state *_state);
void legendrecoefficients(ae_int_t n,
/* Real */ ae_vector* c,
ae_state *_state);
double poissondistribution(ae_int_t k, double m, ae_state *_state);
double poissoncdistribution(ae_int_t k, double m, ae_state *_state);
double invpoissondistribution(ae_int_t k, double y, ae_state *_state);
double psi(double x, ae_state *_state);
double studenttdistribution(ae_int_t k, double t, ae_state *_state);
double invstudenttdistribution(ae_int_t k, double p, ae_state *_state);
void sinecosineintegrals(double x,
double* si,
double* ci,
ae_state *_state);
void hyperbolicsinecosineintegrals(double x,
double* shi,
double* chi,
ae_state *_state);
}
#endif
qmapshack-1.10.0/3rdparty/alglib/src/linalg.cpp 000755 001750 000144 00005742714 13015033052 022504 0 ustar 00oeichlerx users 000000 000000 /*************************************************************************
ALGLIB 3.10.0 (source code generated 2015-08-19)
Copyright (c) Sergey Bochkanov (ALGLIB project).
>>> SOURCE LICENSE >>>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation (www.fsf.org); either version 2 of the
License, or (at your option) any later version.
This program 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 General Public License for more details.
A copy of the GNU General Public License is available at
http://www.fsf.org/licensing/licenses
>>> END OF LICENSE >>>
*************************************************************************/
#include "stdafx.h"
#include "linalg.h"
// disable some irrelevant warnings
#if (AE_COMPILER==AE_MSVC)
#pragma warning(disable:4100)
#pragma warning(disable:4127)
#pragma warning(disable:4702)
#pragma warning(disable:4996)
#endif
using namespace std;
/////////////////////////////////////////////////////////////////////////
//
// THIS SECTION CONTAINS IMPLEMENTATION OF C++ INTERFACE
//
/////////////////////////////////////////////////////////////////////////
namespace alglib
{
/*************************************************************************
Cache-oblivous complex "copy-and-transpose"
Input parameters:
M - number of rows
N - number of columns
A - source matrix, MxN submatrix is copied and transposed
IA - submatrix offset (row index)
JA - submatrix offset (column index)
B - destination matrix, must be large enough to store result
IB - submatrix offset (row index)
JB - submatrix offset (column index)
*************************************************************************/
void cmatrixtranspose(const ae_int_t m, const ae_int_t n, const complex_2d_array &a, const ae_int_t ia, const ae_int_t ja, complex_2d_array &b, const ae_int_t ib, const ae_int_t jb)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::cmatrixtranspose(m, n, const_cast(a.c_ptr()), ia, ja, const_cast(b.c_ptr()), ib, jb, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
Cache-oblivous real "copy-and-transpose"
Input parameters:
M - number of rows
N - number of columns
A - source matrix, MxN submatrix is copied and transposed
IA - submatrix offset (row index)
JA - submatrix offset (column index)
B - destination matrix, must be large enough to store result
IB - submatrix offset (row index)
JB - submatrix offset (column index)
*************************************************************************/
void rmatrixtranspose(const ae_int_t m, const ae_int_t n, const real_2d_array &a, const ae_int_t ia, const ae_int_t ja, const real_2d_array &b, const ae_int_t ib, const ae_int_t jb)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::rmatrixtranspose(m, n, const_cast(a.c_ptr()), ia, ja, const_cast(b.c_ptr()), ib, jb, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
This code enforces symmetricy of the matrix by copying Upper part to lower
one (or vice versa).
INPUT PARAMETERS:
A - matrix
N - number of rows/columns
IsUpper - whether we want to copy upper triangle to lower one (True)
or vice versa (False).
*************************************************************************/
void rmatrixenforcesymmetricity(const real_2d_array &a, const ae_int_t n, const bool isupper)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::rmatrixenforcesymmetricity(const_cast(a.c_ptr()), n, isupper, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
Copy
Input parameters:
M - number of rows
N - number of columns
A - source matrix, MxN submatrix is copied and transposed
IA - submatrix offset (row index)
JA - submatrix offset (column index)
B - destination matrix, must be large enough to store result
IB - submatrix offset (row index)
JB - submatrix offset (column index)
*************************************************************************/
void cmatrixcopy(const ae_int_t m, const ae_int_t n, const complex_2d_array &a, const ae_int_t ia, const ae_int_t ja, complex_2d_array &b, const ae_int_t ib, const ae_int_t jb)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::cmatrixcopy(m, n, const_cast(a.c_ptr()), ia, ja, const_cast(b.c_ptr()), ib, jb, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
Copy
Input parameters:
M - number of rows
N - number of columns
A - source matrix, MxN submatrix is copied and transposed
IA - submatrix offset (row index)
JA - submatrix offset (column index)
B - destination matrix, must be large enough to store result
IB - submatrix offset (row index)
JB - submatrix offset (column index)
*************************************************************************/
void rmatrixcopy(const ae_int_t m, const ae_int_t n, const real_2d_array &a, const ae_int_t ia, const ae_int_t ja, real_2d_array &b, const ae_int_t ib, const ae_int_t jb)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::rmatrixcopy(m, n, const_cast(a.c_ptr()), ia, ja, const_cast(b.c_ptr()), ib, jb, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
Rank-1 correction: A := A + u*v'
INPUT PARAMETERS:
M - number of rows
N - number of columns
A - target matrix, MxN submatrix is updated
IA - submatrix offset (row index)
JA - submatrix offset (column index)
U - vector #1
IU - subvector offset
V - vector #2
IV - subvector offset
*************************************************************************/
void cmatrixrank1(const ae_int_t m, const ae_int_t n, complex_2d_array &a, const ae_int_t ia, const ae_int_t ja, complex_1d_array &u, const ae_int_t iu, complex_1d_array &v, const ae_int_t iv)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::cmatrixrank1(m, n, const_cast(a.c_ptr()), ia, ja, const_cast(u.c_ptr()), iu, const_cast(v.c_ptr()), iv, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
Rank-1 correction: A := A + u*v'
INPUT PARAMETERS:
M - number of rows
N - number of columns
A - target matrix, MxN submatrix is updated
IA - submatrix offset (row index)
JA - submatrix offset (column index)
U - vector #1
IU - subvector offset
V - vector #2
IV - subvector offset
*************************************************************************/
void rmatrixrank1(const ae_int_t m, const ae_int_t n, real_2d_array &a, const ae_int_t ia, const ae_int_t ja, real_1d_array &u, const ae_int_t iu, real_1d_array &v, const ae_int_t iv)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::rmatrixrank1(m, n, const_cast(a.c_ptr()), ia, ja, const_cast(u.c_ptr()), iu, const_cast(v.c_ptr()), iv, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
Matrix-vector product: y := op(A)*x
INPUT PARAMETERS:
M - number of rows of op(A)
M>=0
N - number of columns of op(A)
N>=0
A - target matrix
IA - submatrix offset (row index)
JA - submatrix offset (column index)
OpA - operation type:
* OpA=0 => op(A) = A
* OpA=1 => op(A) = A^T
* OpA=2 => op(A) = A^H
X - input vector
IX - subvector offset
IY - subvector offset
Y - preallocated matrix, must be large enough to store result
OUTPUT PARAMETERS:
Y - vector which stores result
if M=0, then subroutine does nothing.
if N=0, Y is filled by zeros.
-- ALGLIB routine --
28.01.2010
Bochkanov Sergey
*************************************************************************/
void cmatrixmv(const ae_int_t m, const ae_int_t n, const complex_2d_array &a, const ae_int_t ia, const ae_int_t ja, const ae_int_t opa, const complex_1d_array &x, const ae_int_t ix, complex_1d_array &y, const ae_int_t iy)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::cmatrixmv(m, n, const_cast(a.c_ptr()), ia, ja, opa, const_cast(x.c_ptr()), ix, const_cast(y.c_ptr()), iy, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
Matrix-vector product: y := op(A)*x
INPUT PARAMETERS:
M - number of rows of op(A)
N - number of columns of op(A)
A - target matrix
IA - submatrix offset (row index)
JA - submatrix offset (column index)
OpA - operation type:
* OpA=0 => op(A) = A
* OpA=1 => op(A) = A^T
X - input vector
IX - subvector offset
IY - subvector offset
Y - preallocated matrix, must be large enough to store result
OUTPUT PARAMETERS:
Y - vector which stores result
if M=0, then subroutine does nothing.
if N=0, Y is filled by zeros.
-- ALGLIB routine --
28.01.2010
Bochkanov Sergey
*************************************************************************/
void rmatrixmv(const ae_int_t m, const ae_int_t n, const real_2d_array &a, const ae_int_t ia, const ae_int_t ja, const ae_int_t opa, const real_1d_array &x, const ae_int_t ix, real_1d_array &y, const ae_int_t iy)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::rmatrixmv(m, n, const_cast(a.c_ptr()), ia, ja, opa, const_cast(x.c_ptr()), ix, const_cast(y.c_ptr()), iy, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
This subroutine calculates X*op(A^-1) where:
* X is MxN general matrix
* A is NxN upper/lower triangular/unitriangular matrix
* "op" may be identity transformation, transposition, conjugate transposition
Multiplication result replaces X.
Cache-oblivious algorithm is used.
COMMERCIAL EDITION OF ALGLIB:
! Commercial version of ALGLIB includes two important improvements of
! this function, which can be used from C++ and C#:
! * Intel MKL support (lightweight Intel MKL is shipped with ALGLIB)
! * multicore support
!
! Intel MKL gives approximately constant (with respect to number of
! worker threads) acceleration factor which depends on CPU being used,
! problem size and "baseline" ALGLIB edition which is used for
! comparison.
!
! Say, on SSE2-capable CPU with N=1024, HPC ALGLIB will be:
! * about 2-3x faster than ALGLIB for C++ without MKL
! * about 7-10x faster than "pure C#" edition of ALGLIB
! Difference in performance will be more striking on newer CPU's with
! support for newer SIMD instructions.
!
! Commercial edition of ALGLIB also supports multithreaded acceleration
! of this function. Because starting/stopping worker thread always
! involves some overhead, parallelism starts to be profitable for N's
! larger than 128.
!
! In order to use multicore features you have to:
! * use commercial version of ALGLIB
! * call this function with "smp_" prefix, which indicates that
! multicore code will be used (for multicore support)
!
! We recommend you to read 'Working with commercial version' section of
! ALGLIB Reference Manual in order to find out how to use performance-
! related features provided by commercial edition of ALGLIB.
INPUT PARAMETERS
N - matrix size, N>=0
M - matrix size, N>=0
A - matrix, actial matrix is stored in A[I1:I1+N-1,J1:J1+N-1]
I1 - submatrix offset
J1 - submatrix offset
IsUpper - whether matrix is upper triangular
IsUnit - whether matrix is unitriangular
OpType - transformation type:
* 0 - no transformation
* 1 - transposition
* 2 - conjugate transposition
X - matrix, actial matrix is stored in X[I2:I2+M-1,J2:J2+N-1]
I2 - submatrix offset
J2 - submatrix offset
-- ALGLIB routine --
15.12.2009
Bochkanov Sergey
*************************************************************************/
void cmatrixrighttrsm(const ae_int_t m, const ae_int_t n, const complex_2d_array &a, const ae_int_t i1, const ae_int_t j1, const bool isupper, const bool isunit, const ae_int_t optype, const complex_2d_array &x, const ae_int_t i2, const ae_int_t j2)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::cmatrixrighttrsm(m, n, const_cast(a.c_ptr()), i1, j1, isupper, isunit, optype, const_cast(x.c_ptr()), i2, j2, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
void smp_cmatrixrighttrsm(const ae_int_t m, const ae_int_t n, const complex_2d_array &a, const ae_int_t i1, const ae_int_t j1, const bool isupper, const bool isunit, const ae_int_t optype, const complex_2d_array &x, const ae_int_t i2, const ae_int_t j2)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::_pexec_cmatrixrighttrsm(m, n, const_cast(a.c_ptr()), i1, j1, isupper, isunit, optype, const_cast(x.c_ptr()), i2, j2, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
This subroutine calculates op(A^-1)*X where:
* X is MxN general matrix
* A is MxM upper/lower triangular/unitriangular matrix
* "op" may be identity transformation, transposition, conjugate transposition
Multiplication result replaces X.
Cache-oblivious algorithm is used.
COMMERCIAL EDITION OF ALGLIB:
! Commercial version of ALGLIB includes two important improvements of
! this function, which can be used from C++ and C#:
! * Intel MKL support (lightweight Intel MKL is shipped with ALGLIB)
! * multicore support
!
! Intel MKL gives approximately constant (with respect to number of
! worker threads) acceleration factor which depends on CPU being used,
! problem size and "baseline" ALGLIB edition which is used for
! comparison.
!
! Say, on SSE2-capable CPU with N=1024, HPC ALGLIB will be:
! * about 2-3x faster than ALGLIB for C++ without MKL
! * about 7-10x faster than "pure C#" edition of ALGLIB
! Difference in performance will be more striking on newer CPU's with
! support for newer SIMD instructions.
!
! Commercial edition of ALGLIB also supports multithreaded acceleration
! of this function. Because starting/stopping worker thread always
! involves some overhead, parallelism starts to be profitable for N's
! larger than 128.
!
! In order to use multicore features you have to:
! * use commercial version of ALGLIB
! * call this function with "smp_" prefix, which indicates that
! multicore code will be used (for multicore support)
!
! We recommend you to read 'Working with commercial version' section of
! ALGLIB Reference Manual in order to find out how to use performance-
! related features provided by commercial edition of ALGLIB.
INPUT PARAMETERS
N - matrix size, N>=0
M - matrix size, N>=0
A - matrix, actial matrix is stored in A[I1:I1+M-1,J1:J1+M-1]
I1 - submatrix offset
J1 - submatrix offset
IsUpper - whether matrix is upper triangular
IsUnit - whether matrix is unitriangular
OpType - transformation type:
* 0 - no transformation
* 1 - transposition
* 2 - conjugate transposition
X - matrix, actial matrix is stored in X[I2:I2+M-1,J2:J2+N-1]
I2 - submatrix offset
J2 - submatrix offset
-- ALGLIB routine --
15.12.2009
Bochkanov Sergey
*************************************************************************/
void cmatrixlefttrsm(const ae_int_t m, const ae_int_t n, const complex_2d_array &a, const ae_int_t i1, const ae_int_t j1, const bool isupper, const bool isunit, const ae_int_t optype, const complex_2d_array &x, const ae_int_t i2, const ae_int_t j2)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::cmatrixlefttrsm(m, n, const_cast(a.c_ptr()), i1, j1, isupper, isunit, optype, const_cast(x.c_ptr()), i2, j2, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
void smp_cmatrixlefttrsm(const ae_int_t m, const ae_int_t n, const complex_2d_array &a, const ae_int_t i1, const ae_int_t j1, const bool isupper, const bool isunit, const ae_int_t optype, const complex_2d_array &x, const ae_int_t i2, const ae_int_t j2)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::_pexec_cmatrixlefttrsm(m, n, const_cast(a.c_ptr()), i1, j1, isupper, isunit, optype, const_cast(x.c_ptr()), i2, j2, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
This subroutine calculates X*op(A^-1) where:
* X is MxN general matrix
* A is NxN upper/lower triangular/unitriangular matrix
* "op" may be identity transformation, transposition
Multiplication result replaces X.
Cache-oblivious algorithm is used.
COMMERCIAL EDITION OF ALGLIB:
! Commercial version of ALGLIB includes two important improvements of
! this function, which can be used from C++ and C#:
! * Intel MKL support (lightweight Intel MKL is shipped with ALGLIB)
! * multicore support
!
! Intel MKL gives approximately constant (with respect to number of
! worker threads) acceleration factor which depends on CPU being used,
! problem size and "baseline" ALGLIB edition which is used for
! comparison.
!
! Say, on SSE2-capable CPU with N=1024, HPC ALGLIB will be:
! * about 2-3x faster than ALGLIB for C++ without MKL
! * about 7-10x faster than "pure C#" edition of ALGLIB
! Difference in performance will be more striking on newer CPU's with
! support for newer SIMD instructions.
!
! Commercial edition of ALGLIB also supports multithreaded acceleration
! of this function. Because starting/stopping worker thread always
! involves some overhead, parallelism starts to be profitable for N's
! larger than 128.
!
! In order to use multicore features you have to:
! * use commercial version of ALGLIB
! * call this function with "smp_" prefix, which indicates that
! multicore code will be used (for multicore support)
!
! We recommend you to read 'Working with commercial version' section of
! ALGLIB Reference Manual in order to find out how to use performance-
! related features provided by commercial edition of ALGLIB.
INPUT PARAMETERS
N - matrix size, N>=0
M - matrix size, N>=0
A - matrix, actial matrix is stored in A[I1:I1+N-1,J1:J1+N-1]
I1 - submatrix offset
J1 - submatrix offset
IsUpper - whether matrix is upper triangular
IsUnit - whether matrix is unitriangular
OpType - transformation type:
* 0 - no transformation
* 1 - transposition
X - matrix, actial matrix is stored in X[I2:I2+M-1,J2:J2+N-1]
I2 - submatrix offset
J2 - submatrix offset
-- ALGLIB routine --
15.12.2009
Bochkanov Sergey
*************************************************************************/
void rmatrixrighttrsm(const ae_int_t m, const ae_int_t n, const real_2d_array &a, const ae_int_t i1, const ae_int_t j1, const bool isupper, const bool isunit, const ae_int_t optype, const real_2d_array &x, const ae_int_t i2, const ae_int_t j2)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::rmatrixrighttrsm(m, n, const_cast(a.c_ptr()), i1, j1, isupper, isunit, optype, const_cast(x.c_ptr()), i2, j2, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
void smp_rmatrixrighttrsm(const ae_int_t m, const ae_int_t n, const real_2d_array &a, const ae_int_t i1, const ae_int_t j1, const bool isupper, const bool isunit, const ae_int_t optype, const real_2d_array &x, const ae_int_t i2, const ae_int_t j2)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::_pexec_rmatrixrighttrsm(m, n, const_cast(a.c_ptr()), i1, j1, isupper, isunit, optype, const_cast(x.c_ptr()), i2, j2, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
This subroutine calculates op(A^-1)*X where:
* X is MxN general matrix
* A is MxM upper/lower triangular/unitriangular matrix
* "op" may be identity transformation, transposition
Multiplication result replaces X.
Cache-oblivious algorithm is used.
COMMERCIAL EDITION OF ALGLIB:
! Commercial version of ALGLIB includes two important improvements of
! this function, which can be used from C++ and C#:
! * Intel MKL support (lightweight Intel MKL is shipped with ALGLIB)
! * multicore support
!
! Intel MKL gives approximately constant (with respect to number of
! worker threads) acceleration factor which depends on CPU being used,
! problem size and "baseline" ALGLIB edition which is used for
! comparison.
!
! Say, on SSE2-capable CPU with N=1024, HPC ALGLIB will be:
! * about 2-3x faster than ALGLIB for C++ without MKL
! * about 7-10x faster than "pure C#" edition of ALGLIB
! Difference in performance will be more striking on newer CPU's with
! support for newer SIMD instructions.
!
! Commercial edition of ALGLIB also supports multithreaded acceleration
! of this function. Because starting/stopping worker thread always
! involves some overhead, parallelism starts to be profitable for N's
! larger than 128.
!
! In order to use multicore features you have to:
! * use commercial version of ALGLIB
! * call this function with "smp_" prefix, which indicates that
! multicore code will be used (for multicore support)
!
! We recommend you to read 'Working with commercial version' section of
! ALGLIB Reference Manual in order to find out how to use performance-
! related features provided by commercial edition of ALGLIB.
INPUT PARAMETERS
N - matrix size, N>=0
M - matrix size, N>=0
A - matrix, actial matrix is stored in A[I1:I1+M-1,J1:J1+M-1]
I1 - submatrix offset
J1 - submatrix offset
IsUpper - whether matrix is upper triangular
IsUnit - whether matrix is unitriangular
OpType - transformation type:
* 0 - no transformation
* 1 - transposition
X - matrix, actial matrix is stored in X[I2:I2+M-1,J2:J2+N-1]
I2 - submatrix offset
J2 - submatrix offset
-- ALGLIB routine --
15.12.2009
Bochkanov Sergey
*************************************************************************/
void rmatrixlefttrsm(const ae_int_t m, const ae_int_t n, const real_2d_array &a, const ae_int_t i1, const ae_int_t j1, const bool isupper, const bool isunit, const ae_int_t optype, const real_2d_array &x, const ae_int_t i2, const ae_int_t j2)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::rmatrixlefttrsm(m, n, const_cast(a.c_ptr()), i1, j1, isupper, isunit, optype, const_cast(x.c_ptr()), i2, j2, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
void smp_rmatrixlefttrsm(const ae_int_t m, const ae_int_t n, const real_2d_array &a, const ae_int_t i1, const ae_int_t j1, const bool isupper, const bool isunit, const ae_int_t optype, const real_2d_array &x, const ae_int_t i2, const ae_int_t j2)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::_pexec_rmatrixlefttrsm(m, n, const_cast(a.c_ptr()), i1, j1, isupper, isunit, optype, const_cast(x.c_ptr()), i2, j2, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
This subroutine calculates C=alpha*A*A^H+beta*C or C=alpha*A^H*A+beta*C
where:
* C is NxN Hermitian matrix given by its upper/lower triangle
* A is NxK matrix when A*A^H is calculated, KxN matrix otherwise
Additional info:
* cache-oblivious algorithm is used.
* multiplication result replaces C. If Beta=0, C elements are not used in
calculations (not multiplied by zero - just not referenced)
* if Alpha=0, A is not used (not multiplied by zero - just not referenced)
* if both Beta and Alpha are zero, C is filled by zeros.
COMMERCIAL EDITION OF ALGLIB:
! Commercial version of ALGLIB includes two important improvements of
! this function, which can be used from C++ and C#:
! * Intel MKL support (lightweight Intel MKL is shipped with ALGLIB)
! * multicore support
!
! Intel MKL gives approximately constant (with respect to number of
! worker threads) acceleration factor which depends on CPU being used,
! problem size and "baseline" ALGLIB edition which is used for
! comparison.
!
! Say, on SSE2-capable CPU with N=1024, HPC ALGLIB will be:
! * about 2-3x faster than ALGLIB for C++ without MKL
! * about 7-10x faster than "pure C#" edition of ALGLIB
! Difference in performance will be more striking on newer CPU's with
! support for newer SIMD instructions.
!
! Commercial edition of ALGLIB also supports multithreaded acceleration
! of this function. Because starting/stopping worker thread always
! involves some overhead, parallelism starts to be profitable for N's
! larger than 128.
!
! In order to use multicore features you have to:
! * use commercial version of ALGLIB
! * call this function with "smp_" prefix, which indicates that
! multicore code will be used (for multicore support)
!
! We recommend you to read 'Working with commercial version' section of
! ALGLIB Reference Manual in order to find out how to use performance-
! related features provided by commercial edition of ALGLIB.
INPUT PARAMETERS
N - matrix size, N>=0
K - matrix size, K>=0
Alpha - coefficient
A - matrix
IA - submatrix offset (row index)
JA - submatrix offset (column index)
OpTypeA - multiplication type:
* 0 - A*A^H is calculated
* 2 - A^H*A is calculated
Beta - coefficient
C - preallocated input/output matrix
IC - submatrix offset (row index)
JC - submatrix offset (column index)
IsUpper - whether upper or lower triangle of C is updated;
this function updates only one half of C, leaving
other half unchanged (not referenced at all).
-- ALGLIB routine --
16.12.2009
Bochkanov Sergey
*************************************************************************/
void cmatrixherk(const ae_int_t n, const ae_int_t k, const double alpha, const complex_2d_array &a, const ae_int_t ia, const ae_int_t ja, const ae_int_t optypea, const double beta, const complex_2d_array &c, const ae_int_t ic, const ae_int_t jc, const bool isupper)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::cmatrixherk(n, k, alpha, const_cast(a.c_ptr()), ia, ja, optypea, beta, const_cast(c.c_ptr()), ic, jc, isupper, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
void smp_cmatrixherk(const ae_int_t n, const ae_int_t k, const double alpha, const complex_2d_array &a, const ae_int_t ia, const ae_int_t ja, const ae_int_t optypea, const double beta, const complex_2d_array &c, const ae_int_t ic, const ae_int_t jc, const bool isupper)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::_pexec_cmatrixherk(n, k, alpha, const_cast(a.c_ptr()), ia, ja, optypea, beta, const_cast(c.c_ptr()), ic, jc, isupper, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
This subroutine calculates C=alpha*A*A^T+beta*C or C=alpha*A^T*A+beta*C
where:
* C is NxN symmetric matrix given by its upper/lower triangle
* A is NxK matrix when A*A^T is calculated, KxN matrix otherwise
Additional info:
* cache-oblivious algorithm is used.
* multiplication result replaces C. If Beta=0, C elements are not used in
calculations (not multiplied by zero - just not referenced)
* if Alpha=0, A is not used (not multiplied by zero - just not referenced)
* if both Beta and Alpha are zero, C is filled by zeros.
COMMERCIAL EDITION OF ALGLIB:
! Commercial version of ALGLIB includes two important improvements of
! this function, which can be used from C++ and C#:
! * Intel MKL support (lightweight Intel MKL is shipped with ALGLIB)
! * multicore support
!
! Intel MKL gives approximately constant (with respect to number of
! worker threads) acceleration factor which depends on CPU being used,
! problem size and "baseline" ALGLIB edition which is used for
! comparison.
!
! Say, on SSE2-capable CPU with N=1024, HPC ALGLIB will be:
! * about 2-3x faster than ALGLIB for C++ without MKL
! * about 7-10x faster than "pure C#" edition of ALGLIB
! Difference in performance will be more striking on newer CPU's with
! support for newer SIMD instructions.
!
! Commercial edition of ALGLIB also supports multithreaded acceleration
! of this function. Because starting/stopping worker thread always
! involves some overhead, parallelism starts to be profitable for N's
! larger than 128.
!
! In order to use multicore features you have to:
! * use commercial version of ALGLIB
! * call this function with "smp_" prefix, which indicates that
! multicore code will be used (for multicore support)
!
! We recommend you to read 'Working with commercial version' section of
! ALGLIB Reference Manual in order to find out how to use performance-
! related features provided by commercial edition of ALGLIB.
INPUT PARAMETERS
N - matrix size, N>=0
K - matrix size, K>=0
Alpha - coefficient
A - matrix
IA - submatrix offset (row index)
JA - submatrix offset (column index)
OpTypeA - multiplication type:
* 0 - A*A^T is calculated
* 2 - A^T*A is calculated
Beta - coefficient
C - preallocated input/output matrix
IC - submatrix offset (row index)
JC - submatrix offset (column index)
IsUpper - whether C is upper triangular or lower triangular
-- ALGLIB routine --
16.12.2009
Bochkanov Sergey
*************************************************************************/
void rmatrixsyrk(const ae_int_t n, const ae_int_t k, const double alpha, const real_2d_array &a, const ae_int_t ia, const ae_int_t ja, const ae_int_t optypea, const double beta, const real_2d_array &c, const ae_int_t ic, const ae_int_t jc, const bool isupper)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::rmatrixsyrk(n, k, alpha, const_cast(a.c_ptr()), ia, ja, optypea, beta, const_cast(c.c_ptr()), ic, jc, isupper, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
void smp_rmatrixsyrk(const ae_int_t n, const ae_int_t k, const double alpha, const real_2d_array &a, const ae_int_t ia, const ae_int_t ja, const ae_int_t optypea, const double beta, const real_2d_array &c, const ae_int_t ic, const ae_int_t jc, const bool isupper)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::_pexec_rmatrixsyrk(n, k, alpha, const_cast(a.c_ptr()), ia, ja, optypea, beta, const_cast(c.c_ptr()), ic, jc, isupper, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
This subroutine calculates C = alpha*op1(A)*op2(B) +beta*C where:
* C is MxN general matrix
* op1(A) is MxK matrix
* op2(B) is KxN matrix
* "op" may be identity transformation, transposition, conjugate transposition
Additional info:
* cache-oblivious algorithm is used.
* multiplication result replaces C. If Beta=0, C elements are not used in
calculations (not multiplied by zero - just not referenced)
* if Alpha=0, A is not used (not multiplied by zero - just not referenced)
* if both Beta and Alpha are zero, C is filled by zeros.
COMMERCIAL EDITION OF ALGLIB:
! Commercial version of ALGLIB includes two important improvements of
! this function, which can be used from C++ and C#:
! * Intel MKL support (lightweight Intel MKL is shipped with ALGLIB)
! * multicore support
!
! Intel MKL gives approximately constant (with respect to number of
! worker threads) acceleration factor which depends on CPU being used,
! problem size and "baseline" ALGLIB edition which is used for
! comparison.
!
! Say, on SSE2-capable CPU with N=1024, HPC ALGLIB will be:
! * about 2-3x faster than ALGLIB for C++ without MKL
! * about 7-10x faster than "pure C#" edition of ALGLIB
! Difference in performance will be more striking on newer CPU's with
! support for newer SIMD instructions.
!
! Commercial edition of ALGLIB also supports multithreaded acceleration
! of this function. Because starting/stopping worker thread always
! involves some overhead, parallelism starts to be profitable for N's
! larger than 128.
!
! In order to use multicore features you have to:
! * use commercial version of ALGLIB
! * call this function with "smp_" prefix, which indicates that
! multicore code will be used (for multicore support)
!
! We recommend you to read 'Working with commercial version' section of
! ALGLIB Reference Manual in order to find out how to use performance-
! related features provided by commercial edition of ALGLIB.
IMPORTANT:
This function does NOT preallocate output matrix C, it MUST be preallocated
by caller prior to calling this function. In case C does not have enough
space to store result, exception will be generated.
INPUT PARAMETERS
M - matrix size, M>0
N - matrix size, N>0
K - matrix size, K>0
Alpha - coefficient
A - matrix
IA - submatrix offset
JA - submatrix offset
OpTypeA - transformation type:
* 0 - no transformation
* 1 - transposition
* 2 - conjugate transposition
B - matrix
IB - submatrix offset
JB - submatrix offset
OpTypeB - transformation type:
* 0 - no transformation
* 1 - transposition
* 2 - conjugate transposition
Beta - coefficient
C - matrix (PREALLOCATED, large enough to store result)
IC - submatrix offset
JC - submatrix offset
-- ALGLIB routine --
16.12.2009
Bochkanov Sergey
*************************************************************************/
void cmatrixgemm(const ae_int_t m, const ae_int_t n, const ae_int_t k, const alglib::complex alpha, const complex_2d_array &a, const ae_int_t ia, const ae_int_t ja, const ae_int_t optypea, const complex_2d_array &b, const ae_int_t ib, const ae_int_t jb, const ae_int_t optypeb, const alglib::complex beta, const complex_2d_array &c, const ae_int_t ic, const ae_int_t jc)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::cmatrixgemm(m, n, k, *alpha.c_ptr(), const_cast(a.c_ptr()), ia, ja, optypea, const_cast(b.c_ptr()), ib, jb, optypeb, *beta.c_ptr(), const_cast(c.c_ptr()), ic, jc, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
void smp_cmatrixgemm(const ae_int_t m, const ae_int_t n, const ae_int_t k, const alglib::complex alpha, const complex_2d_array &a, const ae_int_t ia, const ae_int_t ja, const ae_int_t optypea, const complex_2d_array &b, const ae_int_t ib, const ae_int_t jb, const ae_int_t optypeb, const alglib::complex beta, const complex_2d_array &c, const ae_int_t ic, const ae_int_t jc)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::_pexec_cmatrixgemm(m, n, k, *alpha.c_ptr(), const_cast(a.c_ptr()), ia, ja, optypea, const_cast(b.c_ptr()), ib, jb, optypeb, *beta.c_ptr(), const_cast(c.c_ptr()), ic, jc, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
This subroutine calculates C = alpha*op1(A)*op2(B) +beta*C where:
* C is MxN general matrix
* op1(A) is MxK matrix
* op2(B) is KxN matrix
* "op" may be identity transformation, transposition
Additional info:
* cache-oblivious algorithm is used.
* multiplication result replaces C. If Beta=0, C elements are not used in
calculations (not multiplied by zero - just not referenced)
* if Alpha=0, A is not used (not multiplied by zero - just not referenced)
* if both Beta and Alpha are zero, C is filled by zeros.
COMMERCIAL EDITION OF ALGLIB:
! Commercial version of ALGLIB includes two important improvements of
! this function, which can be used from C++ and C#:
! * Intel MKL support (lightweight Intel MKL is shipped with ALGLIB)
! * multicore support
!
! Intel MKL gives approximately constant (with respect to number of
! worker threads) acceleration factor which depends on CPU being used,
! problem size and "baseline" ALGLIB edition which is used for
! comparison.
!
! Say, on SSE2-capable CPU with N=1024, HPC ALGLIB will be:
! * about 2-3x faster than ALGLIB for C++ without MKL
! * about 7-10x faster than "pure C#" edition of ALGLIB
! Difference in performance will be more striking on newer CPU's with
! support for newer SIMD instructions.
!
! Commercial edition of ALGLIB also supports multithreaded acceleration
! of this function. Because starting/stopping worker thread always
! involves some overhead, parallelism starts to be profitable for N's
! larger than 128.
!
! In order to use multicore features you have to:
! * use commercial version of ALGLIB
! * call this function with "smp_" prefix, which indicates that
! multicore code will be used (for multicore support)
!
! We recommend you to read 'Working with commercial version' section of
! ALGLIB Reference Manual in order to find out how to use performance-
! related features provided by commercial edition of ALGLIB.
IMPORTANT:
This function does NOT preallocate output matrix C, it MUST be preallocated
by caller prior to calling this function. In case C does not have enough
space to store result, exception will be generated.
INPUT PARAMETERS
M - matrix size, M>0
N - matrix size, N>0
K - matrix size, K>0
Alpha - coefficient
A - matrix
IA - submatrix offset
JA - submatrix offset
OpTypeA - transformation type:
* 0 - no transformation
* 1 - transposition
B - matrix
IB - submatrix offset
JB - submatrix offset
OpTypeB - transformation type:
* 0 - no transformation
* 1 - transposition
Beta - coefficient
C - PREALLOCATED output matrix, large enough to store result
IC - submatrix offset
JC - submatrix offset
-- ALGLIB routine --
2009-2013
Bochkanov Sergey
*************************************************************************/
void rmatrixgemm(const ae_int_t m, const ae_int_t n, const ae_int_t k, const double alpha, const real_2d_array &a, const ae_int_t ia, const ae_int_t ja, const ae_int_t optypea, const real_2d_array &b, const ae_int_t ib, const ae_int_t jb, const ae_int_t optypeb, const double beta, const real_2d_array &c, const ae_int_t ic, const ae_int_t jc)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::rmatrixgemm(m, n, k, alpha, const_cast(a.c_ptr()), ia, ja, optypea, const_cast(b.c_ptr()), ib, jb, optypeb, beta, const_cast(c.c_ptr()), ic, jc, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
void smp_rmatrixgemm(const ae_int_t m, const ae_int_t n, const ae_int_t k, const double alpha, const real_2d_array &a, const ae_int_t ia, const ae_int_t ja, const ae_int_t optypea, const real_2d_array &b, const ae_int_t ib, const ae_int_t jb, const ae_int_t optypeb, const double beta, const real_2d_array &c, const ae_int_t ic, const ae_int_t jc)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::_pexec_rmatrixgemm(m, n, k, alpha, const_cast(a.c_ptr()), ia, ja, optypea, const_cast(b.c_ptr()), ib, jb, optypeb, beta, const_cast(c.c_ptr()), ic, jc, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
This subroutine is an older version of CMatrixHERK(), one with wrong name
(it is HErmitian update, not SYmmetric). It is left here for backward
compatibility.
-- ALGLIB routine --
16.12.2009
Bochkanov Sergey
*************************************************************************/
void cmatrixsyrk(const ae_int_t n, const ae_int_t k, const double alpha, const complex_2d_array &a, const ae_int_t ia, const ae_int_t ja, const ae_int_t optypea, const double beta, const complex_2d_array &c, const ae_int_t ic, const ae_int_t jc, const bool isupper)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::cmatrixsyrk(n, k, alpha, const_cast(a.c_ptr()), ia, ja, optypea, beta, const_cast(c.c_ptr()), ic, jc, isupper, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
void smp_cmatrixsyrk(const ae_int_t n, const ae_int_t k, const double alpha, const complex_2d_array &a, const ae_int_t ia, const ae_int_t ja, const ae_int_t optypea, const double beta, const complex_2d_array &c, const ae_int_t ic, const ae_int_t jc, const bool isupper)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::_pexec_cmatrixsyrk(n, k, alpha, const_cast(a.c_ptr()), ia, ja, optypea, beta, const_cast(c.c_ptr()), ic, jc, isupper, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
QR decomposition of a rectangular matrix of size MxN
COMMERCIAL EDITION OF ALGLIB:
! Commercial version of ALGLIB includes two important improvements of
! this function, which can be used from C++ and C#:
! * Intel MKL support (lightweight Intel MKL is shipped with ALGLIB)
! * multicore support
!
! Intel MKL gives approximately constant (with respect to number of
! worker threads) acceleration factor which depends on CPU being used,
! problem size and "baseline" ALGLIB edition which is used for
! comparison.
!
! Say, on SSE2-capable CPU with N=1024, HPC ALGLIB will be:
! * about 2-3x faster than ALGLIB for C++ without MKL
! * about 7-10x faster than "pure C#" edition of ALGLIB
! Difference in performance will be more striking on newer CPU's with
! support for newer SIMD instructions. Generally, MKL accelerates any
! problem whose size is at least 128, with best efficiency achieved for
! N's larger than 512.
!
! Commercial edition of ALGLIB also supports multithreaded acceleration
! of this function. We should note that QP decomposition is harder to
! parallelize than, say, matrix-matrix product - this algorithm has
! many internal synchronization points which can not be avoided. However
! parallelism starts to be profitable starting from N=512, achieving
! near-linear speedup for N=4096 or higher.
!
! In order to use multicore features you have to:
! * use commercial version of ALGLIB
! * call this function with "smp_" prefix, which indicates that
! multicore code will be used (for multicore support)
!
! We recommend you to read 'Working with commercial version' section of
! ALGLIB Reference Manual in order to find out how to use performance-
! related features provided by commercial edition of ALGLIB.
Input parameters:
A - matrix A whose indexes range within [0..M-1, 0..N-1].
M - number of rows in matrix A.
N - number of columns in matrix A.
Output parameters:
A - matrices Q and R in compact form (see below).
Tau - array of scalar factors which are used to form
matrix Q. Array whose index ranges within [0.. Min(M-1,N-1)].
Matrix A is represented as A = QR, where Q is an orthogonal matrix of size
MxM, R - upper triangular (or upper trapezoid) matrix of size M x N.
The elements of matrix R are located on and above the main diagonal of
matrix A. The elements which are located in Tau array and below the main
diagonal of matrix A are used to form matrix Q as follows:
Matrix Q is represented as a product of elementary reflections
Q = H(0)*H(2)*...*H(k-1),
where k = min(m,n), and each H(i) is in the form
H(i) = 1 - tau * v * (v^T)
where tau is a scalar stored in Tau[I]; v - real vector,
so that v(0:i-1) = 0, v(i) = 1, v(i+1:m-1) stored in A(i+1:m-1,i).
-- ALGLIB routine --
17.02.2010
Bochkanov Sergey
*************************************************************************/
void rmatrixqr(real_2d_array &a, const ae_int_t m, const ae_int_t n, real_1d_array &tau)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::rmatrixqr(const_cast(a.c_ptr()), m, n, const_cast(tau.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
void smp_rmatrixqr(real_2d_array &a, const ae_int_t m, const ae_int_t n, real_1d_array &tau)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::_pexec_rmatrixqr(const_cast(a.c_ptr()), m, n, const_cast(tau.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
LQ decomposition of a rectangular matrix of size MxN
COMMERCIAL EDITION OF ALGLIB:
! Commercial version of ALGLIB includes two important improvements of
! this function, which can be used from C++ and C#:
! * Intel MKL support (lightweight Intel MKL is shipped with ALGLIB)
! * multicore support
!
! Intel MKL gives approximately constant (with respect to number of
! worker threads) acceleration factor which depends on CPU being used,
! problem size and "baseline" ALGLIB edition which is used for
! comparison.
!
! Say, on SSE2-capable CPU with N=1024, HPC ALGLIB will be:
! * about 2-3x faster than ALGLIB for C++ without MKL
! * about 7-10x faster than "pure C#" edition of ALGLIB
! Difference in performance will be more striking on newer CPU's with
! support for newer SIMD instructions. Generally, MKL accelerates any
! problem whose size is at least 128, with best efficiency achieved for
! N's larger than 512.
!
! Commercial edition of ALGLIB also supports multithreaded acceleration
! of this function. We should note that QP decomposition is harder to
! parallelize than, say, matrix-matrix product - this algorithm has
! many internal synchronization points which can not be avoided. However
! parallelism starts to be profitable starting from N=512, achieving
! near-linear speedup for N=4096 or higher.
!
! In order to use multicore features you have to:
! * use commercial version of ALGLIB
! * call this function with "smp_" prefix, which indicates that
! multicore code will be used (for multicore support)
!
! We recommend you to read 'Working with commercial version' section of
! ALGLIB Reference Manual in order to find out how to use performance-
! related features provided by commercial edition of ALGLIB.
Input parameters:
A - matrix A whose indexes range within [0..M-1, 0..N-1].
M - number of rows in matrix A.
N - number of columns in matrix A.
Output parameters:
A - matrices L and Q in compact form (see below)
Tau - array of scalar factors which are used to form
matrix Q. Array whose index ranges within [0..Min(M,N)-1].
Matrix A is represented as A = LQ, where Q is an orthogonal matrix of size
MxM, L - lower triangular (or lower trapezoid) matrix of size M x N.
The elements of matrix L are located on and below the main diagonal of
matrix A. The elements which are located in Tau array and above the main
diagonal of matrix A are used to form matrix Q as follows:
Matrix Q is represented as a product of elementary reflections
Q = H(k-1)*H(k-2)*...*H(1)*H(0),
where k = min(m,n), and each H(i) is of the form
H(i) = 1 - tau * v * (v^T)
where tau is a scalar stored in Tau[I]; v - real vector, so that v(0:i-1)=0,
v(i) = 1, v(i+1:n-1) stored in A(i,i+1:n-1).
-- ALGLIB routine --
17.02.2010
Bochkanov Sergey
*************************************************************************/
void rmatrixlq(real_2d_array &a, const ae_int_t m, const ae_int_t n, real_1d_array &tau)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::rmatrixlq(const_cast(a.c_ptr()), m, n, const_cast(tau.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
void smp_rmatrixlq(real_2d_array &a, const ae_int_t m, const ae_int_t n, real_1d_array &tau)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::_pexec_rmatrixlq(const_cast(a.c_ptr()), m, n, const_cast(tau.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
QR decomposition of a rectangular complex matrix of size MxN
COMMERCIAL EDITION OF ALGLIB:
! Commercial version of ALGLIB includes two important improvements of
! this function, which can be used from C++ and C#:
! * Intel MKL support (lightweight Intel MKL is shipped with ALGLIB)
! * multicore support
!
! Intel MKL gives approximately constant (with respect to number of
! worker threads) acceleration factor which depends on CPU being used,
! problem size and "baseline" ALGLIB edition which is used for
! comparison.
!
! Say, on SSE2-capable CPU with N=1024, HPC ALGLIB will be:
! * about 2-3x faster than ALGLIB for C++ without MKL
! * about 7-10x faster than "pure C#" edition of ALGLIB
! Difference in performance will be more striking on newer CPU's with
! support for newer SIMD instructions. Generally, MKL accelerates any
! problem whose size is at least 128, with best efficiency achieved for
! N's larger than 512.
!
! Commercial edition of ALGLIB also supports multithreaded acceleration
! of this function. We should note that QP decomposition is harder to
! parallelize than, say, matrix-matrix product - this algorithm has
! many internal synchronization points which can not be avoided. However
! parallelism starts to be profitable starting from N=512, achieving
! near-linear speedup for N=4096 or higher.
!
! In order to use multicore features you have to:
! * use commercial version of ALGLIB
! * call this function with "smp_" prefix, which indicates that
! multicore code will be used (for multicore support)
!
! We recommend you to read 'Working with commercial version' section of
! ALGLIB Reference Manual in order to find out how to use performance-
! related features provided by commercial edition of ALGLIB.
Input parameters:
A - matrix A whose indexes range within [0..M-1, 0..N-1]
M - number of rows in matrix A.
N - number of columns in matrix A.
Output parameters:
A - matrices Q and R in compact form
Tau - array of scalar factors which are used to form matrix Q. Array
whose indexes range within [0.. Min(M,N)-1]
Matrix A is represented as A = QR, where Q is an orthogonal matrix of size
MxM, R - upper triangular (or upper trapezoid) matrix of size MxN.
-- LAPACK routine (version 3.0) --
Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
Courant Institute, Argonne National Lab, and Rice University
September 30, 1994
*************************************************************************/
void cmatrixqr(complex_2d_array &a, const ae_int_t m, const ae_int_t n, complex_1d_array &tau)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::cmatrixqr(const_cast(a.c_ptr()), m, n, const_cast(tau.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
void smp_cmatrixqr(complex_2d_array &a, const ae_int_t m, const ae_int_t n, complex_1d_array &tau)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::_pexec_cmatrixqr(const_cast(a.c_ptr()), m, n, const_cast(tau.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
LQ decomposition of a rectangular complex matrix of size MxN
COMMERCIAL EDITION OF ALGLIB:
! Commercial version of ALGLIB includes two important improvements of
! this function, which can be used from C++ and C#:
! * Intel MKL support (lightweight Intel MKL is shipped with ALGLIB)
! * multicore support
!
! Intel MKL gives approximately constant (with respect to number of
! worker threads) acceleration factor which depends on CPU being used,
! problem size and "baseline" ALGLIB edition which is used for
! comparison.
!
! Say, on SSE2-capable CPU with N=1024, HPC ALGLIB will be:
! * about 2-3x faster than ALGLIB for C++ without MKL
! * about 7-10x faster than "pure C#" edition of ALGLIB
! Difference in performance will be more striking on newer CPU's with
! support for newer SIMD instructions. Generally, MKL accelerates any
! problem whose size is at least 128, with best efficiency achieved for
! N's larger than 512.
!
! Commercial edition of ALGLIB also supports multithreaded acceleration
! of this function. We should note that QP decomposition is harder to
! parallelize than, say, matrix-matrix product - this algorithm has
! many internal synchronization points which can not be avoided. However
! parallelism starts to be profitable starting from N=512, achieving
! near-linear speedup for N=4096 or higher.
!
! In order to use multicore features you have to:
! * use commercial version of ALGLIB
! * call this function with "smp_" prefix, which indicates that
! multicore code will be used (for multicore support)
!
! We recommend you to read 'Working with commercial version' section of
! ALGLIB Reference Manual in order to find out how to use performance-
! related features provided by commercial edition of ALGLIB.
Input parameters:
A - matrix A whose indexes range within [0..M-1, 0..N-1]
M - number of rows in matrix A.
N - number of columns in matrix A.
Output parameters:
A - matrices Q and L in compact form
Tau - array of scalar factors which are used to form matrix Q. Array
whose indexes range within [0.. Min(M,N)-1]
Matrix A is represented as A = LQ, where Q is an orthogonal matrix of size
MxM, L - lower triangular (or lower trapezoid) matrix of size MxN.
-- LAPACK routine (version 3.0) --
Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
Courant Institute, Argonne National Lab, and Rice University
September 30, 1994
*************************************************************************/
void cmatrixlq(complex_2d_array &a, const ae_int_t m, const ae_int_t n, complex_1d_array &tau)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::cmatrixlq(const_cast(a.c_ptr()), m, n, const_cast(tau.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
void smp_cmatrixlq(complex_2d_array &a, const ae_int_t m, const ae_int_t n, complex_1d_array &tau)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::_pexec_cmatrixlq(const_cast(a.c_ptr()), m, n, const_cast(tau.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
Partial unpacking of matrix Q from the QR decomposition of a matrix A
COMMERCIAL EDITION OF ALGLIB:
! Commercial version of ALGLIB includes two important improvements of
! this function, which can be used from C++ and C#:
! * Intel MKL support (lightweight Intel MKL is shipped with ALGLIB)
! * multicore support
!
! Intel MKL gives approximately constant (with respect to number of
! worker threads) acceleration factor which depends on CPU being used,
! problem size and "baseline" ALGLIB edition which is used for
! comparison.
!
! Say, on SSE2-capable CPU with N=1024, HPC ALGLIB will be:
! * about 2-3x faster than ALGLIB for C++ without MKL
! * about 7-10x faster than "pure C#" edition of ALGLIB
! Difference in performance will be more striking on newer CPU's with
! support for newer SIMD instructions. Generally, MKL accelerates any
! problem whose size is at least 128, with best efficiency achieved for
! N's larger than 512.
!
! Commercial edition of ALGLIB also supports multithreaded acceleration
! of this function. We should note that QP decomposition is harder to
! parallelize than, say, matrix-matrix product - this algorithm has
! many internal synchronization points which can not be avoided. However
! parallelism starts to be profitable starting from N=512, achieving
! near-linear speedup for N=4096 or higher.
!
! In order to use multicore features you have to:
! * use commercial version of ALGLIB
! * call this function with "smp_" prefix, which indicates that
! multicore code will be used (for multicore support)
!
! We recommend you to read 'Working with commercial version' section of
! ALGLIB Reference Manual in order to find out how to use performance-
! related features provided by commercial edition of ALGLIB.
Input parameters:
A - matrices Q and R in compact form.
Output of RMatrixQR subroutine.
M - number of rows in given matrix A. M>=0.
N - number of columns in given matrix A. N>=0.
Tau - scalar factors which are used to form Q.
Output of the RMatrixQR subroutine.
QColumns - required number of columns of matrix Q. M>=QColumns>=0.
Output parameters:
Q - first QColumns columns of matrix Q.
Array whose indexes range within [0..M-1, 0..QColumns-1].
If QColumns=0, the array remains unchanged.
-- ALGLIB routine --
17.02.2010
Bochkanov Sergey
*************************************************************************/
void rmatrixqrunpackq(const real_2d_array &a, const ae_int_t m, const ae_int_t n, const real_1d_array &tau, const ae_int_t qcolumns, real_2d_array &q)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::rmatrixqrunpackq(const_cast(a.c_ptr()), m, n, const_cast(tau.c_ptr()), qcolumns, const_cast(q.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
void smp_rmatrixqrunpackq(const real_2d_array &a, const ae_int_t m, const ae_int_t n, const real_1d_array &tau, const ae_int_t qcolumns, real_2d_array &q)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::_pexec_rmatrixqrunpackq(const_cast(a.c_ptr()), m, n, const_cast(tau.c_ptr()), qcolumns, const_cast(q.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
Unpacking of matrix R from the QR decomposition of a matrix A
Input parameters:
A - matrices Q and R in compact form.
Output of RMatrixQR subroutine.
M - number of rows in given matrix A. M>=0.
N - number of columns in given matrix A. N>=0.
Output parameters:
R - matrix R, array[0..M-1, 0..N-1].
-- ALGLIB routine --
17.02.2010
Bochkanov Sergey
*************************************************************************/
void rmatrixqrunpackr(const real_2d_array &a, const ae_int_t m, const ae_int_t n, real_2d_array &r)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::rmatrixqrunpackr(const_cast(a.c_ptr()), m, n, const_cast(r.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
Partial unpacking of matrix Q from the LQ decomposition of a matrix A
COMMERCIAL EDITION OF ALGLIB:
! Commercial version of ALGLIB includes two important improvements of
! this function, which can be used from C++ and C#:
! * Intel MKL support (lightweight Intel MKL is shipped with ALGLIB)
! * multicore support
!
! Intel MKL gives approximately constant (with respect to number of
! worker threads) acceleration factor which depends on CPU being used,
! problem size and "baseline" ALGLIB edition which is used for
! comparison.
!
! Say, on SSE2-capable CPU with N=1024, HPC ALGLIB will be:
! * about 2-3x faster than ALGLIB for C++ without MKL
! * about 7-10x faster than "pure C#" edition of ALGLIB
! Difference in performance will be more striking on newer CPU's with
! support for newer SIMD instructions. Generally, MKL accelerates any
! problem whose size is at least 128, with best efficiency achieved for
! N's larger than 512.
!
! Commercial edition of ALGLIB also supports multithreaded acceleration
! of this function. We should note that QP decomposition is harder to
! parallelize than, say, matrix-matrix product - this algorithm has
! many internal synchronization points which can not be avoided. However
! parallelism starts to be profitable starting from N=512, achieving
! near-linear speedup for N=4096 or higher.
!
! In order to use multicore features you have to:
! * use commercial version of ALGLIB
! * call this function with "smp_" prefix, which indicates that
! multicore code will be used (for multicore support)
!
! We recommend you to read 'Working with commercial version' section of
! ALGLIB Reference Manual in order to find out how to use performance-
! related features provided by commercial edition of ALGLIB.
Input parameters:
A - matrices L and Q in compact form.
Output of RMatrixLQ subroutine.
M - number of rows in given matrix A. M>=0.
N - number of columns in given matrix A. N>=0.
Tau - scalar factors which are used to form Q.
Output of the RMatrixLQ subroutine.
QRows - required number of rows in matrix Q. N>=QRows>=0.
Output parameters:
Q - first QRows rows of matrix Q. Array whose indexes range
within [0..QRows-1, 0..N-1]. If QRows=0, the array remains
unchanged.
-- ALGLIB routine --
17.02.2010
Bochkanov Sergey
*************************************************************************/
void rmatrixlqunpackq(const real_2d_array &a, const ae_int_t m, const ae_int_t n, const real_1d_array &tau, const ae_int_t qrows, real_2d_array &q)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::rmatrixlqunpackq(const_cast(a.c_ptr()), m, n, const_cast(tau.c_ptr()), qrows, const_cast(q.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
void smp_rmatrixlqunpackq(const real_2d_array &a, const ae_int_t m, const ae_int_t n, const real_1d_array &tau, const ae_int_t qrows, real_2d_array &q)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::_pexec_rmatrixlqunpackq(const_cast(a.c_ptr()), m, n, const_cast(tau.c_ptr()), qrows, const_cast(q.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
Unpacking of matrix L from the LQ decomposition of a matrix A
Input parameters:
A - matrices Q and L in compact form.
Output of RMatrixLQ subroutine.
M - number of rows in given matrix A. M>=0.
N - number of columns in given matrix A. N>=0.
Output parameters:
L - matrix L, array[0..M-1, 0..N-1].
-- ALGLIB routine --
17.02.2010
Bochkanov Sergey
*************************************************************************/
void rmatrixlqunpackl(const real_2d_array &a, const ae_int_t m, const ae_int_t n, real_2d_array &l)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::rmatrixlqunpackl(const_cast(a.c_ptr()), m, n, const_cast(l.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
Partial unpacking of matrix Q from QR decomposition of a complex matrix A.
COMMERCIAL EDITION OF ALGLIB:
! Commercial version of ALGLIB includes two important improvements of
! this function, which can be used from C++ and C#:
! * Intel MKL support (lightweight Intel MKL is shipped with ALGLIB)
! * multicore support
!
! Intel MKL gives approximately constant (with respect to number of
! worker threads) acceleration factor which depends on CPU being used,
! problem size and "baseline" ALGLIB edition which is used for
! comparison.
!
! Say, on SSE2-capable CPU with N=1024, HPC ALGLIB will be:
! * about 2-3x faster than ALGLIB for C++ without MKL
! * about 7-10x faster than "pure C#" edition of ALGLIB
! Difference in performance will be more striking on newer CPU's with
! support for newer SIMD instructions. Generally, MKL accelerates any
! problem whose size is at least 128, with best efficiency achieved for
! N's larger than 512.
!
! Commercial edition of ALGLIB also supports multithreaded acceleration
! of this function. We should note that QP decomposition is harder to
! parallelize than, say, matrix-matrix product - this algorithm has
! many internal synchronization points which can not be avoided. However
! parallelism starts to be profitable starting from N=512, achieving
! near-linear speedup for N=4096 or higher.
!
! In order to use multicore features you have to:
! * use commercial version of ALGLIB
! * call this function with "smp_" prefix, which indicates that
! multicore code will be used (for multicore support)
!
! We recommend you to read 'Working with commercial version' section of
! ALGLIB Reference Manual in order to find out how to use performance-
! related features provided by commercial edition of ALGLIB.
Input parameters:
A - matrices Q and R in compact form.
Output of CMatrixQR subroutine .
M - number of rows in matrix A. M>=0.
N - number of columns in matrix A. N>=0.
Tau - scalar factors which are used to form Q.
Output of CMatrixQR subroutine .
QColumns - required number of columns in matrix Q. M>=QColumns>=0.
Output parameters:
Q - first QColumns columns of matrix Q.
Array whose index ranges within [0..M-1, 0..QColumns-1].
If QColumns=0, array isn't changed.
-- ALGLIB routine --
17.02.2010
Bochkanov Sergey
*************************************************************************/
void cmatrixqrunpackq(const complex_2d_array &a, const ae_int_t m, const ae_int_t n, const complex_1d_array &tau, const ae_int_t qcolumns, complex_2d_array &q)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::cmatrixqrunpackq(const_cast(a.c_ptr()), m, n, const_cast(tau.c_ptr()), qcolumns, const_cast(q.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
void smp_cmatrixqrunpackq(const complex_2d_array &a, const ae_int_t m, const ae_int_t n, const complex_1d_array &tau, const ae_int_t qcolumns, complex_2d_array &q)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::_pexec_cmatrixqrunpackq(const_cast(a.c_ptr()), m, n, const_cast(tau.c_ptr()), qcolumns, const_cast(q.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
Unpacking of matrix R from the QR decomposition of a matrix A
Input parameters:
A - matrices Q and R in compact form.
Output of CMatrixQR subroutine.
M - number of rows in given matrix A. M>=0.
N - number of columns in given matrix A. N>=0.
Output parameters:
R - matrix R, array[0..M-1, 0..N-1].
-- ALGLIB routine --
17.02.2010
Bochkanov Sergey
*************************************************************************/
void cmatrixqrunpackr(const complex_2d_array &a, const ae_int_t m, const ae_int_t n, complex_2d_array &r)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::cmatrixqrunpackr(const_cast(a.c_ptr()), m, n, const_cast(r.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
Partial unpacking of matrix Q from LQ decomposition of a complex matrix A.
COMMERCIAL EDITION OF ALGLIB:
! Commercial version of ALGLIB includes two important improvements of
! this function, which can be used from C++ and C#:
! * Intel MKL support (lightweight Intel MKL is shipped with ALGLIB)
! * multicore support
!
! Intel MKL gives approximately constant (with respect to number of
! worker threads) acceleration factor which depends on CPU being used,
! problem size and "baseline" ALGLIB edition which is used for
! comparison.
!
! Say, on SSE2-capable CPU with N=1024, HPC ALGLIB will be:
! * about 2-3x faster than ALGLIB for C++ without MKL
! * about 7-10x faster than "pure C#" edition of ALGLIB
! Difference in performance will be more striking on newer CPU's with
! support for newer SIMD instructions. Generally, MKL accelerates any
! problem whose size is at least 128, with best efficiency achieved for
! N's larger than 512.
!
! Commercial edition of ALGLIB also supports multithreaded acceleration
! of this function. We should note that QP decomposition is harder to
! parallelize than, say, matrix-matrix product - this algorithm has
! many internal synchronization points which can not be avoided. However
! parallelism starts to be profitable starting from N=512, achieving
! near-linear speedup for N=4096 or higher.
!
! In order to use multicore features you have to:
! * use commercial version of ALGLIB
! * call this function with "smp_" prefix, which indicates that
! multicore code will be used (for multicore support)
!
! We recommend you to read 'Working with commercial version' section of
! ALGLIB Reference Manual in order to find out how to use performance-
! related features provided by commercial edition of ALGLIB.
Input parameters:
A - matrices Q and R in compact form.
Output of CMatrixLQ subroutine .
M - number of rows in matrix A. M>=0.
N - number of columns in matrix A. N>=0.
Tau - scalar factors which are used to form Q.
Output of CMatrixLQ subroutine .
QRows - required number of rows in matrix Q. N>=QColumns>=0.
Output parameters:
Q - first QRows rows of matrix Q.
Array whose index ranges within [0..QRows-1, 0..N-1].
If QRows=0, array isn't changed.
-- ALGLIB routine --
17.02.2010
Bochkanov Sergey
*************************************************************************/
void cmatrixlqunpackq(const complex_2d_array &a, const ae_int_t m, const ae_int_t n, const complex_1d_array &tau, const ae_int_t qrows, complex_2d_array &q)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::cmatrixlqunpackq(const_cast(a.c_ptr()), m, n, const_cast(tau.c_ptr()), qrows, const_cast(q.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
void smp_cmatrixlqunpackq(const complex_2d_array &a, const ae_int_t m, const ae_int_t n, const complex_1d_array &tau, const ae_int_t qrows, complex_2d_array &q)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::_pexec_cmatrixlqunpackq(const_cast(a.c_ptr()), m, n, const_cast(tau.c_ptr()), qrows, const_cast(q.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
Unpacking of matrix L from the LQ decomposition of a matrix A
Input parameters:
A - matrices Q and L in compact form.
Output of CMatrixLQ subroutine.
M - number of rows in given matrix A. M>=0.
N - number of columns in given matrix A. N>=0.
Output parameters:
L - matrix L, array[0..M-1, 0..N-1].
-- ALGLIB routine --
17.02.2010
Bochkanov Sergey
*************************************************************************/
void cmatrixlqunpackl(const complex_2d_array &a, const ae_int_t m, const ae_int_t n, complex_2d_array &l)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::cmatrixlqunpackl(const_cast(a.c_ptr()), m, n, const_cast(l.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
Reduction of a rectangular matrix to bidiagonal form
The algorithm reduces the rectangular matrix A to bidiagonal form by
orthogonal transformations P and Q: A = Q*B*(P^T).
COMMERCIAL EDITION OF ALGLIB:
! Commercial version of ALGLIB includes one important improvement of
! this function, which can be used from C++ and C#:
! * Intel MKL support (lightweight Intel MKL is shipped with ALGLIB)
!
! Intel MKL gives approximately constant (with respect to number of
! worker threads) acceleration factor which depends on CPU being used,
! problem size and "baseline" ALGLIB edition which is used for
! comparison.
!
! Multithreaded acceleration is NOT supported for this function because
! bidiagonal decompostion is inherently sequential in nature.
!
! We recommend you to read 'Working with commercial version' section of
! ALGLIB Reference Manual in order to find out how to use performance-
! related features provided by commercial edition of ALGLIB.
Input parameters:
A - source matrix. array[0..M-1, 0..N-1]
M - number of rows in matrix A.
N - number of columns in matrix A.
Output parameters:
A - matrices Q, B, P in compact form (see below).
TauQ - scalar factors which are used to form matrix Q.
TauP - scalar factors which are used to form matrix P.
The main diagonal and one of the secondary diagonals of matrix A are
replaced with bidiagonal matrix B. Other elements contain elementary
reflections which form MxM matrix Q and NxN matrix P, respectively.
If M>=N, B is the upper bidiagonal MxN matrix and is stored in the
corresponding elements of matrix A. Matrix Q is represented as a
product of elementary reflections Q = H(0)*H(1)*...*H(n-1), where
H(i) = 1-tau*v*v'. Here tau is a scalar which is stored in TauQ[i], and
vector v has the following structure: v(0:i-1)=0, v(i)=1, v(i+1:m-1) is
stored in elements A(i+1:m-1,i). Matrix P is as follows: P =
G(0)*G(1)*...*G(n-2), where G(i) = 1 - tau*u*u'. Tau is stored in TauP[i],
u(0:i)=0, u(i+1)=1, u(i+2:n-1) is stored in elements A(i,i+2:n-1).
If M n): m=5, n=6 (m < n):
( d e u1 u1 u1 ) ( d u1 u1 u1 u1 u1 )
( v1 d e u2 u2 ) ( e d u2 u2 u2 u2 )
( v1 v2 d e u3 ) ( v1 e d u3 u3 u3 )
( v1 v2 v3 d e ) ( v1 v2 e d u4 u4 )
( v1 v2 v3 v4 d ) ( v1 v2 v3 e d u5 )
( v1 v2 v3 v4 v5 )
Here vi and ui are vectors which form H(i) and G(i), and d and e -
are the diagonal and off-diagonal elements of matrix B.
-- LAPACK routine (version 3.0) --
Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
Courant Institute, Argonne National Lab, and Rice University
September 30, 1994.
Sergey Bochkanov, ALGLIB project, translation from FORTRAN to
pseudocode, 2007-2010.
*************************************************************************/
void rmatrixbd(real_2d_array &a, const ae_int_t m, const ae_int_t n, real_1d_array &tauq, real_1d_array &taup)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::rmatrixbd(const_cast(a.c_ptr()), m, n, const_cast(tauq.c_ptr()), const_cast(taup.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
Unpacking matrix Q which reduces a matrix to bidiagonal form.
COMMERCIAL EDITION OF ALGLIB:
! Commercial version of ALGLIB includes one important improvement of
! this function, which can be used from C++ and C#:
! * Intel MKL support (lightweight Intel MKL is shipped with ALGLIB)
!
! Intel MKL gives approximately constant (with respect to number of
! worker threads) acceleration factor which depends on CPU being used,
! problem size and "baseline" ALGLIB edition which is used for
! comparison.
!
! Multithreaded acceleration is NOT supported for this function.
!
! We recommend you to read 'Working with commercial version' section of
! ALGLIB Reference Manual in order to find out how to use performance-
! related features provided by commercial edition of ALGLIB.
Input parameters:
QP - matrices Q and P in compact form.
Output of ToBidiagonal subroutine.
M - number of rows in matrix A.
N - number of columns in matrix A.
TAUQ - scalar factors which are used to form Q.
Output of ToBidiagonal subroutine.
QColumns - required number of columns in matrix Q.
M>=QColumns>=0.
Output parameters:
Q - first QColumns columns of matrix Q.
Array[0..M-1, 0..QColumns-1]
If QColumns=0, the array is not modified.
-- ALGLIB --
2005-2010
Bochkanov Sergey
*************************************************************************/
void rmatrixbdunpackq(const real_2d_array &qp, const ae_int_t m, const ae_int_t n, const real_1d_array &tauq, const ae_int_t qcolumns, real_2d_array &q)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::rmatrixbdunpackq(const_cast(qp.c_ptr()), m, n, const_cast(tauq.c_ptr()), qcolumns, const_cast(q.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
Multiplication by matrix Q which reduces matrix A to bidiagonal form.
The algorithm allows pre- or post-multiply by Q or Q'.
COMMERCIAL EDITION OF ALGLIB:
! Commercial version of ALGLIB includes one important improvement of
! this function, which can be used from C++ and C#:
! * Intel MKL support (lightweight Intel MKL is shipped with ALGLIB)
!
! Intel MKL gives approximately constant (with respect to number of
! worker threads) acceleration factor which depends on CPU being used,
! problem size and "baseline" ALGLIB edition which is used for
! comparison.
!
! Multithreaded acceleration is NOT supported for this function.
!
! We recommend you to read 'Working with commercial version' section of
! ALGLIB Reference Manual in order to find out how to use performance-
! related features provided by commercial edition of ALGLIB.
Input parameters:
QP - matrices Q and P in compact form.
Output of ToBidiagonal subroutine.
M - number of rows in matrix A.
N - number of columns in matrix A.
TAUQ - scalar factors which are used to form Q.
Output of ToBidiagonal subroutine.
Z - multiplied matrix.
array[0..ZRows-1,0..ZColumns-1]
ZRows - number of rows in matrix Z. If FromTheRight=False,
ZRows=M, otherwise ZRows can be arbitrary.
ZColumns - number of columns in matrix Z. If FromTheRight=True,
ZColumns=M, otherwise ZColumns can be arbitrary.
FromTheRight - pre- or post-multiply.
DoTranspose - multiply by Q or Q'.
Output parameters:
Z - product of Z and Q.
Array[0..ZRows-1,0..ZColumns-1]
If ZRows=0 or ZColumns=0, the array is not modified.
-- ALGLIB --
2005-2010
Bochkanov Sergey
*************************************************************************/
void rmatrixbdmultiplybyq(const real_2d_array &qp, const ae_int_t m, const ae_int_t n, const real_1d_array &tauq, real_2d_array &z, const ae_int_t zrows, const ae_int_t zcolumns, const bool fromtheright, const bool dotranspose)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::rmatrixbdmultiplybyq(const_cast(qp.c_ptr()), m, n, const_cast(tauq.c_ptr()), const_cast(z.c_ptr()), zrows, zcolumns, fromtheright, dotranspose, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
Unpacking matrix P which reduces matrix A to bidiagonal form.
The subroutine returns transposed matrix P.
Input parameters:
QP - matrices Q and P in compact form.
Output of ToBidiagonal subroutine.
M - number of rows in matrix A.
N - number of columns in matrix A.
TAUP - scalar factors which are used to form P.
Output of ToBidiagonal subroutine.
PTRows - required number of rows of matrix P^T. N >= PTRows >= 0.
Output parameters:
PT - first PTRows columns of matrix P^T
Array[0..PTRows-1, 0..N-1]
If PTRows=0, the array is not modified.
-- ALGLIB --
2005-2010
Bochkanov Sergey
*************************************************************************/
void rmatrixbdunpackpt(const real_2d_array &qp, const ae_int_t m, const ae_int_t n, const real_1d_array &taup, const ae_int_t ptrows, real_2d_array &pt)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::rmatrixbdunpackpt(const_cast(qp.c_ptr()), m, n, const_cast(taup.c_ptr()), ptrows, const_cast(pt.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
Multiplication by matrix P which reduces matrix A to bidiagonal form.
The algorithm allows pre- or post-multiply by P or P'.
Input parameters:
QP - matrices Q and P in compact form.
Output of RMatrixBD subroutine.
M - number of rows in matrix A.
N - number of columns in matrix A.
TAUP - scalar factors which are used to form P.
Output of RMatrixBD subroutine.
Z - multiplied matrix.
Array whose indexes range within [0..ZRows-1,0..ZColumns-1].
ZRows - number of rows in matrix Z. If FromTheRight=False,
ZRows=N, otherwise ZRows can be arbitrary.
ZColumns - number of columns in matrix Z. If FromTheRight=True,
ZColumns=N, otherwise ZColumns can be arbitrary.
FromTheRight - pre- or post-multiply.
DoTranspose - multiply by P or P'.
Output parameters:
Z - product of Z and P.
Array whose indexes range within [0..ZRows-1,0..ZColumns-1].
If ZRows=0 or ZColumns=0, the array is not modified.
-- ALGLIB --
2005-2010
Bochkanov Sergey
*************************************************************************/
void rmatrixbdmultiplybyp(const real_2d_array &qp, const ae_int_t m, const ae_int_t n, const real_1d_array &taup, real_2d_array &z, const ae_int_t zrows, const ae_int_t zcolumns, const bool fromtheright, const bool dotranspose)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::rmatrixbdmultiplybyp(const_cast(qp.c_ptr()), m, n, const_cast(taup.c_ptr()), const_cast(z.c_ptr()), zrows, zcolumns, fromtheright, dotranspose, &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
Unpacking of the main and secondary diagonals of bidiagonal decomposition
of matrix A.
Input parameters:
B - output of RMatrixBD subroutine.
M - number of rows in matrix B.
N - number of columns in matrix B.
Output parameters:
IsUpper - True, if the matrix is upper bidiagonal.
otherwise IsUpper is False.
D - the main diagonal.
Array whose index ranges within [0..Min(M,N)-1].
E - the secondary diagonal (upper or lower, depending on
the value of IsUpper).
Array index ranges within [0..Min(M,N)-1], the last
element is not used.
-- ALGLIB --
2005-2010
Bochkanov Sergey
*************************************************************************/
void rmatrixbdunpackdiagonals(const real_2d_array &b, const ae_int_t m, const ae_int_t n, bool &isupper, real_1d_array &d, real_1d_array &e)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::rmatrixbdunpackdiagonals(const_cast(b.c_ptr()), m, n, &isupper, const_cast(d.c_ptr()), const_cast(e.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
Reduction of a square matrix to upper Hessenberg form: Q'*A*Q = H,
where Q is an orthogonal matrix, H - Hessenberg matrix.
COMMERCIAL EDITION OF ALGLIB:
! Commercial version of ALGLIB includes one important improvement of
! this function, which can be used from C++ and C#:
! * Intel MKL support (lightweight Intel MKL is shipped with ALGLIB)
!
! Intel MKL gives approximately constant (with respect to number of
! worker threads) acceleration factor which depends on CPU being used,
! problem size and "baseline" ALGLIB edition which is used for
! comparison.
!
! Generally, commercial ALGLIB is several times faster than open-source
! generic C edition, and many times faster than open-source C# edition.
!
! Multithreaded acceleration is NOT supported for this function.
!
! We recommend you to read 'Working with commercial version' section of
! ALGLIB Reference Manual in order to find out how to use performance-
! related features provided by commercial edition of ALGLIB.
Input parameters:
A - matrix A with elements [0..N-1, 0..N-1]
N - size of matrix A.
Output parameters:
A - matrices Q and P in compact form (see below).
Tau - array of scalar factors which are used to form matrix Q.
Array whose index ranges within [0..N-2]
Matrix H is located on the main diagonal, on the lower secondary diagonal
and above the main diagonal of matrix A. The elements which are used to
form matrix Q are situated in array Tau and below the lower secondary
diagonal of matrix A as follows:
Matrix Q is represented as a product of elementary reflections
Q = H(0)*H(2)*...*H(n-2),
where each H(i) is given by
H(i) = 1 - tau * v * (v^T)
where tau is a scalar stored in Tau[I]; v - is a real vector,
so that v(0:i) = 0, v(i+1) = 1, v(i+2:n-1) stored in A(i+2:n-1,i).
-- LAPACK routine (version 3.0) --
Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
Courant Institute, Argonne National Lab, and Rice University
October 31, 1992
*************************************************************************/
void rmatrixhessenberg(real_2d_array &a, const ae_int_t n, real_1d_array &tau)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::rmatrixhessenberg(const_cast(a.c_ptr()), n, const_cast(tau.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
Unpacking matrix Q which reduces matrix A to upper Hessenberg form
COMMERCIAL EDITION OF ALGLIB:
! Commercial version of ALGLIB includes one important improvement of
! this function, which can be used from C++ and C#:
! * Intel MKL support (lightweight Intel MKL is shipped with ALGLIB)
!
! Intel MKL gives approximately constant (with respect to number of
! worker threads) acceleration factor which depends on CPU being used,
! problem size and "baseline" ALGLIB edition which is used for
! comparison.
!
! Generally, commercial ALGLIB is several times faster than open-source
! generic C edition, and many times faster than open-source C# edition.
!
! Multithreaded acceleration is NOT supported for this function.
!
! We recommend you to read 'Working with commercial version' section of
! ALGLIB Reference Manual in order to find out how to use performance-
! related features provided by commercial edition of ALGLIB.
Input parameters:
A - output of RMatrixHessenberg subroutine.
N - size of matrix A.
Tau - scalar factors which are used to form Q.
Output of RMatrixHessenberg subroutine.
Output parameters:
Q - matrix Q.
Array whose indexes range within [0..N-1, 0..N-1].
-- ALGLIB --
2005-2010
Bochkanov Sergey
*************************************************************************/
void rmatrixhessenbergunpackq(const real_2d_array &a, const ae_int_t n, const real_1d_array &tau, real_2d_array &q)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::rmatrixhessenbergunpackq(const_cast(a.c_ptr()), n, const_cast(tau.c_ptr()), const_cast(q.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
Unpacking matrix H (the result of matrix A reduction to upper Hessenberg form)
Input parameters:
A - output of RMatrixHessenberg subroutine.
N - size of matrix A.
Output parameters:
H - matrix H. Array whose indexes range within [0..N-1, 0..N-1].
-- ALGLIB --
2005-2010
Bochkanov Sergey
*************************************************************************/
void rmatrixhessenbergunpackh(const real_2d_array &a, const ae_int_t n, real_2d_array &h)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::rmatrixhessenbergunpackh(const_cast(a.c_ptr()), n, const_cast(h.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
Reduction of a symmetric matrix which is given by its higher or lower
triangular part to a tridiagonal matrix using orthogonal similarity
transformation: Q'*A*Q=T.
COMMERCIAL EDITION OF ALGLIB:
! Commercial version of ALGLIB includes one important improvement of
! this function, which can be used from C++ and C#:
! * Intel MKL support (lightweight Intel MKL is shipped with ALGLIB)
!
! Intel MKL gives approximately constant (with respect to number of
! worker threads) acceleration factor which depends on CPU being used,
! problem size and "baseline" ALGLIB edition which is used for
! comparison.
!
! Generally, commercial ALGLIB is several times faster than open-source
! generic C edition, and many times faster than open-source C# edition.
!
! Multithreaded acceleration is NOT supported for this function.
!
! We recommend you to read 'Working with commercial version' section of
! ALGLIB Reference Manual in order to find out how to use performance-
! related features provided by commercial edition of ALGLIB.
Input parameters:
A - matrix to be transformed
array with elements [0..N-1, 0..N-1].
N - size of matrix A.
IsUpper - storage format. If IsUpper = True, then matrix A is given
by its upper triangle, and the lower triangle is not used
and not modified by the algorithm, and vice versa
if IsUpper = False.
Output parameters:
A - matrices T and Q in compact form (see lower)
Tau - array of factors which are forming matrices H(i)
array with elements [0..N-2].
D - main diagonal of symmetric matrix T.
array with elements [0..N-1].
E - secondary diagonal of symmetric matrix T.
array with elements [0..N-2].
If IsUpper=True, the matrix Q is represented as a product of elementary
reflectors
Q = H(n-2) . . . H(2) H(0).
Each H(i) has the form
H(i) = I - tau * v * v'
where tau is a real scalar, and v is a real vector with
v(i+1:n-1) = 0, v(i) = 1, v(0:i-1) is stored on exit in
A(0:i-1,i+1), and tau in TAU(i).
If IsUpper=False, the matrix Q is represented as a product of elementary
reflectors
Q = H(0) H(2) . . . H(n-2).
Each H(i) has the form
H(i) = I - tau * v * v'
where tau is a real scalar, and v is a real vector with
v(0:i) = 0, v(i+1) = 1, v(i+2:n-1) is stored on exit in A(i+2:n-1,i),
and tau in TAU(i).
The contents of A on exit are illustrated by the following examples
with n = 5:
if UPLO = 'U': if UPLO = 'L':
( d e v1 v2 v3 ) ( d )
( d e v2 v3 ) ( e d )
( d e v3 ) ( v0 e d )
( d e ) ( v0 v1 e d )
( d ) ( v0 v1 v2 e d )
where d and e denote diagonal and off-diagonal elements of T, and vi
denotes an element of the vector defining H(i).
-- LAPACK routine (version 3.0) --
Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
Courant Institute, Argonne National Lab, and Rice University
October 31, 1992
*************************************************************************/
void smatrixtd(real_2d_array &a, const ae_int_t n, const bool isupper, real_1d_array &tau, real_1d_array &d, real_1d_array &e)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::smatrixtd(const_cast(a.c_ptr()), n, isupper, const_cast(tau.c_ptr()), const_cast(d.c_ptr()), const_cast(e.c_ptr()), &_alglib_env_state);
alglib_impl::ae_state_clear(&_alglib_env_state);
return;
}
catch(alglib_impl::ae_error_type)
{
throw ap_error(_alglib_env_state.error_msg);
}
}
/*************************************************************************
Unpacking matrix Q which reduces symmetric matrix to a tridiagonal
form.
COMMERCIAL EDITION OF ALGLIB:
! Commercial version of ALGLIB includes one important improvement of
! this function, which can be used from C++ and C#:
! * Intel MKL support (lightweight Intel MKL is shipped with ALGLIB)
!
! Intel MKL gives approximately constant (with respect to number of
! worker threads) acceleration factor which depends on CPU being used,
! problem size and "baseline" ALGLIB edition which is used for
! comparison.
!
! Generally, commercial ALGLIB is several times faster than open-source
! generic C edition, and many times faster than open-source C# edition.
!
! Multithreaded acceleration is NOT supported for this function.
!
! We recommend you to read 'Working with commercial version' section of
! ALGLIB Reference Manual in order to find out how to use performance-
! related features provided by commercial edition of ALGLIB.
Input parameters:
A - the result of a SMatrixTD subroutine
N - size of matrix A.
IsUpper - storage format (a parameter of SMatrixTD subroutine)
Tau - the result of a SMatrixTD subroutine
Output parameters:
Q - transformation matrix.
array with elements [0..N-1, 0..N-1].
-- ALGLIB --
Copyright 2005-2010 by Bochkanov Sergey
*************************************************************************/
void smatrixtdunpackq(const real_2d_array &a, const ae_int_t n, const bool isupper, const real_1d_array &tau, real_2d_array &q)
{
alglib_impl::ae_state _alglib_env_state;
alglib_impl::ae_state_init(&_alglib_env_state);
try
{
alglib_impl::smatrixtdunpackq(const_cast