Data update

Task/Queue-Definition/EasyLang/queue-definition.easy

@@ -0,0 +1,56 @@
+prefix qu_
+global q[] head tail .
+#
+proc enq n . .
+   if tail = 0
+      head = 1
+   else
+      q[tail + 2] = len q[] + 1
+   .
+   q[] &= n
+   q[] &= tail
+   q[] &= 0
+   tail = len q[] - 2
+.
+func deq .
+   if head = 0
+      return 0 / 0
+   .
+   r = q[head]
+   old = head
+   head = q[head + 2]
+   prev = q[-2]
+   if prev <> 0
+      q[prev + 2] = old
+   .
+   next = q[-1]
+   if next <> 0
+      q[next + 1] = old
+   else
+      tail = old
+   .
+   q[old] = q[-3]
+   q[old + 1] = q[-2]
+   q[old + 2] = q[-1]
+   len q[] -3
+   if head = len q[] + 1
+      head = old
+   .
+   if head <> 0
+      q[head + 1] = 0
+   else
+      tail = 0
+   .
+   return r
+.
+func empty .
+   return if head = 0
+.
+prefix
+#
+qu_enq 2
+qu_enq 5
+qu_enq 7
+while qu_empty = 0
+   print qu_deq
+.

Task/Queue-Definition/Elena/queue-definition.elena

@@ -31,7 +31,7 @@ class queue<T>
     T pop()
     {
         if (theTale == theTop)
-            { InvalidOperationException.new:"Queue is empty".raise() };
+            { InvalidOperationException.new("Queue is empty").raise() };
 
         T item := theArray[theTop];
 

Task/Queue-Definition/Wren/queue-definition.wren

@@ -1,4 +1,4 @@
-import "/queue" for Queue
+import "./queue" for Queue
 
 var q = Queue.new()
 var item = q.pop()