iopq

60 ms·

391.
by iopq 4y ago
In Baduk gambling in Korea, you pay for points, so you might expect people to just minimize differences to pay out less, but they end up fighting all game instead. This is because it's capped for resignation, it might be cheaper to res
392.
by iopq 4y ago
It only stays relevant if the JavaScript is too slow. In the case of removing two elements from an array of length 8, it's not too slow to remove them one by one since, again, it runs in microseconds
393.
by iopq 4y ago
Allowed in Rust: https://play.rust-lang.org/?version=stable&mode=debug&editio... it's an array of length 0, but it can't be "used" because it has a length of 0 so it occupies no RAM
394.
by iopq 4y ago
No, it's the first element, if it's a 32 bit int it still occupies bytes 0..4 the second int occupies bytes 4..8 you can see the array up to the second int occupies the contiguous space 0..8 which 0..4*2 and it has TWO elements
395.
by iopq 4y ago
An array of length 0 starts at 0 and ends with 0
396.
by iopq 4y ago
Sometimes it executes it exactly how you think it will execute. But it's still slower because the "less optimized code" fit in its cache.
397.
by iopq 4y ago
In college, I optimized the array removal routine from O(N^2) to O(N) by using INVARIANTS But it probably ran in like 100us anyway
398.
by iopq 4y ago
When I did web dev it was more important to know how the WEB BROWSER works, not how machine code works it's not useful to know how the browser allocates memory or garbage collects it, it's more useful to know that it has web socke
399.
by iopq 4y ago
Counter-example: You have to remove all desks from #20 to #30, how many desks are there? Oh, it's 11 desks, I see. This is because we used INCLUSIVE indexing, instead of semi-open interval. If we use semi-open intervals, we don't
400.
by iopq 4y ago
When I did web development, I specifically loaded JS lazily so first you got a pure HTML page with just a few lines of code. Those lines of code are normal (not jQuery) JS that loads the rest of the JS lazily in a progressive enhancement. T
401.
by iopq 4y ago
I tried it, hit a few bugs and immediately switched. The right click menu for the language bar was stuck on the desktop forever which annoyed me right away. It happens in Windows too, and I just don't want to use buggy software. Gnome
402.
by iopq 4y ago
That would be 病護士 and 檢査 I guess
403.
by iopq 4y ago
Second order thinking would be thinking about processes, rather than the situation. So if you have a problem like in the article, you don't like the current government. First order thinking is fund the rebels. Second order thinking is
404.
by iopq 4y ago
This is a first-order article on second-order thinking
405.
by iopq 4y ago
If the corporation is still giving a good service then libertarians like it. If it acts as a monopolist, then libertarians would dislike it and look for alternatives in the free market. That's why libertarians want a free market, to be
406.
by iopq 4y ago
This sounds exactly like a libertarian to me. Don't make laws against Google, I will just avoid using Google myself. You can't use coercive power of the government to reduce the power of corporations, since now you are just creati
407.
by iopq 4y ago
Thanks for that argument, you've changed my mind and now I believe the opposite of what I believed
408.
by iopq 4y ago
Libertarians have no problem with privately run organizations, like unions. Anyone has the right to associate with anyone they want. You just can't force someone to be in your union to get a job
409.
by iopq 4y ago
> Anarchists, in the "headless governance" meaning of the term. Distributed decision making without representatives. which is the same as libertarianism, since the ultimate libertarianism is a system without a government at all
410.
by iopq 4y ago
Nobody said I can't use a SIMILAR search query to have a slightly lower bound for relevance. Machine learning can identify if two queries mean a similar thing in the context of search
411.
by iopq 4y ago
There should be a relevance score, and it might be cross-referenced to other similar search queries that mean the same thing, but that's a machine learning project all on itself
412.
by iopq 4y ago
If they upvote a lot of spam sites, their account will have a low confidence rating, and won't influence each site's confidence. If they actually downvote a few hundred spam sites before casting a vote for a spam site to promote i
413.
by iopq 4y ago
You need to do it with user accounts so the search engine team can remove fake clicks and ban the user. Users with a low amount of ratings won't have any say in the rating of the site, since they will have a low confidence. They will f
414.
by iopq 4y ago
You don't just average user ratings, you need to have a smart system. First, each user needs to have a history or they won't be considered in the rating almost at all. Then, each user's history gets analyzed for average ratin
415.
by iopq 4y ago
I just want to see if it's a spam/scam page and avoid those results with less than 50% rating. The same way I used to see thumbs up/down on YouTube videos to see which videos are clickbait
416.
by iopq 4y ago
Let users just rate that search result, so if someone else searched for the same thing and didn't find it relevant, they can thumbs down. If they found it relevant, they can thumb up.
417.
by iopq 4y ago
The killer feature would be to rate this search result. If I could see other users hate the site, I won't spend time looking at it. Thumbs up and down would work just fine.
418.
by iopq 4y ago
Unless they wrote it in Rust, in which case it would be received with great praise
419.
by iopq 4y ago
When I tried to be more functional, it was really awkward in Rust I wanted to write some helper functions that applied an argument to a closure and I got this code fn apply<A, B, C, G>(mut f: impl FnMut(B) -> G, a: A) -> i
420.
by iopq 4y ago
My girlfriend is actually a 20 BMI 17 year old male (all wrong)

More ›