Reputation
148,377
Next tag badge:
100/100 score
19/20 answers
Badges
18 277 634
Newest
 Enlightened
Impact
~1.7m people reached

Jul
4
revised Converting structured data to a dataset
added 2 characters in body
Jul
4
revised Extracting values from nested rules in JSON data
added 116 characters in body
Jul
4
answered Extracting values from nested rules in JSON data
Jul
3
reviewed Close How can I import JSON object as a nested association?
Jul
3
reviewed No Action Needed How to test for a non--zero rational function?
Jul
3
comment Faster binary Hamming weight for big integers?
@ciao Any problems handling massive integers with that approach? I suppose there are a lot of bignum libraries now but many years ago it didn't seem that simple. Or maybe it was just my lack of skill.
Jul
3
comment Faster binary Hamming weight for big integers?
@Oleksandr Thanks for your work on this. BitShiftLeft is probably an unfair comparison. Should I remove that from this question?
Jul
3
comment Count the sequences in an array
@ciao My f3 is nearly an order of magnitude faster than your Compile code on my machine on the test in my answer. I can't imagine the CPU used makes that much difference. Would you check your results again?
Jul
3
comment Faster binary Hamming weight for big integers?
Some possibly useful methods here: graphics.stanford.edu/~seander/bithacks.html -- I haven't tried to implement any of them yet.
Jul
3
asked Faster binary Hamming weight for big integers?
Jul
3
comment Count the sequences in an array
I pushed it a bit further and it is now 3X faster than f2 so about the same as your code.
Jul
3
revised Count the sequences in an array
faster
Jul
3
comment Count the sequences in an array
I can't compile to C (still!) but I'll trust your timings and give a +1. I updated my answer to squeeze as much as possible from top-level Mathematica code and I think I got close to your clusterFu3 based the ratio of timings.
Jul
3
revised Count the sequences in an array
added 529 characters in body
Jul
3
revised Cluster numbers into n partitions so that each partitions sum is closest to total/n
edited tags
Jul
3
comment Cluster numbers into n partitions so that each partitions sum is closest to total/n
Related: (34952), (69834), (71827), (72071)
Jul
3
comment Count the sequences in an array
@ciao Thanks! By the way which nickname would you prefer I use?
Jul
3
comment Count the sequences in an array
@SquareOne On a packed integer array Join and and Append appear to perform similarly in 10.1.0. What specific code are you using?
Jul
3
comment Count the sequences in an array
@SquareOne Directorial emphasis appears to be strongly in favor of more functionality over good functionality (fast and bug-free). This is a shame. Nevertheless there are improvements being made. SequencePosition is much faster for verbatim (pattern-free) sequences thanks to the low-level-coded GroupTheory`Tools`SublistPosition which it uses in such cases.
Jul
3
comment Positioning axes labels
You can use the shorter FrameTicks -> All with the same effect.