home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!mcsun!news.funet.fi!hydra!klaava!wirzeniu
- From: wirzeniu@klaava.Helsinki.FI (Lars Wirzenius)
- Newsgroups: comp.programming
- Subject: Re: finding 1st one in integer
- Message-ID: <1992Jul24.145254.27713@klaava.Helsinki.FI>
- Date: 24 Jul 92 14:52:54 GMT
- References: <1992Jul21.173805.12045@bcrka451.bnr.ca> <1992Jul21.150033@is.morgan.com> <1992Jul22.121859.12676@public.sub.org>
- Organization: University of Helsinki
- Lines: 10
-
- peterk@public.sub.org (Peter Kittel) writes:
- >Why tables? We *have* bit operators in C!
-
- Speed. Tables of suitable sizes are the best alternative if you want
- portable speed (the same code should work as fast as possible on as many
- machines as possible), and in fact is the fastest possibility on many
- machines. This is true for many other bit counting operations as well.
-
- --
- Lars.Wirzenius@helsinki.fi
-