Reputation
Next tag badge:
209/100 score
19/20 answers
Badges
6 195 286
Newest
 Nice Answer
Impact
~418k people reached

May
8
answered Functions vs. patterns
May
5
awarded  Good Answer
May
4
comment Select certain items from nested list
@TheToad Oh no, by all means keep it as long as you want :). It's fun to everyone. I wasn't really serious.
May
2
comment Select certain items from nested list
@TheToad Even though the origins of the name change are clear, it will take (me) some time to get used to. Is it planned as permanent?
Apr
29
comment Dataset with more than 16 “columns”?
@StefanR Consider making this an answer - it looks like a good one (to me at least).
Apr
26
comment Find and return the key with lowest value in association list
+1. I think, you should definitely keep it.
Apr
24
comment Metaprogramming in Mathematica
@ciao Thanks, I've just received your bounty :). But I feel uneasy about this, still. You know, I am ready to return back several times as many points, if that would help keep you on the site. We've all been through the frustration regarding the inadequacy of rep. My own take is that since some point, I started to simply ignore rep. The fact is, this site has a ton of quality answers, and people like us move it forward to make even better. I believe that we have what matters the most: strong, nice and active community, and tons of really useful stuff exposed already or waiting to be exposed.
Apr
23
comment Metaprogramming in Mathematica
@ciao And thanks for your intent regarding a very generous bounty! But as I said, I would personally much appreciate you staying in the community (if possible of course), and many others surely would also.
Apr
23
comment Metaprogramming in Mathematica
@ciao Glad to hear that! By the way, may I ask why you decided to leave this community (if that is so)? Your contributions and participation here are very valuable. It would be a great pity if you leave.
Apr
23
awarded  Nice Answer
Apr
22
comment Partial reload of definitions from package
One thing you can do is to develop in the FrontEnd, and have your cell context set to whatever your package's private context is (Foo`Private` ). You can then execute it inside BeginPackage["Foo`"] - EndPackage[]. In such a case, you will automatically patch your loaded code, and only with the changes you actually make. When the code is complete, you can move it from FrontEnd to the file.
Apr
22
comment Partial reload of definitions from package
This is probably possible, and an interesting (and important) problem, but this isn't very easy to make robust. Basically, one needs both static analysis on the code, and dynamic analysis on the loaded version, and then a kind of a diff that would tell what the changes are, and then functionality to properly load those changes. We have bits and pieces needed for this scattered in the answers on this site, but this doesn't strike me as a simple project. I will keep it in mind but can't give a good answer right away. You may have luck with some partial solutions.
Apr
22
comment Generic templating system
No, there isn't currently any documentation. This is a new development, it only exists in version 10. It is currently mostly used by Dataset, but can have uses on its own too.
Apr
22
answered Generic templating system
Apr
17
comment Can we say that “all functions in Mathematica are some kind of pattern-matching-and-replacement procedures”?
Actually, I also forgot compiled functions, as the posted answer reminded me (but compiled functions are relatively rarely created at runtime, unlike pure functions).
Apr
17
comment Can we say that “all functions in Mathematica are some kind of pattern-matching-and-replacement procedures”?
One notable example where this is not the case are pure functions. But, unless I am forgetting something, it seems to indeed be the only one.
Apr
15
comment Combining memoization and SlotSequence
@rasher Comments are not supposed to be actual answers. But they can provide a light-weight way to answer or give hints. If someone takes a comment of someone else and posts this (or similar) as an answer, this is totally fine, I think.
Apr
15
comment Combining memoization and SlotSequence
You also could use something like this: ClearAll[p]; p[x_] := p[x] = b^0*a[x]; p[fst___, x_, y_] := p[fst, x, y] = p[fst, x] + b^(Length[{fst}] + 1)*a[x + y].
Apr
14
awarded  Enlightened
Apr
14
awarded  Guru