hw-fingertree-strict: Generic strict finger-tree structure
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 general sequence representation with arbitrary annotations, for use as a base for implementations of various collection types, with examples, as described in section 4 of
Ralf Hinze and Ross Paterson, "Finger trees: a simple general-purpose data structure", Journal of Functional Programming 16:2 (2006) pp 197-217. http://staff.city.ac.uk/~ross/papers/FingerTree.html
For a tuned sequence type, see Data.Sequence
in the
containers
package, which is a specialization of
this structure.
[Skip to Readme]
Properties
Versions | 0.1.0.0, 0.1.0.1, 0.1.0.2, 0.1.0.3, 0.1.1.0, 0.1.1.0, 0.1.1.1, 0.1.1.2, 0.1.1.3, 0.1.2.0, 0.1.2.1 |
---|---|
Change log | None available |
Dependencies | base (>=4.7 && <5), deepseq, semigroups (>=0.18 && <0.19) [details] |
License | BSD-3-Clause |
Copyright | 2017 John Ky; 2006 Ross Paterson, Ralf Hinze |
Author | John Ky |
Maintainer | newhoggy@gmail.com |
Category | Data Structures |
Home page | https://github.com/haskell-works/hw-fingertree-strict#readme |
Bug tracker | https://github.com/haskell-works/hw-fingertree-strict/issues |
Source repo | head: git clone https://github.com/haskell-works/hw-fingertree-strict |
Uploaded | by haskellworks at 2018-05-29T05:28:13Z |
Modules
[Index]
- HaskellWorks
- Data
- FingerTree
- IntervalMap
- Item
- PriorityQueue
- Segment
- SegmentMap
- SegmentSet
- Data
Downloads
- hw-fingertree-strict-0.1.1.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees