Logo

Programming-Idioms

This language bar is your friend. Select your favorite languages!
  • Pascal

Idiom #284 Create a zeroed list of integers

Create a new list a (or array, or slice) of size n, where all elements are integers initialized with the value 0.

a := nil;
setlength(a, n);

First clear the array, then set its length. This ensures data is zero-ed.
#include <stdlib.h>
int *a = calloc(n, sizeof(*a));

calloc automatically sets every byte allocated to 0.
New implementation...
< > ⌨
programming-idioms.org 
a := nil;
setlength(a, n);
int *a = calloc(n, sizeof(*a));
(def a (repeatedly n #(identity 0)))
std::vector<int> a(n, 0);
var a = new int[n];
var a = List.filled(n, 0);
integer, dimension(:), allocatable :: a

allocate(a(n),source = 0)
a := make([]int, n)
a = replicate n 0
const a = new Array(n).fill(0);
int a[] = new int[n];
List<Integer> a = new ArrayList<>(n);
range(0, n).forEach(i -> a.add(0));
int[] a = new int[n];

int[] a = IntStream.generate(() -> 0)
                .limit(n)
                .toArray();
List<Integer> a = new ArrayList<Integer>(n);
for (int i =0;i<n;i++){
    a.add(0);
}
int a[] = range(0, n).map(i -> 0).toArray();
int a[] = iterate(0, i -> 0).limit(n).toArray();
Integer a[] = new Integer[n];
fill(a, 0);
local function new_zeroed_list(n)
 local ret={}
 for i=1,n do
  ret[i]=0
 end
 return ret
end
local zeroed_list=new_zeroed_list(n)
my @a = (0) x $n;
a = [0] * n
a = [*repeat(0, n)]
a = Array.new(n, 0)
a = [0] * n
let a = vec![0; n];