Python utility to find the fastest combination of bin refine factors

[manodeep]

Essentially the same as #91 as fixed in commit 3478f63. That commit simply needs to be copied over to all other extensions. Would be an ideal issue to solve for a newcomer to the repo.

Theory

• DD
• DDrppi
• DDsmu
• wp
• xi
• vpf

Mocks

• DDrppi_mocks
• DDtheta_mocks [Add find_fastest_DDtheta_mocks_bin_refs() function to Corrfunc/mocks/DDtheta_mocks #216]
• DDsmu_mocks
• vpf_mocks

For Advanced Users

• Implement a decorator that can be applied to any of the clustering functions. This decorator would set up a triple nested loop over x/y/z-binref and runs the underlying function (passing all the parameters through). The only parameters for this decorator would be the maxbinref, nrepeats and return_runtimes. This decorator can then be applied to all remaining clustering statistics (i.e., the functions without dedicated helper routines)

[kakirastern]

Hi @manodeep I would like to try out this issue, to get myself familiar with this repo

[kakirastern]

But first of all due to the date of the original post (from 2016), I would like to check if this is still an issue.

Some background: (I have been successful in installing the software to my MacBook with clang8 I installed after purchasing the laptop, and have tested the software on it, so no issue there.) As an aside, I am looking for an issue to prepare me for the n-way matcher idea for GSoC this year. As I am new to this repo, I am thinking if this is still open then I can begin working on it.

[manodeep]

Hi @kakirastern - sure thing - please go ahead. I would recommend creating one for the Corrfunc/mocks/DDtheta_mocks to get yourself familiar with calculations with on-sky angular separations.

[manodeep]

CC @parejkoj @bsipocz

[kakirastern]

Thanks @manodeep! I will begin work on the issue this weekend.

[kakirastern]

@manodeep I would like to follow up on this issue with additional PRs for the remaining extensions and for the implementation of the proposed decorator.

[kakirastern]

Also, would like to know if there is any recommended way to approach each of the remaining tasks in this issue? That is, is there any recommended order for their completion?

[manodeep]

@kakirastern Thanks for your continued interest - your contributions are very welcome.

Let's go for the advanced method - that will have several benefits:

• reduces the total amount of duplicated code
• will extend the solution to other pair-counters that may be added in the future
• (likely) exposes you to decorators - a very powerful python programming technique

Since this contribution will be a little more advanced, I am happy to guide you through the process. For starters, here is a primer on decorators.