FenwickTree

Release 0.1.2.1

Fenwick trees are a O(log N) data structure for updating cumulative sums. This implementation comes with an operation to find a least element for which real-valued cumulative sum reaches certain value, and allows for storage of arbitrary information in the nodes.

Homepage Repository Hackage Haskell Download

Keywords
data-structures, library, Propose Tags, Skip to Readme, Index, Data.Tree.Fenwick, FenwickTree-0.1.2.1.tar.gz, browse, Package description, Package maintainers, MichalGajda, edit package information , 0.1.1, description on Wikipedia, Hackage, Stackage
License
BSD-3-Clause
Install
cabal install FenwickTree-0.1.2.1

Documentation

FenwickTree

Build Status

Fenwick trees are a O(log N) data structure for updating cumulative sums. This implementation comes with an operation to find a least element for which real-valued cumulative sum reaches certain value, and allows for storage of arbitrary information in the nodes.

See description on Wikipedia.

Official releases are on Hackage.

This package is also a part of Stackage - a stable subset of Hackage.

Stats

Dependent repositories
79
Total releases
4
Latest release
First release
Stars
2
Forks
0
Watchers
1
Contributors
1
Repository size
215 KB
SourceRank
8

Development practices

Source repo 2FA enabled
TEXT!
Package manager 2FA enabled
TEXT!
Is security responsive
TEXT!
Dependencies are managed
TEXT!
Issue-free release available
TEXT!
Succession plan available
TEXT!
Package manager 2FA enabled
TEXT!

The Tidelift Subscription provides access to a continuously curated stream of human-researched and maintainer-verified data on open source packages and their licenses, releases, vulnerabilities, and development practices.

Learn more →

Releases

0.1
0.1.1
0.1.2
0.1.2.1

Contributors

Michał J. Gajda


See all contributors

Something wrong with this page? Make a suggestion

Export .ABOUT file for this package

Last synced: 2023-12-02 18:00:45 UTC

Login to resync this project