This is the mail archive of the
cygwin-developers@cygwin.com
mailing list for the Cygwin project.
Re: biggest... check-in... ever...
On Tue, 23 Sep 2003, Corinna Vinschen wrote:
> On Tue, Sep 23, 2003 at 10:01:14AM -0400, Christopher Faylor wrote:
> > On Tue, Sep 23, 2003 at 11:47:30AM +0200, Corinna Vinschen wrote:
> > > Wouldn't a binary array search be better
> > >for this? It would drop the need to use gperf, btw.
> >
> > If you can find some kind of binary tree compiler similar to gperf,
> > I'll certainly consider it.
>
> Actually I meant a binary search in an array, not a binary tree.
> How big is the speed advantage of a fairly elaborate solution as
> a hash over a simple sorted array with respect to devices? The
> array would be created from the same dataset you're already defining
> in devices.gperf, it would just have to be always sorted.
>
> Talking about binary trees, isn't gperf also able to create binary
> trees? [dig, dig, dig] The man page talks about using the -S option
> with a very big number so that it creates a binary search using
> switch statements. Sort of a binary tree statementwise... Hmm...
>
> Corinna
What about tries? Although, we don't have trie-gen on Cygwin, do we?
Igor
--
http://cs.nyu.edu/~pechtcha/
|\ _,,,---,,_ pechtcha@cs.nyu.edu
ZZZzz /,`.-'`' -. ;-;;,_ igor@watson.ibm.com
|,4- ) )-,_. ,\ ( `'-' Igor Pechtchanski, Ph.D.
'---''(_/--' `-'\_) fL a.k.a JaguaR-R-R-r-r-r-.-.-. Meow!
"I have since come to realize that being between your mentor and his route
to the bathroom is a major career booster." -- Patrick Naughton