Hoogle Search
Within LTS Haskell 24.51 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
challenge_ :: Text -> Attributelucid Lucid.Html5 The challenge attribute.
onstalled_ :: Text -> Attributelucid Lucid.Html5 The onstalled attribute.
small_ :: Term arg result => arg -> resultlucid Lucid.Html5 small element
getAllMatches :: AllMatches (f :: Type -> Type) b -> f bregex-base Text.Regex.Base.RegexLike No documentation available.
getAllSubmatches :: AllSubmatches (f :: Type -> Type) b -> f bregex-base Text.Regex.Base.RegexLike No documentation available.
getAllTextMatches :: AllTextMatches (f :: Type -> Type) b -> f bregex-base Text.Regex.Base.RegexLike No documentation available.
getAllTextSubmatches :: AllTextSubmatches (f :: Type -> Type) b -> f bregex-base Text.Regex.Base.RegexLike No documentation available.
matchAll :: RegexLike regex source => regex -> source -> [MatchArray]regex-base Text.Regex.Base.RegexLike matchAll returns a list of matches. The matches are in order and do not overlap. If any match succeeds but has 0 length then this will be the last match in the list.
matchAllText :: RegexLike regex source => regex -> source -> [MatchText source]regex-base Text.Regex.Base.RegexLike This is matchAll with the actual subsections of the source instead of just the (offset,length) information.
module Statistics.Correlation.
Kendall Fast O(NlogN) implementation of Kendall's tau. This module implements Kendall's tau form b which allows ties in the data. This is the same formula used by other statistical packages, e.g., R, matlab.
\tau = \frac{n_c - n_d}{\sqrt{(n_0 - n_1)(n_0 - n_2)}}where n_0 = n(n-1)/2, n_1 = number of pairs tied for the first quantify, n_2 = number of pairs tied for the second quantify, n_c = number of concordant pairs$, n_d = number of discordant pairs.