bottlenecks :)
What do you do when your bottlenecks are
peek()
poke()
and_bits()
or_bits()
I am doing peek() and poke() on a maximize
area of 320 bytes at a time.
I am doing and_bits and or_bits on 2-D sequences.
The max size of the 2-D sequences is 320x200.
similiar in shape as:
sequence seq
seq = repeat(repeat(0, 320), 200)
my and_bits routine is thus:
all sequences are 2-D SUCH AS:
{{1, 2}, {3, 4}}
and_bits({0's, 255's,...}, {0 to 255,...})
or_bits({0 to 255,...}, {0 to 255,...})
{0's,255's} = a sequence that has only 0's and 255's
{0 to 255,...} = a sequence that has many values
of which each value can be
anything from 0 to 255.
I am not use to thinking of something as fast as these
commands as being bottlenecks.
Any help would be appreciated.
--Lucius Lamar Hilley III
-- E-mail at luciuslhilleyiii at juno.com
-- I support transferring of files less than 60K.
-- I can Decode both UU and Base64 format.
|
Not Categorized, Please Help
|
|