home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.programming
- Path: sparky!uunet!s5!is1.is.morgan.com!is.morgan.com!berlin
- From: berlin@is.morgan.com (Alexander Berlin)
- Subject: Re: finding 1st one in integer
- Message-ID: <1992Jul22.091151@is.morgan.com>
- Sender: news@is.morgan.com
- Nntp-Posting-Host: chico
- Organization: Morgan Stanley - IS
- References: <Brqu3F.1J4@undergrad.math.waterloo.edu> <1992Jul21.173805.12045@bcrka451.bnr.ca> <14hsk4INNke@rodan.UU.NET> <1992Jul21.165726@is.morgan.com>
- Date: Wed, 22 Jul 1992 13:11:51 GMT
- Lines: 13
-
- In article <1992Jul21.165726@is.morgan.com>, berlin@is.morgan.com (Alexander Berlin) writes:
- |>
- |> Vadim, you are assuming Big Endian, aren't you?
- |> The original article asked for PORTABLE code. ">>=" depends on byte order.
- |> ---
- |> Alex Berlin
- |> berlin@is.morgan.com
-
- As several people pointed, I was wrong here and Vadim's idea will
- perfectly work regardless of byte order for all 32 bit integers.
- ---
- Alex Berlin
- berlin@is.morgan.com
-