Development discussion. Logged to https://ddnet.tw/irclogs/ Connected with DDNet's IRC channel, Matrix room and GitHub repositories — IRC: #ddnet on Quakenet | Matrix: #ddnet-developer:matrix.org GitHub: https://github.com/ddnet
Between 2022-10-13 00:00:00Z and 2022-10-14 00:00:00Z
i have brought new SSD and just installed windows and some software. I tried to run DDNet but it doesn't start, maybe i have no software like directX, visual C++, Framework, etc?
destroyed230
i have brought new SSD and just installed windows and some software. I tried to run DDNet but it doesn't start, maybe i have no software like directX, visual C++, Framework, etc?
I dunno i think had todo with underscores and stuff. It's more likely someone from vscode thought about a reason than us or not. But I'd need to check kde behaviour ^^
I understand the need for a virtual destructor. But why do we need a pure virtual destructor? In one of the C++ articles, the author has mentioned that we use pure virtual destructor when we want t...
does someone have an idea on how to efficiently check how far a player on a map is?
given : an std::vector<vec2> which stores the best path from start to finish and a vec2 which stores the position of the player.
ive tried to just to just loop over the vector and then return the smallest distance but its slow af...(even without square roots)
Teero
does someone have an idea on how to efficiently check how far a player on a map is?
given : an std::vector<vec2> which stores the best path from start to finish and a vec2 which stores the position of the player.
ive tried to just to just loop over the vector and then return the smallest distance but its slow af...(even without square roots)
sure but you can also store distance in that grid because
19:49
you start from the finish and then expand outwards by 1 tile at a time incrementing by one each pass
19:50
then you get a grid that has distance and you can do some checks to figure out where to go
Teero
does someone have an idea on how to efficiently check how far a player on a map is?
given : an std::vector<vec2> which stores the best path from start to finish and a vec2 which stores the position of the player.
ive tried to just to just loop over the vector and then return the smallest distance but its slow af...(even without square roots)