anchor.diff:        
   c matrix multiplication
   
  -cf2py double precision dimension(m,q),intent(out) :: prod
  -cf2py double precision dimension(m,n),intent(in) :: mat1
  -cf2py double precision dimension(p,q),intent(in) :: mat2
  +cf2py real dimension(m,q),intent(out) :: prod
  +cf2py real dimension(m,n),intent(in) :: mat1
  +cf2py real dimension(p,q),intent(in) :: mat2
   cf2py integer intent(hide),depend(mat1) :: m=len(mat1),n=shape(mat1,1)
   cf2py integer intent(hide),depend(mat2) :: p=len(mat2),q=shape(mat2,1)
   
   
         INTEGER i,j,k,m,n,p,q
  -      DOUBLE PRECISION mat1(m,n), mat2(p,q), prod(m,q)
  -      DOUBLE PRECISION sum
  +      REAL mat1(m,n), mat2(p,q), prod(m,q)
  +      REAL sum
         
         if (n.eq.p) then
           do 30 i = 1,m
  
positive.code: c that x is in ]a, b[ if not. 
  
  cf2py integer, intent(out) :: pass
  cf2py double precision dimension(n), intent(in) :: x
  cf2py double precision dimension(na), intent(in) :: a
  cf2py double precision dimension(nb), intent(in) :: b
  cf2py integer intent(hide), depend(x) :: n = len(x)
  cf2py integer intent(hide), depend(a) :: na = len(a)
  cf2py integer intent(hide), depend(b) :: nb = len(b)
  
negative.code:       END SUBROUTINE exponweib_ppf
  
  
  	  REAL FUNCTION combinationln(n,k)
  
  c Ln of the number of different combinations of n different things, taken k at a time. 
  c DH, 5.02.2007
  
  	  IMPLICIT NONE
  	  INTEGER n, k
  	  REAL factln
  
  	  combinationln= factln(n) - factln(k) - factln(n-k)
  
  	  END FUNCTION combinationln
  
        SUBROUTINE hyperg(x,draws,success,total,n,nd,ns,nt,like)
  
  