Referencerecord - Revision history

Polas: 6 revisions imported

2019-04-15T15:44:39Z

6 revisions imported

Polas at 14:25, 15 April 2013

2013-04-15T14:25:56Z

Polas at 18:24, 13 January 2013

2013-01-13T18:24:44Z

Polas at 17:54, 12 January 2013

2013-01-12T17:54:42Z

Polas at 17:46, 12 January 2013

2013-01-12T17:46:22Z

Polas: /* Example */

2010-01-10T21:35:03Z

‎Example

Polas: Created page with '== Syntax == referencerecord[name₁, type₁,name₂,type₂,...,name_d,type_d] == Semantics == The record type ma…'

2010-01-10T21:34:47Z

Created page with '== Syntax == referencerecord[name1, type1,name2,type2,...,named,typed] == Semantics == The record type ma…'

New page

== Syntax ==

referencerecord[name1, type1,name2,type2,...,named,typed]

== Semantics ==

The [[record]] type may NOT refer to itself (or other records) where as reference records support this, allowing the programmer to create data structures such as linked lists and trees. There are some added complexities of reference records, such as communicating them (all links and linking nodes will be communicated with the record) and freeing the data (garbage collection.) This results in a slight performance hit and is the reason why the record concept has been split into two types.

== Example ==

var node:referencerecord["prev",node,"Int",data,"next",node];
var head:node;
head:=null;
var i;
for i from 0 to 9
{
var newnode:node;
newnode.data:=i;
newnode.next:=head;
if (head!=null) head.prev:=newnode;
head:=newnode;
};

while (head != null)
{
print[head.data,"\n"];
head:=head.next;
};

In this code example a doubly linked list is created, and then its contents read node by node.

@@ Line 38: / Line 38: @@
 In this code example a doubly linked list is created, and then its contents read node by node.
 [[Category:Type Library]]
 [[Category:Compound Types]]
 [[Category:Composition Types]]

@@ Line 40: / Line 40: @@
 [[Category:Type Library]]
-[[Category:Composite Types]]
+[[Category:Compound Types]]
 [[Category:Composition Types]]

← Older revision	Revision as of 15:44, 15 April 2019
(No difference)

@@ Line 21: / Line 21: @@
   typevar node;
   node::=referencerecord["prev",node,"Int",data,"next",node];
-  var head:node;
+  function void main() {
- head:=null;
+   var head:node;
- var i;
+    head:=null;
- for i from 0 to 9 {
+    var i;
-    var newnode:node;
+    for i from 0 to 9 {
-    newnode.data:=i;
+       var newnode:node;
-    newnode.next:=head;
+       newnode.data:=i;
-    if (head!=null) head.prev:=newnode;
+       newnode.next:=head;
-    head:=newnode;
+       if (head!=null) head.prev:=newnode;
- };
+       head:=newnode;
- while (head != null) {
+    while (head != null) {
-    print(itostring(head.data)+"\n");
+       print(itostring(head.data)+"\n");
-    head:=head.next;
+       head:=head.next;
   };