Re: RE: assembly
Just thought of something else. If you can sort the sequences you might be
able to do a binary search rather than a sequential search.
----- Original Message -----
From: "Evan Marshall" <evan at net-link.net>
To: "EUforum" <EUforum at topica.com>
Subject: Re: RE: assembly
sequence phl phl = {{{x1,y1},a1},{{x2,y2},a2},...{{xn,yn},an}}
for b = 1 to 256 do
c = phl[b][1][1]
d = phl[b][1][2]
if phl[b][2] = i then
ellipse(phl[b][2],1,{c-2,d-2},{c+1,d+1})
end if
end for
P.S. I had to create variables c and d because when I had the element
directly in the ellipse function, the first y value never changed
(!?).
i.e. {1,2},{4,2}..{10,2},{14,2}
Brian Broker <bkb at cnw.com> wrote:
>
> Evan,
>
> Are you sure you need assembly? Perhaps if you share your bit of
code
> you might be suprised at what optimizations could be made just using
> Euphoria sequence operations...
>
> -- Brian
>
> > I have a bit of code that would be sped up immensely with a bit of
> > assembly. The problem is that I haven't done any assembly
programming
> > since the late-mid '80's. Does any one know where I can find a
simple
> > tutorial on assembly and/or a list of opcodes in hex (or binary).
> > Specifically, I need to load a sequence into memory, check each
> > element, and return a result depending on the status of the
element.
> > The sequence is in the form of
> > {{{x1,y1},a1}},{{x2,y2},a2},...{{xn,yn},an}}
> >
> >
|
Not Categorized, Please Help
|
|