The Round Stable

sable is one of those games that confuses me on some level

i remember when there was a demo of it and the game was clearly a broken mess,none of which was fixed when it was released

and yet the game got praise

indies have this genuine problem where people are unwilling to consider that a game might just be bad and no ammount of visual style is going to save it

apex legends is apparently a big deal in japan

no wonder so many vtubers play it

fortnite

get in, loser

we're going to japan

here's hoping I finally see the genre getting backlash

the first season of tng is not as bad as people make it out to be

no, i'm serious

yes, the first few episodes are bad, but the writing improves by the end

cute

Oh man that’s a nostalgia shot right there

much to my shame, i haven't touched any ps2 games in a while

angy

Pocket wrote: ↑

Mon Dec 06, 2021 10:36 pm

I have fallen down the rabbit hole of 8-bit homebrew

I am learning 6510 assembly and have PDF copies of several vintage Commodore 64 programming guides including the one that explains what all the memory registers do

help

update: oh lord it turns out the 6510 also has SECRET EXTRA OPCODES that were never documented and have been discovered by the community and can make certain very niche things go even faster

it's like the secret menu at the burger joint

this rabbit hole just keeps going, I am lost forever, remember me as I lived

I wish my colleagues would program a little bit more efficient
I am not the best programmer but at least I try to make sensible programming decisions.
Recently I was scanning manually through major parts of the project code and there were quite a lot of easy to fix parts that increase performance tenfold on average.

For example a set of data was filtered and then the first item of that result was taken. So it is definitely taking O(n) time including a huge allocation. It's more advantageous just to take the first match instead of going through the whole list. This only takes O(n/2) in average but it definitely returns a lot earlier and doesn't need to copy a lot of references into a new list.

Another one pet peeve is also sorting a list for finding a maximum value. Sorting takes O(n * log(n)) time. It's faster just to iterate over the whole list and comparing to a current maximum value during that search. That one is done in O(n).

Sometimes I want to scream

Japanese TV broadcaster NHK released an episode of Japanology Plus (English program about Japanese culture) about VTubers
https://www3.nhk.or.jp/nhkworld/en/onde ... o/2032252/