HNHacker News
TopNewBestAskShowJobs

rand0mstring

-1 karma · joined September 24, 2019

submissionscomments
rand0mstring··on How we made a Ruby method 200x faster
by deleting it
rand0mstring··on (Work in progress) LLVM Libc: The LLVM C Library
any idea when this will be useful? first heard about this years ago
rand0mstring··on How much memory does a graph take?
this makes no sense. it's the wrong tool for the job. you want to be using a sparse adjacency matrix to store your data, and then operate on it. will be orders of magnitude faster than this.
rand0mstring··on Tell HN: C Experts Panel – Ask us anything about C
can you link any to check out?
rand0mstring··on Tell HN: C Experts Panel – Ask us anything about C
is there no way to make C "memory-safe" during compilation?
rand0mstring··on Tell HN: C Experts Panel – Ask us anything about C
will we ever see compile time programming in C like constexpr in C++?
rand0mstring··on Show HN: KCP: a new low-latency, secure network stack
anyone have thoughts on this?

"Optimization, again. TCP is implemented in the kernel and, in part, in the network card. When using TCP we can make one call to the kernel to hand it a large buffer of data and say “segment and package this as you see fit”. When using UDP, because we have to do that segmenting and packaging ourselves, we hand each packet individually the kernel. Each call to the kernel is expensive and the overhead becomes very significant, especially in Go. The kernel’s TCP stack is also highly optimized for performance while the kernel’s UDP stack is typically not."

https://forum.syncthing.net/t/connections-over-udp/9382

rand0mstring··on Show HN: KCP: a new low-latency, secure network stack
ditto lol