Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

1. HttpAuthAny :: HttpAuth

   curl	Network.Curl.Opts

   No documentation available.

2. HttpAuthAnySafe :: HttpAuth

   curl	Network.Curl.Opts

   No documentation available.

3. SSHAuthAny :: SSHAuthType

   curl	Network.Curl.Opts

   No documentation available.

4. module Data.Diverse.Many

   Re-export Many without the constructor

5. class IsMany (t :: [Type] -> k -> Type) (xs :: [Type]) (a :: k)

   data-diverse	Data.Diverse.Many

   This instance allows converting to and from Many There are instances for converting tuples of up to size 15.

6. data Many (xs :: [Type])

   data-diverse	Data.Diverse.Many

   A Many is an anonymous product type (also know as polymorphic record), with no limit on the number of fields. The following functions are available can be used to manipulate unique fields

   • getter/setter for single field: grab and replace
   • getter/setter for multiple fields: select and amend
   • folds: forMany or collect
   These functions are type specified. This means labels are not required because the types themselves can be used to access the 'Many. It is a compile error to use those functions for duplicate fields. For duplicate fields, Nat-indexed versions of the functions are available:
   • getter/setter for single field: grabN and replaceN
   • getter/setter for multiple fields: selectN and amendN
   • folds: forManyN or collectN
   Encoding: The record is encoded as (S.Seq Any). This encoding should reasonabily efficient for any number of fields. The map Key is index + offset of the type in the typelist. The Offset is used to allow efficient cons consMany.

   Key = Index of type in typelist + Offset
   

   The constructor will guarantee the correct number and types of the elements. The constructor is only exported in the Data.Diverse.Many.Internal module

7. consMany :: forall x (xs :: [Type]) . x -> Many xs -> Many (x ': xs)

   data-diverse	Data.Diverse.Many

   Add an element to the left of a Many. Not named cons to avoid conflict with cons

8. forMany :: forall c r (xs :: [Type]) . Collect c r xs => c r xs -> Many xs -> Collector c xs r

   data-diverse	Data.Diverse.Many

   Folds any Many, even with indistinct types. Given distinct handlers for the fields in Many, create AFoldable of the results of running the handlers over the fields in Many.

   let x = (5 :: Int) ./ False ./ 'X' ./ Just 'O' ./ (6 :: Int) ./ Just 'A' ./ nil
   y = show @Int ./ show @Char ./ show @(Maybe Char) ./ show @Bool ./ nil
   afoldr (:) [] (forMany (cases y) x) `shouldBe`
   ["5", "False", "'X'", "Just 'O'", "6", "Just 'A'"]
   

9. forManyN :: forall c r (n :: Nat) (xs :: [Type]) . CollectN c r n xs => c r n xs -> Many xs -> CollectorN c n xs r

   data-diverse	Data.Diverse.Many

   Folds any Many, even with indistinct types. Given index handlers for the fields in Many, create AFoldable of the results of running the handlers over the fields in Many.

   let x = (5 :: Int) ./ False ./ 'X' ./ Just 'O' ./ (6 :: Int) ./ Just 'A' ./ nil
   y = show @Int ./ show @Bool ./ show @Char ./ show @(Maybe Char) ./ show @Int ./ show @(Maybe Char) ./ nil
   afoldr (:) [] (forManyN (casesN y) x) `shouldBe`
   ["5", "False", "'X'", "Just 'O'", "6", "Just 'A'"]
   

10. fromMany :: IsMany t xs a => Many xs -> t xs a

    data-diverse	Data.Diverse.Many

    No documentation available.

Page 188 of many | Previous | Next