Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
ncmncm
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
47 ms
·
481.
▲
by
ncmncm
4y ago
Nukes just cost more. Always have, always will. Like geothermal, they depend on a steam turbine that is expensive to maintain. It is hard for anything with a steam turbine to compete with anything without. Nukes have the extra ball-and-chai
482.
▲
by
ncmncm
4y ago
Right, you only roll out storage as fast as you have overcapacity to charge it from. The amount of storage build-out that justifies, thus far, is easy to accommodate with batteries. Later, as renewables shoulder more of the load, the storag
483.
▲
by
ncmncm
4y ago
Solar, despite its fast accelerating installation rate, is still a very, very small fraction of the mix, most places.
484.
▲
by
ncmncm
4y ago
Eek. I am corrected. Now I need to find the nonstandard flags to set to turn it off.
485.
▲
by
ncmncm
4y ago
I am corrected. Eek.
486.
▲
by
ncmncm
4y ago
I am corrected. Now I need to start turning on nonstandard flags to disable it.
487.
▲
by
ncmncm
4y ago
It won't do that by default. You need to set some non-portable flags to get it to munmap things. Unmapping trashes page-map caches of other threads in the process. That involves inter-core interrupts. Not pretty.
488.
▲
by
ncmncm
4y ago
> it's just what it takes to do this in C++ False.
489.
▲
by
ncmncm
4y ago
Can't recall. Got them in Sweden. The name includes "lakrits", but that is on everything.
490.
▲
by
ncmncm
4y ago
Malloc will not unmap memory. Period. That would have huge performance cost in multi-thread programs.
491.
▲
by
ncmncm
4y ago
None of them unmap freed memory.
492.
▲
by
ncmncm
4y ago
Not correct. It is very rare for memory ever to be freed to the OS before process exit. Malloc never does. And, zeroing the memory, if code later uses it like a pointer, that will be null and the use will trap.
493.
▲
by
ncmncm
4y ago
Allocators really were slow. I.e. it was easy to write a general-purpose allocator 10, 100, or (on SGI Irix!) 1000 times faster than what their libc did. Nowadays it takes work to get more than 10x, but hardly any to get there.
494.
▲
by
ncmncm
4y ago
Writing random values to freed memory would mostly work, at some cost to performance. The memory could get allocated again before it is re-used, and whatever is put in it might be less trappy than a random value. And, of course, a random va
495.
▲
by
ncmncm
4y ago
Probably you should decompile it, instead of starting from scratch. This is made easier because apps are distributed in bytecode form, and compiled to machine code on installation. The bytecode is retained in the .apk file, IIUC.
496.
▲
by
ncmncm
4y ago
Might fail there, too, but only sometimes, if the memory gets allocated again.
497.
▲
by
ncmncm
4y ago
Memory allocators generally don't unmap anything, because the performance hit on any other threads running is severe. When memory is unmapped, caches of memory mappings of other threads are discarded, via inter-core interrupts. Then th
498.
▲
by
ncmncm
4y ago
It is anyway a lot easier to simulate a solid that has no defects. But many properties found that way turn up in defect-ridden, real materials too. A truly periodic substrate lets you wrap it in a closed universe just big enough for what yo
499.
▲
by
ncmncm
4y ago
The go-to reference for web scraping used to be weboob.
500.
▲
by
ncmncm
4y ago
I like the ones that are tiny, rock-hard pellets, and you can't keep them in your mouth long enough to dissolve, because they are so strong it hurts. Is there a name for those?
501.
▲
by
ncmncm
4y ago
Yet, a few pieces a day is plenty.
502.
▲
by
ncmncm
4y ago
If it takes a $4B fine to get Google to behave, then a $4B fine is the right amount, regardless of revenue. Revenue hints at the fine that would get their attention. We charge people with a crime to see if their part in it can be proved. Se
503.
▲
by
ncmncm
4y ago
It has been years since I was tempted to template metaprogramming. It is a specialist technique being made redundant by straightforward language features that compile much faster.
504.
▲
by
ncmncm
4y ago
C++ lambda is particularly adapted to the needs of C++, and C++ programmers. It would be very surprising if it matched any Lisp's. Lisps differ from one another, too.
505.
▲
by
ncmncm
4y ago
That only happens in specially marked Rust-advocacy posts. More people pick up C++ to use professionally in any given week than the total population of working Rust coders. Rust is practically invisible outside hipster media.
506.
▲
by
ncmncm
4y ago
Inheritance is a specialist technique, use of virtual members moreso. Most destructors in modern C++ are left to the compiler to generate. It has been years since I last coded a virtual destructor.
507.
▲
by
ncmncm
4y ago
The substantial performance overhead, in Rust, of code to handle those types is unavoidable, even where source-level inconvenience has been minimized. Overhead is imposed all up and down the call chain, every time through. Seems pretty rele
508.
▲
by
ncmncm
4y ago
That is for courts, but it should be enough to produce correct behavior by eliminating incentive to violate. If the fine is too small, it becomes operating expense, as is usual in the US. Probably any fine should accompany (but not depend o
509.
▲
by
ncmncm
4y ago
The SC imposed its judgement long before Jan 6, and according to no deadline but their own impatience. Which you already knew but seek to obscure. Why?
510.
▲
by
ncmncm
4y ago
Option and Result types are as easily coded in C++. The former is in the Standard C++ library. The latter will be in the next, but anyway the one in Boost has worked fine forever. Throwing, instead, is a choice unavailable to Rust coders, s
More ›