blob: 8c3429599a4344c69fe32bbb0b02e04393af3109 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
|
/**********************************************************************
** Copyright (C) 2001 Trolltech AS. All rights reserved.
**
** This file is part of Qt Palmtop Environment.
**
** This file may be distributed and/or modified under the terms of the
** GNU General Public License version 2 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file.
**
** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
**
** See http://www.trolltech.com/gpl/ for GPL licensing information.
**
** Contact info@trolltech.com if any conditions of this licensing are
** not clear to you.
**
**********************************************************************/
#include "maillist.h"
void MailList::clear()
{
sortedList.setAutoDelete(TRUE);
sortedList.clear();
currentPos = 0;
}
int MailList::count()
{
return sortedList.count();
}
int* MailList::first()
{
dList *mPtr;
if (sortedList.count() == 0)
return NULL;
mPtr = sortedList.at(0);
currentPos = 1;
return &(mPtr->serverId);
}
int* MailList::next()
{
dList *mPtr;
if ( (currentPos) >= sortedList.count())
return NULL;
mPtr = sortedList.at(currentPos);
currentPos++;
return &(mPtr->serverId);
}
void MailList::sizeInsert(int serverId, uint size)
{
dList *tempPtr;
int x;
dList *newEntry = new dList;
newEntry->serverId = serverId;
newEntry->size = size;
for (tempPtr = sortedList.first(); tempPtr != NULL; tempPtr = sortedList.next() ) {
if (newEntry->size < tempPtr->size) {
x = sortedList.at();
sortedList.insert(x, newEntry);
return;
}
}
sortedList.append(newEntry);
}
void MailList::moveFront(int serverId, uint/* size*/)
{
dList *currentPtr;
uint tempPos;
QString temp;
tempPos = currentPos;
if ( tempPos >= sortedList.count() )
return;
currentPtr = sortedList.at(tempPos);
while ( ((tempPos+1) < sortedList.count()) && ( currentPtr->serverId != serverId) ) {
tempPos++;
currentPtr = sortedList.at(tempPos);
}
if ( (currentPtr != NULL) && (currentPtr->serverId == serverId) ) {
temp.setNum(currentPtr->serverId);
qWarning("moved to front, message: " + temp);
dList *itemPtr = sortedList.take(tempPos);
sortedList.insert(currentPos, itemPtr);
}
}
//only works if mail is not already in download
bool MailList::remove(int serverId, uint /*size*/)
{
dList *currentPtr;
uint tempPos;
QString temp;
tempPos = currentPos;
if ( tempPos >=sortedList.count() )
return FALSE;
currentPtr = sortedList.at(tempPos);
while ( ((tempPos + 1) < sortedList.count()) && ( currentPtr->serverId != serverId) ) {
tempPos++;
currentPtr = sortedList.at(tempPos);
}
if ( (currentPtr != NULL) && (currentPtr->serverId == serverId) ) {
temp.setNum(currentPtr->serverId);
qWarning("deleted message: " + temp);
sortedList.remove(tempPos);
return TRUE;
}
return FALSE;
}
void MailList::insert(int /*pos*/, int /*serverId*/, uint/* size*/)
{
// sortedList.insert(pos, mPtr);
}
|
