Brandon Simmons
Brandon Simmons
``` jberryman Code/BOLT-experiments ‹master*› » llvm-bolt --version 130 ↵ LLVM (http://llvm.org/): LLVM version 7.0.0svn Optimized build. Default target: x86_64-unknown-linux-gnu Host CPU: ivybridge BOLT revision f137ed238db11440f03083b1c88b7ffc0f4af65e Registered Targets: aarch64 - AArch64...
I don't know anything about the internals of ctags format. Why should I care that the tags file is no longer sorted? And if it is necessary that it be...
I would like to use [vim-gutentags](https://github.com/ludovicchabant/vim-gutentags) to manage tag creation, but `hasktags` doesn't quite support it. See the requirements section: https://github.com/ludovicchabant/vim-gutentags/blob/master/doc/gutentags.txt#L66 This means: - implementing `--exclude` in a ctags-compatible way...
If we can ensure we never allocate between the counter increment and the array write/read, then we get effectively a wait-free queue, can remove the "blocks at most one reader/writer"...
The full suite takes too long for travis, and there are a few tests that are pretty sensitive. Probably expose a very minimal set of tests in CI (unfortunately).
As expressed in `testNextistentSuccessFailure`. https://github.com/rrnewton/haskell-lockfree/issues/77 I can't remember whether we make use of this.
It would be straight-forward to add a function like: ``` readManyChan :: Int -> OutChan a -> IO [a] ``` that atomically reads `n` consecutive messages, blocking until all are...
Re. #1 We could store a `lap` value in each cell (the writers/reader's count shifted right by `logBase 2 bounds_size`). Both reader and writer need to CAS and possibly block...
`Unagi.Unboxed` could be modified fairly easily to use a payload that matches the internals of either `Text` or `ByteString`. I'm a little bit sketchy on details but this could accommodate...
I'd love to have some small, example programs that each represent some realistic use-case. These would supplement the existing benchmarks which do a good job of measuring the effects of...