Neil Mitchell
Neil Mitchell
That matches GHC 7.8, and given foundation only supports very new things, that compat can be removed. That in turn allows things like `compatAndI#` to be removed as it would...
The new version is broken on GHC 7.10, and furthermore causes Cabal to stop trying to backtrack. Please change your buildable: False thing. Please see the thread https://github.com/haskell-infra/hackage-trustees/issues/165#issuecomment-403358830. Also read...
It should not be defined on top of `mapM` as that requires O(n) stack space. It should also require an Applicative constraint, not a Monad.
I ported weeder to foundation. It goes 30% slower compared to `[Char]`, and I was hoping for a significant speedup (that was the entire point of the port). The two...
I wrote `fst3 . Fdn.fromBytes Fdn.UTF8` because I'm lazy. I imagine lots of other people will to - but what I really want is to just throw errors and return...
Following on from #261, the current upper/lower functions are character oriented, but real Unicode case conversion is string orientated. The list of cases where that isn't equivalent are at http://unicode.org/Public/UNIDATA/CaseFolding.txt...
At the moment you can get at `UVecBA`, but you can't find out if it is pinned or not. Exposing `PinnedStatus` and `isPinned` from `Foundation,Array.Internal` should be sufficient.
@vincenthz suggested I flip `weeder` to `basement`. The one problem with that is the function I defined: ```haskell readFileUTF8 :: FilePath -> IO Str readFileUTF8 = fmap (fst3 . S.fromBytes...
By tracking down some bugs, I found quite a few places where foundation strings aren't memory safe. The example I started from was `sToListStream`, particularly: ```haskell onAddr fptr (Ptr ptr)...
It was recently observed that foundation is faster than text/bytestring even though it allocates a lot more: https://github.com/ndmitchell/weeder/pull/27 I suspect if you allocated less you'd we way faster. You might...