Source code for epsproc.util.misc

# -*- coding: utf-8 -*-
ePSproc convenience functions

Collection of small functions for sorting etc.


# import numpy as np
import re
import itertools
import os
from datetime import datetime
# import scipy.constants
# # Package fns.
# from epsproc.basicPlotters import molPlot

    from natsort import natsorted  # For natural sorting
    natsortFlag = True

except ImportError as e:
    if e.msg != "No module named 'natsort'":
    print('* natsort not found, some sorting functions not available. ')
    natsortFlag = False

#***************** Convenience functions...

# Multistring replace
# See
[docs]def stringRepMap(string, replacements, ignore_case=False): """ Given a string and a replacement map, it returns the replaced string. :param str string: string to execute replacements on :param dict replacements: replacement dictionary {value to find: value to replace} :param bool ignore_case: whether the match should be case insensitive :rtype: str CODE from: ... more or less verbatim. Thanks to *bgusach* for the Gist. """ # If case insensitive, we need to normalize the old string so that later a replacement # can be found. For instance with {"HEY": "lol"} we should match and find a replacement for "hey", # "HEY", "hEy", etc. if ignore_case: def normalize_old(s): return s.lower() re_mode = re.IGNORECASE else: def normalize_old(s): return s re_mode = 0 replacements = {normalize_old(key): val for key, val in replacements.items()} # Place longer ones first to keep shorter substrings from matching where the longer ones should take place # For instance given the replacements {'ab': 'AB', 'abc': 'ABC'} against the string 'hey abc', it should produce # 'hey ABC' and not 'hey ABc' rep_sorted = sorted(replacements, key=len, reverse=True) rep_escaped = map(re.escape, rep_sorted) # Create a big OR regex that matches any of the substrings to replace pattern = re.compile("|".join(rep_escaped), re_mode) # For each match, look up the new string in the replacements, being the key the normalized old string return pattern.sub(lambda match: replacements[normalize_old(], string)
# Sort a 2D numpy array.
[docs]def arraySort2D(a, col): """ Sort np.array `a` by specified column `col`. From """ return a[a[:,col].argsort()]
# Sort & group filenames
[docs]def fileListSort(fList, groupByPrefix=True, prefixStr = None, verbose=True): """ Sort a list of file names, and group by prefix. Note: this currently assumes a file name schema whereby split('_')[0] picks the grouping string. Note: os.path.commonprefix() is used for determining prefix, this may fail in some cases (e.g. for cases where a single file is passed, or files from different dirs). Pass prefix manaully in these cases. """ if natsortFlag: fListSorted = natsorted(fList) else: fListSorted = sorted(fList) # prefixStr = '' if groupByPrefix: if prefixStr is None: prefixStr = os.path.commonprefix(fListSorted) # Find common prefix if not passed. # Solution with itertools groupby # Adapted from groupedList = [list(v) for k,v in itertools.groupby(fListSorted,key=lambda x:x.replace(prefixStr,'').split('_')[0])] if verbose: print(prefixStr) if len(fList) > 1: return fListSorted, groupedList, prefixStr else: return fList, fList, None
# Return a time-string for setting unique file names # May already have this elsewhere...?
[docs]def timeStamp(): """Get local time and return formatted string "%d-%m-%y_%H-%M-%S" for time-stamping filesnames.""" dt = return dt.strftime("%d-%m-%y_%H-%M-%S")