Robin Morisset

I hit the same issue as @dbaron. After running `brew install libjpeg` and trying `pip3 install bikeshed && bikeshed update` again, I now have the following error: ``` Successfully installed...

I found a solution! Running `python3 -m pip install bikeshed` (instead of `pip3 install bikeshed`), and then doing `python3 -m bikeshed ...` (instead of `bikeshed ...`) fixed the problem! It...

As I understand this issue there is a tension between: - being consistent between different types of accesses (e.g. a dynamic indexing into a dynamically typed array vs a static...

The cycles in the dependency graph are perfectly fine: if there is something non-uniform that flows into it then the entire cycle is non-uniform, otherwise it is uniform (or in...

I agree on 1), my approach definitely needs building a graph. But I totally disagree on 2) and 3): nothing specific is required for dealing with cycles: we're just doing...

The total algorithmic complexity is linear. We run the DFS once from the mustBeUniform node, which has an edge leading to every vertex corresponding to places where barriers, derivatives, etc.....

(also note that the second DFS is not described in the links above, it is one that I have been forced to add since then to deal with discard).

I don't see at all how these rules prevent the example I listed. Out-of-thin-air reads are justified by some write. It is just that this write is justified by the...

Thank you for catching the memory leak, I'm sorry for missing it. I did not think to just loop over copy_struct_x, I agree that it sounds much simpler, I'll try...

It turns out that just calling copy_struct for each field of the tuple is actually very tricky. The problem I found is lists: the beginning of the list is not...