demo_pascal_2lists.htm

来自「Delphi脚本控件」· HTM 代码 · 共 138 行

HTM
138 行
字号 
<html>
<head>
<link rel=stylesheet type="text/css" href="styles.css">
</head>

<body>

<h3>
LISPPA: Two Way Linked lists (paxPascal).
</h3>
<hr>

<blockquote>
<pre>
<font color="blue"><b>program</b></font> Demo;

<font color="blue"><b>function</b></font> Insert(Value, P: Variant): Variant;
<font color="blue"><b>begin</b></font>
  result := [Value, P];
  <font color="blue"><b>if</b></font> P <> <font color="blue"><b>null</b></font> <font color="blue"><b>then</b></font>
    P.Owner := result;
  P := result;
<font color="blue"><b>end</b></font>;

<font color="blue"><b>function</b></font> Add(Value, P: Variant): Variant;
<font color="blue"><b>begin</b></font>
  <font color="blue"><b>if</b></font> P = <font color="blue"><b>null</b></font> <font color="blue"><b>then</b></font>
    result := Insert(Value, P)
  <font color="blue"><b>else</b></font>
  <font color="blue"><b>begin</b></font>
    result := Insert(Value, @ P[1]);
    result.Owner := P;
  <font color="blue"><b>end</b></font>;
<font color="blue"><b>end</b></font>;

<font color="blue"><b>function</b></font> Remove(Value, L: Variant): Variant;
<font color="blue"><b>var</b></font>
  temp: Variant;
<font color="blue"><b>begin</b></font>
  result := @ Find(Value, L);
  <font color="blue"><b>if</b></font> result <> <font color="blue"><b>null</b></font> <font color="blue"><b>then</b></font>
  <font color="blue"><b>begin</b></font>
    temp := result.Owner;
    <font color="blue"><b>reduced</b></font> result := result[1];
    <font color="blue"><b>if</b></font> result <> <font color="blue"><b>null</b></font> <font color="blue"><b>then</b></font>
      result.Owner := temp;
  <font color="blue"><b>end</b></font>;
<font color="blue"><b>end</b></font>;

<font color="blue"><b>function</b></font> Find(Key, P: Variant): Variant;
<font color="blue"><b>begin</b></font>
  result := @ P;
  <font color="blue"><b>while</b></font> result <> <font color="blue"><b>null</b></font> <font color="blue"><b>do</b></font>
  <font color="blue"><b>begin</b></font>
    <font color="blue"><b>if</b></font> result[0] = Key <font color="blue"><b>then</b></font>
      <font color="blue"><b>Exit</b></font>;
    result := @ result[1];
  <font color="blue"><b>end</b></font>;
  result := <font color="blue"><b>null</b></font>;
<font color="blue"><b>end</b></font>;

<font color="blue"><b>procedure</b></font> StraightOrder(A: Variant);
<font color="blue"><b>var</b></font>
  P: Variant;
<font color="blue"><b>begin</b></font>
  P := A;
  <font color="blue"><b>while</b></font> P <> <font color="blue"><b>null</b></font> <font color="blue"><b>do</b></font>
  <font color="blue"><b>begin</b></font>
    writeln(P[0]);
    P := P[1];
  <font color="blue"><b>end</b></font>;
<font color="blue"><b>end</b></font>;

<font color="blue"><b>procedure</b></font> BackOrder(A: Variant);
<font color="blue"><b>var</b></font>
  P: Variant;
<font color="blue"><b>begin</b></font>
  <font color="blue"><b>if</b></font> A = <font color="blue"><b>null</b></font> <font color="blue"><b>then</b></font>
    writeln(A)
  <font color="blue"><b>else</b></font>
  <font color="blue"><b>begin</b></font>
    P := A;
    <font color="blue"><b>while</b></font> P[1] <> <font color="blue"><b>null</b></font> <font color="blue"><b>do</b></font> P := P[1];
    <font color="blue"><b>while</b></font> P <> <font color="blue"><b>null</b></font> <font color="blue"><b>do</b></font>
    <font color="blue"><b>begin</b></font>
      <font color="blue"><b>println</b></font> P[0];
      P := P.Owner;
    <font color="blue"><b>end</b></font>;
  <font color="blue"><b>end</b></font>;
<font color="blue"><b>end</b></font>;

<font color="blue"><b>var</b></font>
  A, P: Variant;
<font color="blue"><b>begin</b></font>
  A := <font color="blue"><b>null</b></font>;

  Add(300, @ A);

  Insert(100, @ A);
  Insert(50, @ A);
  writeln(A);
  BackOrder(A);

  P := Find(300, A);
  Add(400, @ P);
  writeln(A);
  BackOrder(A);

  P := Find(300, A);
  Add(350, @ P);
  writeln(A);
  BackOrder(A);

  P := Find(100, A);
  Add(150, @ P);
  writeln(A);
  BackOrder(A);

  Remove(100, A);
  writeln(A);
  BackOrder(A);

  writeln(A);
  StraightOrder(A);
<font color="blue"><b>end</b></font>.
</pre>
</blockquote>

<p>
<HR>
<font size = 1 color ="gray">
Copyright &copy; 1999-2005
VIRT Laboratory. All rights reserved.
</font>
</body>
</html>

demo_pascal_2lists.htm - 源码说明

本页面展示了「Delphi脚本控件」中的 demo_pascal_2lists.htm 源码文件，采用 HTM 编程语言编写，共 138 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫下载站收录了大量与Delphi相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?