Hoogle Search

Within LTS Haskell 24.36 (ghc-9.10.3)

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

  1. lookupIndex :: forall (m :: Type -> Type) . Int -> GVal m -> Maybe (GVal m)

    ginger Text.Ginger.GVal

    Treat a GVal as a flat list and look up a value by integer index. If the value is not a List, or if the index exceeds the list length, return Nothing.

  2. lookupIndexMay :: forall (m :: Type -> Type) . Maybe Int -> GVal m -> Maybe (GVal m)

    ginger Text.Ginger.GVal

    Helper function; look up a value by an integer index when the index may or may not be available. If no index is given, return Nothing.

  3. lookupKey :: forall (m :: Type -> Type) . Text -> GVal m -> Maybe (GVal m)

    ginger Text.Ginger.GVal

    Strictly-typed lookup: treat value as a dictionary-like object and look up the value at a given key.

  4. lookupLoose :: forall (m :: Type -> Type) . GVal m -> GVal m -> Maybe (GVal m)

    ginger Text.Ginger.GVal

    Loosely-typed lookup: try dictionary-style lookup first (treat index as a string, and container as a dictionary), if that doesn't yield anything (either because the index is not string-ish, or because the container doesn't provide dictionary-style access), try index-based lookup.

  5. lookupLooseDef :: forall (m :: Type -> Type) . GVal m -> GVal m -> GVal m -> GVal m

    ginger Text.Ginger.GVal

    Like lookupLoose, but fall back to the given default value if the key is not in the dictionary, or if the indexee is not a dictionary-like object.

  6. lookupException :: String -> Exceptions -> Maybe [Int]

    hyphenation Text.Hyphenation.Exception

    Try to find a matching hyphenation exception.

  7. lookupPattern :: String -> Patterns -> [Int]

    hyphenation Text.Hyphenation.Pattern

    Tallies the hyphenation scores for a word considering all tails.

  8. lookup' :: KeySpec -> KVITable v -> Maybe v

    kvitable Data.KVITable

    Like lookup, but assumes a normalized key (all key elements specified, and in the proper order). Faster than lookup, but will return false negatives if not used with a normalized key.

  9. lookupCMap :: (?callStack :: CallStack) => CMap a -> SubcId -> a

    liquid-fixpoint Language.Fixpoint.Graph.Types

    CMap API -------------------------------------------------------------

  10. lookupLocalRewrites :: BindId -> LocalRewritesEnv -> Maybe LocalRewrites

    liquid-fixpoint Language.Fixpoint.Types.Constraints

    No documentation available.

Page 113 of many | Previous | Next