Viewing profile — lkirkwood
lkirkwood
HN member- Joined
- Wed, Aug 31, 2022, 10:56 AM UTC
- HN karma
- 71
- Public activity
- 36 items
- HN profile
- View on Hacker News ↗
About lkirkwood
No profile information was provided.
Recent public activity
-
comment
Comment #48874326
Not much skill in problem solving if you can't Google some react syntax
-
comment
Comment #48874098
Not that everyone should know it but it's definitely widely used. A Google search for "stack UAF" also turns it up.
-
comment
Comment #48334039
The tone here is a bit rude but I'm still curious: what does no runtime mean to you?
-
comment
Comment #47813393
Why? I thought it was pretty good, just get the rest of your function a lot of times and no context switching to type to an agent or whatever. It just happens immediately and if it…
-
comment
Comment #45831439
... why? What does it offer that literally any other IDE does not? Genuinely asking.
-
comment
Comment #45808112
Are there that many people running Windows on ARM machines? I don't think I've ever met someone who was.
-
comment
Comment #45640091
Tokio is fast, but it's huge! Check the size of any library or binary that includes tokio with even minimal features, let alone their recommended default feature set which comes wi…
-
comment
Comment #45511954
I wish there was more of this in the world. Educational math content is very hard to do well. Great stuff!
-
comment
Comment #45511642
If you're using LLMs for a large number of arithmetic calculations, you're exactly the problem GP is talking about. If you absolutely must use AI get it to generate code that will …
-
comment
Comment #45500912
What is so superior about Visual Studios debugging experience that you're sure it can't be replicated anywhere else? I've never used it.
-
comment
Comment #45462018
I find this infuriating. I get absolutely no sense that this is AI, and this bizarre attitude towards em dashes is nonsense. Loads of people use them, especially in less formal wri…
-
comment
Comment #44418417
Wow that is not encouraging
-
comment
Comment #44413018
This is a funny thought, but do you think this would really happen? Surely anyone hiring a programmer would be aware of this.
-
comment
Comment #44001948
Just nitpick but all odd numbers end in an odd number, not 1, and all even numbers end in an even number i.e. a multiple of 2.
-
comment
Comment #43995230
Well that's the claim, isn't it. People tend to see an hour tick over and think "well, better wrap up". The impulse is much less strong at ten minutes to the hour. It's a bit like …
-
comment
Comment #43937382
Yes, but once I'm at the checkout or it starts raining, I reach for it...
-
comment
Comment #43728904
In my opinion it's unhelpful to pathologize behaviour like being blunt or speaking your mind. It's just another expression of the impulse to split the world into an in-group and an…
-
comment
Comment #42243676
I felt the same but after switching to anyhow and thiserror in pretty much every Rust project I work on I find it quite painless. It's not ideal to rely on crates for a core langua…
-
comment
Comment #41867106
I think they probably do agree, GP says one per person wouldn't be enough.
-
comment
Comment #41564713
... do you think people don't use Java anymore?
-
comment
Comment #41544861
Sorry but that comparison is nonsense. Potato chips are just fried slices of potato. How would you squeeze 6-8 medium potatoes ( each weighing 5-10oz according to top Google result…
-
comment
Comment #41336616
I used to feel this way but having installed Ubuntu on a friend's old laptop for him, it's crazy the amount of stuff you forget you do because it's second nature. I certainly think…
-
comment
Comment #41177149
It's true that in the case of a sorting algorithm it's not immediately obvious how to analyse the time complexity with Big O. However, I feel that you may be getting bogged down in…
-
comment
Comment #41133929
> It's anyone's guess if the code you wrote a year ago would work today Is that true? In what sense? I was under the impression the editions took care of that.
-
comment
Comment #41084792
No, I believe you are forgetting the context. Big O is a upper bound on the growth rate of a function. In this case the function describes the time taken, therefore a higher time i…