Reputation
6,770
Next privilege 10,000 Rep.
Access moderator tools
Badges
12 47
Newest
 Necromancer
Impact
~54k people reached

1d
comment Adapting “Find and Replace” functionality to work with Patterns
Also I don't want the bounty myself, I want to get a rep of 6667 :). Feel free to edit my answer! It is fine if my rep vanishes.
1d
comment Adapting “Find and Replace” functionality to work with Patterns
@Kuba ahhh, sorry about missing your mail Kuba. My gmail is a total mess right now, ever since I subscribed to some overly active github repository :P. (temporary message)
1d
comment How to find pieces of code responsible for syntax errors?
Here is it is also relevant that we can now "find the string"
1d
revised Adapting “Find and Replace” functionality to work with Patterns
New answer, as I found a way to "get the string"
Apr
15
awarded  Necromancer
Apr
14
comment Make a program that does union of two lists
Ahh, sorry I misread, I will delete :P
Apr
2
comment How to return a string from LibraryLink?
Here is a complete example of the technique showed by Szabolcs (the OP) using C instead of C++.
Apr
2
revised How to sort digits in a string while keeping other characters untouched?
this-> LibraryLink and strings
Apr
2
comment How to sort digits in a string while keeping other characters untouched?
+1 for showing me that FromCharacterCode is fast after I had decided that it wasn't.
Apr
2
answered How to sort digits in a string while keeping other characters untouched?
Mar
31
revised Looking for “Longest Common Substring” solution
Made existence of a mac version more apparant
Mar
19
comment How to evaluate a function on a list until stable?
I think your point about auto compilation is very good and I guess this even works for Table, as I suppose the first argument of Table can only be compiled if it has no side effects, which is its functional use case. I don't fully agree with everything you say, but I guess it is largely a matter of preference for procedural vs functional programming (in MMA). I would like to dive into Haskell one day, where (auto) compilation is much more advanced, giving functionally represented solutions much more speed.
Mar
19
revised How to evaluate a function on a list until stable?
Cleaner motivation of appended code
Mar
17
awarded  Altruist
Mar
16
revised How to evaluate a function on a list until stable?
Removed sillyness
Mar
16
comment How to evaluate a function on a list until stable?
On my machine, your two functions in your edit are about equally fast.
Mar
16
revised How to evaluate a function on a list until stable?
Some code to show Pickett
Mar
16
comment How to evaluate a function on a list until stable?
That difference in speed should be small compared to compiled vs uncompiled code. Also my advice about Append(To) extends to the compiled case, I suppose I will post code to show what I mean. I guess I was silly to say programming functionally is not too efficient in cases like these. Really what I want to say is that procedural code like this is not invalid, especially because of the possibility to compile.
Mar
16
comment How to evaluate a function on a list until stable?
Hey Pickett, thanks for your response. You make some good points. For example I like how you managed to put everything in the body of the For loop and avoided nonsense like variation = threshold+1. I suppose I should have done this but I had a weird preference for While in cases like this. I was about to implement a better functional solution when I saw your edit and I like your use of NestWhileList here. I guess my procedural code should be a bit slower because I have more intermediate definitions and I suppose NestWhileList avoids the need to ... evaluate a bunch of Sows. But...
Mar
16
answered How to evaluate a function on a list until stable?