[futurebasic] Re: [FB] Jay's Alphabetic Continuum v.2

Message: < previous - next > : Reply : Subscribe : Cleanse
Home   : October 2000 : Group Archive : Group : All Groups

From: Ruslan Zasukhin <sunshine@...>
Date: Thu, 12 Oct 2000 15:15:26 +0300
on 12/10/2000 10:54, Jay Reeve at jktr@... wrote:

Hi Jay,

> On the bright side, now that it's fixed, the additional 120,000+ words only
> take a time toll of a quarter-second. Here are new sample data from my 240mHz
> G3:
> 
> ==============================================
> File: "bible11.txt"
> €  5,073,934 characters
> €    791,016 total word count
> €     13,066 different words used
> Processing time: 81.92 ticks.  (1.365 seconds)
> ==============================================

In description of alg you say that you get position in array as
    A[a,s,d,f]

This mean for me that you do something like:

    A[ Str[0], Str[1], Str[2], Str[3] ]

i.e. you do 4 access to byte value.

Much faster will be access one time long value:

    A[ Long(Str[0]) ]

This must work as above but faster in N times ...


> 0"0
> =J= a  y
> "

-- 
Best regards,
Ruslan Zasukhin

-------------------------
Paradigma.

e-mail: ruslan@...
web   : http://www.paradigmasoft.com

To subscribe to the Valentina mail list
send a letter to valentina-on@...