Path: utzoo!attcan!uunet!lll-winken!ames!mailrus!tut.cis.ohio-state.edu!rutgers!cmcl2!adm!smoke!gwyn From: gwyn@smoke.BRL.MIL (Doug Gwyn ) Newsgroups: comp.unix.questions Subject: Re: Bit counting Message-ID: <9397@smoke.BRL.MIL> Date: 16 Jan 89 16:00:21 GMT References: <1207@ncar.ucar.edu> <7825@boring.cwi.nl> Reply-To: gwyn@brl.arpa (Doug Gwyn (VLD/VMB) ) Organization: Ballistic Research Lab (BRL), APG, MD. Lines: 5 In article <7825@boring.cwi.nl> aeb@cwi.nl (Andries Brouwer) writes: > a &= (a-1); Such algorithms should use unsigned integers, to avoid possible overflow problems on certain bit patterns.