Reputation
68,533
Next tag badge:
211/100 score
19/20 answers
Badges
6 200 293
Newest
 Enlightened
Impact
~437k people reached

Mar
5
comment How is the Mathematica kernel structured internally, and how does evaluation work?
This question may also be (somewhat) relevant.
Mar
5
comment How does MakeBoxes handle an n-ary operator?
@RandomBits In other words, List @@ Replace[ HoldComplete[x], elem_ :> MakeBoxes[elem, form], {1}] should work just as well here, while being less magical.
Mar
5
comment How does MakeBoxes handle an n-ary operator?
@RandomBits I should have given more explanations. I need to pass each of the arguments of the x sequence to MakeBoxes. I use HoldComplete to avoid their premature evaluation. To evaluate them inside HoldComplete, I use Trott-Strzebonski technique. This is actually an overkill here, I could have just used elem_ :> MakeBoxes[elem, form], and then all these would evaluate at the point when HoldComplete head is changed into List.
Mar
5
comment How does MakeBoxes handle an n-ary operator?
@RandomBits Glad I could help. See also my update on evaluation leaks and the second version. Thanks for the accept. B.t.w., typically it is better to wait for a while before accepting an answer, to encourage others to contribute more answers. You can also accept a different answer at any time later.
Mar
5
revised How does MakeBoxes handle an n-ary operator?
Added a version which does not leak evaluation
Mar
4
answered How does MakeBoxes handle an n-ary operator?
Mar
4
revised How to find the name of the current function
Fixed a renaming issue with deflex
Mar
4
comment How to find the name of the current function
@sebhofer The best I can tell at the moment is what is described in my answer to this question.
Mar
4
revised How to find the name of the current function
Added a warning on the limitations of this approach
Mar
4
answered How to find the name of the current function
Mar
2
comment How can I get Google search results with Mathematica?
Have a look at this answer. Presumably, Google expects you to switch to a newer API.
Mar
2
answered Parallelization of REvaluate[]?
Mar
1
comment Function with custom Options and modified Options for built-in Symbols
Ok, you are right. My fault, then. In some sense, the placement is right in the docs.
Mar
1
comment Function with custom Options and modified Options for built-in Symbols
This does indeed, but this is not what I see in the V9 documentation‌​, where only list of rules is mentioned. I will try to remember to ask why there was such a change.
Mar
1
comment Function with custom Options and modified Options for built-in Symbols
This particular form is not documented (list of functions inside OptionsPattern[]). I wasn't aware of it.
Mar
1
comment Function with custom Options and modified Options for built-in Symbols
This is pretty cool, +1.
Mar
1
answered Function with custom Options and modified Options for built-in Symbols
Feb
28
awarded  Enlightened
Feb
28
awarded  Nice Answer
Feb
24
comment How to accelerate updating some parts of sparse matrices?
I would add this link, where I outlined the general efficiency problem with by-element updates of sparse matrices. You would need a sparse array implementation based on something like binary trees to make updates efficient, I think.