-
-
I find it hard to know/remember which methods are for lazy configuration, and the javadoc isn't useful. To be honest it feels like it would be nice just to deprecate the ones that aren't lazy. In lieu…
-
## 📓 Summary
Part of #191599
The exploratory view plugin has some margin of improvement in cutting its bundle size by:
- [ ] Refactor lazy exports using `dynamic` util.
- [ ] Remove unused export…
-
One of the obstacles to using Toga with Invent is their feeling that Toga is too big and slow. Part of the reason for this is that we import every module on startup whether the app needs it or not.
…
-
### FAQ
- [X] I have checked the [FAQ](https://github.com/hrsh7th/nvim-cmp/blob/main/doc/cmp.txt) and it didn't resolve my problem.
### Announcement
- [X] I have checked [Breaking change announceme…
-
This is something I've often felt would be useful in zod.
### Use case
- I'm calling an external api
- I want to parse the data I get back, to ensure nothing unexpected happens when I consume t…
-
### Specification
After experimenting with PolykeyClient in Polykey Network Status. I've realized that the error handling is really tedious.
The main issues happen when a connection fails, the e…
-
The original paper we base `Data.Graph` on expects *lazy* `ST`, but we use *strict* `ST`. Depending how the result is consumed, lazier might be better. For ordered traversals (producing lists rather t…
-
`graphFromEdges` is one way to construct a `Graph` in `Data.Graph`, and the line in it which actually constructs the graph looks like
https://github.com/haskell/containers/blob/d8d163a8baa43a7c8ba9…
-
This is just a thought. I'm interested in what people think.
Background:
Go has two short circuit binary operators, `&&` and `||`, that only evaluate their second operand under certain conditio…