Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
timhh
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
11 ms
·
91.
▲
by
timhh
2y ago
On 2 there is this now: https://alasdair.github.io/#_modules But it's very new and the RISC-V model doesn't use it yet. I think it's also just a first step rather than fully solving the problem.
92.
▲
by
timhh
2y ago
That's not really what I meant. It's very easy to configure which instructions or CSRs exist, and excluding custom extensions there are really only two options for behaviour, so you just have a flag `haveSomeExtension()` to enable
93.
▲
by
timhh
2y ago
Yeah I completely agree. Especially annoying if RISC-V is the first ISA you've learnt which is probably the case for a lot of people. I don't think you meant D3-1 btw.
94.
▲
by
timhh
2y ago
I've been doing a lot of work with Sail (not SAIL btw) and I'm not sure I agree with the points about it. There's already a way to extract functions into asciidoc as the author noted. I've used it. It works well. The liq
95.
▲
Anakin – Automatically Kill Orphans
(github.com)
89 points
by
timhh
3y ago
|
23 comments
96.
▲
by
timhh
3y ago
> no, I don't need to accept your PR just because you put work in it, you should have checked with me first, before doing it Which is a bit rude IMO, and not really in the spirit of open source. I never demanded that he accept it. A
97.
▲
by
timhh
3y ago
Yes it's unsolicited "advice" that shows an uncooperative attitude IMO. You can say "I don't want to do that" in a nice way without being patronising. If you look at the other closed MRs you'll see a simil
98.
▲
by
timhh
3y ago
I attempted to use this but was disheartened but the fact that it doesn't statically type node names. Tree Sitter doesn't either but it has much more of an excuse given that it targets C. https://github.com/lezer-p
99.
▲
by
timhh
3y ago
Haha someone didn't like that I'm pointing out flaws in Python and down-voted that question.
100.
▲
by
timhh
3y ago
Here's a bug I ran into with Python async: https://stackoverflow.com/q/78036302/265521 I've written about 200 lines of Python async code in total, so to run into a bug like that so soon was not encouragi
101.
▲
by
timhh
3y ago
IMO that URL crate is not especially high quality. I barely work with URLs and I quickly found an embarrassingly trivial bug: https://github.com/servo/rust-url/issues/864#issuecomment-16...
102.
▲
by
timhh
3y ago
Neat. I did a similar thing for analysing the output of commands that can produce JSON (SLURM in this case). Worked pretty well but I immediately ran into PRQL's lack of support for DuckDB's struct types.
103.
▲
by
timhh
3y ago
That's completely feasible and there are languages that do this. It doesn't really eliminate the need to run your program unless the inputs to your program are also completely restricted types like One, Two, Three. In which case
104.
▲
by
timhh
3y ago
Ah yeah I should have said "a library for which the integration is easier than writing my own library from scratch"!
105.
▲
by
timhh
3y ago
I had to write an expression parser recently and found the number of names for essentially the same algorithm very confusing. There's Pratt parsing, precedence climbing, and shunting yard. But really they're all the same algorithm
106.
▲
by
timhh
3y ago
Due to the regularisation yeah they all start at the same rating. But you don't need many votes to start getting good ratings. I introduced this method to Dyson for objectively calculating very subjective measurements (e.g. "how f
107.
▲
by
timhh
3y ago
You can do much better than just sorting. The simplest is to use Bradley-Terry. It's a very simple algorithm and will let you combine results from multiple users and gives an actual rating rather than just a ranking. It also handles th
108.
▲
by
timhh
3y ago
Interesting. Difficult to tell how complex the bugs are though. Some of them seem to be just triggered by accessing non-existent CSRs which suggests those chips haven't been very well verified already? Also: > Cascade discovered 3 i
109.
▲
by
timhh
3y ago
This is neat. I feel like it should be blind by default though.
110.
▲
Cross-Compiling Rust on GitHub Actions
(blog.timhutt.co.uk)
3 points
by
timhh
3y ago
|
0 comments
111.
▲
by
timhh
3y ago
I have the same but I wouldn't recommend gRPC. It adds a ton of overhead and complexity that you don't want. Plus you have to deal with all the complexity of Protobuf and the fact that everything becomes `Option<>`. Instead
112.
▲
by
timhh
4y ago
> Are you judging with that experience? Yes. Again, merge conflicts are intuitive (there were two different edits to the same code; you have to resolve the conflict). But yet again Git makes things difficult - using words like "Ours
113.
▲
by
timhh
4y ago
I disagree. The model is intuitive. It's just that Git dresses it up in confusing language, a terrible CLI and a gazillion half baked GUIs. It doesn't help that lots of people recommend not using a GUI which is terrible advice f
114.
▲
by
timhh
4y ago
> It should be possible to sync all of my branches (or some subset) via merge or rebase, in a single operation. Not sure if this is exactly what the author is looking for but I made Autorebase exactly for this. https://github.
115.
▲
Fixing Clickbait with ChatGPT
(blog.timhutt.co.uk)
3 points
by
timhh
4y ago
|
1 comments
116.
▲
by
timhh
4y ago
That sounds great! I have partly solved this issue in my autorebase tool ( https://github.com/Timmmm/autorebase ) - it basically rebases every branch, and fixes the commit time so that stacked branches get preserved even
117.
▲
by
timhh
4y ago
People don't dislike it because they are unaware how helpful it can be. They dislike it because they are aware how hacky, fragile and error-prone it is. They want something more robust than text substitution.
118.
▲
by
timhh
4y ago
Ha I suggested this on the C++ proposals mailing list 7 years ago: https://groups.google.com/a/isocpp.org/g/std-proposals/c/b6n... Enjoy the naysayers if you like! I'm glad someone spent the ti
119.
▲
by
timhh
4y ago
I don't think those high end locks are made of plastic though!
120.
▲
by
timhh
4y ago
Thanks!
More ›