demo_c_lists.htm

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

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

<body>

<h3>
LISPPA: Linked lists (paxC).
</h3>
<hr>

<blockquote>
<pre>
<font color="blue"><b>variant</b></font> L, P;
<font color="blue"><b>int</b></font> I;

<font color="blue"><b>println</b></font> <font color="Red">'Create a list'</font>;
L = [100, [200, [300, <font color="blue"><b>NULL</b></font>]]];
<font color="blue"><b>println</b></font> L;

<font color="blue"><b>println</b></font> <font color="Red">'Insert new item at the beginning'</font>;
L = [50, L];
<font color="blue"><b>println</b></font> L;

<font color="blue"><b>println</b></font> <font color="Red">'Add new item at the end'</font>;
P = & L; // Create alias of L
<font color="blue"><b>while</b></font> (P != <font color="blue"><b>NULL</b></font>) {P = & P[1]; }; // Find last item
P = [400, <font color="blue"><b>NULL</b></font>]; // Add <font color="blue"><b>new</b></font> item
<font color="blue"><b>println</b></font> L;

<font color="blue"><b>println</b></font> <font color="Red">'Insert new item at the middle'</font>;
P = & L[1];
P = & P[1]; // insert before 200
P = [150, P];
<font color="blue"><b>println</b></font> L;

<font color="blue"><b>println</b></font> <font color="Red">'Print list'</font>;
P = & L; // create alias of L
<font color="blue"><b>while</b></font> (P != <font color="blue"><b>NULL</b></font>) {
  <font color="blue"><b>println</b></font> P[0];
  P = & P[1]; // go to the next item
}

<font color="blue"><b>println</b></font> <font color="Red">'Delete the first item of the list'</font>;
<font color="blue"><b>reduced</b></font> L = L[1];
<font color="blue"><b>println</b></font> L;

<font color="blue"><b>println</b></font> <font color="Red">'Delete the last item of the list'</font>;
P = & L; // Create alias of L
<font color="blue"><b>while</b></font> (P[1] != <font color="blue"><b>NULL</b></font>) { P = & P[1]; }// Find last item
<font color="blue"><b>reduced</b></font> P = P[1];
<font color="blue"><b>println</b></font> L;

<font color="blue"><b>println</b></font> <font color="Red">'Delete item at the middle of the list'</font>;
P = & L;
P = & P[1];
<font color="blue"><b>reduced</b></font> P = P[1];
<font color="blue"><b>println</b></font> L;

<font color="blue"><b>println</b></font> <font color="Red">'Delete all items from the list'</font>;
<font color="blue"><b>while</b></font> (L != <font color="blue"><b>NULL</b></font>) { <font color="blue"><b>reduced</b></font> L = L[1]; };
<font color="blue"><b>println</b></font> L;

<font color="blue"><b>println</b></font> <font color="Red">'Create a cycled list'</font>;
L = [100, [200, [300, <font color="blue"><b>NULL</b></font>]]];
L[1][1][1] = & L; // join head and tail of the list
<font color="blue"><b>println</b></font> L;

<font color="blue"><b>delete</b></font> L;

<font color="blue"><b>println</b></font> <font color="Red">'Another way to create a cycled list'</font>;
L = [100, [200, [300, <font color="blue"><b>NULL</b></font>]]];
P = & L; // Create alias of L
<font color="blue"><b>while</b></font> (P != <font color="blue"><b>NULL</b></font>) {P = & P[1]; }; // Find last item
* P = & L; // join head and tail of the list
<font color="blue"><b>println</b></font> L;

<font color="blue"><b>println</b></font> <font color="Red">'Print the cycled list'</font>;
P = & L;
I = 0;
<font color="blue"><b>do</b></font> {
  <font color="blue"><b>println</b></font> P[0];
  P = & P[1];
  I++;
}
<font color="blue"><b>while</b></font> (I < 15);
</pre>
</blockquote>

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

demo_c_lists.htm - 源码说明

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

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

⌨️ 快捷键说明

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