blob: 0ad9367be39470dec7d9bac86a30a9e439dc2325 (
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
|
/* simple hash table for kmail. inspired by TQDict */
/* Author: Ronen Tzur <rtzur@shani.net> */
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include "kmdict.h"
#include "kmglobal.h"
#include <kdebug.h>
#include <string.h>
//-----------------------------------------------------------------------------
KMDict::KMDict( int size )
{
init( ( int ) KMail::nextPrime( size ) );
//kdDebug( 5006 ) << "KMMDict::KMDict Size: " << mSize << endl;
}
//-----------------------------------------------------------------------------
KMDict::~KMDict()
{
clear();
}
//-----------------------------------------------------------------------------
void KMDict::init(int size)
{
mSize = size;
mVecs = new KMDictItem *[mSize];
memset(mVecs, 0, mSize * sizeof(KMDictItem *));
}
//-----------------------------------------------------------------------------
void KMDict::clear()
{
if (!mVecs)
return;
for (int i = 0; i < mSize; i++) {
KMDictItem *item = mVecs[i];
while (item) {
KMDictItem *nextItem = item->next;
delete item;
item = nextItem;
}
}
delete [] mVecs;
mVecs = 0;
}
//-----------------------------------------------------------------------------
void KMDict::replace( long key, KMDictItem *item )
{
insert( key, item );
removeFollowing( item, key ); // remove other items with same key
}
//-----------------------------------------------------------------------------
void KMDict::insert( long key, KMDictItem *item )
{
item->key = key;
int idx = (unsigned long)key % mSize; // insert in
item->next = mVecs[idx]; // appropriate
mVecs[idx] = item; // column
}
//-----------------------------------------------------------------------------
void KMDict::remove(long key)
{
int idx = (unsigned long)key % mSize;
KMDictItem *item = mVecs[idx];
if (item) {
if (item->key == key) { // if first in the column
mVecs[idx] = item->next;
delete item;
} else
removeFollowing(item, key); // if deep in the column
}
}
//-----------------------------------------------------------------------------
void KMDict::removeFollowing(KMDictItem *item, long key)
{
while (item) {
KMDictItem *itemNext = item->next;
if (itemNext && itemNext->key == key) {
KMDictItem *itemNextNext = itemNext->next;
delete itemNext;
item->next = itemNextNext;
} else
item = itemNext;
}
}
//-----------------------------------------------------------------------------
KMDictItem *KMDict::find(long key)
{
int idx = (unsigned long)key % mSize;
KMDictItem *item = mVecs[idx];
while (item) {
if (item->key == key)
break;
item = item->next;
}
return item;
}
|
