This is exactly what I did in my original implementation, but the only
real way of testing the efficient would be via profiling the method for
each implementation, has anyone tried this?
On Thu, 16 Mar 2000, Brad Giaccio wrote:
[snip]
> But to avoid all this the code as presented calculates the number of
> escapes to be caluclated
> char [] array = new char[length + escapeCount];
> int index;
> for (int i = 0; i < length; i++) {
> // do switch here and just to insertion into array here
> }
[snip]
- Wanted: Efficient String Escape Method Paul Kinnucan
- Re: Wanted: Efficient String Escape Method Mark Gibson
- Re: Wanted: Efficient String Escape Method Paul Kinnucan
- Re: Wanted: Efficient String Escape Method Ralf Nieser
- Re: Wanted: Efficient String Escape Method Brad Giaccio
- Re: Wanted: Efficient String Escape Method Phillip Lord
- Re: Wanted: Efficient String Escape Me... Brad Giaccio
- Re: Wanted: Efficient String Escap... Phillip Lord
- Re: Wanted: Efficient String Escap... Mark Gibson
- Re: Wanted: Efficient String E... Silvio Macedo
- Re: Wanted: Efficient String E... Silvio Macedo
- RE: Wanted: Efficient String Escape Method David Hay
- RE: Wanted: Efficient String Escape Method Paul Kinnucan
- Re: Wanted: Efficient String Escape Method Paul Kinnucan
