Property-based test for critical scheduling logic.
- The structure is sound if and only if all hold true:
- A hash can be used to retrieve availability for the time slot represented by the hash.
- For all IDs representing those with availability within the given date range, the ID along with the hash representing a given time slot can be used to verify that the ID is listed in the given time slot.
- The algorithm used to generate hashes that represent time slots is correct if and only if all hold true:
- The algorithm is referentially transparent.
- No two different time slots will produce the same hash.