...similar, although it was called "compile-time computations" and not a preprocessor: .ifact = 1 .do i = 1, 5 .ifact = ifact*i A(i) = B(i) / ifact .end do This would turn into the following 5 lines: A(1...(4) / 24 A(5) = B(5) / 120 The variables ifact and i are both compile-time varaibles and don't even exist ...

... something similar, although it was called "compile-time computations" and not a preprocessor: .ifact = 1 .do i = 1, 5 .ifact = ifact*i A(i) = B(i) / ifact .end do This would turn into the following 5 lines: A(1) =...= B(4) / 24 A(5) = B(5) / 120 The variables ifact and i are both compile-time varaibles and don't even exist at ...

.... 247). ! 'Ordinary' Legendre polynomals are given for m=0. ! ! Calls: pure recursive function ifact -> double factorial n!! implicit none real(dp) :: Plm real(dp), intent(in)...m) then Plm = (-1)**m (-1)**M is an inefficient way to change sign. * ifact(2.0d0*m-1.0d0) 2.0D0*M is an inefficient way to double M (...

.... 247). ! 'Ordinary' Legendre polynomals are given for m=0. ! ! Calls: pure recursive function ifact -> double factorial n!! implicit none real(dp) :: Plm real(dp), intent(in)... integer, intent(in) :: l if(l == m) then Plm = (-1)**m * ifact(2.0d0*m-1.0d0) * (1.0d0-x**2)**(m/2.0d0) elseif(...

...' Legendre polynomals are given for m=0. ! ! Calls: pure recursive function ifact -> double factorial n!! implicit none real(dp) :: Plm... l if(l == m) then Plm = (-1)**m * ifact(2.0d0*m-1.0d0) * (1.0d0-x**2)**(m... once for (x, m, l-1). Then there's ifact; if you're computing the factorial recursively, that will slow ...

... p. 247). ! 'Ordinary' Legendre polynomals are given for m=0. ! ! Calls: pure recursive function ifact -> double factorial n!! implicit none real(dp) :: Plm real(dp), intent(in) :: x...in) :: m integer, intent(in) :: l if(l == m) then Plm = (-1)**m * ifact(2.0d0*m-1.0d0) * (1.0d0-x**2)**(m/2.0d0) elseif(l ==...