Most Available Comparator
The ordering is determined such that more available units "rise to the top", then by least number times seized, then by oldest time last busy
Functions
Link copied to clipboard
Link copied to clipboard
open fun <U : Any> thenComparing(p0: Function<in Resource, out U>, p1: Comparator<in U>): Comparator<Resource>
Link copied to clipboard
Link copied to clipboard
Link copied to clipboard