Special case for allocating zeros

Author: phischu

examples/benchmarks/are_we_fast_yet/storage.effekt

@@ -31,7 +31,7 @@ def run(n: Int) = {
   def buildTreeDepth(depth: Int) { rand: Random }: Tree = {
     count.set(count.get + 1);
     if (depth == 1) {
-      Leaf(array(mod(rand.next, 10) + 1, 0))
+      Leaf(array::allocateZeros(mod(rand.next, 10) + 1))
     } else {
       Node(
         buildTreeDepth(depth - 1){ rand },

libraries/common/array.effekt

@@ -173,6 +173,18 @@ extern def set[T](arr: Array[T], index: Int, value: T) at global: Unit =
 
 // Derived operations:
 
+/// Allocates a new array initialized with zero integer values.
+def allocateZeros(size: Int): Array[Int] =
+  unsafeAllocate(size)
+
+/// Allocates a new array initialized with zero double values.
+def allocateZeros(size: Int): Array[Double] =
+  unsafeAllocate(size)
+
+/// Allocates a new array initialized with zero double values.
+def allocateNones[T](size: Int): Array[Option[T]] =
+  unsafeAllocate(size)
+
 /// Builds a new Array of size `size` from a computation `index` which gets an index
 /// and returns a value that will be on that position in the resulting array
 def build[T](size: Int) { index: Int => T }: Array[T] = {