Determine the outer bin edges to use, from either the data or the range argument
(a, range)
| 296 | |
| 297 | |
| 298 | def _get_outer_edges(a, range): |
| 299 | """ |
| 300 | Determine the outer bin edges to use, from either the data or the range |
| 301 | argument |
| 302 | """ |
| 303 | if range is not None: |
| 304 | first_edge, last_edge = range |
| 305 | if first_edge > last_edge: |
| 306 | raise ValueError( |
| 307 | 'max must be larger than min in range parameter.') |
| 308 | if not (np.isfinite(first_edge) and np.isfinite(last_edge)): |
| 309 | raise ValueError( |
| 310 | f"supplied range of [{first_edge}, {last_edge}] is not finite") |
| 311 | elif a.size == 0: |
| 312 | # handle empty arrays. Can't determine range, so use 0-1. |
| 313 | first_edge, last_edge = 0, 1 |
| 314 | else: |
| 315 | first_edge, last_edge = a.min(), a.max() |
| 316 | if not (np.isfinite(first_edge) and np.isfinite(last_edge)): |
| 317 | raise ValueError( |
| 318 | f"autodetected range of [{first_edge}, {last_edge}] is not finite") |
| 319 | |
| 320 | # expand empty range to avoid divide by zero |
| 321 | if first_edge == last_edge: |
| 322 | first_edge = first_edge - 0.5 |
| 323 | last_edge = last_edge + 0.5 |
| 324 | |
| 325 | return first_edge, last_edge |
| 326 | |
| 327 | |
| 328 | def _unsigned_subtract(a, b): |
no test coverage detected
searching dependent graphs…