(o: A)
| 468 | * then optimizes the final hash. |
| 469 | * |
| 470 | * **Gotchas** |
| 471 | * |
| 472 | * A hash is not an equality proof. Because this implementation uses XOR, |
| 473 | * reordered inputs can produce the same hash. |
no test coverage detected
searching dependent graphs…