OpenEuphoria

Re: bottlenecks :)

• Posted by Robert Craig <robert_craig at COMPUSERVE.COM> Mar 27, 1997
• 943 views

David Cuny writes:

<several plausible suggestions for speeding up Hilley's code>

> I haven't tried running or timing this, but often another option you have is
> to build a table lookup for your functions (ANDs and ORs). It would be 256 *
> 256 bytes long per table, but once built, you could use the two value to
> index into the table. For example, something like this (i haven't bothered
> to test the code):

I really doubt that this will buy you anything.
and_bits, or_bits etc. are really quite fast. They're
on a par with + or - of integers. They're probably
slightly faster than a single subscript operation on a sequence,
let alone two subscript operations.

Mr. Hilley: I would suggest that before you try
any radical solutions, such as suggested by David,
that you first put "with profile_time" at the top
of your main .ex file, and let us know which statements
have the highest percentages. How do you know that
bitwise operations and peek/poke are the "bottleneck"?


Regards,
  Rob Craig
  Rapid Deployment Software

P.S. The Euphoria Web page has not been accessible
for the past 2 days due to CompuServe's "ourworld"
server being broken again. I sent a nasty message to CompuServe
and we're preparing to move the page and files over to AOL.
I'll let you know when it's ready. We'll probably maintain
both the CompuServe and the AOL URL's for Euphoria, with almost
all the files and pages being hosted on AOL. It's my impression
that AOL will provide a more reliable service, for Web pages at least.
The new URL will be: http://members.aol.com/FilesEu/
but it won't be ready for a day or so.