Hoogle Search

Within LTS Haskell 24.48 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. ProtocolEntry :: ProtocolName -> [ProtocolName] -> ProtocolNumber -> ProtocolEntry

    network-bsd Network.BSD

    No documentation available.

  2. type ProtocolName = String

    network-bsd Network.BSD

    No documentation available.

  3. type ProtocolNumber = CInt

    network-bsd Network.BSD

    Protocol number.

  4. pattern Pseudo_AF_HDRCMPLT :: Family

    network-bsd Network.BSD

    Used by BPF to not rewrite hdrs in iface output

  5. pattern Pseudo_AF_KEY :: Family

    network-bsd Network.BSD

    Internal key-management function

  6. pattern Pseudo_AF_PIP :: Family

    network-bsd Network.BSD

    Help Identify PIP packets

  7. pattern Pseudo_AF_RTIP :: Family

    network-bsd Network.BSD

    Help Identify RTIP packets

  8. pattern Pseudo_AF_XTP :: Family

    network-bsd Network.BSD

    eXpress Transfer Protocol (no AF)

  9. module Control.Applicative.Permutations

    This module is a generalization of the package parsec-permutation authored by Samuel Hoffstaetter: https://hackage.haskell.org/package/parsec-permutation This module also takes inspiration from the algorithm is described in: Parsing Permutation Phrases, by Arthur Baars, Andres Löh and Doaitse Swierstra. Published as a functional pearl at the Haskell Workshop 2001: https://www.cs.ox.ac.uk/jeremy.gibbons/wg21/meeting56/loeh-paper.pdf From these two works we derive a flexible and general method for parsing permutations over an Applicative structure. Quite useful in conjunction with "Free" constructions of Applicatives, Monads, etc. Other permutation parsing libraries tend towards using special "almost applicative" combinators for construction which denies the library user the ability to lift and unlift permutation parsing into any Applicative computational context. We redefine these combinators as convenience operators here alongside the equivalent Applicative instance. For example, suppose we want to parse a permutation of: an optional string of a's, the character b and an optional c. Using a standard parsing library combinator char (e.g. ReadP) this can be described using the Applicative instance by: 

    test = runPermutation $
(,,) <$> toPermutationWithDefault ""  (some (char 'a'))
<*> toPermutation (char 'b')
<*> toPermutationWithDefault '_' (char 'c')

  10. data Permutation (m :: Type -> Type) a

    parser-combinators Control.Applicative.Permutations

    An Applicative wrapper-type for constructing permutation parsers.

Page 267 of many | Previous | Next