Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.python > #32142 > unrolled thread
| Started by | Mark Lawrence <breamoreboy@yahoo.co.uk> |
|---|---|
| First post | 2012-10-25 17:24 +0100 |
| Last post | 2012-10-25 17:24 +0100 |
| Articles | 1 — 1 participant |
Back to article view | Back to comp.lang.python
This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by
below is the oldest one visible, not the original post.
Re: bit count or bit set && Python3 Mark Lawrence <breamoreboy@yahoo.co.uk> - 2012-10-25 17:24 +0100
| From | Mark Lawrence <breamoreboy@yahoo.co.uk> |
|---|---|
| Date | 2012-10-25 17:24 +0100 |
| Subject | Re: bit count or bit set && Python3 |
| Message-ID | <mailman.2851.1351182149.27098.python-list@python.org> |
On 25/10/2012 15:47, Charles Hixson 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 needed bitarray and bitstring are available on pypi. -- Cheers. Mark Lawrence.
Back to top | Article view | comp.lang.python
csiph-web