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
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
|
/**************************************************************/
/* ********************************************************** */
/* * * */
/* * GLOBAL SYSTEM VECTOR * */
/* * * */
/* * $Module: VECTOR * */
/* * * */
/* * Copyright (C) 1996, 1998, 1999, 2000, 2001 * */
/* * MPI fuer Informatik * */
/* * * */
/* * 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 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, write * */
/* * to the Free Software Foundation, Inc., 59 Temple * */
/* * Place, Suite 330, Boston, MA 02111-1307 USA * */
/* * * */
/* * * */
/* $Revision: 21527 $ * */
/* $State$ * */
/* $Date: 2005-04-24 21:10:28 -0700 (Sun, 24 Apr 2005) $ * */
/* $Author: duraid $ * */
/* * * */
/* * Contact: * */
/* * Christoph Weidenbach * */
/* * MPI fuer Informatik * */
/* * Stuhlsatzenhausweg 85 * */
/* * 66123 Saarbruecken * */
/* * Email: weidenb@mpi-sb.mpg.de * */
/* * Germany * */
/* * * */
/* ********************************************************** */
/**************************************************************/
/* $RCSfile$ */
#ifndef _VECTOR_
#define _VECTOR_
#include "misc.h"
/**************************************************************/
/* Type and Variable Definitions */
/**************************************************************/
#define vec_SIZE 10000
typedef POINTER VECTOR[vec_SIZE];
extern VECTOR vec_VECTOR;
extern int vec_MAX;
/**************************************************************/
/* Inline Functions */
/**************************************************************/
/* Stack operations */
static __inline__ void vec_Init(void)
{
vec_MAX = 0;
}
static __inline__ void vec_Push(POINTER Value)
{
#ifdef CHECK
if (vec_MAX >= vec_SIZE) {
misc_StartErrorReport();
misc_ErrorReport("\n In vec_Push: Vector Overflow.");
misc_FinishErrorReport();
}
#endif
vec_VECTOR[vec_MAX++] = Value;
}
static __inline__ POINTER vec_GetNth(NAT Index)
{
#ifdef CHECK
if (Index >= vec_SIZE || Index >= vec_MAX) {
misc_StartErrorReport();
misc_ErrorReport("\n In vec_GetNth: Illegal vector access.");
misc_FinishErrorReport();
}
#endif
return vec_VECTOR[Index];
}
static __inline__ void vec_PutNth(NAT Index, POINTER Value)
{
#ifdef CHECK
if (Index >= vec_SIZE || Index >= vec_MAX) {
misc_StartErrorReport();
misc_ErrorReport("\n In vec_PutNth: Illegal vector access.");
misc_FinishErrorReport();
}
#endif
vec_VECTOR[Index] = Value;
}
static __inline__ void vec_Pop(void)
{
--vec_MAX;
}
static __inline__ POINTER vec_PopResult(void)
{
return vec_VECTOR[--vec_MAX];
}
static __inline__ void vec_PopToN(int N)
{
vec_VECTOR[N] = vec_VECTOR[--vec_MAX];
}
static __inline__ void vec_NPop(int N)
{
vec_MAX -= N;
}
static __inline__ POINTER vec_Top(void)
{
return vec_VECTOR[vec_MAX-1];
}
static __inline__ POINTER vec_NthTop(int N)
{
return vec_VECTOR[vec_MAX-(1+N)];
}
static __inline__ void vec_RplacTop(POINTER Value)
{
vec_VECTOR[vec_MAX-1] = Value;
}
static __inline__ void vec_RplacNthTop(int N, POINTER Value)
{
vec_VECTOR[vec_MAX-(1+N)] = Value;
}
static __inline__ int vec_ActMax(void)
{
return vec_MAX;
}
static __inline__ void vec_SetMax(int Index)
{
vec_MAX = Index;
}
static __inline__ BOOL vec_IsMax(int Index)
{
return vec_MAX == Index;
}
static __inline__ BOOL vec_IsEmpty(void)
{
return vec_MAX == 0;
}
/**************************************************************/
/* Prototypes */
/**************************************************************/
void vec_Swap(int, int);
void vec_PrintSel(int, int, void(*)(POINTER));
void vec_PrintAll(void(*)(POINTER));
#endif
|
