OrderedBits: Efficient ordered (by popcount) enumeration of bits
This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.
Warnings:
- 'ghc-options: -O2' is rarely needed. Check that it is giving a real benefit and not just imposing longer compile times on your users.
This library provides efficient methods to enumerate all elements of a set in order of the population count, or the ordered enumerations of the elements of the powerset of a set. First, the empty set, then all 1-element sets, all 2-element sets, etc. Such enumerations are important for algorithms over unordered data sets. Examples include the travelling salesman problem and the closely related Hamiltonian path problem.
[Skip to Readme]
Properties
| Versions | 0.0.0.1, 0.0.0.2, 0.0.0.3, 0.0.1.0, 0.0.1.1, 0.0.1.1, 0.0.1.2, 0.0.2.0 |
|---|---|
| Change log | changelog.md |
| Dependencies | base (>=4.7 && <5.0), bits (>=0.4 && <0.6), primitive (>=0.5 && <0.7), vector (>=0.10 && <0.12), vector-algorithms (>=0.6 && <0.7.1) [details] |
| License | BSD-3-Clause |
| Copyright | Christian Hoener zu Siederdissen, 2014 - 2016 |
| Author | Christian Hoener zu Siederdissen |
| Maintainer | choener@bioinf.uni-leipzig.de |
| Category | Data |
| Home page | https://github.com/choener/OrderedBits |
| Bug tracker | https://github.com/choener/OrderedBits/issues |
| Source repo | head: git clone git://github.com/choener/OrderedBits |
| Uploaded | by ChristianHoener at 2016-09-01T12:47:18Z |
Modules
[Index]
- Data
Downloads
- OrderedBits-0.0.1.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees
Readme for OrderedBits-0.0.1.1
[back to package description]
OrderedBits
The OrderedBits library provides methods to generate unboxed vectors of Ints (and others) ordered by their population count or Hamming distance to the 0 set. In other words, we enumerate the power set of a given input set.
Such an order is important for dynamic programming algorithms for Hamiltonian path problems and the travelling salesman problem.
Contact
Christian Hoener zu Siederdissen
Leipzig University, Leipzig, Germany
choener@bioinf.uni-leipzig.de
http://www.bioinf.uni-leipzig.de/~choener/