A fair RWLock with timeouts and a capacity.

Obeys the typical rules about RWLocks

1. If a writer holds the lock, only a single writer is in the lock.
2. If a writer does not hold the lock, any number of readers may hold the

The lock favors writers, but readers are not starved, and the next batch of readers will be served in before any waiting writers in FIFO order (when a writer releases the lock).

BoundedRWLock is referenced in 1 repository