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]

Reply via email to