jwaldmann
jwaldmann
The `sumBits` function computes the sum of a list of binary numbers. If all numbers have just one bit, then this computes the number of bits that are set to...
Hi. I came here from your message https://mail.haskell.org/pipermail/haskell-cafe/2020-August/132593.html Could you please add (in the README) a few words on this data structure(s) and their use cases? When should I prefer...
`fsep` and `fcat` are confusing as well. Does anyone know what "Paragraph fill" mean in this context? ``` "Paragraph fill" version of sep. ``` ``` "Paragraph fill" version of cat....
Try this: ``` import Text.PrettyPrint import System.Environment main = do [ s ] fsep [ text "a" , x text "b" ] ) empty !! read s ``` on my...
we have ``` emptyDef :: LanguageDef st type LanguageDef st = GenLanguageDef String st Identity makeTokenParser :: Stream s m Char => GenLanguageDef s u m -> GenTokenParser s u...
I would very much want that the documentation contains a minimal convincing example (and that this would also be included in tests, so we can be sure that it works)....
For larger values of `maxSize`, I have to wait a looong time to see anything, in the output of `speculate`. I was hoping that theorems are printed as they are...
it seems that Numeric.Natural https://hackage.haskell.org/package/base-4.18.0.0/docs/Numeric-Natural.html is the standard non-negative integer type now. I would welcome a Listable instance. Simply this? ``` instance T.Listable Natural where tiers = T.mapT (fromIntegral @T.Natural)...
currently, leancheck enumerates lexicographically (within each tier): ``` tiers !! 2 :: [(Nat,Nat,Nat,Nat)] [(0,0,0,2),(0,0,1,1),(0,0,2,0),(0,1,0,1),(0,1,1,0),(0,2,0,0),(1,0,0,1),(1,0,1,0),(1,1,0,0),(2,0,0,0)] ``` That means the frequency of changes in the first component is much lower than in...
I am doing the usual "configure; make ; sudo make install". On "sudo make install", scoop is re-compiled. This is redundant, and it leaves files in scoop/src (e.g., Usage.dyn_o) owned...