(a, manual_expected=None)
| 451 | |
| 452 | |
| 453 | def check_internal_overlap(a, manual_expected=None): |
| 454 | got = internal_overlap(a) |
| 455 | |
| 456 | # Brute-force check |
| 457 | m = set() |
| 458 | ranges = tuple(range(n) for n in a.shape) |
| 459 | for v in itertools.product(*ranges): |
| 460 | offset = sum(s * w for s, w in zip(a.strides, v)) |
| 461 | if offset in m: |
| 462 | expected = True |
| 463 | break |
| 464 | else: |
| 465 | m.add(offset) |
| 466 | else: |
| 467 | expected = False |
| 468 | |
| 469 | # Compare |
| 470 | if got != expected: |
| 471 | assert_equal(got, expected, err_msg=repr((a.strides, a.shape))) |
| 472 | if manual_expected is not None and expected != manual_expected: |
| 473 | assert_equal(expected, manual_expected) |
| 474 | return got |
| 475 | |
| 476 | |
| 477 | def test_internal_overlap_manual(): |
no test coverage detected
searching dependent graphs…