Hoogle Search

Within LTS Haskell 24.64 (ghc-9.10.3)

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

Exact lookup

1. lookupFL :: Int -> FocusList a -> Maybe a

   focuslist	Data.FocusList

   Lookup the element at the specified index, counting from 0.

   >>> let Just fl = fromListFL (Focus 0) ['a'..'c']
   
   >>> lookupFL 0 fl
   Just 'a'
   

   Returns Nothing if the index is out of bounds.

   >>> let Just fl = fromListFL (Focus 0) ['a'..'c']
   
   >>> lookupFL 100 fl
   Nothing
   
   >>> lookupFL (-1) fl
   Nothing
   

   Always returns Nothing if the FocusList is empty.

   lookupFL i emptyFL == Nothing
   

   complexity: O(log(min(i, n - i))) where i is the index you want to look up, and n is the length of the FocusList.

2. lookupName :: forall (n :: S) a . Name n -> NameMap n a -> a

   free-foil	Control.Monad.Foil

   Looking up a name should always succeed. Note that since Name is Sinkable, you can lookup a name from scope n in a NameMap for scope l whenever l extends n.

3. lookupSubst :: forall e (i :: S) (o :: S) . InjectName e => Substitution e i o -> Name i -> e o

   free-foil	Control.Monad.Foil

   Apply substitution to a given name.

4. lookupName :: forall (n :: S) a . Name n -> NameMap n a -> a

   free-foil	Control.Monad.Foil.Internal

   Looking up a name should always succeed. Note that since Name is Sinkable, you can lookup a name from scope n in a NameMap for scope l whenever l extends n.

5. lookupSubst :: forall e (i :: S) (o :: S) . InjectName e => Substitution e i o -> Name i -> e o

   free-foil	Control.Monad.Foil.Internal

   Apply substitution to a given name.

6. lookupNode :: Node -> NodeManager k -> Maybe k

   graph-core	Data.Core.Graph.NodeManager

   No documentation available.

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

   greskell	Data.Greskell.AsLabel

   Lookup the value and parse it into a.

8. lookupAsM :: forall k (c :: Type -> Type) a m . (PMapKey k, NonEmptyLike c, PMapValue k ~ a, FromGraphSON a, MonadThrow m) => k -> PMap c GValue -> m a

   greskell	Data.Greskell.AsLabel

   MonadThrow version of lookupAs.

9. lookupM :: forall k (c :: Type -> Type) m v . (PMapKey k, NonEmptyLike c, MonadThrow m) => k -> PMap c v -> m v

   greskell	Data.Greskell.AsLabel

   MonadThrow version of lookup. If there is no value for the key, it throws PMapNoSuchKey.

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

    greskell	Data.Greskell.Extra

    Lookup the value and parse it into a.

Page 93 of many | Previous | Next