dgim: Implementation of DGIM algorithm
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.
A basic implementation of the DGIM algorithm for counting the occurrence of certain elements in a fixed length prefix of a stream.
Properties
| Versions | 0.0.2, 0.0.2, 0.0.3 |
|---|---|
| Change log | None available |
| Dependencies | base (>=4.7 && <4.8) [details] |
| License | MIT |
| Author | Utkarsh Upadhyay |
| Maintainer | musically.ut@gmail.com |
| Category | Data, Algorithms |
| Home page | https://github.com/musically-ut/haskell-dgim |
| Bug tracker | https://github.com/musically-ut/haskell-dgim/issues/ |
| Source repo | head: git clone git://github.com/musically-ut/haskell-dgim.git |
| Uploaded | by musically_ut at 2015-04-04T15:53:53Z |
Modules
- Data
- Stream
- Algorithms
- Data.Stream.Algorithms.DGIM
- Data.Stream.Algorithms.DGIM.Internal
- Data.Stream.Algorithms.DGIM
- Algorithms
- Stream
Downloads
- dgim-0.0.2.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees