Gurkenglas

Put IdeResult in terms of Either, add ideError

3

Let's try this again.

Setter -> Traversal

3

Python's nonlocal state side effects give every setter traversal powers. You should unify them or have a utility to convert them. I say this because using `re.sub` (which allows a...

Find All References doesn't work for local variables

1

Replication: Visit https://github.com/tgstation/tgstation/blob/master/code/controllers/master.dm#L504 Ctrl-click `queue_node_paused` to go to its definition Alt-Shift-F12 in that to not find `L504`.

Refactor findNextNumberedName

1

maximumDef comes from Safe.

I morally count retry in a case match as recursion.

Exterminate recursion!

https://github.com/ekmett/lens/pull/732 remains unresolved. The next step would be to implement tests using https://www.reddit.com/r/haskell/comments/69ots1/notorious_lens_errors_thread/.

Because as far as I can see it is safe but requires partial functions to implement: ``` type Pair a a = Pair a a deriving Functor zipWith :: Distributive...

Language extension: caseMay

3

``` caseMay x of A -> a B -> b ``` would be desugared to ``` case x of A -> Just a B -> Just b _ -> Nothing...

Add monadic IORef functions (e.g. atomicModifyIORefM)

2

`atomicModifyIORef :: IORef a -> (a -> (a, b)) -> IO b` into `atomicModifyIORefM :: MonadIO m => IORef a -> (a -> m (b, a)) -> m b` and...