Hoogle Search

Within LTS Haskell 24.46 (ghc-9.10.3)

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

Exact lookup

1. GMapEntry :: Bool -> k -> v -> GMapEntry k v

   greskell	Data.Greskell

   No documentation available.

2. gElementMap :: Element s => Keys s -> Walk Transform s (PMap Single GValue)

   greskell	Data.Greskell

   .elementMap step.

3. gFlatMap :: (Lift Transform c, Split cc c, ToGTraversal g, WalkType c, WalkType cc) => g cc s e -> Walk c s e

   greskell	Data.Greskell

   .flatMap step. .flatMap step is at least as powerful as Transform, even if the child walk is Filter type. This is because .flatMap step always modifies the path of the Traverser.

4. gFlatMap' :: ToGTraversal g => g Transform s e -> Walk Transform s e

   greskell	Data.Greskell

   Monomorphic version of gFlatMap.

5. gValueMap :: Element s => Keys s -> Walk Transform s (PMap (ElementPropertyContainer s) GValue)

   greskell	Data.Greskell

   .valueMap step.

6. gmapEntryFlat :: GMapEntry k v -> !Bool

   greskell	Data.Greskell

   No documentation available.

7. gmapEntryKey :: GMapEntry k v -> !k

   greskell	Data.Greskell

   No documentation available.

8. gmapEntryValue :: GMapEntry k v -> !v

   greskell	Data.Greskell

   No documentation available.

9. gmapFlat :: GMap (c :: Type -> Type -> Type) k v -> !Bool

   greskell	Data.Greskell

   If True, the map is encoded as an array. If False, it's encoded as a JSON Object.

10. gmapValue :: GMap (c :: Type -> Type -> Type) k v -> !c k v

    greskell	Data.Greskell

    Map implementation.

Page 1167 of many | Previous | Next