begin
i := 0;
while s[i] # 0X do
- INC(i)
+ Increment(i)
end
return i
end Len;
idxs := pos - 1;
repeat
- INC(idxs);
+ Increment(idxs);
idxp := 0;
while (pattern[idxp] # 0X) & (s[idxs + idxp] = pattern[idxp]) do
- INC(idxp)
+ Increment(idxp)
end
until (pattern[idxp] = 0X) or (s[idxs + idxp] = 0X);
if (s[i] >= "a") & (s[i] <= "z") then
s[i] := AsChar(AsInt("A") + AsInt(s[i]) - AsInt("a"));
end;
- INC(i)
+ Increment(i)
end
end Cap;
{"AsInt", TREES_ORD_PROC},
{"AsReal", TREES_FLT_PROC},
{"Assert", TREES_ASSERT_PROC},
- {"DEC", TREES_DEC_PROC},
+ {"Decrement", TREES_DEC_PROC},
{"EXCL", TREES_EXCL_PROC},
{"FLOOR", TREES_FLOOR_PROC},
- {"INC", TREES_INC_PROC},
{"INCL", TREES_INCL_PROC},
+ {"Increment", TREES_INC_PROC},
{"Length", TREES_LEN_PROC},
{"New", TREES_NEW_PROC},
{"Bool", TREES_TYPE_KIND, TREES_BOOLEAN_TYPE},
{"Byte", TREES_TYPE_KIND, TREES_BYTE_TYPE},
{"Char", TREES_TYPE_KIND, TREES_CHAR_TYPE},
- {"DEC", TREES_PROCEDURE_KIND, TREES_DEC_PROC}, /* Operator */
+ {"Decrement", TREES_PROCEDURE_KIND, TREES_DEC_PROC}, /* Operator */
{"EXCL", TREES_PROCEDURE_KIND, TREES_EXCL_PROC},
{"FLOOR", TREES_PROCEDURE_KIND, TREES_FLOOR_PROC},
- {"INC", TREES_PROCEDURE_KIND, TREES_INC_PROC}, /* Operator */
{"INCL", TREES_PROCEDURE_KIND, TREES_INCL_PROC},
+ {"Increment", TREES_PROCEDURE_KIND, TREES_INC_PROC}, /* Operator */
{"Int", TREES_TYPE_KIND, TREES_INTEGER_TYPE},
{"Length", TREES_PROCEDURE_KIND, TREES_LEN_PROC},
{"New", TREES_PROCEDURE_KIND, TREES_NEW_PROC},
{"AsInt", TREES_ORD_PROC},
{"AsReal", TREES_FLT_PROC},
{"Assert", TREES_ASSERT_PROC},
- {"DEC", TREES_DEC_PROC},
+ {"Decrement", TREES_DEC_PROC},
{"EXCL", TREES_EXCL_PROC},
{"FLOOR", TREES_FLOOR_PROC},
- {"INC", TREES_INC_PROC},
{"INCL", TREES_INCL_PROC},
+ {"Increment", TREES_INC_PROC},
{"Length", TREES_LEN_PROC},
{"New", TREES_NEW_PROC},
procedure IncReturnZero(var x: Int): Int;
begin
- INC(x)
+ Increment(x)
return 0
end IncReturnZero;
procedure IncReturnEmpty(var x: Int): Set;
begin
- INC(x)
+ Increment(x)
return {}
end IncReturnEmpty;
v: pointer to record f: Int end;
begin
n := 0;
- INC(n);
+ Increment(n);
Assert(n = 1);
n := 0;
- INC(n, 10);
+ Increment(n, 10);
Assert(n = 10);
n := 0;
- DEC(n);
+ Decrement(n);
Assert(n = -1);
n := 0;
- DEC(n, 10);
+ Decrement(n, 10);
Assert(n = -10);
A := {};
n:= 0;
i := 1;
repeat
- INC(n);
- INC(i)
+ Increment(n);
+ Increment(i)
until i = 11;
Assert(n = 10);
end TestRepeatStatements;
procedure IncGlobalIntegerReturnOne(): Int;
begin
- INC(globalInteger)
+ Increment(globalInteger)
return 1
end IncGlobalIntegerReturnOne;
for i := 0 to Length(M) - 1 do
for j := 0 to Length(M[0]) - 1 do
Assert(M[i, j] = c);
- INC(c)
+ Increment(c)
end
end;
end Inner;
c := Length(row);
for j := 0 to Length(row) - 1 do
Assert(row[j] = c);
- INC(c)
+ Increment(c)
end
end Inner1;
for j := 0 to Length(T[0]) - 1 do
for k := 0 to Length(T[0, 0]) - 1 do
Assert(T[i, j, k] = c);
- INC(c)
+ Increment(c)
end
end
end;
for i := 0 to Length(M) - 1 do
for j := 0 to Length(M[0]) - 1 do
M[i, j] := c;
- INC(c)
+ Increment(c)
end
end;
Q(M);
for j := 0 to Length(T[0]) - 1 do
for k := 0 to Length(T[0, 0]) - 1 do
T[i, j, k] := c;
- INC(c)
+ Increment(c)
end
end
end;