Forth Academy (;-))).P.
- PŮVODNÍ ZPRÁVA -
Od: "Kalus Michael"
Komu: "Everything around amforth"
Předmět: Re: [Amforth-devel] Speed analysis.. "one"
Datum: 3.4.2011 - 12:38:13
>
>
>
> Am 03.04.2011 um 12:27 schrieb D Nyberg:
>
> &g
Am 03.04.2011 um 12:27 schrieb D Nyberg:
> I think you would also see a huge speed increase if you defined
> constant
> named "1" and tried it again too. That used to be standard in F79 and
> 83, though it was more about size than speed.
>
> On 4/3/2011 4:16:17 AM, pito ([email protected]) wrote:
asic
> clean amforth 4.2 compilation. P
>
> - PÙVODNÍ ZPRÁVA -
> Od: "Kalus Michael"
> Komu: "Everything around amforth"
>
> Pøedmìt: Re: [Amforth-devel] Speed analysis..
> Datum: 3.4.2011 - 10:04:25
-
amforth 4.2 compilation. P
- PŮVODNÍ ZPRÁVA -
Od: "Kalus Michael"
Komu: "Everything around amforth"
Předmět: Re: [Amforth-devel] Speed analysis..
Datum: 3.4.2011 - 10:04:25
> Hi.
>
> pito wrote:
> > Hi, when running the amforth4.2 in simulator
> > I
Hi.
pito wrote:
> Hi, when running the amforth4.2 in simulator I've observed
> following:
> a) "1 1 + ." takes 42sec to calculate
> b) "1000 1000 3000 + - ." takes 60sec to calculate.
> Does it mean the amforth spends most of the time with tokens lookup?
Interpreting a commandline speeds up if yo
pito wrote:
> Hi, when running the amforth4.2 in simulator I've observed
> following:
> a) "1 1 + ." takes 42sec to calculate
> b) "1000 1000 3000 + - ." takes 60sec to calculate.
> Does it mean the amforth spends most of the time with tokens lookup?
The dictionary is always searched first. A numb
