Hoogle Search
Within LTS Haskell 24.4 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
columnar Text.Columnar if we need monoidal records then the fields must be Monoidal too.
MonoidalFieldMethods :: Lens' r f -> MonoidalFieldMethods r ccolumnar Text.Columnar No documentation available.
-
constrained-categories Control.Applicative.Constrained No documentation available.
-
constrained-categories Control.Category.Constrained.Prelude No documentation available.
module Data.LCA.Online.
Monoidal Provides online calculation of the the lowest common ancestor in O(log h) by compressing the spine of the paths using a skew-binary random access list. This library implements the technique described in my talk http://www.slideshare.net/ekmett/skewbinary-online-lowest-common-ancestor-search to improve the known asymptotic bounds on both online lowest common ancestor search http://en.wikipedia.org/wiki/Lowest_common_ancestor and the online level ancestor problem: http://en.wikipedia.org/wiki/Level_ancestor_problem Algorithms used here assume that the key values chosen for k are globally unique. This version provides access to a monoidal "summary" of the elided path for many operations.
-
This module contains a newtype wrapper around Map that has a correct Group instance compared to the one for MonoidalMap, in that it has a unique neutral element. This comes with different constraints on the parameters (check the instances for Semigroup and Monoid of the corresponding data structures if you're interested).
-
monoid-map Data.MonoidMap Newtype wrapper around Data.Map.Monoidal.MonoidalMap
MonoidMap :: MonoidalMap k v -> MonoidMap k vmonoid-map Data.MonoidMap No documentation available.
-
ghc GHC.Builtin.Names No documentation available.
-
ghc GHC.Builtin.Names No documentation available.