I have no figures- but consider the following: TRT does a lockup for each and every char until terminating char is found or the maximum length is reached- the lockup is done against a table of 256 char.
SRST does a check of each char against a single char (plus the termination char). I would expect SRST to be faster - but have no data to prove it. actually - to prove the fact that either is faster it would need more than just a loop of a million TR(e) vs SRST and I can hardly imagine anyone having the time to really do this kind of excercise. Martin Trübner; everything around "PoOps of z/arch"
