Hoogle Search

Within LTS Haskell 24.61 (ghc-9.10.3)

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

  1. lookupEdge :: (Edge e, Ord n) => e n -> Graph e n el nl -> Maybe el

    comfort-graph Data.Graph.Comfort 

    \(GraphAndEdge gr e) -> Graph.lookupEdge e gr === Map.lookup e (Graph.edgeLabels gr)

  2. lookupNode :: forall n (e :: Type -> Type) el nl . Ord n => n -> Graph e n el nl -> Maybe nl

    comfort-graph Data.Graph.Comfort 

    \(TestGraph gr) n -> Graph.lookupNode n gr === Map.lookup n (Graph.nodeLabels gr)

  3. lookupOrdered :: FromField a => NamedRecordOrdered -> ByteString -> Parser a

    csv-conduit Data.CSV.Conduit.Conversion

    No documentation available.

  4. lookupECM :: forall m k (mv :: Type -> Type) s v . (Monad m, Eq k, Hashable k) => ECM m mv s HashMap k v -> k -> m v

    expiring-cache-map Caching.ExpiringCacheMap.HashECM

    Request a value associated with a key from the cache.

    • If the value is not in the cache, the value will be requested through the function defined when the ECM value was created, its computation returned and the value stored in the cache state map.
    • If the value is in the cache and has not expired, it will be returned.
    • If the value is in the cache and a new time is computed in the same lookup, and the value has been determined to have since expired, it will be discarded and a new value will be requested for this computation.
    Every lookupECM computation increments an accumulator in the cache state which is used to keep track of the succession of key accesses. Based on the parameters provided with the CacheWithLRUList constructor, this history of key accesses is then used to remove entries from the cache back down to a minimum size. Also, when the modulo of the accumulator and the modulo value computes to 0, the time request function is invoked. In some cases the accumulator may get incremented more than once in a lookupECM computation. As the accumulator is a bound unsigned integer, when the accumulator increments back to 0, the cache state is completely cleared. The time request function is invoked in one of two different conditions
    • When a new key-value entry is requested, the current time is also requested during the same lookup, as a recent time determination is needed for a new entry in the key-value cache.
    • When the modulo of the accumulator and a specified value equals to 0.
    When the current time is determined during a lookup, access times of the entries in the key-value cache are compared with the new time to filter out expired entries from the key-value map.

  5. lookupECM :: forall m k (mv :: Type -> Type) s v . (Monad m, Ord k) => ECM m mv s Map k v -> k -> m v

    expiring-cache-map Caching.ExpiringCacheMap.OrdECM

    Request a value associated with a key from the cache.

    • If the value is not in the cache, it will be requested through the function defined through newECM, its computation returned and the value stored in the cache state map.
    • If the value is in the cache and has not expired, it will be returned.
    • If the value is in the cache and a new time is computed in the same lookup, and the value has been determined to have since expired, it will be discarded and a new value will be requested for this computation.
    Every lookupECM computation increments an accumulator in the cache state which is used to keep track of the succession of key accesses. Based on the parameters provided with the CacheWithLRUList constructor, this history of key accesses is then used to remove entries from the cache back down to a minimum size. Also, when the modulo of the accumulator and the modulo value computes to 0, the time request function is invoked. In some cases the accumulator may get incremented more than once in a lookupECM computation. As the accumulator is a bound unsigned integer, when the accumulator increments back to 0, the cache state is completely cleared. The time request function is invoked in one of two different conditions
    • When a new key-value entry is requested, the current time is also requested during the same lookup, as a recent time determination is needed for a new entry in the key-value cache.
    • When the modulo of the accumulator and a specified value equals to 0.
    When the current time is determined during a lookup, access times of the entries in the key-value cache are compared with the new time to filter out expired entries from the key-value map.

  6. lookupTFun :: TyLookup x xs => TFun f xs (f x)

    fixed-vector-hetero Data.Vector.HFixed.Class

    No documentation available.

  7. 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.

  8. 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.

  9. 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.

  10. 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.

Page 129 of many | Previous | Next