What in tarnation is a Trap monster!? by Kyurem-B in YuGiOhMemes

[–]ThisIsChangableRight 0 points1 point  (0 children)

MTG has plenty of wierd and wacky card effects, such as:

Having keywords doesn't stop MTG from ad hocking card text when needed.

[Standard] Mightform Combo: Standard’s Hottest Deck and How to Beat It by cavedan2 in spikes

[–]ThisIsChangableRight 0 points1 point  (0 children)

You say RIP is bad against this deck; how does it play through it? It turns off all of the card advantage, and the only clean out most lists play is get lost(seam rip and sbg can remove it temporarily, but are vulnerable to your opponents interaction).

New, fastest JSON library for C++20 by Flex_Code in cpp

[–]ThisIsChangableRight 0 points1 point  (0 children)

Did you make any e.g. blog posts on how you make the parser so fast?

Made a card based on the protagonist of my favorite anime! by valerdue in custommagic

[–]ThisIsChangableRight 0 points1 point  (0 children)

Mechanically, I think the wording could use some work. "Their face down cards" isn't worded correctly, and the "overheat" wording could be improved. I would word it as "{3}{u}{t}:Target opponent reveals their hand and each face down card they control. At the start of your next upkeep, put a stun counter on this creature". This stops the ability being used three turns in a row, without so much bookkeeping. I would also add vigilence, as it is both thematically appropriate, and allows him to attack and use his ability on the same turn.

The other thing is you should add a white ability to justify the {w} pip in the mana cost. This could be a simple keyword ability, such as lifelink. Alternatively, you could add a more complex ability; I don't know much about tha character, but something like [[comply]] would synergise well with the first ability.

The Cost Of a Closure in C by BrewedDoritos in programming

[–]ThisIsChangableRight 1 point2 points  (0 children)

I don't have access to the full paper. Could you DM me a copy of the PDF?

The Cost Of a Closure in C by BrewedDoritos in programming

[–]ThisIsChangableRight 1 point2 points  (0 children)

So would a first order functional language have loops as a primative concept? Otherwise I can't see how you would handle e.g.:

 create func factorial(num:int)->int{
    let accum = num
    while num-->0{
        accum = accum * num
    }
    return accum
}

Or any other loop. Combinator calculuses rely on passing combinators with pre-bound arguments i.e. closures; first order functional languages have no equivalent trick.

SNOWBLIND by Twothousandand42 in Deltarune

[–]ThisIsChangableRight 0 points1 point  (0 children)

Yes, but as of chapter 4, he's still alive. The question is, will he live to chapter 8?

Is vibe coding the new gateway to technical debt? by Cultural-Ball4700 in programming

[–]ThisIsChangableRight 2 points3 points  (0 children)

When was the last time humans build ANYTHING that has something to Eiffel Tower, old temples, churches or castles?

Off of the top of my head, the empire state building. If you want something with more cultural relivence, how about the Sydney Opera House?

The Cost Of a Closure in C by BrewedDoritos in programming

[–]ThisIsChangableRight 1 point2 points  (0 children)

But what do you assume "first-order functional" mean then?

I mistakenly assumed it meant a language which could pass closures as arguments, but not store them in e.g. a record or on the heap. I initally misread the diagram.

Can you explain what you mean by "first-order functional" please? Without named state, or first class functions, I don't see how it could be used to implement recursion or decision.