• 0 Posts
  • 12 Comments
Joined 1 year ago
cake
Cake day: June 15th, 2023

help-circle




  • So, a dark pattern is a design that tries to trick the user into something. But what is the word for “knowing what the user wants, blatantly ignoring it and imposing the companies will anyway”?

    Example: I think YouTube shorts are a terrible format, and I find them generally irritating. So I click the X on the element in YouTube that has a bunch of side scrolling cards, where each card is one of these shorts. YouTube informs me it will hide them for 30 days and then they’ll be back.

    Another example, Windows Update. I’ve set all the group policy settings so it should never restart and update without me triggering it. But, if I allow it to download the update, then damn my group policy settings, it is going to apply that update and restart whenever it wants.






  • Additionally, instead of actually trying to compete and gain users but making a platform that isn’t trash, they insist on instead trying to trick users with temporary free game offers. And if that doesn’t work, they try to strong arm users into going to their platform by buying exclusive sales rights to games, bringing exclusives to the PC gaming space.

    Their CEO is a loud clown who is always spouting nonsense on Twitter. They buy games studios and rip their games off of the platform where users bought them (see Rocket League), and discontinue mac/Linux versions that were fully functional.

    Their flagship game preys on children via micro transactions. They lack so many features on their platform that (I believe) they have endorsed using Steams community features for games bought on Epic.

    I could probably go on, but I think that’s probably sufficient.




  • I found this amusing enough to try it out. It does actually compile (I used g++ for this). However, the current implementation just goes into an infinite loop if you enter a number >= 2.

    I think the original author meant to do n -= 1 rn in the tweakin loop that is inside the bussin loop. That way, at some point n % i finna cap will be false, and i will bouta. Which then makes the expression i <= n in the bussin loop eventually false, so we stop bussin and yeet cap rn.

    However, that would mean that the intention of the program isn’t to output prime factors, because even with this fix it does not do so. The structure of mf chief() also doesn’t suggest that is the purpose as it is missing another tweakin and sussin like this example of calculating prime factors in C++.

    Example run:

    $ ./zpp.exe
    Enter a number larger than 1: 50
    2
    7
    8
    47