Skip to content

Commit 2dae36a

Browse files
authored
fix/Update and rename simple_list.pas to simple_queue.pas
1 parent 4cd89f7 commit 2dae36a

1 file changed

Lines changed: 21 additions & 21 deletions

File tree

simple_list.pas renamed to simple_queue.pas

Lines changed: 21 additions & 21 deletions
Original file line numberDiff line numberDiff line change
@@ -1,43 +1,43 @@
1-
Program simple_list;
1+
Program simple_queue;
22
uses crt;
33

44
var pointer:byte;
5-
var list:array[1..5] of integer;
5+
var queue:array[1..5] of integer;
66
var input:integer;
77

8-
procedure include(list:array of integer; pointer:integer; full:boolean);
8+
procedure include(queue:array of integer; pointer:integer; full:boolean);
99
var num:integer;
1010
begin
1111
if (full = false) then
1212
begin
1313
write('number: ');
1414
readln(num);
1515

16-
list[pointer] := num;
16+
queue[pointer] := num;
1717
pointer := pointer + 1;
1818

1919
ClrScr;
20-
writeln(num, ' added to the list');
20+
writeln(num, ' added to the queue');
2121
end
2222
else
2323
begin
2424
ClrScr;
25-
writeln('list full');
25+
writeln('queue full');
2626
end
2727
end;
2828

29-
procedure remove(list:array of integer; pointer:integer; empty:boolean);
29+
procedure remove(queue:array of integer; pointer:integer; empty:boolean);
3030
var i:integer;
3131
begin
3232
i := 1;
3333
if (empty = false) then
3434
begin
3535
ClrScr;
36-
writeln(list[1], ' removed');
36+
writeln(queue[1], ' removed');
3737

3838
while i < 5 do
3939
begin
40-
list[i] := list[i + 1];
40+
queue[i] := queue[i + 1];
4141
i := i + 1;
4242
end;
4343

@@ -46,25 +46,25 @@ procedure remove(list:array of integer; pointer:integer; empty:boolean);
4646
else
4747
begin
4848
ClrScr;
49-
writeln('empty list');
49+
writeln('empty queue');
5050
end
5151
end;
5252

53-
procedure consult(list:array of integer; empty:boolean);
53+
procedure consult(queue:array of integer; empty:boolean);
5454
begin
5555
if (empty = false) then
5656
begin
5757
ClrScr;
58-
writeln(list[1]);
58+
writeln(queue[1]);
5959
end
6060
else
6161
begin
6262
ClrScr;
63-
writeln('empty list');
63+
writeln('empty queue');
6464
end
6565
end;
6666

67-
procedure _write(list:array of integer; pointer:integer);
67+
procedure _write(queue:array of integer; pointer:integer);
6868
var i:integer;
6969
begin
7070
i := 1;
@@ -73,14 +73,14 @@ procedure _write(list:array of integer; pointer:integer);
7373

7474
while i < pointer do
7575
begin
76-
write(list[i], '|');
76+
write(queue[i], '|');
7777
i := i + 1;
7878
end
7979
end;
8080

81-
function full(list:array of integer; pointer:integer):boolean;
81+
function full(queue:array of integer; pointer:integer):boolean;
8282
begin
83-
if (pointer > length(list)) then
83+
if (pointer > length(queue)) then
8484
begin
8585
full := true;
8686
end
@@ -116,10 +116,10 @@ procedure menu();
116116
readln(input);
117117

118118
case input of
119-
1: include(list; pointer; full(list; pointer));
120-
2: remove(list; pointer; empty(pointer));
121-
3: consult(list; empty(pointer));
122-
4: _write(list; pointer);
119+
1: include(queue; pointer; full(queue; pointer));
120+
2: remove(queue; pointer; empty(pointer));
121+
3: consult(queue; empty(pointer));
122+
4: _write(queue; pointer);
123123
end;
124124

125125
if (input = 0) then

0 commit comments

Comments
 (0)