src/test/scripts/functions/misc/IPAUnknownRecursion.dml

#-------------------------------------------------------------
#
# Licensed to the Apache Software Foundation (ASF) under one
# or more contributor license agreements.  See the NOTICE file
# distributed with this work for additional information
# regarding copyright ownership.  The ASF licenses this file
# to you under the Apache License, Version 2.0 (the
# "License"); you may not use this file except in compliance
# with the License.  You may obtain a copy of the License at
# 
#   http://www.apache.org/licenses/LICENSE-2.0
# 
# Unless required by applicable law or agreed to in writing,
# software distributed under the License is distributed on an
# "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
# KIND, either express or implied.  See the License for the
# specific language governing permissions and limitations
# under the License.
#
#-------------------------------------------------------------


factorial = function(Matrix[Double] arr, Integer pos) return (Matrix[Double] arr){
	if(pos == 1) arr[1, pos] = 1
	else{
		arr = factorial(arr, pos-1)
		arr[1, pos] = pos * arr[1, pos-1]
	}
	
	for(i in 1:ncol(arr))
		print("inside factorial (" + pos + ") " + i + ": " + as.scalar(arr[1, i]))
}

n = $1
arr = matrix(0, rows=1, cols=n)
arr = factorial(arr, n)

R = matrix(0, rows=1, cols=n);
for(i in 1:n) #copy important to test dynamic rewrites
{
   print("main factorial " + i + ": " + as.scalar(arr[1, i]))
   R[1,i] = as.scalar(arr[1, i]);
}

write(R, $2);