52dc9068e5
QHash provides faster lookup times than QMap because it uses a hash table to store the elements, while QMap uses a self-balancing binary tree. Signed-off-by: Edgars Cīrulis <edgarsscirulis@gmail.com>
14 lines
230 B
C
14 lines
230 B
C
#pragma once
|
|
|
|
#include <QString>
|
|
#include <QHash>
|
|
#include <QByteArray>
|
|
|
|
struct ApplicationMessage {
|
|
QString command;
|
|
QHash<QString, QString> args;
|
|
|
|
QByteArray serialize();
|
|
void parse(const QByteArray & input);
|
|
};
|