Re: Is there an easy way to scan for bits?

it will not be faster because the HLL is C.
It might be faster because the optimizer does a very good job
and is used for C but not for MI. I had the same experience
when coding AES in both MI and C.

----- Original Message -----
From: Steve Richter <srichter@AutoCoder.com>
To: <mi400@midrange.com>
Sent: Thursday, December 20, 2001 9:11 PM
Subject: Re: [MI400] Is there an easy way to scan for bits?


> I'll byte, Why would it be faster in C ?
>
> ----- Original Message -----
> From: "Bob Donovan" <rjd@us.ibm.com>
> To: <mi400@midrange.com>
> Sent: Thursday, December 20, 2001 9:57 PM
> Subject: Re: [MI400] Is there an easy way to scan for bits?
>
>
> >
> > I like Leif's binary tree approach.  Another name for the data structure
> he
> > described is a trie.
> >
> > Bit twiddling in a HLL (like C) might be a "bit" faster than MI.   If you
> > go with C or C++, you should be able to find plenty of online examples.
> >
> > Bob Donovan/Rochester/IBM
> > rjd@us.ibm.com
> >
> >
> > _______________________________________________
> > This is the MI Programming on the AS400 / iSeries (MI400) mailing list
> > To post a message email: MI400@midrange.com
> > To subscribe, unsubscribe, or change list options,
> > visit: http://lists.midrange.com/cgi-bin/listinfo/mi400
> > or email: MI400-request@midrange.com
> > Before posting, please take a moment to review the archives
> > at http://archive.midrange.com/mi400.
> >
> >
>
> _______________________________________________
> This is the MI Programming on the AS400 / iSeries (MI400) mailing list
> To post a message email: MI400@midrange.com
> To subscribe, unsubscribe, or change list options,
> visit: http://lists.midrange.com/cgi-bin/listinfo/mi400
> or email: MI400-request@midrange.com
> Before posting, please take a moment to review the archives
> at http://archive.midrange.com/mi400.
>