Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
DennisL123
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
5 ms
·
1.
▲
by
DennisL123
1mo ago
Nice work. Getting DT edge cases right can be quite some work. Shameless plug: My own DT for int32 coordinates in Rust, and compiled to wasm with a bit of visualization. Click to add and remove sites, hit animate for a bit of lava lamp like
2.
▲
by
DennisL123
2mo ago
I wish the article was written in a better way. It throws put many percentages in different contexts. 50-26-37-41- … Not saying any particular number is wrong, just wishing it was a clearer way of writing.
3.
▲
by
DennisL123
2mo ago
There’s something missing in the discussion. Building software is about achieving outcomes, not about generating output, ie tokens. Yet, the ai business case is selling output, obviously. Not sure how to reconcile the two. Ideas?
4.
▲
by
DennisL123
2mo ago
Use FOOD30 for 30% off.
5.
▲
by
DennisL123
2mo ago
In a world without AI/LLMs/agents the rewrite would have been major news how much better software gets when ported to Rust.
6.
▲
by
DennisL123
2mo ago
Yes, been using it for 18’ish months. Works great.
7.
▲
by
DennisL123
3mo ago
Now, that’s a Commodore phone I can get behind.
8.
▲
by
DennisL123
3mo ago
not so sure about this one.
9.
▲
by
DennisL123
3mo ago
<snark> Arguably the one thing C++ is great at is its type system. Makes total sense to cast it away. </snark>
10.
▲
by
DennisL123
4mo ago
> Friend, you’re diabetic. Your survival is ultimately your own responsibility. Prepare yourself for a few hard truths. This.
11.
▲
by
DennisL123
4mo ago
Does the policy fix the issue of many low quality PRs being submitted? Unlikely. Will it fix a related but different problem? Likely.
12.
▲
by
DennisL123
6mo ago
Gotcha. It seemed though from the replies on the github ticket that at least some of the problem was unrelated to effort settings.
13.
▲
by
DennisL123
6mo ago
Happy to have my mind changed, yet I am not 100% convinced closing the issue as completed captures the feedback.
14.
▲
by
DennisL123
6mo ago
If agents can already read and rewrite code, literate programming might actually be unnecessary. Instead of maintaining prose alongside code, you could let agents generate explanations on demand. The real requirement becomes writing code in
15.
▲
by
DennisL123
7mo ago
Yes, the idea was to transition to a variant of MLD that lends itself to the offline use case and would use an updated modeling to be more space efficient while preserving performance. There exists an incomplete (and private) PoC written in
16.
▲
by
DennisL123
7mo ago
Who knows .. ;)
17.
▲
by
DennisL123
8mo ago
Agree, mercator projection isn’t great. But it’s pretty simple. All of the mapping apps are rooted in paper maps. That’s what most people find accessible in a natural way. So, in any 2D world view some projection must be chosen, and you can
18.
▲
by
DennisL123
9mo ago
Last minute I sold 200 €/$£/¥ worth of product. At this rate and because online sales is 24/7, I am hitting 200*60*24*365 = 105.120.000 ARR. tada!
19.
▲
by
DennisL123
1y ago
In the US the price varies a lot by state [1]. [1] https://www.electricchoice.com/electricity-prices-by-state/
20.
▲
by
DennisL123
1y ago
Yep, that’s the one. There are a number of follow-up papers that engineer individual aspects of the implementation.
21.
▲
by
DennisL123
1y ago
I was referring to variants of Customizable Route Planning. Easiest to implement is likely the partitioner of Sommer et al, and a unidirectional multi-level dijkstra.
22.
▲
by
DennisL123
1y ago
OSRM founder, here. Yes, you are right, many of the speedup techniques are related. My personal opinion is, tho, that looking at the identification of important nodes is best captured by the ideas of applying partitioning to multi-level dij
23.
▲
by
DennisL123
1y ago
Efficiency, not effectiveness. They are all effective in the sense that they produce sorted results. Even the non-modern sort algorithms are effective in the sense that the results are correct. This should be about the efficiency with which
24.
▲
by
DennisL123
1y ago
A way to give radix sort a performance boost is to allocate uninitialized blocks of memory for each bucket that are of size n. It exploits the MMU and you don’t have to worry about managing anything related to buckets potentially overwritin
25.
▲
by
DennisL123
1y ago
A winner tree uses extra space, doesn't it? That might exclude it from certain applications to be an alternative. Four-ary heaps are roughly (ymmv) twice as fast as binary heaps by exploiting cache locality in a better way for small ke
26.
▲
by
DennisL123
1y ago
A BUILD.md could be useful.
27.
▲
by
DennisL123
1y ago
Interesting stuff. Not sure if I read this right that it‘s 16 und 32 bit values of integers that get sorted. If yes, I‘d love to see if the GPU implementation can beat a competitive Radix sort implementation on a CPU.
28.
▲
by
DennisL123
1y ago
OSRM lead dev here. Love to see this large of an instance being solved.
29.
▲
by
DennisL123
2y ago
It precomputes partial routes that are combined at run time. :)
30.
▲
by
DennisL123
2y ago
tl;dr: doesn‘t work as expected and we sank a ton of money on it too.
More ›