#include "message.h"
-MessageModel::MessageModel(QObject *parent) : QAbstractItemModel(parent) {
-
-
-
-}
-
-MessageModel::~MessageModel() {
-
-
+MessageModel::MessageModel(QObject *parent)
+ : QAbstractItemModel(parent)
+{
}
QVariant MessageModel::data(const QModelIndex &index, int role) const {
- int row = index.row();
- if(row < 0 || row >= _messageList.count()) return QVariant();
+ int row = index.row(); int column = index.column();
+ if(row < 0 || row >= _messageList.count() || column < 0)
+ return QVariant();
+
+ if(role == ColumnTypeRole)
+ return column;
+
return _messageList[row]->data(index.column(), role);
}
bool MessageModel::setData(const QModelIndex &index, const QVariant &value, int role) {
int row = index.row();
- if(row < 0 || row >= _messageList.count()) return false;
+ if(row < 0 || row >= _messageList.count())
+ return false;
+
if(_messageList[row]->setData(index.column(), value, role)) {
emit dataChanged(index, index);
return true;
}
+
return false;
}
-void MessageModel::insertMessage(const Message &msg) {
+
+
+bool MessageModel::insertMessage(const Message &msg, bool fakeMsg) {
MsgId id = msg.msgId();
int idx = indexForId(id);
+ if(!fakeMsg && idx < _messageList.count()) { // check for duplicate
+ if(_messageList[idx]->msgId() == id)
+ return false;
+ }
+
MessageModelItem *item = createMessageModelItem(msg);
beginInsertRows(QModelIndex(), idx, idx);
_messageList.insert(idx, item);
endInsertRows();
+ return true;
}
-void MessageModel::insertMessages(const QList<Message> &msglist) {
+
+void MessageModel::insertMessageGroup(const QList<Message> &msglist) {
if(msglist.isEmpty()) return;
- // FIXME make this more efficient by grouping msgs
- foreach(Message msg, msglist) insertMessage(msg);
+ int idx = indexForId(msglist.first().msgId());
+ beginInsertRows(QModelIndex(), idx, idx+msglist.count()-1);
+
+ foreach(Message msg, msglist) {
+ _messageList.insert(idx, createMessageModelItem(msg));
+ idx++;
+ }
+
+ endInsertRows();
+}
+
+
+void MessageModel::insertMessages(const QList<Message> &msglist) {
+ if(msglist.isEmpty())
+ return;
+
+ if(_messageList.isEmpty()) {
+ insertMessageGroup(msglist);
+ return;
+ }
+
+ bool inOrder = (msglist.first().msgId() < msglist.last().msgId());
+
+ // check if the whole bunch fits in at one position
+ if(indexForId(msglist.first().msgId()) == indexForId(msglist.last().msgId())) {
+ if(inOrder) {
+ insertMessageGroup(msglist);
+ } else {
+ QList<Message> messages = msglist;
+ qSort(messages);
+ insertMessageGroup(messages);
+ }
+ return;
+ }
+
+ // depending on the order we have to traverse from the front to the back or vice versa
+ // for the sake of performance we have a little code duplication here
+ // if you need to do some changes here you'll probably need to change them at all
+ // places marked DUPE
+
+
+ // FIXME: keep scrollbars from jumping
+ // the somewhat bulk insert leads to a jumpy scrollbar when the user requests further backlog.
+ // it would probably be the best to stop processing each time we actually insert a messagegroup
+ // and give back controll to the eventloop (similar to what the QtUiMessageProcessor used to do)
+ QList<Message> grouplist;
+ MsgId id;
+ bool fastForward = false;
+ QList<Message>::const_iterator iter;
+ if(inOrder) {
+ iter = msglist.constEnd();
+ iter--; // this op is safe as we've allready passed an empty check
+ } else {
+ iter = msglist.constBegin();
+ }
+
+ // DUPE (1 / 3)
+ int idx = indexForId((*iter).msgId());
+ // we always compare to the previous entry...
+ // if there isn't, we can fastforward to the top
+ if(idx - 1 >= 0) // also safe as we've passed another empty check
+ id = _messageList[idx - 1]->msgId();
+ else
+ fastForward = true;
+ grouplist << *iter;
+
+ if(!inOrder)
+ iter++;
+
+ if(inOrder) {
+ while(iter != msglist.constBegin()) {
+ iter--;
+ // DUPE (2 / 3)
+ if(!fastForward && (*iter).msgId() < id) {
+ insertMessageGroup(grouplist);
+ grouplist.clear();
+
+ // build new group
+ int idx = indexForId((*iter).msgId());
+ if(idx - 1 >= 0)
+ id = _messageList[idx - 1]->msgId();
+ else
+ fastForward = true;
+ }
+ grouplist.prepend(*iter);
+ }
+ } else {
+ while(iter != msglist.constEnd()) {
+ // DUPE (3 / 3)
+ if(!fastForward && (*iter).msgId() < id) {
+ insertMessageGroup(grouplist);
+ grouplist.clear();
+
+ // build new group
+ int idx = indexForId((*iter).msgId());
+ if(idx - 1 >= 0)
+ id = _messageList[idx - 1]->msgId();
+ else
+ fastForward = true;
+ }
+ grouplist.prepend(*iter);
+ iter++;
+ }
+ }
+
+ if(!grouplist.isEmpty()) {
+ insertMessageGroup(grouplist);
+ }
+
+ return;
+}
+
+
+void MessageModel::clear() {
+ beginRemoveRows(QModelIndex(), 0, rowCount() - 1);
+ qDeleteAll(_messageList);
+ _messageList.clear();
+ endRemoveRows();
}
+
// returns index of msg with given Id or of the next message after that (i.e., the index where we'd insert this msg)
int MessageModel::indexForId(MsgId id) {
- if(_messageList.isEmpty() || id <= _messageList[0]->data(0, MsgIdRole).value<MsgId>()) return 0;
+ if(_messageList.isEmpty() || id <= _messageList.value(0)->data(0, MsgIdRole).value<MsgId>()) return 0;
if(id > _messageList.last()->data(0, MsgIdRole).value<MsgId>()) return _messageList.count();
// binary search
int start = 0; int end = _messageList.count()-1;
while(1) {
if(end - start == 1) return end;
int pivot = (end + start) / 2;
- if(id <= _messageList[pivot]->data(0, MsgIdRole).value<MsgId>()) end = pivot;
+ if(id <= _messageList.value(pivot)->data(0, MsgIdRole).value<MsgId>()) end = pivot;
else start = pivot;
}
}
/**********************************************************************************/
-MessageModelItem::MessageModelItem(const Message &msg) {
- _timestamp = msg.timestamp();
- _msgId = msg.msgId();
- _bufferId = msg.bufferInfo().bufferId();
- _type = msg.type();
- _flags = msg.flags();
+MessageModelItem::MessageModelItem(const Message &msg) :
+ _timestamp(msg.timestamp()),
+ _msgId(msg.msgId()),
+ _bufferId(msg.bufferInfo().bufferId()),
+ _type(msg.type()),
+ _flags(msg.flags())
+{
+}
+QVariant MessageModelItem::data(int column, int role) const {
+ if(column < MessageModel::TimestampColumn || column > MessageModel::ContentsColumn)
+ return QVariant();
+
+ switch(role) {
+ case MessageModel::MsgIdRole: return QVariant::fromValue<MsgId>(_msgId);
+ case MessageModel::BufferIdRole: return QVariant::fromValue<BufferId>(_bufferId);
+ case MessageModel::TypeRole: return _type;
+ case MessageModel::FlagsRole: return (int)_flags;
+ case MessageModel::TimestampRole: return _timestamp;
+ default: return QVariant();
+ }
}
-MessageModelItem::~MessageModelItem() {
+// Stuff for later
+bool MessageModelItem::lessThan(const MessageModelItem *m1, const MessageModelItem *m2){
+ return (*m1) < (*m2);
}
-QVariant MessageModelItem::data(int column, int role) const {
- if(column < MessageModel::TimestampColumn || column > MessageModel::ContentsColumn) return QVariant();
- switch(role) {
- case MessageModel::MsgIdRole: return QVariant::fromValue<MsgId>(_msgId);
- case MessageModel::BufferIdRole: return QVariant::fromValue<BufferId>(_bufferId);
- case MessageModel::TypeRole: return _type;
- case MessageModel::FlagsRole: return (int)_flags;
- case MessageModel::TimestampRole: return _timestamp;
- default: return QVariant();
- }
+bool MessageModelItem::operator<(const MessageModelItem &other) const {
+ return _msgId < other._msgId;
}
+bool MessageModelItem::operator==(const MessageModelItem &other) const {
+ return _msgId == other._msgId;
+}
+
+bool MessageModelItem::operator>(const MessageModelItem &other) const {
+ return _msgId > other._msgId;
+}