In house nanmin and nanmax for object array
(func, fill_value, value, axis=None, **kwargs)
| 54 | |
| 55 | |
| 56 | def _nan_minmax_object(func, fill_value, value, axis=None, **kwargs): |
| 57 | """In house nanmin and nanmax for object array""" |
| 58 | valid_count = count(value, axis=axis) |
| 59 | filled_value = fillna(value, fill_value) |
| 60 | data = getattr(np, func)(filled_value, axis=axis, **kwargs) |
| 61 | if not hasattr(data, "dtype"): # scalar case |
| 62 | data = fill_value if valid_count == 0 else data |
| 63 | # we've computed a single min, max value of type object. |
| 64 | # don't let np.array turn a tuple back into an array |
| 65 | return utils.to_0d_object_array(data) |
| 66 | return where_method(data, valid_count != 0) |
| 67 | |
| 68 | |
| 69 | def nanmin(a, axis=None, out=None): |
no test coverage detected
searching dependent graphs…