Re: Pointer vs. BIF performance (was: Getting into pointers)

David,

Albert may well be right and the XLATE method will be slower.

However, whichever method you use, bear in mind what I said about DBCS
shift-in & shift-out. I don't know if you use DBCS at all, but if this
routine would ever be used over DBCS data, you should take it into account).

To use Charles's code:

charPtr = %addr(SRCDATA);
strLen = %len(%trimr(SRCDATA));
for p = 0 to strLen;
if char < x'40' and char <> x'0E' and char <> x'0F;
char = *blank;
endif;
charPtr += 1;
endfor;

Rory