@@ -114,20 +114,20 @@ def get_lower_lows(data: np.array, order=5, K=2):
114
114
115
115
Parameters:
116
116
117
- order (optional): int - How many points on each
118
- side to use for the comparison to
117
+ order (optional): int - How many points on each
118
+ side to use for the comparison to
119
119
consider ``comparator(n, n+x)`` to be True.
120
- K (optional): int - How many consecutive lows need
121
- to be lower. This means that for a given low,
122
- the next K lows must be lower than the k lows
123
- before. So say K=2, then the low at index i must
120
+ K (optional): int - How many consecutive lows need
121
+ to be lower. This means that for a given low,
122
+ the next K lows must be lower than the k lows
123
+ before. So say K=2, then the low at index i must
124
124
be lower than the low at index i-2 and i-1. If this
125
125
condition is met, then the low at index i is considered a
126
126
lower low. If the condition is not met, then the low at
127
127
index i is not considered a lower low.
128
128
129
129
Returns:
130
- extrema: list - A list of lists containing the indices of the
130
+ extrema: list - A list of lists containing the indices of the
131
131
consecutive lower lows in the data array.
132
132
'''
133
133
# Get lows
0 commit comments