budabudimir

A site where you can play against titled chess players. Games are played on Lichess.

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.

Anyone can optimize a database for trivial queries. Would be nice to at least see TPCH results or any other more complex benchmark.

It does say something, one someone can become so overweight and being considered poor at the same time.

Hello everyone,

I've built a small project in my spare time, an elo based rating system for MMA fighters. I looked for a bit and haven't find anything of a sort.

Data is sourced from Sherdog.

Any feedback, feature requests or bug reports are appreciated! :)

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.

Thankfully we switched to ninja.

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

Definitely a much better choice

A database implemented in JS; very encouraging. I guess performance and robustness were not a priority.

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

I get the point, but mmap is a syscall as well. Perhaps a better title would be, "Why using mmap is faster than using read and write syscalls".

Would using O_DIRECT flag result in similar timings for mmap and read/write?

Exactly, never thought I'd say this, but true.

This pool seems to be completely out of touch with reality. Venezuela in the top 10 happiest countries?

What is the difference between each team owning a microservice and owning a part of the monolith?

There is common release process, but with proper infra in place, that shouldn't be a problem.

It's not slow?

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.

We could be violently agreeing, not sure :)

Indeed, could you expand on that a bit?

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?

I don't think a ordered data structure with O(1) insert time is even possible, as that would mean that you can do sort in O(n).