-
Notifications
You must be signed in to change notification settings - Fork 2
/
nodedictionary.cpp
executable file
·100 lines (83 loc) · 3.08 KB
/
nodedictionary.cpp
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
/*
Copyright (C) 2010 Matthew Baranowski, Sander van Rossen & Raven software.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "ndictionary.h"
#include <iostream>
using namespace std;
void NodeDictionaryInfo::insert( Object element, Object key )
{
NodeLocator nL = new NodeLocatorInfo( this, element, key );
insertLast( nL );
};
Object NodeDictionaryInfo::insertReplace( Object element, Object key )
{
Object toReturn;
NodeLocator nL;
for (nL = (NodeLocator)first(); nL != NULL; nL = (NodeLocator)after(nL))
{
if (m_keyComp->equal( nL->key(), key )) {
toReturn = nL->element();
nL->setElement( element );
return toReturn;
}
}
// found nothing so append
nL = new NodeLocatorInfo( this, element, key );
insertLast( nL );
return NULL;
};
Object NodeDictionaryInfo::find(Object key)
{
for (NodeLocator nL = (NodeLocator)first(); nL != NULL; nL = (NodeLocator)after(nL))
{
if (m_keyComp->equal( nL->key(), key )) {
return nL->element();
}
}
return NULL; // found nothing
}
Object NodeDictionaryInfo::remove( Object key )
{
for (NodeLocator nL = (NodeLocator)first(); nL != NULL; nL = (NodeLocator)after(nL))
{
if (m_keyComp->equal( nL->key(), key )) {
return remove( nL );
}
}
return NULL; // found nothing
}
Object NodeDictionaryInfo::replace( Object element, Object key )
{
Object toReturn;
for (NodeLocator nL = (NodeLocator)first(); nL != NULL; nL = (NodeLocator)after(nL))
{
if (m_keyComp->equal( nL->key(), key )) {
toReturn = nL->element();
nL->setElement( element );
return toReturn;
}
}
return NULL; // found nothing
}
void NodeDictionaryInfo::dumpDictionary()
{
cout << "Dictionary Dump, size " << size() << endl;
for (NodeLocator nL = (NodeLocator)first(); nL != NULL; nL = (NodeLocator)after(nL))
{
cout << " Position " << nL;
cout << " next " << nL->getNextNode();
cout << " prev " << nL->getPrevNode();
cout << " element " << nL->element();
cout << " key " << (char *)nL->key() << endl;
}
}