Path: csiph.com!usenet.pasdenom.info!dedibox.gegeweb.org!gegeweb.eu!nntpfeed.proxad.net!proxad.net!feeder1-1.proxad.net!ecngs!feeder2.ecngs.de!newsfeed.freenet.ag!news2.euro.net!newsgate.cistron.nl!newsgate.news.xs4all.nl!post.news.xs4all.nl!not-for-mail Return-Path: X-Original-To: python-list@python.org Delivered-To: python-list@mail.python.org X-Spam-Status: OK 0.001 X-Spam-Evidence: '*H*': 1.00; '*S*': 0.00; 'python3': 0.05; 'test,': 0.05; 'bits': 0.07; 'subject:Python3': 0.09; 'subject:set': 0.09; 'decent': 0.16; 'equivalents': 0.16; 'integers,': 0.16; 'message- id:@earthlink.net': 0.16; 'operation.': 0.16; 'received:dsl.mindspring.com': 0.16; 'subject:bit': 0.16; 'integer': 0.17; 'tests': 0.18; 'bit': 0.21; 'logical': 0.22; "i'd": 0.22; 'header:User-Agent:1': 0.26; 'operations,': 0.27; 'correct': 0.28; 'this?': 0.28; 'probably': 0.29; "i'm": 0.29; 'implement': 0.32; 'to:addr:python-list': 0.33; 'there': 0.35; 'but': 0.36; "i'll": 0.36; 'drop': 0.37; 'to:addr:python.org': 0.39; 'union': 0.66; 'light-weight': 0.84 Date: Thu, 25 Oct 2012 07:47:58 -0700 From: Charles Hixson User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:10.0.7) Gecko/20120922 Icedove/10.0.7 MIME-Version: 1.0 To: python-list@python.org Subject: bit count or bit set && Python3 Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit X-BeenThere: python-list@python.org X-Mailman-Version: 2.1.15 Precedence: list List-Id: General discussion list for the Python programming language List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Newsgroups: comp.lang.python Message-ID: Lines: 16 NNTP-Posting-Host: 2001:888:2000:d::a6 X-Trace: 1351176984 news.xs4all.nl 6922 [2001:888:2000:d::a6]:52443 X-Complaints-To: abuse@xs4all.nl Xref: csiph.com comp.lang.python:32131 In Python3 is there any good way to count the number of on bits in an integer (after an & operation)? Alternatively, is there any VERY light-weight implementation of a bit set? I'd prefer to use integers, as I'm probably going to need thousands of these, if the tests work out. But before I can test, I need a decent bit counter. (shift, xor, &, and | are already present for integer values, but I also need to count the number of "true" items after the logical operation. So if a bitset is the correct approach, I'll need it to implement those operations, or their equivalents in terms of union and intersection.) Or do I need to drop into C for this? -- Charles Hixson