Prevent this user from interacting with your repositories and sending you notifications.
Learn more about blocking users.
You must be logged in to block users.
Contact GitHub support about this user’s behavior.
Learn more about reporting abuse.
Number theory: primes, arithmetic functions, modular computations, special sequences
Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)
Bit vectors: 8x less memory, up to 1000x faster than Vector Bool
Lazy infinite compact streams with cache-friendly O(1) indexing and applications for memoization
Modular arithmetic, promoting moduli to the type level
Featherlight benchmark framework, drop-in replacement for criterion and gauge.
This has been raised in course of haskell/text#365 (comment)
New text UTF8 engine is based on a function isValidUtf8 :: ByteString -> Bool, impleme…
isValidUtf8 :: ByteString -> Bool
Seeing something unexpected? Take a look at the
GitHub profile guide.