Living Cosmos

YouTube – Breastfeeding…at 8..

YouTube – Panda Attacks Tourist.

\ Greatest Common Divisor
\ http://en.wikipedia.org/wiki/Greatest_common_divisor#Using_Euclid.27s_algorithm
\ http://www.complang.tuwien.ac.at/forth/gforth/Docs-html/General-Loops-Tutorial.html

: divide-a-and-b-leaving-b-and-remainder
  TUCK /mod drop ;

: check-for-non-zero-remainder ( r - flag )
  DUP 0> ;

: mygcd ( a b -- c )
  BEGIN
    divide-a-and-b-leaving-b-and-remainder
    check-for-non-zero-remainder
  UNTIL  \ remainder is non-zero
  DROP ; \ the remainder of 0, leaving b

Version with while

\ Greatest Common Divisor
\ http://en.wikipedia.org/wiki/Greatest_common_divisor#Using_Euclid.27s_algorithm
\ http://www.complang.tuwien.ac.at/forth/gforth/Docs-html/General-Loops-Tutorial.html

: divide-a-and-b-leaving-b-and-remainder
  TUCK /mod drop ;

: check-for-non-zero-remainder ( r - flag )
  DUP 0> ;

: mygcd ( a b -- c )
  BEGIN
    divide-a-and-b-leaving-b-and-remainder
    check-for-non-zero-remainder
    WHILE \ remainder is non-zero
      \ set-a-to-b-and-b-to-remainder
  REPEAT
  DROP ; \ the remainder of 0, leaving b

The gforth manual has a completely unreadable definition of how to calculate a base2 logarithm:

Having done some research on the algorithm, I am of the conviction that a real forth way to write this should be:

: mylog2 ( n -- log2n )
  count [ 2/ ] [ 0= ]

And I am confident that by the time I have finished the manual I will be able to do so.

• Data::Nested
• Data::Diver
• Data::DPath

I wonder why the racism on this show is ok.

Who would wish for 2 gay guys and a Chinese kid?

You’re just a suburban White boy who watches MTV cribs

    : nip  A B -> B
    : over A B -> A B A
    : tuck A B -> B A B


    >R  
    R>  
    R@  
    2>R  
    2R>  
    2DUP 
    ROT  
    2OVER  
    2SWAP 

PICK ROLL -ROT

All I did was ask where Doug lived and he throws a knee-jerk reaction: