lca: O(log n) persistent on-line lowest common ancestor calculation without preprocessing with optional monoidal annotations

[ algorithms, bsd3, data-structures, library ] [ Propose Tags ]

O(log n) persistent on-line lowest common ancestor calculation without preprocessing with optional monoidal annotations

Versions [faq] 0.1, 0.1.0.1, 0.2, 0.2.1, 0.2.2, 0.2.3, 0.2.4, 0.3, 0.3.1
Dependencies base (>=4 && <4.8) [details]
License BSD-3-Clause
Copyright Copyright (C) 2011-2012 Edward A. Kmett
Author Edward A. Kmett
Maintainer Edward A. Kmett <ekmett@gmail.com>
Revised Revision 1 made by HerbertValerioRiedel at Thu Jun 1 09:09:51 UTC 2017
Category Algorithms, Data Structures
Home page http://github.com/ekmett/lca/
Bug tracker http://github.com/ekmett/lca/issues
Source repo head: git clone git://github.com/ekmett/lca.git
Uploaded by EdwardKmett at Thu Jun 7 11:59:00 UTC 2012
Distributions LTSHaskell:0.3.1, NixOS:0.3.1, Stackage:0.3.1
Downloads 4813 total (16 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

For package maintainers and hackage trustees