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.

Exact lookup

1. lookupListAs' :: forall k (c :: Type -> Type) a . (PMapKey k, NonEmptyLike c, PMapValue k ~ Maybe a, FromGraphSON a) => k -> PMap c GValue -> Either PMapLookupException [Maybe a]

   greskell	Data.Greskell.Extra

   Similar to lookupListAs, but this function accepts null results. If the key k is not found in the map, it returns an empty list. If the key k is found and nulls are included in the values, they are obtained as Nothing.

2. cList :: Greskell Cardinality

   greskell	Data.Greskell.Graph

   list Cardinality.

3. data PropertyMapList (p :: Type -> Type) v

   greskell	Data.Greskell.Graph.PropertyMap

   A PropertyMap that can keep more than one values per key. lookupOne returns the first property associated with the given key. putProperty prepends the given property to the property list. <> returns the union of the two given property maps. If the two property maps share some same keys, those property lists are concatenated.

4. lookupList :: PropertyMap m => Text -> m p v -> [p v]

   greskell	Data.Greskell.Graph.PropertyMap

   Look up all properties associated with the given key.

5. lookupListValues :: forall m (p :: Type -> Type) v . (PropertyMap m, Property p) => Text -> m p v -> [v]

   greskell	Data.Greskell.Graph.PropertyMap

   Lookup a list of property values from a PropertyMap by key.

6. parseListValues :: forall m (p :: Type -> Type) v . (PropertyMap m, Property p, FromGraphSON v) => Text -> m p GValue -> Parser [v]

   greskell	Data.Greskell.Graph.PropertyMap

   Lookup a list of property values from a PropertyMap by the given key, and parse them. In version 0.1.1.0 and before, this function took an argument m p (GraphSON Value). This has changed, because property types for AVertex etc have changed.

7. lookupList :: forall k (c :: Type -> Type) v . (PMapKey k, NonEmptyLike c) => k -> PMap c v -> [v]

   greskell	Data.Greskell.PMap

   Lookup all items for the key. If there is no item for the key, it returns an empty list.

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

   Look up the values and parse them into a.

9. lookupListAs' :: forall k (c :: Type -> Type) a . (PMapKey k, NonEmptyLike c, PMapValue k ~ Maybe a, FromGraphSON a) => k -> PMap c GValue -> Either PMapLookupException [Maybe a]

   greskell	Data.Greskell.PMap

   Similar to lookupListAs, but this function accepts null results. If the key k is not found in the map, it returns an empty list. If the key k is found and nulls are included in the values, they are obtained as Nothing.

10. pMapFromList :: forall (c :: Type -> Type) v . NonEmptyLike c => [(Text, v)] -> PMap c v

    greskell	Data.Greskell.PMap

    Make a PMap from list of entries.

Page 197 of many | Previous | Next