I deleted my 14 year old reddit account when they pulled their shit. Then I recently created a new account because I need to be able to get answers to specific programming questions sometimes, and lemmy doesn’t have the population of users that reddit still has. I generally post on both lemmy and reddit, but I almost always get more answers on reddit.

Why are you traveling to make a call? You could just call.

Ah I didn’t realize most people have moved onto OnceCell. The issue with both lazy static and oncecell is that they can only be assigned to once. You need a global mutable state, so neither OnceCell or lazy_static are the right choice.

You’re going to be fighting the borrow checker if you try to have global mutable state. It will bite you eventually. You can potentially use an interior mutablity pattern along with a mutex. Have you looked into interior mutability?

Very cool. I’ll have to try it out. I just started using React, and I’m beginning to love it. React with rust sounds like heaven.

Maybe lazy_static? Personally I’d just pass a borrow to the vec around. It’s very common for programs to have some global state that they pass around to different parts.

Woah. First I’ve heard of dioxus. Has anyone here tried it?

Lol not a great name choice. Wish I would have thought of it though.

I get why the binary is there, but there really should be a simple way to force compilation instead of downloading a precompiled binary.

Serde is incredible though, so it can get away with basically anything it wants.

Ideally, all of these values should be represented in memory exactly the same way:

That would make the game hard to play, since you’d have to think about where your move would end up since it won’t stay on the cell you click.

I think you’re wanting to store them that way so that you can easily check for win conditions, maybe? But that’s the wrong approach. Store the cells as they appear to the player, in a 2d Array (or 1d Array with indexing math. That’s how I’d do it).

Then you can take advantage of symmetries in your win condition code, if you like. But it really couldn’t be much simpler than counting the matching cells in each row, column, and diagonal. That’s just 8 groups of 3.