You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
197 lines
5.8 KiB
197 lines
5.8 KiB
#include <tdeaboutdata.h>
|
|
#include <tdeapplication.h>
|
|
#include <kdebug.h>
|
|
#include <tdelocale.h>
|
|
#include <tdecmdlineargs.h>
|
|
#include <kstandarddirs.h>
|
|
|
|
#include "addressbook.h"
|
|
#include "addresseelist.h"
|
|
|
|
using namespace TDEABC;
|
|
|
|
static const TDECmdLineOptions options[] =
|
|
{
|
|
{ "save", "", 0 },
|
|
{ "number", "", 0 },
|
|
TDECmdLineLastOption
|
|
};
|
|
|
|
int main(int /*argc*/,char /* **argv*/)
|
|
{
|
|
/* TDEAboutData aboutData("testaddresseelist","TestAddresseeList","0.1");
|
|
TDECmdLineArgs::init(argc, argv, &aboutData);
|
|
TDECmdLineArgs::addCmdLineOptions(options);
|
|
|
|
TDEApplication app;
|
|
TDECmdLineArgs* args = TDECmdLineArgs::parsedArgs(); */
|
|
|
|
kdDebug() << "Creating addressees" << endl;
|
|
Addressee a, b, c, d, e, f;
|
|
a.setGivenName ("Peter");
|
|
a.setFamilyName("Pan");
|
|
a.setFormattedName("Pan, Peter");
|
|
a.setUid("Asdf");
|
|
b.setGivenName ("Phileas");
|
|
b.setFamilyName("Fogg");
|
|
b.setFormattedName("Fogg, Phileas");
|
|
b.setUid("Rsdf");
|
|
c.setGivenName ("Jim");
|
|
c.setFamilyName("Hawkins");
|
|
c.setFormattedName("Hawkins, Jim");
|
|
c.setUid("Fhwn");
|
|
d.setGivenName ("John");
|
|
d.setFamilyName("Silver");
|
|
d.setPrefix ("Long");
|
|
d.setFormattedName("Long John Silver");
|
|
d.setUid("Z2hk");
|
|
e.setGivenName ("Alice");
|
|
e.setFamilyName("Liddel");
|
|
e.setFormattedName("Liddel, Alice");
|
|
e.setUid("kk45");
|
|
f.setGivenName ("Edmond");
|
|
f.setFamilyName("Dantes");
|
|
f.setFormattedName("Dantes, Edmond");
|
|
f.setUid("78ze");
|
|
|
|
kdDebug() << "Adding to list" << endl;
|
|
AddresseeList list;
|
|
list.append(a);
|
|
list.append(b);
|
|
list.append(c);
|
|
list.append(d);
|
|
list.append(e);
|
|
list.append(f);
|
|
|
|
list.sortBy(FamilyName);
|
|
if ( !( (*list.at(0)).uid()=="78ze"
|
|
&& (*list.at(1)).uid()=="Rsdf"
|
|
&& (*list.at(2)).uid()=="Fhwn"
|
|
&& (*list.at(3)).uid()=="kk45"
|
|
&& (*list.at(4)).uid()=="Asdf"
|
|
&& (*list.at(5)).uid()=="Z2hk"
|
|
) ) {
|
|
kdError() << "SORTING BY FAMILY NAME NOT CORRECT!" << endl;
|
|
kdDebug() << "list sorted by family name:" << endl;
|
|
list.dump();
|
|
} else {
|
|
kdDebug() << "Sorting by family name correct." << endl;
|
|
}
|
|
list.setReverseSorting(true);
|
|
list.sort();
|
|
if ( !( (*list.at(5)).uid()=="78ze"
|
|
&& (*list.at(4)).uid()=="Rsdf"
|
|
&& (*list.at(3)).uid()=="Fhwn"
|
|
&& (*list.at(2)).uid()=="kk45"
|
|
&& (*list.at(1)).uid()=="Asdf"
|
|
&& (*list.at(0)).uid()=="Z2hk"
|
|
) ) {
|
|
kdError() << "REVERSE SORTING BY FAMILY NAME NOT CORRECT!" << endl;
|
|
kdDebug() << "list reverse sorted by family name:" << endl;
|
|
list.dump();
|
|
} else {
|
|
kdDebug() << "Reverse sorting by family name correct." << endl;
|
|
}
|
|
|
|
list.setReverseSorting(false);
|
|
list.sortBy(FormattedName);
|
|
if ( !( (*list.at(0)).uid()=="78ze"
|
|
&& (*list.at(1)).uid()=="Rsdf"
|
|
&& (*list.at(2)).uid()=="Fhwn"
|
|
&& (*list.at(3)).uid()=="kk45"
|
|
&& (*list.at(4)).uid()=="Z2hk"
|
|
&& (*list.at(5)).uid()=="Asdf"
|
|
) ) {
|
|
kdError() << "SORTING BY FORMATTED NAME NOT CORRECT!" << endl;
|
|
kdDebug() << "list sorted by formatted name:" << endl;
|
|
list.dump();
|
|
} else {
|
|
kdDebug() << "Sorting by formatted name correct." << endl;
|
|
}
|
|
list.setReverseSorting(true);
|
|
list.sort();
|
|
if ( !( (*list.at(5)).uid()=="78ze"
|
|
&& (*list.at(4)).uid()=="Rsdf"
|
|
&& (*list.at(3)).uid()=="Fhwn"
|
|
&& (*list.at(2)).uid()=="kk45"
|
|
&& (*list.at(1)).uid()=="Z2hk"
|
|
&& (*list.at(0)).uid()=="Asdf"
|
|
) ) {
|
|
kdError() << "REVERSE SORTING BY FORMATTED NAME NOT CORRECT!" << endl;
|
|
kdDebug() << "list reverse sorted by formatted name:" << endl;
|
|
list.dump();
|
|
} else {
|
|
kdDebug() << "Reverse sorting by formatted name correct." << endl;
|
|
}
|
|
|
|
|
|
list.setReverseSorting(false);
|
|
list.sortBy(Uid);
|
|
if ( !( (*list.at(0)).uid()=="78ze"
|
|
&& (*list.at(1)).uid()=="Asdf"
|
|
&& (*list.at(2)).uid()=="Fhwn"
|
|
&& (*list.at(3)).uid()=="Rsdf"
|
|
&& (*list.at(4)).uid()=="Z2hk"
|
|
&& (*list.at(5)).uid()=="kk45"
|
|
) ) {
|
|
kdError() << "SORTING BY UID NOT CORRECT!" << endl;
|
|
kdDebug() << "list sorted by Uid:" << endl;
|
|
list.dump();
|
|
} else {
|
|
kdDebug() << "Sorting by Uid correct." << endl;
|
|
}
|
|
list.setReverseSorting(true);
|
|
list.sortBy(Uid);
|
|
if ( !( (*list.at(5)).uid()=="78ze"
|
|
&& (*list.at(4)).uid()=="Asdf"
|
|
&& (*list.at(3)).uid()=="Fhwn"
|
|
&& (*list.at(2)).uid()=="Rsdf"
|
|
&& (*list.at(1)).uid()=="Z2hk"
|
|
&& (*list.at(0)).uid()=="kk45"
|
|
) ) {
|
|
kdError() << "REVERSE SORTING BY UID NOT CORRECT!" << endl;
|
|
kdDebug() << "list sorted by Uid:" << endl;
|
|
list.dump();
|
|
} else {
|
|
kdDebug() << "Reverse sorting by Uid correct." << endl;
|
|
}
|
|
|
|
// zero, one or two entries might give errors in a poor sorting
|
|
// implementation
|
|
kdDebug() << "sorting empty list" << endl;
|
|
AddresseeList list2;
|
|
list2.sort();
|
|
|
|
kdDebug() << "sorting one entry list" << endl;
|
|
list2.append(a);
|
|
list2.sort();
|
|
|
|
kdDebug() << "sorting two entry list" << endl;
|
|
list2.append(f);
|
|
list2.setReverseSorting(false);
|
|
list2.sort();
|
|
if ( !( (*list2.at(0)).uid()=="78ze"
|
|
&& (*list2.at(1)).uid()=="Asdf"
|
|
) ) {
|
|
kdError() << "SORTING BY FORMATTED NAME IN A TWO ENTRY LIST NOT CORRECT!" << endl;
|
|
kdDebug() << "list sorted by formatted name, two entries:" << endl;
|
|
list2.dump();
|
|
} else {
|
|
kdDebug() << "Sorting by FormattedName in a two entry list correct." << endl;
|
|
}
|
|
list2.setReverseSorting(true);
|
|
list2.sort();
|
|
if ( !( (*list2.at(1)).uid()=="78ze"
|
|
&& (*list2.at(0)).uid()=="Asdf"
|
|
) ) {
|
|
kdError() << "REVERSE SORTING BY FORMATTED NAME IN A TWO ENTRY LIST NOT CORRECT!" << endl;
|
|
kdDebug() << "list reverse sorted by formatted name, two entries:" << endl;
|
|
list2.dump();
|
|
} else {
|
|
kdDebug() << "Reverse sorting by FormattedName in a two entry list correct." << endl;
|
|
}
|
|
|
|
}
|
|
|
|
|