(subset, superset, message)
| 386 | ] |
| 387 | |
| 388 | def is_subset(subset, superset, message): |
| 389 | for i in range(len(subset)): |
| 390 | if subset[i] not in superset: |
| 391 | sys.stderr.write("%s error: %s\n" % (message, subset[i])) |
| 392 | return False |
| 393 | return True |
| 394 | |
| 395 | def errors_match(expected, actual): |
| 396 | return (is_subset(actual, expected, "Unexpected") and |
no test coverage detected
searching dependent graphs…