VList: Difference between revisions

The task is to demonstrate creation of a VList and how to perform the primary operations.

 

=={{header|C}}==

#include <stdlib.h>

 

v_del(v);

return 0;

 

=={{header|C++}}==

{{trans|Go}}

#include <iostream>

#include <vector>

return 0;

}

{{out}}

<pre>

[ 6 ]

 

</pre>

 

=={{header|D}}==

{{trans|C}}

import core.stdc.stdlib: malloc, free, abort;

 

 

v.free;

{{out}}

<pre>v.length = 10

popHead: 1

popHead: 0</pre>

 

=={{header|Go}}==

 

import "fmt"

fmt.Println("show cdr releasing segment. 2 elements removed:", v)

v.printStructure()

{{out}}

<pre>

{{omit from|Openscad}}

{{omit from|Tcl|You wouldn't do such a low-level data structure directly in Tcl normally}}

 

=={{header|Kotlin}}==

{{trans|Go}}

 

class VList<T : Any?> {

println("Demonstrating cdr method again, 2 more elements removed: $v")

v.printStructure()

 

{{out}}

[4, 5]

[6]

</pre>

 

The ooRexx queue class is a vlist implementation.

Here are some examples of usage:

-- show how to use the queue class

q = .queue~of(1, 2, 3, 4)

say q[1] q[2] q[4]

 

{{out}}

<pre>

</pre>

 

{{trans|Go}}

{{trans|Kotlin}}

 

subset vEle of Any; # or Str

}

 

has Int $.offset is rw is default(0) ;

 

method Index(Int $i is copy --> vEle) { # method to locate the kth element

if $i ≥ 0 {

}

}

 

method cons(vEle \a --> vList) { # method to add an element to the front

self.base.ele.push: a ;

return self;

}

return self

}

method cdr(--> vList) {

die "cdr on empty vList" unless self.base.defined;

}

 

 

method gist { # (mis)used to create output similar to Go/Kotlin

}

 

$v := $v.cdr.cdr;

say "show cdr releasing segment. 2 elements removed: ", $v;

{{out}}

<pre>zero value for type. empty vList: []

[6]

</pre>

 

=={{header|REXX}}==

║ used. I.E.: 63.01 63.5 63.63 63.9 ║

╚════════════════════════════════════════════════════════════════════╝

/*could use instead: q = 1 2 3 4 */

call q 0, 1 2 3 4 /*populate the list with values 1 ── ►4*/

if j==ni then $=$ ! /*handle the "insert". */

end /*j*/

{{out|output|text=&nbsp; when using the default input:}}

<pre>

The Scala implementation shares a common root with the Clojure implementation, but is certainly not a port of it.</blockquote>

A quote of Martin Odersky, his co-worker Phil Bagwell† invented the VList.

 

val emptyVlist1 = Vector.empty[Int]

assert(addedVlist1(3) == 10, "Wrong element accesed.")

println("Successfully completed without errors.")