Best way to provide lookup values (over 1000)

[nbkhwjm]

I have a custom network server Daemon that returns error codes to the client as numbers like "10000", "10003" etc.

These numbers correspond to text descriptions like this:

10000 = Success
10003 = Failed
etc.

There are over 1000 of these codes, what is the best way to store them in the client app so i can search through them later?

Thanks for the help

[wysota]

QHash or some other (custom) kind of tree.

[spud]

or why not just a switch/case statement:

QString errorString(int code)
{
    switch(code)
    {
    case 1000 : return "Success";
    case 1003 : return "Error";
    ...
    }
}

QString errorString(int code)
{
    switch(code)
    {
    case 1000 : return "Success";
    case 1003 : return "Error";
    ...
    }
}

To copy to clipboard, switch view to plain text mode 

[wysota]

Hmm... that would mean 1000 conditional branch operations in the worst case and only 32 in case of using a binary tree.

[nbkhwjm]

Here's what I did . . .

I defined the structure like this:

QMap<int, QString> map;
 map[100] = "event 1";
 map[101] = "event 2";
 map[102] = "event 3";

QMap<int, QString> map;
 map[100] = "event 1";
 map[101] = "event 2";
 map[102] = "event 3";

To copy to clipboard, switch view to plain text mode 

Then to lookup the human text where the incoming network data is "num"

int num = statusData[1].toInt();
 
		QMap<int, QString>::const_iterator i = map.find(num);
		while (i != map.end() && i.key() == num) {
			qDebug() << "DEBUG: Status Definition = " << i.value();
			machineStatusLabel->setText(tr("%1").arg(i.value()));
			++i;
 		}

int num = statusData[1].toInt();

		QMap<int, QString>::const_iterator i = map.find(num);
		while (i != map.end() && i.key() == num) {
			qDebug() << "DEBUG: Status Definition = " << i.value();
			machineStatusLabel->setText(tr("%1").arg(i.value()));
			++i;
 		}

To copy to clipboard, switch view to plain text mode 

Works great...

Thanks.

[wysota]

I really suggest to use QHash instead of QMap. It will work much faster.