Re: Elementary but surprisingly difficult.
- From: Slava Pestov <slava@xxxxxxxxx>
- Date: Sat, 24 May 2008 15:23:29 -0700 (PDT)
On May 24, 4:36 pm, Bernd Paysan <bernd.pay...@xxxxxx> wrote:
: uniquify ( addr u -- addr u' )
over >r bounds dup dup c@ 2swap 1+ ?DO
I c@ tuck <> IF swap 1+ 2dup c! swap THEN LOOP
drop r> swap over - ;
This is why stack-based languages have a reputation of unreadability.
Slava
.
- Follow-Ups:
- Re: Elementary but surprisingly difficult.
- From: Doug Hoffman
- Re: Elementary but surprisingly difficult.
- From: Bruce McFarling
- Re: Elementary but surprisingly difficult.
- References:
- Elementary but surprisingly difficult.
- From: Albert van der Horst
- Re: Elementary but surprisingly difficult.
- From: Slava Pestov
- Re: Elementary but surprisingly difficult.
- From: Bernd Paysan
- Elementary but surprisingly difficult.
- Prev by Date: Re: Elementary but surprisingly difficult.
- Next by Date: Re: Elementary but surprisingly difficult.
- Previous by thread: Re: Elementary but surprisingly difficult.
- Next by thread: Re: Elementary but surprisingly difficult.
- Index(es):
Relevant Pages
|