algo/IVTFilter.py
def traverseOffsets(self, data, sindex:int, eindex:int, thres:float) -> tuple:
        """Runs step by step through data in given direction and finds nearest threshold value.

        :param data:
        :param sindex: start index
        :param eindex: end index
        :param thres: value to search for
        :return: found indices
        """
        myRange = data[:sindex]
        myRange = myRange[myRange <= thres]
        if len(myRange):
            svalue = myRange.index[-1]
        else:
            svalue = data.index[0]

        myRange = data[eindex:]
        myRange = myRange[myRange <= thres]
        if len(myRange):
            evalue = myRange.index[0]
        else:
            evalue = data.index[-1]

        return (svalue, evalue)
Runs step by step through data in given direction and finds nearest threshold value.

        :param data:
        :param sindex: start index
        :param eindex: end index
        :param thres: value to search for
        :return: found indices
        
Runs step by step through data in given direction and finds nearest threshold value.
Runs step by step through data in given direction and finds nearest threshold value .
def traverseOffsets(self, data, sindex:int, eindex:int, thres:float) -> tuple:
        myRange = data[:sindex]
        myRange = myRange[myRange <= thres]
        if len(myRange):
            svalue = myRange.index[-1]
        else:
            svalue = data.index[0]
        myRange = data[eindex:]
        myRange = myRange[myRange <= thres]
        if len(myRange):
            evalue = myRange.index[0]
        else:
            evalue = data.index[-1]
        return (svalue, evalue)
def traverseOffsets ( self , data , sindex : int , eindex : int , thres : float ) -> tuple : myRange = data [ : sindex ] myRange = myRange [ myRange <= thres ] if len ( myRange ) : svalue = myRange . index [ - 1 ] else : svalue = data . index [ 0 ] myRange = data [ eindex : ] myRange = myRange [ myRange <= thres ] if len ( myRange ) : evalue = myRange . index [ 0 ] else : evalue = data . index [ - 1 ] return ( svalue , evalue )
Runs step by step through data in given direction and finds nearest threshold value.
Runs step by step through data in given direction and finds nearest threshold value .
"""Runs step by step through data in given direction and finds nearest threshold value.

        :param data:
        :param sindex: start index
        :param eindex: end index
        :param thres: value to search for
        :return: found indices
        """
None
self
data
None
sindex
int
None
eindex
int
None
thres
float
value to search for
value to search for