Changeset 5116 for LMDZ6/branches/Amaury_dev/libf/misc/lmdz_interpolation.f90

Timestamp:

Jul 24, 2024, 2:54:37 PM (2 months ago)

Author:

abarral

Message:

rename modules properly lmdz_*
move ismin, ismax, minmax into new lmdz_libmath.f90
(lint) uppercase fortran keywords

File:

• LMDZ6/branches/Amaury_dev/libf/misc/lmdz_interpolation.f90 (moved) (moved from LMDZ6/branches/Amaury_dev/libf/misc/interpolation.F90) (5 diffs)

LMDZ6/branches/Amaury_dev/libf/misc/lmdz_interpolation.f90

@@ -1 +1 @@
 ! $Id$
-module interpolation
+module lmdz_interpolation
 
   ! From Press et al., 1996, version 2.10a
   ! B3 Interpolation and Extrapolation
 
-  IMPLICIT NONE 
+  IMPLICIT NONE; PRIVATE
+  PUBLIC locate, hunt
 
 contains
 
-  pure FUNCTION locate(xx,x)
+  pure FUNCTION locate(xx, x)
 
     REAL, DIMENSION(:), INTENT(IN) :: xx
@@ -22 +23 @@
     ! See notes.
 
-    INTEGER  n,jl,jm,ju
+    INTEGER  n, jl, jm, ju
     LOGICAL  ascnd
 
     !----------------------------
 
-    n=size(xx)
+    n = size(xx)
     ascnd = (xx(n) >= xx(1))
     ! (True if ascending order of table, false otherwise.)
     ! Initialize lower and upper limits:
-    jl=0
-    ju=n+1
-    do while (ju-jl > 1)
-       jm=(ju+jl)/2 ! Compute a midpoint,
-       if (ascnd .eqv. (x >= xx(jm))) then
-          jl=jm ! and replace either the lower limit
-       else
-          ju=jm ! or the upper limit, as appropriate.
-       end if
+    jl = 0
+    ju = n + 1
+    do while (ju - jl > 1)
+      jm = (ju + jl) / 2 ! Compute a midpoint,
+      if (ascnd .eqv. (x >= xx(jm))) THEN
+        jl = jm ! and replace either the lower limit
+      else
+        ju = jm ! or the upper limit, as appropriate.
+      end if
     END DO
     ! {ju == jl + 1}
@@ -48 +49 @@
 
     ! Then set the output, being careful with the endpoints:
-    if (x == xx(1)) then
-       locate=1
-    else if (x == xx(n)) then
-       locate=n-1
+    if (x == xx(1)) THEN
+      locate = 1
+    else if (x == xx(n)) THEN
+      locate = n - 1
     else
-       locate=jl
+      locate = jl
     end if
 
@@ -60 +61 @@
   !***************************
 
-  pure SUBROUTINE hunt(xx,x,jlo)
+  pure SUBROUTINE hunt(xx, x, jlo)
 
     ! Given an array xx(1:N ), and given a value x, returns a value
@@ -72 +73 @@
     REAL, INTENT(IN) :: x
     REAL, DIMENSION(:), INTENT(IN) :: xx
-    INTEGER  n,inc,jhi,jm
+    INTEGER  n, inc, jhi, jm
     LOGICAL  ascnd, hunt_up
 
     !-----------------------------------------------------
 
-    n=size(xx)
+    n = size(xx)
     ascnd = (xx(n) >= xx(1))
     ! (True if ascending order of table, false otherwise.)
-    if (jlo < 0 .or. jlo > n) then
-       ! Input guess not useful. Go immediately to bisection.
-       jlo=0
-       jhi=n+1
+    if (jlo < 0 .or. jlo > n) THEN
+      ! Input guess not useful. Go immediately to bisection.
+      jlo = 0
+      jhi = n + 1
     else
-       inc=1 ! Set the hunting increment.
-       if (jlo == 0) then
-          hunt_up = .TRUE.
-       else
-          hunt_up = x >= xx(jlo) .eqv. ascnd
-       end if
-       if (hunt_up) then ! Hunt up:
-          do
-             jhi=jlo+inc
-             if (jhi > n) then ! Done hunting, since off end of table.
-                jhi=n+1
-                exit
-             else
-                if (x < xx(jhi) .eqv. ascnd) exit
-                jlo=jhi ! Not done hunting,
-                inc=inc+inc ! so double the increment
-             end if
-          END DO ! and try again.
-       else ! Hunt down:
-          jhi=jlo
-          do
-             jlo=jhi-inc
-             if (jlo < 1) then ! Done hunting, since off end of table.
-                jlo=0
-                exit
-             else
-                if (x >= xx(jlo) .eqv. ascnd) exit
-                jhi=jlo ! Not done hunting,
-                inc=inc+inc ! so double the increment
-             end if
-          END DO ! and try again.
-       end if
+      inc = 1 ! Set the hunting increment.
+      if (jlo == 0) THEN
+        hunt_up = .TRUE.
+      else
+        hunt_up = x >= xx(jlo) .eqv. ascnd
+      end if
+      if (hunt_up) then ! Hunt up:
+        do
+          jhi = jlo + inc
+          if (jhi > n) then ! Done hunting, since off end of table.
+            jhi = n + 1
+            exit
+          else
+            if (x < xx(jhi) .eqv. ascnd) exit
+            jlo = jhi ! Not done hunting,
+            inc = inc + inc ! so double the increment
+          end if
+        END DO ! and try again.
+      else ! Hunt down:
+        jhi = jlo
+        do
+          jlo = jhi - inc
+          if (jlo < 1) then ! Done hunting, since off end of table.
+            jlo = 0
+            exit
+          else
+            if (x >= xx(jlo) .eqv. ascnd) exit
+            jhi = jlo ! Not done hunting,
+            inc = inc + inc ! so double the increment
+          end if
+        END DO ! and try again.
+      end if
     end if ! Done hunting, value bracketed.
 
     do ! Hunt is done, so begin the final bisection phase:
-       if (jhi-jlo <= 1) then
-          if (x == xx(n)) jlo=n-1
-          if (x == xx(1)) jlo=1
-          exit
-       else
-          jm=(jhi+jlo)/2
-          if (x >= xx(jm) .eqv. ascnd) then
-             jlo=jm
-          else
-             jhi=jm
-          end if
-       end if
+      if (jhi - jlo <= 1) THEN
+        if (x == xx(n)) jlo = n - 1
+        if (x == xx(1)) jlo = 1
+        exit
+      else
+        jm = (jhi + jlo) / 2
+        if (x >= xx(jm) .eqv. ascnd) THEN
+          jlo = jm
+        else
+          jhi = jm
+        end if
+      end if
     END DO
 
   END SUBROUTINE hunt
 
-end module interpolation
+end module lmdz_interpolation