![]() The binder sorts all available volumes first, then it filters out volumes that cannot be bound by processing each volume in a loop and then finds the smallest matching volume by binary search. So, if we process every available volume in a loop, we can also remember the smallest matching one and save us potentially long sorting (and quick binary search). |
||
---|---|---|
.. | ||
options | ||
binder_test.go | ||
controller_base.go | ||
controller_test.go | ||
controller.go | ||
delete_test.go | ||
framework_test.go | ||
index_test.go | ||
index.go | ||
OWNERS | ||
provision_test.go | ||
recycle_test.go | ||
volume_host.go |