Substantiate please. Give me some links or statistics at least. Your claim is essentially that net-worth inequality is much worse than the income inequality. To me that is non-obvious and very likely wrong given that high net worth individuals are very rare and high income people somewhat common.
Substantiate please. Give me some links or statistics at least. Your claim is essentially that net-worth inequality is much worse than the income inequality. To me that is non-obvious and very likely wrong given that high net worth individuals are very rare and high income people somewhat common.
Does anybody actually care about the moderation team anyway? CoC is also just set of guidelines that people abide by anyway in most situations, but doesn't prevent anybody from being an asshole. When somebody is an asshole, random set of people can't really do anything about it.
Indeed, I had the misfortune of using SCons on one project back in 2017-2019. It was ridiculous how slow it was. Even for the case when "Nothing to be done" was the result it took 20-40 seconds to output the message.
I would have said that for any statically typed language.
It simply leads to more robust software because compiler rejects large set of incorrect programs that would otherwise end up in production. Your test coverage has to be much larger just to verify that your program is sane on the most basic level.
Rusts compiler is even stricter than most.
Not to mention resilience to change, JS is simply a blunder
It is skipping the buffer cache that is true, but, if I understand things correctly, it allows kernel to use user provided buffers directly, thus skipping the copying of the data from kernel to user land. That is why buffers used in O_DIRECT context have to be aligned properly.
It would be fun to run the experiment non the less.
From open(2) man pages on O_DIRECT:
Try to minimize cache effects of the I/O to and from this
file. In general this will degrade performance, but it is
useful in special situations, such as when applications do
their own caching. File I/O is done directly to/from user-
space buffers
It takes it 30s, on a decent size codebase, just to tell you that there is "Nothing to do." There is order of magnitude difference between it and make. It's a complete travesty!
You raise an interesting point, how are they going to prevent Amazon just taking their business with making SkyllaDB on demand? Confluent ( Kafka folks ) did it by adjusting the licence.
That's true for array, that expected insert time is O(1), and it still holds for N inserts, because you double the size every time, which yields O(2N) time complexity. This is not the case for this data structure, time complexity of inserting N elements is O( N log N ), therefore expected complexity of inserting single element cannot be O(1), even if single insert sometimes can be O(1),
O(1) in the paper referred to restructuring, after O( log n ) search time.
Even if what you meant is expected time complexity for the single insert operation is O(1), that surely cannot be the case. What would be expected time complexity of N inserts then?