Replaced tabs with spaces in test files

test/arrays/check_success/scan_vector_matrix.cvc

@@ -9,16 +9,16 @@ extern void printFloat(float c);
 void scan_vector(float [m] a)
 {
     for (int i = 0, m) {
-	a[i] = scanFloat();
+    a[i] = scanFloat();
     }
 }
 
 void scan_matrix(float [m,n] a)
 {
     for (int i = 0, m) {
-	for (int j = 0, n) {
-	    a[i,j] = scanFloat();
-	}
+    for (int j = 0, n) {
+        a[i,j] = scanFloat();
+    }
     }
 }
 
@@ -29,23 +29,23 @@ export int main()
 
     void do_vector()
     {
-	float [m] v;
+    float [m] v;
 
-	scan_vector(v);
+    scan_vector(v);
     }
 
     void do_matrix()
     {
-	float [m,n] M;
+    float [m,n] M;
 
-	scan_matrix(M);
+    scan_matrix(M);
     }
 
     if (n == 1 && m >= 1) {
-	do_vector();
+    do_vector();
     }
     else if (n > 1 && m >= 1) {
-	do_matrix();
+    do_matrix();
     }
 
     return 0;

test/arrays/functional/8_queen.cvc

@@ -20,63 +20,63 @@ int[8] x;
 
 int abs_sub(int i,int j)
 {
-	int k;
-	if(i>=j)
-		k=i-j;
-	else
-		k=j-i;
-	return k;
+    int k;
+    if(i>=j)
+        k=i-j;
+    else
+        k=j-i;
+    return k;
 }
 
 void print ()
 {
-	int i;
-	int j;
-	for (int i=0,8)
-	{
-		for (int j=0,8)
-		{
-			if (j==x[i])
-			{
-				printInt(i*10+j);
-				printSpaces(3);
-			}
-		}
-	}
-		printNewlines(1);
+    int i;
+    int j;
+    for (int i=0,8)
+    {
+        for (int j=0,8)
+        {
+            if (j==x[i])
+            {
+                printInt(i*10+j);
+                printSpaces(3);
+            }
+        }
+    }
+        printNewlines(1);
 
 }
 
 /* tests, whether (ix, iy) is beaten by queens 0...(iy-1) */
 int is_free (int ix, int iy)
 {
-	int i;
-	int flag=1;
-	for (int i=0,iy)
-		if ((x[i]==ix) || (abs_sub(x[i],ix)==abs_sub(i,iy)))
-			flag= 0;
-	return flag;
+    int i;
+    int flag=1;
+    for (int i=0,iy)
+        if ((x[i]==ix) || (abs_sub(x[i],ix)==abs_sub(i,iy)))
+            flag= 0;
+    return flag;
 }
 
 /* tries to place queen n on row n */
 void try (int n)
 {
-	int i;
-	if (n==8) print();
-	else
-	{
-		for (int i=0,8)
-			if (is_free(i,n)==1)
-			{
-				x[n]=i;
-				try (n+1);
-			}
-	}
+    int i;
+    if (n==8) print();
+    else
+    {
+        for (int i=0,8)
+            if (is_free(i,n)==1)
+            {
+                x[n]=i;
+                try (n+1);
+            }
+    }
 }
 
 export int main()
 {
 
-	try(0);
-	return 0;
+    try(0);
+    return 0;
 }

test/arrays/functional/dimreduce.cvc

@@ -8,9 +8,9 @@ int[3] glob;
 void printArray(int[n] a)
 {
     for(int i = 0, n) {
-		printInt(a[i]);
-		printSpaces(1);
-	}
+        printInt(a[i]);
+        printSpaces(1);
+    }
     printNewlines(1);
 }
 

test/arrays/functional/matrix_mult.cvc

@@ -10,71 +10,71 @@ extern void printNewlines( int num);
 
 export int main()
 {
-	//Read dimensions of matrix from input
-	int rowsMatrixA =5;
-	int colMatrixA = 5;
+    //Read dimensions of matrix from input
+    int rowsMatrixA =5;
+    int colMatrixA = 5;
 
-	int rowsMatrixB =5;
-	int colMatrixB = 5;
+    int rowsMatrixB =5;
+    int colMatrixB = 5;
 
-	int[rowsMatrixA, colMatrixA] matrixA;
-	int[rowsMatrixB, colMatrixB] matrixB;
-	int[rowsMatrixA, colMatrixB] matrixProduct;
+    int[rowsMatrixA, colMatrixA] matrixA;
+    int[rowsMatrixB, colMatrixB] matrixB;
+    int[rowsMatrixA, colMatrixB] matrixProduct;
 
-	//Product cannot be done if the following condition does not stand
-	if (colMatrixA == rowsMatrixB)
-	{
-		//Fill in Matrix A
-		for (int i = 0, rowsMatrixA)
-		{
-			for (int j = 0, colMatrixA)
-			{
-				matrixA[i, j] = i + j;
-				printInt(matrixA[i, j]);
-				printSpaces(3);
-			}
-			printNewlines(1);
-		}
+    //Product cannot be done if the following condition does not stand
+    if (colMatrixA == rowsMatrixB)
+    {
+        //Fill in Matrix A
+        for (int i = 0, rowsMatrixA)
+        {
+            for (int j = 0, colMatrixA)
+            {
+                matrixA[i, j] = i + j;
+                printInt(matrixA[i, j]);
+                printSpaces(3);
+            }
+            printNewlines(1);
+        }
         printNewlines(1);
 
-		//Fill in Matrix B
-		for (int i = 0, rowsMatrixB)
-		{
-			for (int j = 0, colMatrixB)
-			{
-				matrixB[i, j] = i + j;
-				printInt(matrixB[i, j]);
-				printSpaces(3);
-			}
-			printNewlines(1);
-		}
+        //Fill in Matrix B
+        for (int i = 0, rowsMatrixB)
+        {
+            for (int j = 0, colMatrixB)
+            {
+                matrixB[i, j] = i + j;
+                printInt(matrixB[i, j]);
+                printSpaces(3);
+            }
+            printNewlines(1);
+        }
         printNewlines(1);
 
-		//Do Multiplication
-		for (int i = 0, rowsMatrixA)
-		{
-			for (int j = 0, colMatrixB)
-			{
-				matrixProduct[i, j] = 0;
-				for (int m = 0, colMatrixA)
-				{
-					matrixProduct[i, j] = matrixProduct[i, j] + (matrixA[i, m] * matrixB[m,j]);
-				}
-			}
-		}
+        //Do Multiplication
+        for (int i = 0, rowsMatrixA)
+        {
+            for (int j = 0, colMatrixB)
+            {
+                matrixProduct[i, j] = 0;
+                for (int m = 0, colMatrixA)
+                {
+                    matrixProduct[i, j] = matrixProduct[i, j] + (matrixA[i, m] * matrixB[m,j]);
+                }
+            }
+        }
 
 
-		for (int i = 0, rowsMatrixA)
-		{
-			for (int j = 0, colMatrixB)
-			{
-				printInt(matrixProduct[i, j]);
-						printSpaces(3);
-			}
-			printNewlines(1);
-		}
-	}
-	return 0;
+        for (int i = 0, rowsMatrixA)
+        {
+            for (int j = 0, colMatrixB)
+            {
+                printInt(matrixProduct[i, j]);
+                        printSpaces(3);
+            }
+            printNewlines(1);
+        }
+    }
+    return 0;
 }
 
 

test/arrays/functional/matrix_print.cvc

@@ -18,24 +18,24 @@ extern void printNewlines( int num);
 
 export int main()
 {
-	int[5,5] matrix;
+    int[5,5] matrix;
 
-	for (int i = 0, 5) 
-	{
-		for (int j = 0, 5)
-			matrix[i,j]=j;
-	}
-	
-	for (int i = 0, 5) 
-	{
-		for (int j = 0, 5)
+    for (int i = 0, 5) 
+    {
+        for (int j = 0, 5)
+            matrix[i,j]=j;
+    }
+    
+    for (int i = 0, 5) 
+    {
+        for (int j = 0, 5)
         {
-			printInt(matrix[i,j]);
+            printInt(matrix[i,j]);
             printSpaces(3);
         }
         printNewlines(1);
-	}
-		
-	return 0;
+    }
+        
+    return 0;
 }
 

test/arrays/functional/quicksort.cvc

@@ -4,82 +4,82 @@ extern void printNewlines( int num);
 
 void printvector(int[m] a)
 {
-	for(int i=0,m)
-	{
-		printInt(a[i]);
-		printSpaces(3);
-	}
+    for(int i=0,m)
+    {
+        printInt(a[i]);
+        printSpaces(3);
+    }
     printNewlines(1);
 }
 
 void quicksort(int[N] list,int m,int n)
 {
-	int key;
-	int i;
-	int j;
-	int k;
-	int temp;
+    int key;
+    int i;
+    int j;
+    int k;
+    int temp;
 
-	if( m < n)
-	{
+    if( m < n)
+    {
 
-		k = (m+n)/2;
+        k = (m+n)/2;
 
-		//swap
-		temp=list[m];
-		list[m]=list[k];
-		list[k]=temp;
+        //swap
+        temp=list[m];
+        list[m]=list[k];
+        list[k]=temp;
 
-		key = list[m];
+        key = list[m];
 
-		i = m+1;
+        i = m+1;
 
-		j = n;
+        j = n;
 
-		while(i <= j)
-		{
+        while(i <= j)
+        {
 
-			while((i <= n) && (list[i] <= key))
-			{
+            while((i <= n) && (list[i] <= key))
+            {
                 i=i+1;
-			}
-			while((j >= m) && (list[j] > key))
-			{
+            }
+            while((j >= m) && (list[j] > key))
+            {
                 j=j-1;
-			}
-			if( i < j)
-			{
+            }
+            if( i < j)
+            {
 
                 temp=list[i];
-				list[i]=list[j];
-				list[j]=temp;
-			}
+                list[i]=list[j];
+                list[j]=temp;
+            }
 
-		}
+        }
 
-		// swap two elements
+        // swap two elements
 
-		temp=list[m];
-		list[m]=list[j];
-		list[j]=temp;
+        temp=list[m];
+        list[m]=list[j];
+        list[j]=temp;
 
-		// recursively sort the lesser list
+        // recursively sort the lesser list
 
-		quicksort(list,m,j-1);
+        quicksort(list,m,j-1);
 
-		quicksort(list,j+1,n);
+        quicksort(list,j+1,n);
 
-	}
+    }
 
 }
 
 export int main()
 {
-	int[10] a = [2,10,5,4,9,7,8,6,1,2];
+    int[10] a = [2,10,5,4,9,7,8,6,1,2];
 
-	quicksort(a,0,9);
-	printvector(a);
-	return 0;
+    quicksort(a,0,9);
+    printvector(a);
+    return 0;
 }
 
 

test/basic/functional/factorial.cvc

@@ -2,25 +2,25 @@ extern void printInt(int val);
 extern void printNewlines(int num);
 
 int fac(int num) {
-	int input = num;
-	int output = 1;
-	int i = 1;
+    int input = num;
+    int output = 1;
+    int i = 1;
 
-	if (input == 0) {
-		output = 1;
+    if (input == 0) {
+        output = 1;
     } else {
         while (i <= input) {
-			output = output * i;
-			i = i + 1;
-		}
-	}
-	return output;
+            output = output * i;
+            i = i + 1;
+        }
+    }
+    return output;
 }
 
 export int main() {
     printInt(fac(3));  printNewlines(1);
     printInt(fac(5));  printNewlines(1);
     printInt(fac(10)); printNewlines(1);
-	return 0;
+    return 0;
 }
 

test/basic/functional/forloop.cvc

@@ -11,30 +11,30 @@ extern void printNewlines( int num);
 export int main()
 {
     int a;
-	int m=10;
-	int n=5;
+    int m=10;
+    int n=5;
 
-	a=10;
+    a=10;
     m=5;
 
-	for(int i=0,m)
-	{
-			a=a-1;
+    for(int i=0,m)
+    {
+            a=a-1;
             printInt(a);
-			printSpaces(3);
-	}
-	printNewlines(1);
+            printSpaces(3);
+    }
+    printNewlines(1);
 
     m=5;
     for(int i=10,m,-1)
-	{
-			a=a-1;
+    {
+            a=a-1;
             printInt(a);
-			printSpaces(3);
+            printSpaces(3);
 
-	}
-	printNewlines(1);
+    }
+    printNewlines(1);
 
 
-	return 0;
+    return 0;
 }

test/basic/functional/typecheck.cvc

@@ -9,46 +9,46 @@ extern void printNewlines( int num);
 
 int foo(int a, float b,int c)
 {
-	return a+(int)b+c;
+    return a+(int)b+c;
 }
 
 
 int fun()
 {
-	int a=1;
-	int b=2;
-	int c=3;
-	int d=4;
-	float w=1.0;
-	float x=2.0;
-	//bool q = TRUE;  This is the original line, which has a typo
-	bool q = true;
+    int a=1;
+    int b=2;
+    int c=3;
+    int d=4;
+    float w=1.0;
+    float x=2.0;
+    //bool q = TRUE;  This is the original line, which has a typo
+    bool q = true;
 
-	d = (int)(a<b&&c>d);
-	printInt(d);//0
-	printNewlines(1);
+    d = (int)(a<b&&c>d);
+    printInt(d);//0
+    printNewlines(1);
 
-	d = foo((int)(a<c),w+x,(int)(b<d));//4
-	printInt(d);//5
-	printNewlines(1);
+    d = foo((int)(a<c),w+x,(int)(b<d));//4
+    printInt(d);//5
+    printNewlines(1);
 
 
-	if(b<d||a>c)
-		a=7;
+    if(b<d||a>c)
+        a=7;
 
-	return 1;
+    return 1;
 }
 
 void bar() {
-	int a = 5;
-	float b = 6.0;
-	int c = a + ((int)(b))* a;
-	printInt(c);
-	printNewlines(1);
+    int a = 5;
+    float b = 6.0;
+    int c = a + ((int)(b))* a;
+    printInt(c);
+    printNewlines(1);
 }
 
 export int main() {
-	fun();
-	bar();
-	return 0;
+    fun();
+    bar();
+    return 0;
 }

test/nested_funs/functional/euclid.cvc

@@ -11,23 +11,23 @@ export int main() {
 }
 
 int euclid(int num1, int num2) {
-	int gcd;
+    int gcd;
 
     void findNextPair() {
-		if (num1 > num2)
-			num1 = num1 % num2;
-		else
-			num2 = num2 % num1;
-	}
+        if (num1 > num2)
+            num1 = num1 % num2;
+        else
+            num2 = num2 % num1;
+    }
 
     do
-		findNextPair();
-	while (num1 != 0 && num2 != 0);
+        findNextPair();
+    while (num1 != 0 && num2 != 0);
 
-	if (num1 == 0)
-		gcd = num2;
-	else
-		gcd = num1;
+    if (num1 == 0)
+        gcd = num2;
+    else
+        gcd = num1;
 
     return gcd;
 }

test/nested_funs/functional/scopes.cvc

@@ -21,7 +21,7 @@ export int main()
     {
         a = 11111;
         printInt(a);
-		printNewlines(1);
+        printNewlines(1);
     }
 
     /* A variable initalized by a variable of the same name */
@@ -30,7 +30,7 @@ export int main()
         int a = a;
         a = a + 11111;
         printInt(a);
-		printNewlines(1);
+        printNewlines(1);
     }
 
     /* using a in the inner function makes it an escaped variable */