Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
hxhxhrra
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
3 ms
·
1.
▲
by
hxhxhrra
4y ago
Maybe consider a different color palette. I have a red/green color blindness (like ~8% of the male population), and I can only barely differentiate the colors.
2.
▲
by
hxhxhrra
4y ago
I wouldn't call some cases of UB like overflowing a signed int or running into a dangling reference "actively pushing the compiler". I'm having a hard time believing you didn't ever run into these or similar issues
3.
▲
by
hxhxhrra
4y ago
> I don't believe that it does. If the invalid arithmetic proceeds without crashing, and produces a value in the int32_t i variable, then that issue is settled. The subsequent statement should behave according to accessing that valu
4.
▲
by
hxhxhrra
4y ago
As others are pointing out, the C standard does allow this. There is no safe way to check for undefined behavior (UB) after it has happened, because the whole program is immediately invalidated. This has caused a Linux kernel exploit in the
5.
▲
by
hxhxhrra
7y ago
Algorithm fib1 („Dynamic Programming without Memoization“) is just ordinary recursion and not dynamic programming.
6.
▲
by
hxhxhrra
7y ago
It is hard to overestimate the importance of the OEIS in enumerative combinatorics. I discovered the main results of my PhD thesis essentially as follows: 1. Find complicated construction A, hoping to prove some new results. 2. Fail to suff
7.
▲
by
hxhxhrra
7y ago
This problem is called Chinese Postman Problem and can be solved in polynomial time using matching algorithms: https://en.m.wikipedia.org/wiki/Route_inspection_problem