Path: csiph.com!usenet.pasdenom.info!weretis.net!feeder1.news.weretis.net!feeder.erje.net!newsfeed.xs4all.nl!newsfeed6.news.xs4all.nl!xs4all!post.news.xs4all.nl!not-for-mail
Return-Path: <python-python-list@m.gmane.org>
X-Original-To: python-list@python.org
Delivered-To: python-list@mail.python.org
X-Spam-Status: OK 0.000
X-Spam-Evidence: '*H*': 1.00; '*S*': 0.00; 'python3': 0.05; 'test,': 0.05; 'bits': 0.07; 'received:80.91': 0.09; 'received:80.91.229': 0.09; 'received:gmane.org': 0.09; 'received:list': 0.09; 'subject:Python3': 0.09; 'subject:set': 0.09; 'terry': 0.09; 'extension': 0.13; 'decent': 0.16; 'equivalents': 0.16; 'integers,': 0.16; 'oct': 0.16; 'operation.': 0.16; 'received:80.91.229.3': 0.16; 'received:plane.gmane.org': 0.16; 'reedy': 0.16; 'subject:bit': 0.16; 'wrote:': 0.17; 'integer': 0.17; 'jan': 0.18; 'tests': 0.18; 'bit': 0.21; 'logical': 0.22; "i'd": 0.22; 'class.': 0.23; 'header:In-Reply-To:1': 0.25; 'header :User-Agent:1': 0.26; 'operations,': 0.27; 'correct': 0.28; 'header:X-Complaints-To:1': 0.28; 'this?': 0.28; 'probably': 0.29; "i'm": 0.29; 'implement': 0.32; 'to:addr:python-list': 0.33; 'pm,': 0.35; 'there': 0.35; 'received:org': 0.36; 'but': 0.36; 'wanted': 0.36; "i'll": 0.36; 'drop': 0.37; 'subject:: ': 0.38; 'to:addr:python.org': 0.39; 'header:Received:5': 0.40; 'union': 0.66; 'light-weight': 0.84; 'received:fios.verizon.net': 0.84; 'rusi': 0.91
X-Injected-Via-Gmane: http://gmane.org/
To: python-list@python.org
From: Terry Reedy <tjreedy@udel.edu>
Subject: Re: bit count or bit set && Python3
Date: Thu, 25 Oct 2012 16:16:10 -0400
References: <mailman.2846.1351176984.27098.python-list@python.org> <a4a3d0f1-b5d8-4f76-a7b7-bda8936761ae@i7g2000pbf.googlegroups.com>
Mime-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
X-Gmane-NNTP-Posting-Host: pool-173-75-251-66.phlapa.fios.verizon.net
User-Agent: Mozilla/5.0 (Windows NT 6.1; WOW64; rv:15.0) Gecko/20120824 Thunderbird/15.0
In-Reply-To: <a4a3d0f1-b5d8-4f76-a7b7-bda8936761ae@i7g2000pbf.googlegroups.com>
X-BeenThere: python-list@python.org
X-Mailman-Version: 2.1.15
Precedence: list
List-Id: General discussion list for the Python programming language <python-list.python.org>
List-Unsubscribe: <http://mail.python.org/mailman/options/python-list>, <mailto:python-list-request@python.org?subject=unsubscribe>
List-Archive: <http://mail.python.org/pipermail/python-list/>
List-Post: <mailto:python-list@python.org>
List-Help: <mailto:python-list-request@python.org?subject=help>
List-Subscribe: <http://mail.python.org/mailman/listinfo/python-list>, <mailto:python-list-request@python.org?subject=subscribe>
Newsgroups: comp.lang.python
Message-ID: <mailman.2863.1351196196.27098.python-list@python.org>
Lines: 21
NNTP-Posting-Host: 2001:888:2000:d::a6
X-Trace: 1351196196 news.xs4all.nl 6951 [2001:888:2000:d::a6]:48367
X-Complaints-To: abuse@xs4all.nl
Xref: csiph.com comp.lang.python:32159

On 10/25/2012 12:13 PM, rusi wrote:
> On Oct 25, 7:56 pm, Charles Hixson <charleshi...@earthlink.net> wrote:
>> 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?

If I wanted 1000s of fast limited-length bitsets, I would consider using 
Cython to make an extension class.

-- 
Terry Jan Reedy