Best search algorithm to find condition within a range

Albert van der Horst albert at
Sat Apr 25 16:49:07 CEST 2015

In article <5533a77d$0$12993$c3e8da3$5496439d at>,
Steven D'Aprano  <steve+comp.lang.python at> wrote:
>On Sun, 19 Apr 2015 04:08 am, Albert van der Horst wrote:
>> Fire up a lowlevel interpreter like Forth. (e.g. gforth)
>Yay! I'm not the only one who uses or likes Forth!

I'm an author of half a dozen implementations, brand is called
ciforth. Just last Thursday an elaborate test session in Apple.
Expect release 5.2 for Linux Windows and Apple in a few weeks.

I've also published a minimalistic system called yourforth.

>Have you tried Factor? I'm wondering if it is worth looking at, as a more
>modern and less low-level version of Forth.

Chuck Moore has build a 100+ processor chip. I've experimented with
a parallel sieve for primes on the chip. Later Leon Konings and I have
run the same program on a simulator for the greenarray's chip
with 144 processors. Leon has written the simulator in Factor, it is
called Arrayforth. So I've seen some Factor from close up.
I think the system is practical and reliable. The runtime environment
however is a bit unwieldy. Leon is enthusiastic (but he always is)
about the documentation and general working. Factor has a lot of

It is nothing like ciforth however, most faulty ciforth programs end
in "segmentation fault". For 60K (+ 300K library) ciforth buys you an
interpreter, a scripter and a compiler. Unlike most Forth's you can do
    lina -c hello.frt
and then ship the hello program. ( And yes, hello.frt is a one liner
with just one definition, no boilerplate.)
I've solved hundreds of Euler project problems with it, but if
you need really abstract things (like representing "situations"
and counting them using a dict) I generally use Python.

ciforth arrayforth and yourforth are googleable.


Groetjes Albert
Economic growth -- being exponential -- ultimately falters.
albert at spe&ar& &=n

More information about the Python-list mailing list