Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

A "idiomatic" implementation variant of Findminmax #1

Open
wants to merge 3 commits into
base: findminmax
Choose a base branch
from

Conversation

jd-foster
Copy link

Hi Seth, Based on your suggestion, here is a PR identical to JuliaMath#62. It should help to view the diff against your PR branch. There are hopefully some features here that could be merged. I was impressed by your approach that mirrors Julia Base code style, but the reason I put this together was that I couldn't understand how to debug the CI error, and it might be helpful for others in the future to read a more "elementary" code style.

The approach taken in this PR is to adhere more closely to how NaNMath already does things, namely only support AbstractFloat iterables, including no missing support. The extension to AbstractDict and NamedTuple is somewhat of a (worthwhile) departure already from the existing functions of NaNMath, so we're careful about being explicit about what can be accepted.

@jd-foster jd-foster changed the title A "idiomatic" implementation varianat of Findminmax A "idiomatic" implementation variant of Findminmax Sep 2, 2022
@jd-foster
Copy link
Author

Not sure if you have any thoughts on this; strengths or weaknesses?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants