Hoogle Search

Within LTS Haskell 24.10 (ghc-9.10.2)

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

Exact lookup

1. pattern GL_DUAL_TEXTURE_SELECT_SGIS :: GLenum

   OpenGLRaw	Graphics.GL.Tokens

   No documentation available.

2. pattern GL_MAX_DUAL_SOURCE_DRAW_BUFFERS :: GLenum

   OpenGLRaw	Graphics.GL.Tokens

   No documentation available.

3. pattern GL_MAX_DUAL_SOURCE_DRAW_BUFFERS_EXT :: GLenum

   OpenGLRaw	Graphics.GL.Tokens

   No documentation available.

4. foldDUAL :: (Semigroup d, Monoid d) => (d -> l -> r) -> r -> (NonEmpty r -> r) -> (d -> r -> r) -> (a -> r -> r) -> DUALTree d u a l -> Maybe r

   dual-tree	Data.Tree.DUAL

   Fold for DUAL-trees. It is given access to the internal and leaf data, internal d values, and the accumulated d values at each leaf. It is also allowed to replace "u-only" leaves with a constant value. In particular, however, it is not given access to any of the u annotations, the idea being that those are used only for constructing trees. If you do need access to u values, you can duplicate the values you need in the internal data nodes. Be careful not to mix up the d values at internal nodes with the d values at leaves. Each d value at a leaf satisfies the property that it is the mconcat of all internal d values along the path from the root to the leaf. The result is Nothing if and only if the tree is empty.

5. foldDUAL :: (Semigroup d, Monoid d) => (d -> l -> r) -> r -> (NonEmpty r -> r) -> (d -> r -> r) -> (a -> r -> r) -> DUALTree d u a l -> Maybe r

   dual-tree	Data.Tree.DUAL.Internal

   Fold for DUAL-trees. It is given access to the internal and leaf data, internal d values, and the accumulated d values at each leaf. It is also allowed to replace "u-only" leaves with a constant value. In particular, however, it is not given access to any of the u annotations, the idea being that those are used only for constructing trees. If you do need access to u values, you can duplicate the values you need in the internal data nodes. Be careful not to mix up the d values at internal nodes with the d values at leaves. Each d value at a leaf satisfies the property that it is the mconcat of all internal d values along the path from the root to the leaf. The result is Nothing if and only if the tree is empty.

6. foldDUALNE :: (Semigroup d, Monoid d) => (d -> l -> r) -> r -> (NonEmpty r -> r) -> (d -> r -> r) -> (a -> r -> r) -> DUALTreeNE d u a l -> r

   dual-tree	Data.Tree.DUAL.Internal

   Fold for non-empty DUAL-trees.

7. unDUALTree :: DUALTree d u a l -> Maybe (DUALTreeU d u a l)

   dual-tree	Data.Tree.DUAL.Internal

   No documentation available.

8. unDUALTreeU :: DUALTreeU d u a l -> (u, DUALTreeNE d u a l)

   dual-tree	Data.Tree.DUAL.Internal

   No documentation available.

9. encoderResidualPartitionOrders :: EncoderSettings -> !Maybe (Word32, Word32)

   flac	Codec.Audio.FLAC.StreamEncoder

   Set the minimum and maximum partition order to search when coding the residual. The partition order determines the context size in the residual. The context size will be approximately blocksize / (2 ^ order). Set both min and max values to 0 to force a single context, whose Rice parameter is based on the residual signal variance. Otherwise, set a min and max order, and the encoder will search all orders, using the mean of each context for its Rice parameter, and use the best. Default: Nothing.

10. glp_dual_rtest :: Ptr Problem -> CInt -> Ptr CInt -> Ptr CDouble -> CInt -> CDouble -> IO CInt

    glpk-headers	Math.Programming.Glpk.Header

    No documentation available.

Page 17 of many | Previous | Next