void
update(DictionaryList<T> params, NameValuePair<TT> qualifier)
{
for(size_t i=0;i<params.size();i++)
{
update<T,TT>(params[i],qualifier);
}
}
/**
* @param filename File where to load plugin from
*
*/
void PluginManager::loadPlugin(const QString & filename) {
QPluginLoader pluginLoader(filename);
QObject * plugin = pluginLoader.instance();
if (plugin == 0) {
// FIXME - inform about invalid plugin format
return;
}
DictionaryShelfPluginInterface * shelf =
qobject_cast<DictionaryShelfPluginInterface *>(plugin);
if (shelf == 0) {
// FIXME - inform about invalid plugin interface
return;
}
// everythings seems fine, let's add the dictionaries to the
// local list
DictionaryList dicts = shelf->getDictionaries();
DictionaryList::iterator e = dicts.end();
for (DictionaryList::iterator i = dicts.begin(); i != e; ++i) {
addDictionary(*i);
}
}
void insert(DictionaryList<T> params)
{
string query = "INSERT INTO "+table+" (";
ostringstream endquery;
endquery<<" VALUES ( ";
for(size_t i=0; i< params.size(); i++)
{
query+=" `"+fixInvalids(params[i].name)+"`";
ostringstream tempval;
tempval<<params[i].value;
endquery<<"'"<<fixInvalids(tempval.str())<<"'";
if(i < params.size()-1)
{
query+=",";
endquery<<",";
}
}
endquery<<" )";
query+=" )"+endquery.str();
DebugOut()<<"BaseDB: "<<query<<endl;
q->execute(query);
}
void print(DictionaryList& dl)
{
if (dl.size() == 0)
cout << " List is EMPTY.\n";
for (dl.go_to_first(); dl.cursor_ok(); dl.step_fwd()) {
cout << " " << dl.cursor_key();
cout << " " << dl.cursor_datum().c_str() << '\n';
}
}
void test_copying()
{
DictionaryList one;
// Copy an empty list.
DictionaryList two;
assert(two.size() == 0);
// Copy a list with three entries and a valid cursor.
one.insert(319,"Randomness");
one.insert(315,"Shocks");
one.insert(335,"ParseErrors");
one.go_to_first();
one.step_fwd();
DictionaryList three(one);
assert(three.cursor_datum().isEqual("Randomness"));
one.remove(335);
cout << "Printing list--keys should be 315, 319\n";
print(one);
cout << "Printing list--keys should be 315, 319, 335\n";
print(three);
// Assignment operator check.
one = two = three = three;
one.remove(319);
two.remove(315);
cout << "Printing list--keys should be 315, 335\n";
print(one);
cout << "Printing list--keys should be 319, 335\n";
print(two);
cout << "Printing list--keys should be 315, 319, 335\n";
print(three);
cout << "***----Finished tests of copying----------------------***\n\n";
}
DictionaryList dictionary_tests()
{
DictionaryList dl;
assert(dl.size() == 0);
cout << "\nPrinting list just after its creation ...\n";
print(dl);
// Insert using new keys.
dl.insert(8001,"Dilbert");
dl.insert(8002,"Alice");
dl.insert(8003,"Wally");
assert(dl.size() == 3);
cout << "\nPrinting list after inserting 3 new keys ...\n";
print(dl);
dl.remove(8002);
dl.remove(8001);
dl.insert(8004,"PointyHair");
assert(dl.size() == 2);
cout << "\nPrinting list after removing two keys and inserting PointyHair ...\n";
print(dl);
// Insert using existing key.
dl.insert(8003,"Sam");
assert(dl.size() == 2);
cout << "\nPrinting list after changing data for one of the keys ...\n";
print(dl);
dl.insert(8001,"Allen");
dl.insert(8002,"Peter");
assert(dl.size() == 4);
cout << "\nPrinting list after inserting 2 more keys ...\n";
print(dl);
cout << "***----Finished dictionary tests---------------------------***\n\n";
return dl;
}
void test_operator_overloading(DictionaryList& dl)
{
DictionaryList dl2 = dl;
dl.go_to_first();
dl.step_fwd();
dl2.go_to_first();
cout << "\n\nTesting a few comparison and insertion operators." << endl;
// Needs to overload >= and << (insertion operator) in class Mystring
if (dl.cursor_datum() >= (dl2.cursor_datum()))
cout << endl << dl.cursor_datum() << " is greater than or equal " << dl2.cursor_datum();
else
cout << endl << dl2.cursor_datum() << " is greater than " << dl.cursor_datum();
// Needs to overload <= for Mystring
if(dl.cursor_datum() <= (dl2.cursor_datum()))
cout << dl.cursor_datum() << " is less than or equal" << dl2.cursor_datum();
else
cout << endl << dl2.cursor_datum() << " is less than " << dl.cursor_datum();
// Needs to overload != for Mystring
if(dl.cursor_datum() != (dl2.cursor_datum()))
cout << endl << dl.cursor_datum() << " is not equal to " << dl2.cursor_datum();
else
cout << endl << dl2.cursor_datum() << " is equal to " << dl.cursor_datum();
// Needs to overload > for Mystring
if(dl.cursor_datum() > (dl2.cursor_datum()))
cout << endl << dl.cursor_datum() << " is greater than " << dl2.cursor_datum();
else
cout << endl << dl.cursor_datum() << " is not greater than " << dl2.cursor_datum();
// Needs to overload < for Mystring
if(dl.cursor_datum() < (dl2.cursor_datum()))
cout << endl << dl.cursor_datum() << " is less than " << dl2.cursor_datum();
else
cout << endl << dl.cursor_datum() << " is not less than " << dl2.cursor_datum();
// Needs to overload == for Mystring
if(dl.cursor_datum() == (dl2.cursor_datum()))
cout << endl << dl.cursor_datum() << " is equal to " << dl2.cursor_datum();
else
cout << endl << dl.cursor_datum() << " is not equal to " << dl2.cursor_datum();
cout << endl << "\nUsing square bracket [] to access elements of Mystring objects. ";
char c = dl.cursor_datum()[1];
cout << endl << "The second element of " << dl.cursor_datum() << " is: " << c;
dl.cursor_datum()[1] = 'o';
c = dl.cursor_datum()[1];
cout << endl << "The second element of " << dl.cursor_datum() << " is: " << c;
cout << endl << "\nUsing << to display key/datum pairs in a Dictionary list: \n";
/* The following line is expected to display the content of the linked list
* dl2 -- key/datum pairs. It should display:
* 8001 Allen
* 8002 Peter
* 8003 Sam
* 8004 PointyHair
*/
cout << dl2;
cout << endl << "\nUsing [] to display the datum only: \n";
/* The following line is expected to display the content of the linked list
* dl2 -- datum. It should display:
* Allen
* Peter
* Sam
* PointyHair
*/
for(int i =0; i < dl2.size(); i++)
cout << dl2[i] << endl;
cout << endl << "\nUsing [] to display sequence of charaters in a datum: \n";
/* The following line is expected to display the characters in the first node
* of the dictionary. It should display:
* A
* l
* l
* e
* n
*/
cout << dl2[0][0] << endl;
cout << dl2[0][1] << endl;
cout << dl2[0][2] << endl;
cout << dl2[0][3] << endl;
cout << dl2[0][4] << endl;
cout << "\n\n***----Finished tests for overloading operators ----------***\n\n";
}
void test_finding(DictionaryList& dl)
{
// Pretend that a user is trying to look up names.
cout << "\nLet's look up some names ...\n";
dl.find(8001);
if (dl.cursor_ok())
cout << " name for 8001 is: " << dl.cursor_datum().c_str() << ".\n";
else
cout << " Sorry, I couldn't find 8001 in the list. \n" ;
dl.find(8000);
if (dl.cursor_ok())
cout << " name for 8000 is: " << dl.cursor_datum().c_str() << ".\n";
else
cout << " Sorry, I couldn't find 8000 in the list. \n" ;
dl.find(8002);
if (dl.cursor_ok())
cout << " name for 8002 is: " << dl.cursor_datum().c_str() << ".\n";
else
cout << " Sorry, I couldn't find 8002 in the list. \n" ;
dl.find(8004);
if (dl.cursor_ok())
cout << " name for 8004 is: " << dl.cursor_datum().c_str() << ".\n";
else
cout << " Sorry, I couldn't find 8004 in the list. \n" ;
cout << "***----Finished tests of finding -------------------------***\n\n";
}
void * cbFunc(gpointer data)
{
Shared *shared = static_cast<Shared*>(data);
if(!shared)
{
throw std::runtime_error("Could not cast shared object.");
}
vector<DictionaryList<string> > insertList;
while(1)
{
DBObject* obj = shared->queue.pop();
if( obj->quit )
{
delete obj;
break;
}
DictionaryList<string> dict;
NameValuePair<string> one("key", obj->key);
NameValuePair<string> two("value", obj->value);
NameValuePair<string> three("source", obj->source);
NameValuePair<string> four("time", boost::lexical_cast<string>(obj->time));
NameValuePair<string> five("sequence", boost::lexical_cast<string>(obj->sequence));
dict.push_back(one);
dict.push_back(two);
dict.push_back(three);
dict.push_back(four);
dict.push_back(five);
insertList.push_back(dict);
if(insertList.size() > bufferLength)
{
shared->db->exec("BEGIN IMMEDIATE TRANSACTION");
for(int i=0; i< insertList.size(); i++)
{
DictionaryList<string> d = insertList[i];
shared->db->insert(d);
}
shared->db->exec("END TRANSACTION");
insertList.clear();
}
delete obj;
}
/// final flush of whatever is still in the queue:
shared->db->exec("BEGIN IMMEDIATE TRANSACTION");
for(int i=0; i< insertList.size(); i++)
{
DictionaryList<string> d = insertList[i];
shared->db->insert(d);
}
shared->db->exec("END TRANSACTION");
return NULL;
}