feat(collections): add minWith

[majidsajadi]

This PR adds minWith to the collections module.

[LionC]

That is actually really nice - it is a lot more efficient than sorting, because it does not need a copy (which sort needs if you do not want to mutate) and it has a complexity of O(n), while sorting is O(n * log n).

I initially didn't realize that when making the initial proposal and glancing over those functions, but that makes a lot of sense. I will add a review tomorrow.

[LionC]

See my new review on maxWith which applies here as well

[kt3k]

@majidsajadi LGTM. Thanks!

[kt3k]

Side note: This should be useful when the comparator is very complex (like the below) and can't be rewritten with minBy easily.

minWith(array, (a, b) => {
  if (a.foo !== b.foo) {
    return a.foo - b.foo;
  }

  if (a.bar !== b.bar) {
    return a.bar.length - b.bar.length;
  }

  return a.baz - b.baz;
});