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
132
133
134
135
136
137
138
139
140
141
|
/*-------------------------------------------------------------------------
Compiler Generator Coco/R,
Copyright (c) 1990, 2004 Hanspeter Moessenboeck, University of Linz
extended by M. Loeberbauer & A. Woess, Univ. of Linz
ported to C++ by Csaba Balazs, University of Szeged
with improvements by Pat Terry, Rhodes University
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 2, 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, write to the Free Software Foundation, Inc.,
59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
As an exception, it is allowed to write an extension of Coco/R that is
used as a plugin in non-free software.
If not otherwise stated, any source code generated by Coco/R (other than
Coco/R itself) does not fall under the GNU General Public License.
-------------------------------------------------------------------------*/
#include <stdio.h>
#include "SortedList.h"
#include "Tab.h"
namespace Coco {
int Compare(Symbol *x, Symbol *y) {
return coco_string_compareto(x->name, y->name);
}
SortedEntry::SortedEntry(Symbol* Key, void* Value) {
this->Key = Key;
this->Value = Value;
this->next = NULL;
}
SortedEntry::~SortedEntry() {
};
SortedList::SortedList() {
Count = 0;
Data = NULL;
}
SortedList::~SortedList() {
}
bool SortedList::Find(Symbol* key) {
SortedEntry* pSortedEntry = Data;
while (pSortedEntry) {
if (!Compare(pSortedEntry->Key, key))
return true;
pSortedEntry = pSortedEntry->next;
}
return false;
}
void SortedList::Set(Symbol *key, void *value) {
if (!Find(key)) {
// new entry
SortedEntry* pSortedEntry = Data;
SortedEntry* pSortedEntryPrev = NULL;
SortedEntry* newSortedEntry = new SortedEntry(key, value);
if (pSortedEntry) {
// insert
if (Compare(pSortedEntry->Key, key) > 0) { // before the first
newSortedEntry->next = Data;
Data = newSortedEntry;
} else {
while (pSortedEntry) {
if (Compare(pSortedEntry->Key, key) < 0) {
pSortedEntryPrev = pSortedEntry;
pSortedEntry = pSortedEntry->next;
} else {
break;
}
}
pSortedEntryPrev->next = newSortedEntry;
newSortedEntry->next = pSortedEntry;
}
} else {
Data = newSortedEntry; // first entry
}
Count++;
} else {
// exist entry - overwrite
SortedEntry* pSortedEntry = Data;
while (Compare(pSortedEntry->Key, key)) {
pSortedEntry = pSortedEntry->next;
}
pSortedEntry->Value = value;
}
}
void* SortedList::Get( Symbol* key ) const // Value
{
SortedEntry* pSortedEntry = Data;
while (pSortedEntry) {
if (!Compare(pSortedEntry->Key, key))
return pSortedEntry->Value;
pSortedEntry = pSortedEntry->next;
}
return NULL;
}
void* SortedList::GetKey( int index ) const // Key
{
if (0 <= index && index < Count) {
SortedEntry* pSortedEntry = Data;
for (int i=0; i<index; i++) {
pSortedEntry = pSortedEntry->next;
}
return pSortedEntry->Key;
} else {
return NULL;
}
}
SortedEntry* SortedList::operator[]( int index ) const {
if (0 <= index && index < Count) {
SortedEntry* pSortedEntry = Data;
for (int i=0; i<index; i++) {
pSortedEntry = pSortedEntry->next;
}
return pSortedEntry;
} else {
return NULL;
}
}
}; // namespace
|
