This repository was archived by the owner on Sep 3, 2019. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTDALISTA.pas
More file actions
205 lines (182 loc) · 4.61 KB
/
Copy pathTDALISTA.pas
File metadata and controls
205 lines (182 loc) · 4.61 KB
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
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
{SHELLBEGO - BRACCO ESCALANTE GARCIA OBELAR
SHELLBEGO is Copyright (C) 2014-2015 Free Software Foundation, Inc.
SHELLBEGO es un intérprete primitivo de lenguajes de comandos que ejecuta órdenes leídas de la entrada estándar.
SHELLBEGO fue desarrollada como trabajo final de la materia Sistemas Operativos FRCU - UTN.
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/>.
Also add information on how to contact you by electronic and paper mail.}
UNIT TDALISTA;
INTERFACE
TYPE
TDATOS = STRING;
TPUNTEROL=^TNODOL;
TNODOL=RECORD
INFO:TDATOS;
SIG:TPUNTEROL;
END;
TLISTA=RECORD
CAB,AUX:TPUNTEROL;
TAM:CARDINAL;
END;
PROCEDURE CrearLista(VAR L:TLISTA;NOMBRE:STRING);
PROCEDURE CerrarLista(VAR L:TLISTA;NOMBRE:STRING);
FUNCTION Tamano(VAR L:TLISTA):CARDINAL;
FUNCTION Info(VAR L:TLISTA):TDATOS;
PROCEDURE Primero(VAR L:TLISTA);
PROCEDURE Siguiente(VAR L:TLISTA);
FUNCTION Fin(VAR L:TLISTA):BOOLEAN;
PROCEDURE Modif(VAR L:TLISTA;X:TDATOS);
PROCEDURE InsertarIPos(VAR L:TLISTA;X:TDATOS;POS:INTEGER);
PROCEDURE EliminarIPos(VAR L:TLISTA;VAR X:TDATOS;POS:INTEGER);
PROCEDURE EliminarUltimo(VAR L:TLISTA;VAR X:TDATOS);
PROCEDURE InsertarUltimo(VAR L:TLISTA;X:TDATOS);
FUNCTION NodoFinal(L:TLISTA):BOOLEAN;
PROCEDURE ConcatenarListas(VAR L:TLISTA;S:TLISTA);
FUNCTION ListaAString(L:TLISTA):STRING;
IMPLEMENTATION
USES CRT,SYSUTILS;
PROCEDURE CrearLista(VAR L:TLISTA;NOMBRE:STRING);
BEGIN
L.CAB:=NIL;
L.AUX:=NIL;
L.TAM:=0;
END;
PROCEDURE CerrarLista(VAR L:TLISTA;NOMBRE:STRING);
VAR
AUX,ELIM:TPUNTEROL;
BEGIN
AUX:=L.CAB;
WHILE(AUX<>NIL)DO
BEGIN
ELIM:=AUX;
AUX:=AUX^.SIG;
DISPOSE(ELIM)
END
END;
FUNCTION Tamano(VAR L:TLISTA):CARDINAL;
BEGIN
Tamano:=L.TAM;
END;
FUNCTION Info(VAR L:TLISTA):TDATOS;
BEGIN
Info:=L.AUX^.INFO;
END;
PROCEDURE Primero(VAR L:TLISTA);
BEGIN
L.AUX:=L.CAB;
END;
PROCEDURE Siguiente(VAR L:TLISTA);
BEGIN
L.AUX:=L.AUX^.SIG;
END;
FUNCTION Fin(VAR L:TLISTA):BOOLEAN;
BEGIN
Fin:=L.AUX=NIL;
END;
PROCEDURE Modif(VAR L:TLISTA;X:TDATOS);
BEGIN
L.AUX^.INFO:=X;
END;
PROCEDURE InsertarIPos(VAR L:TLISTA;X:TDATOS;POS:INTEGER);
VAR
AUX:TPUNTEROL;
ANT,ACT:TPUNTEROL;
BEGIN
NEW(AUX);
INC(L.TAM);
AUX^.INFO:=X;
IF (L.CAB=NIL)OR (POS = 1) THEN
BEGIN
AUX^.SIG:=L.CAB;
L.CAB:=AUX;
END
ELSE
BEGIN
ANT:=L.CAB;
ACT:=L.CAB^.SIG;
WHILE (ACT<>NIL) AND (POS>1)DO
BEGIN
ANT:=ACT;
ACT:=ACT^.SIG;
DEC(POS);
END;
AUX^.SIG:=ACT;
ANT^.SIG:=AUX;
END;
END;
PROCEDURE EliminarIPos(VAR L:TLISTA;VAR X:TDATOS;POS:INTEGER);
VAR
AUX,AUX1:TPUNTEROL;
BEGIN
IF (L.CAB<>NIL)AND(POS = 1) THEN
BEGIN
AUX:=L.CAB;
DEC(L.TAM);
X:=AUX^.INFO;
L.CAB:=L.CAB^.SIG;
DISPOSE(AUX);
END
ELSE
BEGIN
IF(L.CAB<>NIL)THEN
BEGIN
AUX:=L.CAB;
AUX1:=AUX^.SIG;
WHILE (AUX1<>NIL) AND (POS>2)DO
BEGIN
AUX := AUX^.SIG;
AUX1 := AUX^.SIG;
DEC(POS);
END;
IF(POS=2)THEN
BEGIN
DEC(L.TAM);
AUX^.SIG:= AUX1^.SIG;
X:=AUX1^.INFO;
DISPOSE(AUX1);
END;
END;
END;
END;
PROCEDURE InsertarUltimo(VAR L:TLISTA;X:TDATOS);
BEGIN
InsertarIPos(L,X,TAMANO(L)+1);
END;
PROCEDURE EliminarUltimo(VAR L:TLISTA;VAR X:TDATOS);
BEGIN
EliminarIPos(L,X,TAMANO(L))
END;
FUNCTION NodoFinal(L:TLISTA):BOOLEAN;
BEGIN
NodoFinal:=L.AUX^.SIG=NIL;
END;
PROCEDURE ConcatenarListas(VAR L:TLISTA;S:TLISTA);
BEGIN
WHILE NOT FIN(S) DO
BEGIN
InsertarUltimo(L,INFO(S));
Siguiente(S);
END;
END;
FUNCTION ListaAString(L:TLISTA):STRING;
VAR
CAD:STRING;
BEGIN
CAD:='';
PRIMERO(L);
WHILE NOT FIN(L) DO
BEGIN
CAD:=CAD+' '+INFO(L);
SIGUIENTE(L);
END;
ListaAString:=CAD;
END;
END.