in reply to Re^3: Out of Memory
in thread Out of Memory
Are you sure this is the most efficient way to do this? Seems like to me that its creating a copy of the original string and trying to replace the matches before it outputs the count. (as far as i can tell given reading a quick page on teh TR function) I wouldn't think that would be as memory efficient as the while code... but I don't understand the internals of the while code either, if it instantiates a huge list the interates through them, I can see how that wouldn't be as efficient as teh TR code.
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^5: Out of Memory
by BrowserUk (Patriarch) on Mar 28, 2013 at 19:12 UTC | |
by Michael Kittrell (Novice) on Mar 28, 2013 at 19:31 UTC | |
by BrowserUk (Patriarch) on Mar 28, 2013 at 19:55 UTC | |
by Michael Kittrell (Novice) on Mar 28, 2013 at 22:33 UTC |