On 2018-06-14, at 18:50:01, Robin Vowels wrote:
> Why is everyone afraid to use TRT?
> It is designed for just such a task.
>
> ----- Original Message ----- From: "Charles Mills" <[email protected]>
> Sent: Friday, June 15, 2018 5:40 AM
>
>> Not the answer to your question but I don't think "TRT performs badly."
>>
Probably good points. And any empirical comparison would probably be
model-sensitive.
On 2018-06-14, at 18:44:06, Robin Vowels wrote:
>
> How many words can you fit into 16 characters?
>>
I Understand Ed's suggestion involves repeating after 16 characters,
akin to using TRT in a loop.
On 2018-06-14, at 16:05:54, Ed Jaffe wrote:
>
> Use VL to load 16 one-byte search arguments into (for example) V0
> Use VLL to load 16 bytes (or how ever many remain if <16) of the string into
> (for example) V1
> Use VFAEB to find the first matching byte e.g., VFAEB V1,V1,V0,1
> If CC=not found, adjust string pointer up by 16 and remaining length down by
> 16 and loop back to the VLL (or exit if none left)
> Otherwise, use VLGVG to get the matching ELE index from V1 into (for example)
> R15
> Point to matching byte in the string by adding index value to the current
> string pointer e.g., LA R1,0(R15,1R1)
>
I fear my assimilation of PoOps stalled around XA. So probably ignorant
questions:
Suppose words are separated by an arbitrary mixture of an arbitrary number of
<TAB> and <SP>, e.g.
" chicken Flamingo Ostrich Sparrow Turkey Wren "
Is there a way to skip over the terminators to the first non-terminator,
i.e. "c"? Perhaps a "don't find" option for VFAEB? (Something like the
(No)Match option to Rexx VERIFY()?)
Oops! From PoOps:
Proceeding from left to right, the elements of the second operand are
compared with the corresponding elements of the third operand and
optionally with zero.
"Corresponding element" is the problem.
If the second operand is <TAB><SP><TAB><SP><TAB><SP><TAB><SP>
and the third operand is <SP><TAB><SP><TAB><SP><TAB><SP><TAB>
I believe I'll never get the desired match. TRT seems to remain
the winner.
-- gil
