Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

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

Exact lookup

1. Counter'NumPacketsSent :: Counter

   reliable-io	Reliable.IO

   No documentation available.

2. Counter'NumPacketsStale :: Counter

   reliable-io	Reliable.IO

   No documentation available.

3. Counter'NumPacketsTooLargeToReceive :: Counter

   reliable-io	Reliable.IO

   No documentation available.

4. Counter'NumPacketsTooLargeToSend :: Counter

   reliable-io	Reliable.IO

   No documentation available.

5. setMaxNumFragments :: Int -> EndpointConfig -> EndpointConfig

   reliable-io	Reliable.IO

   Sets the number of fragments per packet in this endpoint. This is only to make sure that the endpoint has enough buffer space provisioned for incoming packets. Default for this value is 16, and the maximum value is 256.

6. showBignum :: Int -> Integer -> String

   rev-scientific	Data.ReversedScientific

   Two big positive Integer numbers in the ordered list of them are somewhat 'quickly' compared by values from left to right. If the number after "e" is greater than the other one respectively, the number is also greater than the other. If these values are equal, then the next shown Double values are compared (with the same rule). If they are also equal, then the difference between them can be likely find from the last two values (nevertheless, the numbers can differ if the values here are all pairwise equal! But the numbers are close in values one to another and so can represent just a subtle difference). This notation allows to reduce the difference in the lengths of big numbers in general case and to read the standard scientific notation not from right to left, but in a 'more usual' way — from left to right. If two numbers have different results of the function, then they are definitely unequal numbers. Is intended to be used in the PhLADiPreLiO for big numbers output. Example:

   let a = 58702730574235423475087390582374507304750234705847047403750375034750723045720387502357280345
   let b = 58738475082532745724057082370582054703750278402705730573074052705780857034750537507053278
   showBignum 7 a == "e91~5.87...d92~345"
   showBignum 7 b == "e88~5.87...d89~278"
   

   As it is seen from the numbers after "e" the first one is greater than the second one. Nevertheless, if you append the three digits 345 (hence "d" in the notation meanitg a number of significant digits) to the end of the second one, the output here will be equivalent, but the modified second number will be greater than the first one.

7. toNum :: [Int8] -> Integer

   rhythmic-sequences	Rhythmicity.MarkerSeqs

   Function to create bitwise representation of the intermediate data for the algorithm. Should be very optimized to run fast.

8. toNum2 :: [Int8] -> Integer

   rhythmic-sequences	Rhythmicity.MarkerSeqs

   The alternative implementation of the toNum (on the Linux x86_64 for some CPU is slower than the former one).

9. boolToNum :: Num b => Bool -> b

   rocksdb-haskell	Database.RocksDB.Internal

   No documentation available.

10. rot13enum :: Enum a => a -> a

    rot13	Codec.Rot13

    Perform the ROT13 cipher on the given Enum instance (in the sense of Rot13).

Page 519 of many | Previous | Next