+int MessageModel::insertMessagesGracefully(const QList<Message>& msglist)
+{
+ /* short description:
+ * 1) first we check where the message with the highest msgId from msglist would be inserted
+ * 2) check that position for dupe
+ * 3) determine the messageId of the preceeding msg
+ * 4) insert as many msgs from msglist with with msgId larger then the just determined id
+ * those messages are automatically less then the msg of the position we just determined in 1)
+ */
+ bool inOrder = (msglist.first().msgId() < msglist.last().msgId());
+ // depending on the order we have to traverse from the front to the back or vice versa
+
+ QList<Message> grouplist;
+ MsgId minId;
+ MsgId dupeId;
+ int processedMsgs = 1; // we know the list isn't empty, so we at least process one message
+ int idx;
+ 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();
+ }
+
+ idx = indexForId((*iter).msgId());
+ if (idx < messageCount())
+ dupeId = messageItemAt(idx)->msgId();
+
+ // we always compare to the previous entry...
+ // if there isn't, we can fastforward to the top
+ if (idx - 1 >= 0)
+ minId = messageItemAt(idx - 1)->msgId();
+ else
+ fastForward = true;
+
+ if ((*iter).msgId() != dupeId) {
+ grouplist << *iter;
+ dupeId = (*iter).msgId();
+ }
+
+ if (!inOrder)
+ ++iter;
+
+ if (inOrder) {
+ while (iter != msglist.constBegin()) {
+ --iter;
+
+ if (!fastForward && (*iter).msgId() <= minId)
+ break;
+ processedMsgs++;
+
+ if (grouplist.isEmpty()) { // as long as we don't have a starting point, we have to update the dupeId
+ idx = indexForId((*iter).msgId());
+ if (idx >= 0 && !messagesIsEmpty())
+ dupeId = messageItemAt(idx)->msgId();
+ }
+ if ((*iter).msgId() != dupeId) {
+ if (!grouplist.isEmpty()) {
+ QDateTime nextTs = grouplist.value(0).timestamp();
+ QDateTime prevTs = (*iter).timestamp();
+ nextTs.setTimeSpec(Qt::UTC);
+ prevTs.setTimeSpec(Qt::UTC);
+ qint64 nextDay = nextTs.toMSecsSinceEpoch() / DAY_IN_MSECS;
+ qint64 prevDay = prevTs.toMSecsSinceEpoch() / DAY_IN_MSECS;
+ if (nextDay != prevDay) {
+ nextTs.setMSecsSinceEpoch(nextDay * DAY_IN_MSECS);
+ nextTs.setTimeSpec(Qt::LocalTime);
+ Message dayChangeMsg = Message::ChangeOfDay(nextTs);
+ dayChangeMsg.setMsgId((*iter).msgId());
+ grouplist.prepend(dayChangeMsg);
+ }
+ }
+ dupeId = (*iter).msgId();
+ grouplist.prepend(*iter);
+ }
+ }
+ }
+ else {
+ while (iter != msglist.constEnd()) {
+ if (!fastForward && (*iter).msgId() <= minId)
+ break;
+ processedMsgs++;
+
+ if (grouplist.isEmpty()) { // as long as we don't have a starting point, we have to update the dupeId
+ idx = indexForId((*iter).msgId());
+ if (idx >= 0 && !messagesIsEmpty())
+ dupeId = messageItemAt(idx)->msgId();
+ }
+ if ((*iter).msgId() != dupeId) {
+ if (!grouplist.isEmpty()) {
+ QDateTime nextTs = grouplist.value(0).timestamp();
+ QDateTime prevTs = (*iter).timestamp();
+ nextTs.setTimeSpec(Qt::UTC);
+ prevTs.setTimeSpec(Qt::UTC);
+ qint64 nextDay = nextTs.toMSecsSinceEpoch() / DAY_IN_MSECS;
+ qint64 prevDay = prevTs.toMSecsSinceEpoch() / DAY_IN_MSECS;
+ if (nextDay != prevDay) {
+ nextTs.setMSecsSinceEpoch(nextDay * DAY_IN_MSECS);
+ nextTs.setTimeSpec(Qt::LocalTime);
+ Message dayChangeMsg = Message::ChangeOfDay(nextTs);
+ dayChangeMsg.setMsgId((*iter).msgId());
+ grouplist.prepend(dayChangeMsg);
+ }
+ }
+ dupeId = (*iter).msgId();
+ grouplist.prepend(*iter);
+ }
+ ++iter;
+ }
+ }
+
+ if (!grouplist.isEmpty())
+ insertMessageGroup(grouplist);
+ return processedMsgs;