-
Notifications
You must be signed in to change notification settings - Fork 3
speedup isless productsector #3
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
Conversation
Actually, it is simpler than that; there is no such recursive structure. The order is just in terms of increasing total Manhattan distance, and within the same Manhattan distance it is simply lexographic ordering of the multidimensional index. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I'm not sure I fully understand the implementation, but that sounds reasonable to me 🙃
Codecov ReportAll modified and coverable lines are covered by tests ✅
|
I am not quite sure why JET is complaining on Julia 1.11.1. I won't have much time to look into it until later today. |
Ok I fixed the JET complaints by adding some type restrictions/specialisations. It seems very un-Julian that this is necessary, but I guess that for now it is without harm. |
Also, I don't know why Julia 1.10 ubuntu-latest x64 CI is not running/reporting. Is this some rule you set up @lkdvos ? |
Rather than computing the Manhattan index for defining
isless
, use that the Manhattan index is increasing in such a way that multidimensional indices are sorted first according to total manhattan distance to the origin, then among those with fixed total manhattan distance, sorted according to manhattan distance of the first N-1 indices, and so forth.