28,377 reputation
260136
bio website
location Argentina
age
visits member for 2 years, 11 months
seen 57 mins ago

My email:

StringTake[ ExampleData[{"Text", "Hamlet"}] <> "@", List /@ {45, 114, 132, 134, 138, 142, 2933, 2939, -1, 2994, 3184, 3189, 3213, 3305, 3364, 3427, 3446, 3473}] // StringJoin


Jun
19
comment Emulating Sequence with my own function
Perhaps there's another internal sequence-like thing used that evaluates to Sequence in the end, but flattens itself out even in HoldComplete. No idea, but I think we are all guessing big about internals that probably won't ever be relevant :P
Jun
19
comment Emulating Sequence with my own function
I almost second @Mr.Wizard except for the part where Unevaluated has a role (which I just don't have any hunch at all). I don't think Leonid's example proves that in his solution there's an internal use of Sequence. I imagine that when the replacer builds the expression :>rhs, if it a sequence, it has no other choice than to wrapping it in Sequence before putting it wherever it should be put. But that doesn't apply to his proposed solution, it's not a f[sth___]:=sth definition but something like ff[2, 3] /. ff[x___] :> HoldComplete[x]which seems to avoid Sequence
Jun
18
comment Are persistent variable values after the kernel is stopped possible?
I use backticks to write code. If you want to know more, when you're writing a comment there's a help link that leads you to some info, and then a Learn more link that leads you to loads more
Jun
18
comment Emulating Sequence with my own function
I mean, you've started suggesting changes to fix things in comments
Jun
18
comment Emulating Sequence with my own function
Is the code up to date?
Jun
18
comment Implementing a function which generalizes the merging step in merge sort
@LeonidShifrin, actually, it would take a little code modification because I swap the lists around in each call
Jun
18
revised Implementing a function which generalizes the merging step in merge sort
added 825 characters in body
Jun
18
comment Implementing a function which generalizes the merging step in merge sort
@LeonidShifrin, feel free to check out the edit and comment on it. It's still not the fastest possible, but have I avoided the quadratic complexity?
Jun
18
comment Implementing a function which generalizes the merging step in merge sort
@MichaelWijaya then let's keep this going :). I just edited
Jun
18
revised Implementing a function which generalizes the merging step in merge sort
added 825 characters in body
Jun
18
revised Calling Table with custom iterator
added 10 characters in body
Jun
18
revised Implementing a function which generalizes the merging step in merge sort
deleted 57 characters in body
Jun
18
answered Implementing a function which generalizes the merging step in merge sort
Jun
18
comment Are persistent variable values after the kernel is stopped possible?
It would be nice to add to your answer a use case of your idea to save and load with a couple of buttons some saved variable. For example, SetAttributes[dataSaver, HoldFirst]; dataSaver[sym_] := DynamicModule[{bck = 0}, Row[{Button["Save " <> ToString@Unevaluated@sym <> " ownvalues", bck = sym], Button["Load " <> ToString@Unevaluated@sym <> " ownvalues", sym = bck]}], Initialization :> (sym = bck)]
Jun
18
awarded  Enlightened
Jun
18
awarded  Nice Answer
Jun
18
comment Is it possible to insert arguments into functions when they're used like Function@ or //Function?
@Mr.Wizard, father's day in here ;)
Jun
18
answered Is it possible to insert arguments into functions when they're used like Function@ or //Function?
Jun
18
revised New display format needed: “drag box”
edited body
Jun
18
comment HoldFirst and inserting additional options into a Grid of Graphics
@Verbeia, yeah, I was referring to this code and your question... If I'm not reading it wrong, the only Unevaluated is in Map[Hold, Unevaluated[m], {2}]. That's an Unevaluated that gets automatically stripped off, and Map doesn't even see it, so it isn't there when it's Cases turn to act. Contrats on your code's working :)