Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. dualDoc :: IsDoc doc => SDoc -> HDoc -> doc

   ghc	GHC.Utils.Outputable

   Prints as either the given SDoc or the given HDoc, depending on which type the result is instantiated to. This should generally be avoided; see Note [dualLine and dualDoc] for details.

2. dualLine :: IsLine doc => SDoc -> HLine -> doc

   ghc	GHC.Utils.Outputable

   Prints as either the given SDoc or the given HLine, depending on which type the result is instantiated to. This should generally be avoided; see Note [dualLine and dualDoc] for details.

3. dualDataName :: Name

   deriving-compat	Data.Deriving.Internal

   No documentation available.

4. dualDoc :: IsDoc doc => SDoc -> HDoc -> doc

   ghc-lib-parser	GHC.Utils.Outputable

   Prints as either the given SDoc or the given HDoc, depending on which type the result is instantiated to. This should generally be avoided; see Note [dualLine and dualDoc] for details.

5. dualLine :: IsLine doc => SDoc -> HLine -> doc

   ghc-lib-parser	GHC.Utils.Outputable

   Prints as either the given SDoc or the given HLine, depending on which type the result is instantiated to. This should generally be avoided; see Note [dualLine and dualDoc] for details.

6. package dual-tree

   Rose trees with cached and accumulating monoidal annotations Rose (n-ary) trees with both upwards- (i.e. cached) and downwards-traveling (i.e. accumulating) monoidal annotations. This is used as the core data structure underlying the diagrams framework (https://diagrams.github.io), but potentially has other applications as well. Abstractly, a DUALTree is a rose (n-ary) tree with data (of type l) at leaves, data (of type a) at internal nodes, and two types of monoidal annotations, one (of type u) travelling "up" the tree and one (of type d) traveling "down". See Data.Tree.DUAL for full documentation. Data.Tree.DUAL provides a public API which should suffice for most purposes. Data.Tree.DUAL.Internal exports more of the internal implementation---use it at your own risk.

7. dualFlipFlopSynchronizer :: forall a (dom1 :: Domain) (dom2 :: Domain) . (NFDataX a, KnownDomain dom1, KnownDomain dom2) => Clock dom1 -> Clock dom2 -> Reset dom2 -> Enable dom2 -> a -> Signal dom1 a -> Signal dom2 a

   clash-prelude	Clash.Explicit.Prelude

   Synchronizer based on two sequentially connected flip-flops.

   • NB: This synchronizer can be used for bit-synchronization.
   • NB: Although this synchronizer does reduce metastability, it does not guarantee the proper synchronization of a whole word. For example, given that the output is sampled twice as fast as the input is running, and we have two samples in the input stream that look like:

     [0111,1000]

     But the circuit driving the input stream has a longer propagation delay on msb compared to the lsbs. What can happen is an output stream that looks like this:

     [0111,0111,0000,1000]

     Where the level-change of the msb was not captured, but the level change of the lsbs were.If you want to have safe word-synchronization use asyncFIFOSynchronizer.

8. dualFlipFlopSynchronizer :: forall a (dom1 :: Domain) (dom2 :: Domain) . (NFDataX a, KnownDomain dom1, KnownDomain dom2) => Clock dom1 -> Clock dom2 -> Reset dom2 -> Enable dom2 -> a -> Signal dom1 a -> Signal dom2 a

   clash-prelude	Clash.Explicit.Prelude.Safe

   Synchronizer based on two sequentially connected flip-flops.

   • NB: This synchronizer can be used for bit-synchronization.
   • NB: Although this synchronizer does reduce metastability, it does not guarantee the proper synchronization of a whole word. For example, given that the output is sampled twice as fast as the input is running, and we have two samples in the input stream that look like:

     [0111,1000]

     But the circuit driving the input stream has a longer propagation delay on msb compared to the lsbs. What can happen is an output stream that looks like this:

     [0111,0111,0000,1000]

     Where the level-change of the msb was not captured, but the level change of the lsbs were.If you want to have safe word-synchronization use asyncFIFOSynchronizer.

9. dualFlipFlopSynchronizer :: forall a (dom1 :: Domain) (dom2 :: Domain) . (NFDataX a, KnownDomain dom1, KnownDomain dom2) => Clock dom1 -> Clock dom2 -> Reset dom2 -> Enable dom2 -> a -> Signal dom1 a -> Signal dom2 a

   clash-prelude	Clash.Explicit.Synchronizer

   Synchronizer based on two sequentially connected flip-flops.

   • NB: This synchronizer can be used for bit-synchronization.
   • NB: Although this synchronizer does reduce metastability, it does not guarantee the proper synchronization of a whole word. For example, given that the output is sampled twice as fast as the input is running, and we have two samples in the input stream that look like:

     [0111,1000]

     But the circuit driving the input stream has a longer propagation delay on msb compared to the lsbs. What can happen is an output stream that looks like this:

     [0111,0111,0000,1000]

     Where the level-change of the msb was not captured, but the level change of the lsbs were.If you want to have safe word-synchronization use asyncFIFOSynchronizer.

10. dualPasswordType :: User -> Maybe User_DualPasswordType

    gogol-sqladmin	Gogol.SQLAdmin

    Dual password status for the user.

Page 7 of many | Previous | Next