Jay,

I have played with both of these for a few minutes.   This list amazes 
me.   I turn out some pretty nice looking software that works well and 
is pretty quick.   I look at these two FNs and think that if I wrote 
one, it would take me 50 lines of code.

Compiles to 275,999 bytes and that includes both.   Seems #2 may run 
faster than #1?

  Clever clever stuff.

(To make sure I understood, I made one to quadruplets.    Duh.)


On Jun 11, 2005, at 11:20 PM, Jay Reeve wrote:

>
>
> '~'A
> '                             Runtime : RNTM Lite.INCL
> '~'B
>
> local fn incrementTriplet1(@t as ptr)
> while t.3` == _"Z"
> t.3` = _"A" : t --
> wend
> t.3` ++
> end fn
>
> local fn incrementTriplet2(@t as ptr)
> select _pAtStRetch
> case>t.3`:t.3` ++:_t=16705
> case>t.2`:t.2` ++: t.3`=_t
> case>t.1`:t.1` ++: t.2%=_t
> case t.1`:t.1`=_t: t.2%=_t
> end select
> end fn
>
> dim n$, r
> n = "ZXW Folder"
> for r = 1 to 300 step 2
> print n,
> fn incrementTriplet1(n)
> print n,
> fn incrementTriplet2(n)
> next
>
----
Best Wishes,

George
http://www.pggp.com