This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
PROCEDURE DefaultTrapViewer; | |
VAR len, ref, end, x, a, b, c: INTEGER; mod: Module; | |
name: Name; out: ARRAY 1024 OF SHORTCHAR; | |
PROCEDURE WriteString (s: ARRAY OF SHORTCHAR); | |
VAR i: INTEGER; | |
BEGIN | |
i := 0; | |
WHILE (len < LEN(out) - 1) & (s[i] # 0X) DO out[len] := s[i]; INC(i); INC(len) END | |
END WriteString; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Элементарная логика подсказывает, что увлечению широких масс "прогрессом" не так уж много лет; и оный "прогресс" отнюдь не имманентен человеческому роду, умеющему тысячелетиями поддерживать баланс со вмещающим биогеоценозом. Отмечу, что равно справедливо и обратное: механизмов защиты от "прогресса", встроенных в автоматически запускаемый алгоритм инстинктивных реакций и обеспечивающих своевременное гашение этого паразитного резонанса не существует тоже. | |
Определю понятия. Сам термин "прогресс" в приложении к рассматриваемой проблематике есть не что иное, как химера, абстракция, призванная вуалировать отсутствие за собой положительного содержания. Таким образом, дать определение возможно лишь одноименной идеологеме, . Итак: "прогресс" есть идеология, санкционирующая нелимитированное извлечение энергии, сокрытой в структуре эксплуатируемого популяцией ландшафта. И, подчеркну, высвобождаемой исключительно в процессе деградации такового, что, в свою очередь, закрывая пути возврата к нормальному, сообразному ср |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
PROCEDURE IntToString* (x: LONGINT; OUT s: ARRAY OF CHAR); | |
VAR j, k: INTEGER; ch: CHAR; a: ARRAY 32 OF CHAR; | |
BEGIN | |
IF x # MIN(LONGINT) THEN | |
IF x < 0 THEN s[0] := "-"; k := 1; x := -x ELSE k := 0 END; | |
j := 0; REPEAT a[j] := CHR(x MOD 10 + ORD("0")); x := x DIV 10; INC(j) UNTIL x = 0 | |
ELSE | |
a := minLongIntRev; s[0] := "-"; k := 1; | |
j := 0; WHILE a[j] # 0X DO INC(j) END | |
END; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
00-+0-++0-+0-+-0000000000+0 | |
0+0+00-+0-+0000000000000000 | |
00-0000000000000000000000+- | |
0+00000+0-00000000000000000 | |
00-00000000000000000000000+ | |
0+00000+0-000000000000000+0 | |
0-00000+0-00000000000000000 | |
0-0000++0-000000000000000+0 | |
00+000000000+-+00000000000+ | |
0-0000++0-00000000000000000 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{ | |
"SendTryte": { | |
"class": 1, | |
"ref": 0, | |
"form": 10, | |
"base": { | |
"ref": -9 | |
}, | |
"par": [ | |
{ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{ | |
"t0":"T", | |
"t1":"T", | |
"t2":"T", | |
"t3":"T", | |
"t4":"T", | |
"s0":"SM3", | |
"s1":"SM", | |
"s2":"SM", | |
"s3":"SM", |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<?xml version="1.0" encoding="UTF-8" standalone="yes"?> | |
<graphml edgedefault="undirected" | |
xmlns:cpt="urn:bbcb:component:dev:cpt" | |
xmlns="http://graphml.graphdrawing.org/xmlns"> | |
<graph cpt:objects="PrivDemo1"> | |
<node id="17381744" cpt:name="PrivDemo1" cpt:mode="err"/> | |
<node id="17407008" cpt:name="i" cpt:mode="variable" cpt:type="INTEGER"/> | |
<node id="17418752" cpt:name="j" cpt:mode="variable" cpt:type="INTEGER"/> | |
</graph> | |
<graph cpt:module="PrivDemo1"> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Генератор фэнтези | |
Автор этого текста нам неизвестен, но он определенно знает все о написании успешно продающихся волшебных историй. | |
В одном... | |
a. большом городе; | |
b. маленьком селе; | |
c. старом доме с привидениями. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
До: | |
PROCEDURE TravObj (obj: DevCPT.Object); | |
BEGIN | |
IF obj # NIL THEN | |
TravObj(obj.left); | |
IF (obj.mode = Var) OR (obj.mode = VarPar) THEN | |
Indent; w.WriteString("VAR "); w.WriteString(obj.name$); | |
w.WriteString(": "); DumpType(obj.typ, NIL); w.WriteLn | |
ELSIF obj.mode = Typ THEN | |
Indent; w.WriteString("TYPE "); w.WriteString(obj.name$); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
MODULE XevDemo3; | |
VAR i, j: INTEGER; | |
PROCEDURE Do(a: BYTE; VAR x: INTEGER): INTEGER; | |
BEGIN | |
x:=i+14; | |
RETURN i+34+a | |
END Do; | |
OlderNewer