all tasks

Task/Singly-linked-list-Traversal/0DESCRIPTION

@@ -0,0 +1 @@
+Traverse from the beginning of a singly-linked list to the end.

Task/Singly-linked-list-Traversal/1META.yaml

@@ -0,0 +1,4 @@
+---
+category:
+- Iteration
+note: Data Structures

Task/Singly-linked-list-Traversal/ACL2/singly-linked-list-traversal.acl2

@@ -0,0 +1,5 @@
+(defun traverse (xs)
+   (if (endp xs)
+       (cw "End.~%")
+       (prog2$ (cw "~x0~%" (first xs))
+               (traverse (rest xs)))))

Task/Singly-linked-list-Traversal/ALGOL-68/singly-linked-list-traversal.alg

@@ -0,0 +1,15 @@
+MODE STRINGLIST = STRUCT(STRING value, REF STRINGLIST next);
+
+STRINGLIST list := ("Big",
+  LOC STRINGLIST := ("fjords",
+    LOC STRINGLIST := ("vex",
+      LOC STRINGLIST := ("quick",
+        LOC STRINGLIST := ("waltz",
+          LOC STRINGLIST := ("nymph",NIL))))));
+
+REF STRINGLIST node := list;
+WHILE node ISNT REF STRINGLIST(NIL) DO
+  print((value OF node, space));
+  node := next OF node
+OD;
+print(newline)

Task/Singly-linked-list-Traversal/ActionScript/singly-linked-list-traversal.as

@@ -0,0 +1,6 @@
+var A:Node;
+//...
+for(var i:Node = A; i != null; i = i.link)
+{
+	doStuff(i);
+}

Task/Singly-linked-list-Traversal/Ada/singly-linked-list-traversal.ada

@@ -0,0 +1,18 @@
+with Ada.Containers.Doubly_Linked_Lists;
+with Ada.Text_Io; use Ada.Text_Io;
+
+procedure Traversal_Example is
+   package Int_List is new Ada.Containers.Doubly_Linked_Lists(Integer);
+   use Int_List;
+   procedure Print(Position : Cursor) is
+   begin
+      Put_Line(Integer'Image(Element(Position)));
+   end Print;
+   The_List : List;
+begin
+   for I in 1..10 loop
+      The_List.Append(I);
+   end loop;
+   -- Traverse the list, calling Print for each value
+   The_List.Iterate(Print'access);
+end traversal_example;

Task/Singly-linked-list-Traversal/AutoHotkey/singly-linked-list-traversal.ahk

@@ -0,0 +1,20 @@
+a = 1
+a_next = b
+b = 2
+b_next = c
+c = 3
+
+traverse("a")
+return
+
+traverse(element)
+{
+  MsgBox % element . "= " . %element%
+  name := element . "_next"
+  while, %name%
+  {
+  element := %name%
+  msgbox % %name% . "= " . %element%
+  name := %name% . "_next"
+  }
+}

Task/Singly-linked-list-Traversal/BBC-BASIC/singly-linked-list-traversal.bbc

@@ -0,0 +1,24 @@
+      DIM node{pNext%, iData%}
+      DIM a{} = node{}, b{} = node{}, c{} = node{}
+
+      a.pNext% = b{}
+      a.iData% = 123
+      b.iData% = 789
+      c.iData% = 456
+
+      PROCinsert(a{}, c{})
+
+      PRINT "Traverse list:"
+      pnode% = a{}
+      REPEAT
+        !(^node{}+4) = pnode%
+        PRINT node.iData%
+        pnode% = node.pNext%
+      UNTIL pnode% = 0
+
+      END
+
+      DEF PROCinsert(here{}, new{})
+      new.pNext% = here.pNext%
+      here.pNext% = new{}
+      ENDPROC

Task/Singly-linked-list-Traversal/C/singly-linked-list-traversal.c

@@ -0,0 +1,6 @@
+struct link *first;
+// ...
+struct link *iter;
+for(iter = first; iter != NULL; iter = iter->next) {
+  // access data, e.g. with iter->data
+}

Task/Singly-linked-list-Traversal/Clojure/singly-linked-list-traversal.clj

@@ -0,0 +1 @@
+(doseq [x xs] (println x)

Task/Singly-linked-list-Traversal/Common-Lisp/singly-linked-list-traversal-1.lisp

@@ -0,0 +1,2 @@
+(dolist (x list)
+  (print x))

Task/Singly-linked-list-Traversal/Common-Lisp/singly-linked-list-traversal-2.lisp

@@ -0,0 +1,3 @@
+(loop for ref = list then (rest ref)
+      until (null ref)
+      do (print (first ref)))

Task/Singly-linked-list-Traversal/D/singly-linked-list-traversal-1.d

@@ -0,0 +1,15 @@
+struct SLinkedNode(T) {
+    T data;
+    typeof(this)* next;
+}
+
+void main() {
+    import std.stdio;
+
+    alias N = SLinkedNode!int;
+    auto lh = new N(1, new N(2, new N(3, new N(4))));
+
+    for (auto p = lh; p; p = p.next)
+        write(p.data, " ");
+    writeln();
+}

Task/Singly-linked-list-Traversal/D/singly-linked-list-traversal-2.d

@@ -0,0 +1,11 @@
+import tango.io.Stdout;
+import tango.util.collection.LinkSeq;
+
+void main() {
+    auto m = new LinkSeq!(char[]);
+    m.append("alpha");
+    m.append("bravo");
+    m.append("charlie");
+    foreach (val; m)
+        Stdout(val).newline;
+}

Task/Singly-linked-list-Traversal/Delphi/singly-linked-list-traversal.delphi

@@ -0,0 +1,22 @@
+uses system ;
+
+type
+
+   // declare the list pointer type
+   plist = ^List ;
+
+   // declare the list type, a generic data pointer prev and next pointers
+   List = record
+      data : pointer ;
+      next : pList ;
+   end;
+
+// since this task is just showing the traversal I am not allocating the memory and setting up the root node etc.
+// Note the use of the carat symbol for de-referencing the pointer.
+
+begin
+
+   // beginning to end
+   while not (pList^.Next = NIL) do pList := pList^.Next ;
+
+end;

Task/Singly-linked-list-Traversal/E/singly-linked-list-traversal-1.e

@@ -0,0 +1,6 @@
+var linkedList := [1, [2, [3, [4, [5, [6, [7, null]]]]]]]
+
+while (linkedList =~ [value, next]) {
+    println(value)
+    linkedList := next
+}

Task/Singly-linked-list-Traversal/E/singly-linked-list-traversal-2.e

@@ -0,0 +1,6 @@
+var linkedList := makeLink(1, makeLink(2, makeLink(3, empty)))
+
+while (!(linkedList.null())) {
+    println(linkedList.value())
+    linkedList := linkedList.next()
+}

Task/Singly-linked-list-Traversal/Ela/singly-linked-list-traversal-1.ela

@@ -0,0 +1,2 @@
+traverse [] = []
+traverse (x::xs) = x :: traverse xs

Task/Singly-linked-list-Traversal/Ela/singly-linked-list-traversal-2.ela

@@ -0,0 +1,3 @@
+xs = [& x \\ x <- [1..1000]]//lazy list
+
+traverse xs

Task/Singly-linked-list-Traversal/Factor/singly-linked-list-traversal.factor

@@ -0,0 +1,11 @@
+: list-each ( linked-list quot: ( data -- ) -- )
+    [ [ data>> ] dip call ]
+    [ [ next>> ] dip over [ list-each ] [ 2drop ] if ] 2bi ; inline recursive
+
+SYMBOLS: A B C ;
+
+A <linked-list>
+[ C <linked-list> list-insert ] keep
+[ B <linked-list> list-insert ] keep
+
+[ . ] list-each

Task/Singly-linked-list-Traversal/Fantom/singly-linked-list-traversal.fantom

@@ -0,0 +1,7 @@
+    // traverse the linked list
+    Node? current := a
+    while (current != null)
+    {
+      echo (current.value)
+      current = current.successor
+    }

Task/Singly-linked-list-Traversal/Forth/singly-linked-list-traversal-1.fth

@@ -0,0 +1,2 @@
+: last ( list -- end )
+  begin dup @ while @ repeat ;

Task/Singly-linked-list-Traversal/Forth/singly-linked-list-traversal-2.fth

@@ -0,0 +1,4 @@
+: walk ( a xt -- )
+   >r begin ?dup while
+     dup cell+ @ r@ execute
+   @ repeat r> drop ;

Task/Singly-linked-list-Traversal/Fortran/singly-linked-list-traversal-1.f

@@ -0,0 +1,14 @@
+subroutine traversal(list,proc)
+   type(node), target    :: list
+   type(node), pointer   :: current
+   interface
+      subroutine proc(node)
+         real, intent(in) :: node
+      end subroutine proc
+   end interface
+   current => list
+   do while ( associated(current) )
+      call proc(current%data)
+      current => current%next
+   end do
+end subroutine traversal

Task/Singly-linked-list-Traversal/Fortran/singly-linked-list-traversal-2.f

@@ -0,0 +1,9 @@
+subroutine printNode(data)
+   real, intent(in)  :: data
+   write (*,*) data
+end subroutine
+
+subroutine printAll(list)
+   type(node), intent(in)  :: list
+   call traversal(list,printNode)
+end subroutine printAll

Task/Singly-linked-list-Traversal/Go/singly-linked-list-traversal.go

@@ -0,0 +1,7 @@
+start := &Ele{"tacos", nil}
+end := start.Append("burritos")
+end = end.Append("fajitas")
+end = end.Append("enchilatas")
+for iter := start; iter != nil; iter = iter.Next {
+    fmt.Println(iter)
+}

Task/Singly-linked-list-Traversal/Haskell/singly-linked-list-traversal.hs

@@ -0,0 +1,9 @@
+map (>5) [1..10] -- [False,False,False,False,False,True,True,True,True,True]
+
+map (++ "s") ["Apple", "Orange", "Mango", "Pear"] -- ["Apples","Oranges","Mangos","Pears"]
+
+foldr (+) 0 [1..10] -- prints 55
+
+traverse :: [a] -> [a]
+traverse list = map func list
+	where func a = -- ...do something with a

Task/Singly-linked-list-Traversal/Icon/singly-linked-list-traversal.icon

@@ -0,0 +1,7 @@
+procedure main ()
+  ns := Node(1, Node(2, Node (3)))
+  until /ns do { # repeat until ns is null
+    write (ns.value)
+    ns := ns.successor
+  }
+end

Task/Singly-linked-list-Traversal/J/singly-linked-list-traversal.j

@@ -0,0 +1 @@
+foo"0 {:"1 list

Task/Singly-linked-list-Traversal/Java/singly-linked-list-traversal.java

@@ -0,0 +1,6 @@
+LinkedList<Type> list = new LinkedList<Type>();
+
+for(Type i: list){
+  //each element will be in variable "i"
+  System.out.println(i);
+}

Task/Singly-linked-list-Traversal/JavaScript/singly-linked-list-traversal.js

@@ -0,0 +1,12 @@
+LinkedList.prototype.traverse = function(func) {
+    func(this);
+    if (this.next() != null)
+        this.next().traverse(func);
+}
+
+LinkedList.prototype.print = function() {
+    this.traverse( function(node) {print(node.value())} );
+}
+
+var head = createLinkedListFromArray([10,20,30,40]);
+head.print();

Task/Singly-linked-list-Traversal/Logo/singly-linked-list-traversal.logo

@@ -0,0 +1,4 @@
+to last :list
+  if empty? bf :list [output first :list]
+  output last bf :list
+end

Task/Singly-linked-list-Traversal/MATLAB/singly-linked-list-traversal-1.m

@@ -0,0 +1,4 @@
+list = 1:10;
+    for k=1:length(list)
+        printf('%i\n',list(k))	
+    end;

Task/Singly-linked-list-Traversal/MATLAB/singly-linked-list-traversal-2.m

@@ -0,0 +1 @@
+  printf('%d\n', list(:));

Task/Singly-linked-list-Traversal/Mathematica/singly-linked-list-traversal.math

@@ -0,0 +1,7 @@
+Print /@ {"rosettacode", "kitten", "sitting", "rosettacode",  "raisethysword"}
+->
+rosettacode
+kitten
+sitting
+rosettacode
+raisethysword

Task/Singly-linked-list-Traversal/OCaml/singly-linked-list-traversal.ocaml

@@ -0,0 +1,9 @@
+# let li = ["big"; "fjords"; "vex"; "quick"; "waltz"; "nymph"] in
+  List.iter print_endline li ;;
+big
+fjords
+vex
+quick
+waltz
+nymph
+- : unit = ()

Task/Singly-linked-list-Traversal/Objeck/singly-linked-list-traversal.objeck

@@ -0,0 +1,3 @@
+for(node := head; node <> Nil; node := node->GetNext();) {
+  node->GetValue()->PrintLine();
+};

Task/Singly-linked-list-Traversal/Objective-C/singly-linked-list-traversal.m

@@ -0,0 +1,6 @@
+RCListElement *current;
+for(current=first_of_the_list; current != nil; current = [current next] )
+{
+  // to get the "datum":
+  // id dat_obj = [current datum];
+}

Task/Singly-linked-list-Traversal/Perl-6/singly-linked-list-traversal-1.pl6

@@ -0,0 +1,5 @@
+my $list = 1 => 2 => 3 => 4 => 5 => 6 => Mu;
+
+loop (my $l = $list; $l; $l = $l.value) {
+    say $l.key;
+}

Task/Singly-linked-list-Traversal/Perl-6/singly-linked-list-traversal-2.pl6

@@ -0,0 +1,11 @@
+use MONKEY_TYPING;
+augment class Pair {
+    method traverse () {
+        gather loop (my $l = self; $l; $l = $l.value) {
+            take $l.key;
+        }
+    }
+}
+
+my $list = [=>] 'Ⅰ' .. 'Ⅻ', Mu;
+say ~$list.traverse;

Task/Singly-linked-list-Traversal/PicoLisp/singly-linked-list-traversal-1.l

@@ -0,0 +1 @@
+(mapc println '(a "cde" (X Y Z) 999))

Task/Singly-linked-list-Traversal/PicoLisp/singly-linked-list-traversal-2.l

@@ -0,0 +1,2 @@
+(for X '(a "cde" (X Y Z) 999)
+   (println X) )

Task/Singly-linked-list-Traversal/Protium/singly-linked-list-traversal-1.protium

@@ -0,0 +1,9 @@
+<@ LETCNSLSTLIT>public holidays|開國紀念日^和平紀念日^婦女節、兒童節合併假期^清明節^國慶日^春節^端午節^中秋節^農曆除夕</@>
+<@ OMT>From First to Last</@>
+<@ ITEFORSZELSTLIT>public holidays|
+<@ SAYLST>...</@><@ ACTMOVFWDLST>...</@>
+</@>
+<@ OMT>From Last to First (pointer is still at end of list)</@>
+<@ ITEFORSZELSTLIT>public holidays|
+<@ SAYLST>...</@><@ ACTMOVBKWLST>...</@>
+</@>

Task/Singly-linked-list-Traversal/Protium/singly-linked-list-traversal-2.protium

@@ -0,0 +1,9 @@
+<# 指定构造列表字串>public holidays|開國紀念日^和平紀念日^婦女節、兒童節合併假期^清明節^國慶日^春節^端午節^中秋節^農曆除夕</#>
+<# 忽略>From First to Last</#>
+<# 迭代迭代次数结构大小列表字串>public holidays|
+<# 显示列表>...</#><# 运行移位指针向前列表>...</#>
+</#>
+<# 忽略>From Last to First (pointer is still at end of list)</#>
+<# 迭代迭代次数结构大小列表字串>public holidays|
+<# 显示列表>...</#><# 运行移位指针向后列表>...</#>
+</#>

Task/Singly-linked-list-Traversal/PureBasic/singly-linked-list-traversal.purebasic

@@ -0,0 +1,9 @@
+Procedure traverse(*node.MyData)
+  While *node
+    ;access data, i.e. PrintN(Str(*node\Value))
+    *node = *node\next
+  Wend
+EndProcedure
+
+;called using
+traverse(*firstnode.MyData)

Task/Singly-linked-list-Traversal/Python/singly-linked-list-traversal-1.py

@@ -0,0 +1,2 @@
+for node in lst:
+    print node.value

Task/Singly-linked-list-Traversal/Python/singly-linked-list-traversal-2.py

@@ -0,0 +1,23 @@
+class LinkedList(object):
+  """USELESS academic/classroom example of a linked list implemented in Python.
+     Don't ever consider using something this crude!  Use the built-in list() type!
+  """
+  def __init__(self, value, next):
+    self.value = value;
+    self.next = next
+  def __iter__(self):
+    node = self
+    while node != None:
+      yield node.value
+      node = node.next;
+
+lst = LinkedList("big",  next=
+  LinkedList(value="fjords",next=
+    LinkedList(value="vex",   next=
+      LinkedList(value="quick", next=
+        LinkedList(value="waltz", next=
+          LinkedList(value="nymph", next=None))))));
+
+for value in lst:
+  print value,;
+print

Task/Singly-linked-list-Traversal/Retro/singly-linked-list-traversal-1.retro

@@ -0,0 +1 @@
+: traverse ( l- ) repeat @ 0; again ;

Task/Singly-linked-list-Traversal/Retro/singly-linked-list-traversal-2.retro

@@ -0,0 +1 @@
+last [ drop ] ^types'LIST each@

Task/Singly-linked-list-Traversal/Retro/singly-linked-list-traversal-3.retro

@@ -0,0 +1 @@
+last [ @d->name puts space ] ^types'LIST each@

Task/Singly-linked-list-Traversal/Ruby/singly-linked-list-traversal.rb

@@ -0,0 +1,13 @@
+head = ListNode.new("a", ListNode.new("b", ListNode.new("c")))
+head.insertAfter("b", "b+")
+
+# then:
+head.each {|node| print node.value, ","}
+puts
+
+# or
+current = head
+begin
+  print current.value, ","
+end while current = current.succ
+puts

Task/Singly-linked-list-Traversal/Run-BASIC/singly-linked-list-traversal.run

@@ -0,0 +1,4 @@
+list$ = "now is the time for all good men"
+for lnk = 1 to 8
+ print lnk;"->";word$(list$,lnk)
+next lnk

Task/Singly-linked-list-Traversal/Scala/singly-linked-list-traversal-1.scala

@@ -0,0 +1,6 @@
+def traverse1[T](xs: Seq[T]): Unit = xs match {
+  case s if s.isEmpty => ()
+  case _ => { Console.println(xs.head);
+              traverse1(xs.tail)
+  }
+}

Task/Singly-linked-list-Traversal/Scala/singly-linked-list-traversal-2.scala

@@ -0,0 +1 @@
+def traverse2[T](xs: Seq[T]) = for (x <- xs) Console.println(x)

Task/Singly-linked-list-Traversal/Scheme/singly-linked-list-traversal.ss

@@ -0,0 +1,6 @@
+(define (traverse seq func)
+  (if (null? seq)
+      '()
+      (begin
+        (func (car seq))
+        (traverse (cdr seq) func))))

Task/Singly-linked-list-Traversal/Tcl/singly-linked-list-traversal-1.tcl

@@ -0,0 +1,11 @@
+oo::define List {
+    method for {varName script} {
+        upvar 1 $varName var
+        set elem [self]
+        while {$elem ne ""} {
+            set var [$elem value]
+            uplevel 1 $script
+            set elem [$elem next]
+        }
+    }
+}

Task/Singly-linked-list-Traversal/Tcl/singly-linked-list-traversal-2.tcl

@@ -0,0 +1,7 @@
+set list {}
+foreach n {1 3 5 7 2 4 6 8} {
+    set list [List new $n $list]
+}
+$list for x {
+    puts "we have a $x in the list"
+}

Task/Singly-linked-list-Traversal/Trith/singly-linked-list-traversal.trith

@@ -0,0 +1 @@
+[1 2 3 4 5] [print] each

Task/Singly-linked-list-Traversal/Visual-Basic-.NET/singly-linked-list-traversal.visual

@@ -0,0 +1,6 @@
+Private Sub Iterate(ByVal list As LinkedList(Of Integer))
+    Dim node = list.First
+    Do Until node Is Nothing
+        node = node.Next
+    Loop
+    End Sub

Task/Singly-linked-list-Traversal/XPL0/singly-linked-list-traversal.xpl0

@@ -0,0 +1 @@
+repeat Node:= Node(0) until Node=0