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

Timestamp:

Jul 24, 2024, 4:23:34 PM (2 months ago)

Author:

abarral

Message:

rename modules properly lmdz_*
move some unused files to obsolete/
(lint) uppercase fortran keywords

File:

• LMDZ6/branches/Amaury_dev/libf/misc/lmdz_interpolation.f90 (modified) (6 diffs)

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

@@ -36 +36 @@
     do while (ju - jl > 1)
       jm = (ju + jl) / 2 ! Compute a midpoint,
-      if (ascnd .eqv. (x >= xx(jm))) THEN
+      IF (ascnd .eqv. (x >= xx(jm))) THEN
         jl = jm ! and replace either the lower limit
       else
@@ -44 +44 @@
     ! {ju == jl + 1}
 
-    ! {(ascnd .and. xx(jl) <= x < xx(jl+1)) 
+    ! {(ascnd .AND. xx(jl) <= x < xx(jl+1))
     !  .neqv. 
-    !  (.not. ascnd .and. xx(jl+1) <= x < xx(jl))}
+    !  (.NOT. ascnd .AND. xx(jl+1) <= x < xx(jl))}
 
     ! Then set the output, being careful with the endpoints:
-    if (x == xx(1)) THEN
+    IF (x == xx(1)) THEN
       locate = 1
-    else if (x == xx(n)) THEN
+    ELSE IF (x == xx(n)) THEN
       locate = n - 1
     else
@@ -81 +81 @@
     ascnd = (xx(n) >= xx(1))
     ! (True if ascending order of table, false otherwise.)
-    if (jlo < 0 .or. jlo > n) THEN
+    IF (jlo < 0 .OR. jlo > n) THEN
       ! Input guess not useful. Go immediately to bisection.
       jlo = 0
@@ -87 +87 @@
     else
       inc = 1 ! Set the hunting increment.
-      if (jlo == 0) THEN
+      IF (jlo == 0) THEN
         hunt_up = .TRUE.
       else
         hunt_up = x >= xx(jlo) .eqv. ascnd
       end if
-      if (hunt_up) then ! Hunt up:
-        do
+      IF (hunt_up) then ! Hunt up:
+        DO
           jhi = jlo + inc
-          if (jhi > n) then ! Done hunting, since off end of table.
+          IF (jhi > n) then ! Done hunting, since off end of table.
             jhi = n + 1
             exit
           else
-            if (x < xx(jhi) .eqv. ascnd) exit
+            IF (x < xx(jhi) .eqv. ascnd) exit
             jlo = jhi ! Not done hunting,
             inc = inc + inc ! so double the increment
@@ -106 +106 @@
       else ! Hunt down:
         jhi = jlo
-        do
+        DO
           jlo = jhi - inc
-          if (jlo < 1) then ! Done hunting, since off end of table.
+          IF (jlo < 1) then ! Done hunting, since off end of table.
             jlo = 0
             exit
           else
-            if (x >= xx(jlo) .eqv. ascnd) exit
+            IF (x >= xx(jlo) .eqv. ascnd) exit
             jhi = jlo ! Not done hunting,
             inc = inc + inc ! so double the increment
@@ -121 +121 @@
 
     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
+      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
+        IF (x >= xx(jm) .eqv. ascnd) THEN
           jlo = jm
         else