Hoogle Search

Within LTS Haskell 24.60 (ghc-9.10.3)

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

  1. lookup :: Resolver -> Domain -> TYPE -> IO (Either DNSError [RData])

    dns Network.DNS.LookupRaw

    Look up resource records of a specified type for a domain, collecting the results from the ANSWER section of the response. See the documentation of lookupRaw to understand the concrete behavior. Cache is used if resolvCache is Just. Example: 

    >>> rs <- makeResolvSeed defaultResolvConf

>>> withResolver rs $ \resolver -> lookup resolver "www.example.com" A
Right [93.184.216.34]

  2. lookup :: FieldName -> Data -> FieldName -> LookupFields -> BuildTransformSpecs

    hvega Graphics.Vega.VegaLite

    Perform a lookup of named fields between two data sources. This allows you to find values in one data source based on the values in another (like a relational join). Use lookupSelection for linking data with interactive selections. See the Vega-Lite documentation for further details. The following would return the values in the age and height fields from lookup_people.csv for all rows where the value in the name column in that file matches the value of person in the primary data source. 

    peopleData = dataFromUrl "data/lookup_people.csv" []
lfields = LuFields ["age", "height"]
trans = transform
. lookup "person" peopleData "name" lfields
    Note that the interface has changed in version 0.5.0.0: the output field names argument now uses the new LookupFields type. This provides greater flexibility in naming and default behaviour. The conversion from version 0.4 is simple: change 
    lookup key1 dataSource key2 fields
    to 
    lookup key1 dataSource key2 (LuFields fields)

  3. lookup :: Eq a => a -> [(a, b)] -> Maybe b

    mixed-types-num Numeric.MixedTypes.PreludeHiding

    lookup key assocs looks up a key in an association list. For the result to be Nothing, the list must be finite.

    Examples

    >>> lookup 2 []
Nothing

    >>> lookup 2 [(1, "first")]
Nothing

    >>> lookup 2 [(1, "first"), (2, "second"), (3, "third")]
Just "second"

  4. lookup :: Hashable key => key -> Map key value -> STM (Maybe value)

    stm-containers StmContainers.Map

    Look up an item.

  5. lookup :: (Hashable key, Hashable value) => value -> key -> Multimap key value -> STM Bool

    stm-containers StmContainers.Multimap

    Look up an item by a value and a key.

  6. lookup :: Hashable item => item -> Set item -> STM Bool

    stm-containers StmContainers.Set

    Lookup an element.

  7. lookup :: forall (ks :: Type -> Type -> Type) k (vs :: Type -> Type -> Type) v m . (MVector ks k, MVector vs v, PrimMonad m, Hashable k, Eq k) => Dictionary (PrimState m) ks k vs v -> k -> m (Maybe v)

    vector-hashtables Data.Vector.Hashtables

    O(1) in the best case, O(n) in the worst case. Find value by given key in Dictionary. Like lookup' but return Nothing if value not found.

  8. lookup :: forall (ks :: Type -> Type -> Type) k (vs :: Type -> Type -> Type) v m . (MVector ks k, MVector vs v, PrimMonad m, Hashable k, Eq k) => Dictionary (PrimState m) ks k vs v -> k -> m (Maybe v)

    vector-hashtables Data.Vector.Hashtables.Internal

    O(1) in the best case, O(n) in the worst case. Find value by given key in Dictionary. Like lookup' but return Nothing if value not found.

  9. lookup :: FilePath -> ContentTypes -> Maybe Text

    xlsx Codec.Xlsx.Types.Internal.ContentTypes

    No documentation available.

  10. lookup :: RefId -> Relationships -> Maybe Relationship

    xlsx Codec.Xlsx.Types.Internal.Relationships

    No documentation available.

Page 12 of many | Previous | Next