Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

  1. unsafeFromListFL :: Focus -> [a] -> FocusList a

    focuslist Data.FocusList

    Unsafely create a FocusList. This does not check that the focus actually exists in the list. This is an internal function and should generally not be used. It is only safe to use if you ALREADY know the Focus is within the list. Instead, you should generally use fromListFL. The following is an example of using unsafeFromListFL correctly. 

    >>> unsafeFromListFL (Focus 1) [0..2]
FocusList (Focus 1) [0,1,2]

    >>> unsafeFromListFL NoFocus []
FocusList NoFocus []
    unsafeFromListFL can also be used uncorrectly. The following is an example of unsafeFromListFL allowing you to create a FocusList that does not pass invariantFL. 
    >>> unsafeFromListFL (Focus 100) [0..2]
FocusList (Focus 100) [0,1,2]
    If fromListFL returns a Just FocusList, then unsafeFromListFL should return the same FocusList. complexity: O(n) where n is the length of the input list.

  2. fromList :: [Text] -> FuzzySet

    fuzzyset Data.FuzzySet.Simple

    Create a new set from a list of entries, using the default settings.

  3. module Data.Generics.Product.HList

    Derive an isomorphism between a product type and a flat HList.

  4. class IsList f g (as :: [Type]) (bs :: [Type]) | f -> as, g -> bs

    generic-optics Data.Generics.Product.HList

    No documentation available.

  5. bitList :: [Int] -> Hex

    ghci-hexcalc Data.GHex

    Set bits with List 

    >>> bitList [15, 8, 1]
0x0000_0000_0000_8102

  6. toList :: NodeManager k -> [(k, Node)]

    graph-core Data.Core.Graph.NodeManager

    No documentation available.

  7. cList :: Greskell Cardinality

    greskell Data.Greskell

    list Cardinality.

  8. parseUnwrapList :: (IsList a, i ~ Item a, FromGraphSON i) => GValue -> Parser a

    greskell Data.Greskell

    Extract GArray from the given GValue, parse the items in the array, and gather them by fromList. Useful to implement FromGraphSON instances for IsList types.

  9. toList :: forall (c :: Type -> Type -> Type) k v . (IsList (c k v), Item (c k v) ~ (k, v)) => GMap c k v -> [GMapEntry k v]

    greskell Data.Greskell

    Deconstruct GMap into a list of GMapEntrys.

  10. lookupListAs :: forall k (c :: Type -> Type) a . (PMapKey k, NonEmptyLike c, PMapValue k ~ a, FromGraphSON a) => k -> PMap c GValue -> Either PMapLookupException (NonEmpty a)

    greskell Data.Greskell.Extra

    Look up the values and parse them into a.

Page 196 of many | Previous | Next