Replies: 1 comment · 1 reply
-
|
I tend to use |
Beta Was this translation helpful? Give feedback.
-
|
Thanks for the quick responses everywhere! 🙂 I still don't fully understand the guiding principle in this codebase on deciding between having features duplicated across modules (maintenance burden) or relying on conversions between representations to use functions from other modules (potential performance tradeoff), so I'm not entirely sure when to suggest adding a function that already exists somewhere else to another module, but since this is not only just in a separate module, but in an entirely separate library, I think that it is worthwhile having a version in here as well. 👍 |
Beta Was this translation helpful? Give feedback.
Uh oh!
There was an error while loading. Please reload this page.
-
One utility function commonly found in the standard libraries of other languages allows the retrieval of a minimal or maximal element. (A separate
min_byis not necessary, as it can be achieved byFun.flip-ping the comparator function.)Currently the quick & dirty way to achieve this is sorting the list and taking the head element, but that is wasteful in terms of resources if only a single extreme element is needed to be found.
Is this be something you would consider adding to the library? If yes, I'll try to prepare and submit a PR with an implementation, tests and docs.
Beta Was this translation helpful? Give feedback.
All reactions