Implement min_by, min_by_key, max_by, and max_by_key #20
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
The implementation isn't exactly elegant, but it compiles.
This was useful to me because I had a list of entities and wanted to get the one closest to a given entity for a simple script, but the only function the std provided for that was
min
, which, when followed by amap
, allowed me to easily get the distance of the closest entity, but not the entity itself.min-by-key
makes that easier.Prior art: https://docs.racket-lang.org/reference/pairs.html#(def._((lib._racket%2Flist..rkt)._argmin))