Hoogle Search

Within LTS Haskell 24.50 (ghc-9.10.3)

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

Exact lookup

1. showSimpleConst :: (Ord a1, Num a1) => (a1 -> a2 -> ShowS) -> p -> [a2] -> a1 -> ShowS

   dice	Data.Random.Dice

   No documentation available.

2. showSimpleListConst :: Show a => String -> [a] -> Int -> ShowS

   dice	Data.Random.Dice

   No documentation available.

3. showSimpleRationalConst :: p -> [Ratio Integer] -> Integer -> ShowS

   dice	Data.Random.Dice

   No documentation available.

4. showFFromStrVec :: Int -> Float -> String -> String

   dobutokO2	DobutokO.Sound.FunctionF

   Experimental show for f::Float -> Vector (Float,Float) that is used only for visualisation. It is correct only with maybeFFromStrVec or equivalent function. Because the shape of the f is known the function can be defined.

   showFFromStrVec (-1) 440 "[(25.358,0.3598),(489.35,0.4588962),(795.35,0.6853)]"
   
   "(440.00,(\t -> <(0.05763181818181818 * t, 0.3598),(1.112159090909091 * t, 0.4588962),(1.8076136363636364 * t, 0.6853)>))"
   

5. showD :: Params -> String

   dobutokO2	DobutokO.Sound.Functional.Params

   A way to show not the (somewhat algebraic) structure of the Params (as the usual show does), but the contained frequencies in it.

6. showToError :: Show a => a -> Error

   error	Data.Error

   Create an error from a Show type. If your type implements Exception, it is usually better to use exceptionToError instead. Strings produced by show are usually not very user-friendly. Note: goes via String, so not efficient.

7. showBranch :: Branch -> String

   fedora-releases	Distribution.Fedora.Branch

   render Branch to String

8. showDot :: Dot a -> String

   fgl-visualize	Data.Graph.Inductive.Dot

   No documentation available.

9. showDigits :: BinDecode a => a -> Int

   floatshow	Text.FShow.Raw

   The number of significant digits needed to uniquely determine the value (or however many digits are desired). Usually, showDigits will be a constant function, but that is not necessary. However, all values of showDigits must be positive. If the mantissa always has the same highest bit, highBit, set when it is nonzero,

   showDigits _ = 2 + floor ((highBit+1) * logBase 10 2)
   

   is sufficient to make the values and formatted Strings uniquely determine each other and in general this is the smallest number to achieve that (calculate the number once and supply the result as a constant). If the highest set bit of nonzero mantissae varies, things are not so easy. If the width of mantissae is bounded, plugging the largest possible value into the above formula works, but may yield an unduly large number for common cases. Using the formula with highBit determined by the mantissa almost works, but if the representation is rounded at all, with sufficiently many bits in the mantissa, there will be values between the original and the representation. So, with mantissae of width varying over a large range, the only feasible way of obtaining a bijection between values and their decimal representations is printing to full precision in general, optionally capping at the upper limit. The default implementation prints values exactly, which in general is undesirable because it involves huge Integers and long representations.

10. showRegex :: String -> IO ()

    frisby	Text.Parsers.Frisby

    Show a representation of the parsed regex, mainly for debugging.

Page 202 of many | Previous | Next