1 /***************************************************************************
2 * Copyright (C) 2005-08 by the Quassel IRC Team *
3 * devel@quassel-irc.org *
5 * This program is free software; you can redistribute it and/or modify *
6 * it under the terms of the GNU General Public License as published by *
7 * the Free Software Foundation; either version 2 of the License, or *
8 * (at your option) version 3. *
10 * This program is distributed in the hope that it will be useful, *
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of *
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
13 * GNU General Public License for more details. *
15 * You should have received a copy of the GNU General Public License *
16 * along with this program; if not, write to the *
17 * Free Software Foundation, Inc., *
18 * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
19 ***************************************************************************/
21 #include "messagemodel.h"
25 MessageModel::MessageModel(QObject *parent)
26 : QAbstractItemModel(parent)
30 QVariant MessageModel::data(const QModelIndex &index, int role) const {
31 int row = index.row(); int column = index.column();
32 if(row < 0 || row >= _messageList.count() || column < 0)
35 if(role == ColumnTypeRole)
38 return _messageList[row]->data(index.column(), role);
41 bool MessageModel::setData(const QModelIndex &index, const QVariant &value, int role) {
42 int row = index.row();
43 if(row < 0 || row >= _messageList.count())
46 if(_messageList[row]->setData(index.column(), value, role)) {
47 emit dataChanged(index, index);
56 bool MessageModel::insertMessage(const Message &msg, bool fakeMsg) {
57 MsgId id = msg.msgId();
58 int idx = indexForId(id);
59 if(!fakeMsg && idx < _messageList.count()) { // check for duplicate
60 if(_messageList[idx]->msgId() == id)
64 MessageModelItem *item = createMessageModelItem(msg);
65 beginInsertRows(QModelIndex(), idx, idx);
66 _messageList.insert(idx, item);
72 void MessageModel::insertMessageGroup(const QList<Message> &msglist) {
73 if(msglist.isEmpty()) return;
75 int idx = indexForId(msglist.first().msgId());
76 beginInsertRows(QModelIndex(), idx, idx+msglist.count()-1);
78 foreach(Message msg, msglist) {
79 _messageList.insert(idx, createMessageModelItem(msg));
87 void MessageModel::insertMessages(const QList<Message> &msglist) {
91 if(_messageList.isEmpty()) {
92 insertMessageGroup(msglist);
96 bool inOrder = (msglist.first().msgId() < msglist.last().msgId());
97 // depending on the order we have to traverse from the front to the back or vice versa
98 // for the sake of performance we have a little code duplication here
99 // if you need to do some changes here you'll probably need to change them at all
100 // places marked DUPE
103 // FIXME: keep scrollbars from jumping
104 // the somewhat bulk insert leads to a jumpy scrollbar when the user requests further backlog.
105 // it would probably be the best to stop processing each time we actually insert a messagegroup
106 // and give back controll to the eventloop (similar to what the QtUiMessageProcessor used to do)
107 QList<Message> grouplist;
110 bool fastForward = false;
111 QList<Message>::const_iterator iter;
113 iter = msglist.constEnd();
114 iter--; // this op is safe as we've allready passed an empty check
116 iter = msglist.constBegin();
120 int idx = indexForId((*iter).msgId());
122 dupeId = _messageList[idx]->msgId();
123 // we always compare to the previous entry...
124 // if there isn't, we can fastforward to the top
125 if(idx - 1 >= 0) // also safe as we've passed another empty check
126 id = _messageList[idx - 1]->msgId();
129 if((*iter).msgId() != dupeId)
136 while(iter != msglist.constBegin()) {
139 if(!fastForward && (*iter).msgId() < id) {
140 insertMessageGroup(grouplist);
144 int idx = indexForId((*iter).msgId());
146 dupeId = _messageList[idx]->msgId();
148 id = _messageList[idx - 1]->msgId();
152 if((*iter).msgId() != dupeId)
153 grouplist.prepend(*iter);
156 while(iter != msglist.constEnd()) {
158 if(!fastForward && (*iter).msgId() < id) {
159 insertMessageGroup(grouplist);
163 int idx = indexForId((*iter).msgId());
165 dupeId = _messageList[idx]->msgId();
167 id = _messageList[idx - 1]->msgId();
171 if((*iter).msgId() != dupeId)
172 grouplist.prepend(*iter);
177 if(!grouplist.isEmpty()) {
178 insertMessageGroup(grouplist);
185 void MessageModel::clear() {
186 beginRemoveRows(QModelIndex(), 0, rowCount() - 1);
187 qDeleteAll(_messageList);
188 _messageList.clear();
193 // returns index of msg with given Id or of the next message after that (i.e., the index where we'd insert this msg)
194 int MessageModel::indexForId(MsgId id) {
195 if(_messageList.isEmpty() || id <= _messageList.value(0)->data(0, MsgIdRole).value<MsgId>()) return 0;
196 if(id > _messageList.last()->data(0, MsgIdRole).value<MsgId>()) return _messageList.count();
198 int start = 0; int end = _messageList.count()-1;
200 if(end - start == 1) return end;
201 int pivot = (end + start) / 2;
202 if(id <= _messageList.value(pivot)->data(0, MsgIdRole).value<MsgId>()) end = pivot;
207 /**********************************************************************************/
209 MessageModelItem::MessageModelItem(const Message &msg) :
210 _timestamp(msg.timestamp()),
212 _bufferId(msg.bufferInfo().bufferId()),
218 QVariant MessageModelItem::data(int column, int role) const {
219 if(column < MessageModel::TimestampColumn || column > MessageModel::ContentsColumn)
223 case MessageModel::MsgIdRole: return QVariant::fromValue<MsgId>(_msgId);
224 case MessageModel::BufferIdRole: return QVariant::fromValue<BufferId>(_bufferId);
225 case MessageModel::TypeRole: return _type;
226 case MessageModel::FlagsRole: return (int)_flags;
227 case MessageModel::TimestampRole: return _timestamp;
228 default: return QVariant();
234 bool MessageModelItem::lessThan(const MessageModelItem *m1, const MessageModelItem *m2){
235 return (*m1) < (*m2);
238 bool MessageModelItem::operator<(const MessageModelItem &other) const {
239 return _msgId < other._msgId;
242 bool MessageModelItem::operator==(const MessageModelItem &other) const {
243 return _msgId == other._msgId;
246 bool MessageModelItem::operator>(const MessageModelItem &other) const {
247 return _msgId > other._msgId;