mirror of
https://github.com/k3s-io/kubernetes.git
synced 2025-09-30 14:46:16 +00:00
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).