How do I get to see the full code for this function?
The function is cut off after the 5th line.

//Search and replace:
String.prototype.searchreplace=function(find,replace) {
var string=this
var counter
while (counter
???????
Thanks, Alex

it's there now.

What about the much simplified:


String.prototype.searchreplace=function(find,replace) { var result = this.split(find); return this.join(replace); }


Though I dont know how much faster this would be.

top prototype flashguru...

just added an optional number of replaces...

// iReplace is the number of replaces you can do, if omited or zero then will replace all... String.prototype.replace = function(find, replace, iReplaces) { counter = i = 0; string = String(this); while (counter<string.length) { start = string.indexOf(find, counter); if (start == -1) { break; } else { before = string.substr(0, start); after = string.substr(start+find.length, string.length); string = before+replace+after; counter = before.length+replace.length; i++; if (i == iReplaces) counter = string.length; } } return string; }

I did a speed test: 1) big_mo_mine's method; 2) flahguru's (without BHall's string rewrite); 3) flashguru's (with BHall's string rewrite); 4) big_mo_mine's method (WITH BHall's string rewrite);

from fastest to slowest:
4
3
1
2

the string rewrite helps alot. Big_mo_mine's method is much cleaner and is indeed faster.

String.prototype.replaceIt=function(find,replace) { var result = this.split(find); return result.join(replace);}

Typo in MoMad's comment. This works:

String.prototype.searchReplace=function(find,replace) { var result = this.split(find); return result.join(replace); }

Please excuse me for asking a daft question, but I've never actually used this syntax:

String.prototype.searchreplace=function()


How do I adapt it to my code?

thanks.
David

This one is pretty nice... :-)
And much faster then other ones. thanks.

PJ

String.prototype.Replace = function(what, bywhat) {
while (this.indexOf(what)>-1) {
var tmp = this.split(what);
this = tmp.join(bywhat);
}
return (this);
};

I would recommend you this way because if there is ever a duplication
after one cycle you may get bad results with the previous method.
Just a while() added.

Wow, have you folks ever heard of reserved words? Using variables named things like "string" or "start" is generally a bad idea. Also, the counter var below needs to be initialized to 0 for that while condition to make sense...maybe it worked in an old version of Flash, but it doesn't work now. Here's the above code fixed...it works okay now in Flash MX 2004:

String.prototype.searchreplace=function(finder,replace) { var daString=this var counter=0; while (counter<daString.length) { var startPos = daString.indexOf(finder, counter); if (startPos == -1) { break; } else { var before=daString.substr(0,startPos) var after=daString.substr(startPos+finder.length,daString.length) daString=before+replace+after var counter=before.length+replace.length } } return daString; }

Here's a recursive method if you're into that...I've just grown not to trust 'while' statements in actionscript and found this to work just as well (for smaller strings at least). If you're going to be using this for larger strings I would recomend adding in a 'counter' for the '.indexOf' and pass it along with the recursion.


findReplace = function( _search, _find, _replace ) { var _location = _search.indexOf( _find ); if( _location != -1 ){ var _sub1 = _search.substr( 0, _location ); _location += _find.length; var _sub2 = _search.substr( _location, _search.length ); var _newString = _sub1 + _sub2; findReplace( _newString, _find, _replace ); } else{ return( _search ); } }

would there be a way to get this kind of function to work in the context of an l-system equation, where you define simple rules for string replacement, and perform them simultaneously?

I use this page as a reference, http://www.mh-portfolio.com/L_Systems/ls2.html

It seems at first glance that the functions on this page wouldn't suffice to get results like the ones on the page above, but i'm not quite sure. I don't know much about l-systems, I'm just trying to get started understanding them, and there is little info on the web about specific algorithms.

Thanks for your help,

What about this?

S_yourString = S_yourString.split("\\").join("/");

That should do the trick.

Jordan

thanks, i'll try that out...