Changeset 1592 in lmdz_wrf for trunk/tools/generic_tools.py

Timestamp:

Aug 2, 2017, 9:18:38 PM (8 years ago)

Author:

lfita

Message:

Adding:

• `InsertVal_list_sign': Insert values into a sorrted list according to its sign of growth

File:

• trunk/tools/generic_tools.py (modified) (2 diffs)

trunk/tools/generic_tools.py

@@ -85 +85 @@
 # index_mat: Function to provide the coordinates of a given value inside a matrix
 # index_vec: Function to provide the coordinates of a given value inside a vector
+# InsertVal_list_sign: Insert values into a sorrted list according to its sign of growth
 # int_to_roman: Convert an integer to Roman numerals
 # julday_360d: Function to provide the julian day of a date in a 360 days/yr (or 12 30-days months) calendar
@@ -12243 +12244 @@
 #quit()
 
+def InsertVal_list_sign(listv, newvalues):
+    """ Insert values into a sorrted list according to its sign of growth
+      listv= inital values of the list
+      newvalues= values to add
+      >>> InsertVal_list_sign(range(0,100,10), [0,1,2,3,5,8,13,21,34,55,89,144])
+      [0, 1, 2, 3, 5, 8, 10, 13, 20, 21, 30, 34, 40, 50, 55, 60, 70, 80, 89, 90, 144]
+    """
+    fname = 'InsertVal_list_sign'
+
+    newlist = []
+
+    # Number of values
+    Nold = len(listv)
+    Nnew = len(newvalues)
+
+    lsign = np.float(listv[1]) - np.float(listv[0])
+
+    # Number of values
+    Lcoinvals = len(set(listv).intersection(set(newvalues)))
+    Ldiffvals = len(set(listv).symmetric_difference(set(newvalues)))
+
+    Ltot = Lcoinvals + Ldiffvals
+
+    inew = 0
+    iold = 0
+    if lsign > 0.:
+        for il in range(Ltot):
+            if listv[iold] < newvalues[inew]: 
+                newval = listv[iold]
+                iold = iold + 1
+            else:
+                newval = newvalues[inew]
+                inew = np.min([inew + 1, Nnew-1])
+
+            # Not repeating values
+            if not searchInlist(newlist,newval): newlist.append(newval)
+            # breaking just in case ...
+            if iold > Nold -1:
+                newlist = newlist + newvalues[inew:Nnew]
+                break
+            if inew > Nnew -1:
+                newlist = newlist + listv[iold:Nold]
+                break
+    else:
+        for il in range(Ltot+1):
+            if listv[iold] > newvalues[inew]: 
+                newval = listv[iold]
+                iold = iold + 1
+            else:
+                newval = newvalues[inew]
+                inew = inew + 1
+            # Not repeating values
+            if not searchInlist(newlist,newval):  newlist.append(newval)
+            # breaking just in case ...
+            if iold > Nold -1:
+                newlist = newlist + newvalues[inew:Nnew]
+                break
+            if inew > Nnew -1:
+                newlist = newlist + listv[iold:Nold]
+                break
+
+    return newlist
 
 #quit()