tmyklebu

10 ms·

61.
by tmyklebu 10y ago
I wasn't aware of the ambiguity surrounding the underflow flag noted in your second link. However, the other complaints I'm reading from your links (things not specified by the standard may vary in behaviour; the standard is writ
62.
by tmyklebu 10y ago
Floating-point math is carefully-defined. There are multiple independently-developed but interoperable implementations and an IEEE standard that talks in detail about how floating-point math is supposed to work. It's not "a bit
63.
by tmyklebu 10y ago
Writing ad-hoc tagged unions and two-element 'optional' structs is a completely straightforward mechanical task---exactly the sort of thing that a programming language ought to automate. Why does there need to be a "compromi
64.
by tmyklebu 10y ago
In modern gcc, std::variant doesn't look like a competent replacement for old-fashioned tagged unions. On x86_64 Linux, it looks like a function with signature `void f(std::variant<int, char>)` expects its (8-byte) argument to be
65.
by tmyklebu 10y ago
You can use the usual BSD socket API (in which case the context switches to/from the kernel for calling read() puts the contemplated workload out of reach) or any number of vendor-specific userland network stacks. There is no need to
66.
by tmyklebu 10y ago
I'm not clear on why coroutines or an explicit state machine are necessary to implement network protocols. We have been doing it for decades by writing straightforward imperative C code and for years by writing C++ template classes th
67.
by tmyklebu 10y ago
180ns overhead per packet means the time budget per packet for your business logic goes down by 180ns. That said, I suspect you can live a long life without ever encountering a situation where this matters.
68.
by tmyklebu 10y ago
I'm not sure we have a sufficiently efficient concurrency mechanism that doesn't simply give the user control over scheduling decisions. Depending on how many tens we're talking about, those tens of nanoseconds for a context