Game Engine Containers – handle_map
gamedev.net
Game Engine Containers – handle_map
1–10 of 17 posts
Re: Game Engine Containers – handle_map
#2Reminds me of this article [1] that appeared in game dev mag when that was still circulating.
[1] http://seanmiddleditch.com/data-structures-for-game-develope...
Re: Game Engine Containers – handle_map
#3I find it highly suspect when a data structure uses independently allocated nodes tha contain actual pointers (as opposed to indirection ints). I know people like to make the tree just be another node, but it's really really important to allocate things together! I would deem it mandatory to allocate every node in the same tree in the same vector.
Re: Game Engine Containers – handle_map
#4Mmmm, like getting a ticket to exchange for your coat.
Re: Game Engine Containers – handle_map
#5I find it highly suspect when a data structure uses independently allocated nodes tha contain actual pointers (as opposed to indirection ints). I know people like to make the tree just be another node, but it's really really important to allocate things together! I would deem it mandatory to allocate every node in the same tree in the same vector.
Are you criticizing the separation of m_sparseIds and m_items in this article? Could you give some more detail as to why you see this as a problem?
The only performance issue I see with having these separate is what the author describes as Consideration #2: you have to do completely separate read for the indirection which may incur an additional cache miss. But this is the cost of keeping the dense set dense and the handles constant.
Is there another issue I'm overlooking? Maybe I misunderstand you, as this structure does use int indexes (both for the free lists and to locate objects in the other array), and I don't know what you mean by "I know people like to make the tree just be another node"
Re: Game Engine Containers – handle_map
#6I find it highly suspect when a data structure uses independently allocated nodes tha contain actual pointers (as opposed to indirection ints). I know people like to make the tree just be another node, but it's really really important to allocate things together! I would deem it mandatory to allocate every node in the same tree in the same vector.
Are you criticizing the separation of m_sparseIds and m_items in this article? Could you give some more detail as to why you see this as a problem? The only performance issue I see with having these separate is what the author describes as Consideration #2: you have to do completely separate read for the indirection which may incur an additional cache miss. But this is the cost of keeping the dense set dense and the…
Sorry I'm not going to look at specifics, but I'm not arguing with the article; I'm agreeing with it.
Re: Game Engine Containers – handle_map
#7Earlier quoted context omitted.
Are you criticizing the separation of m_sparseIds and m_items in this article? Could you give some more detail as to why you see this as a problem? The only performance issue I see with having these separate is what the author describes as Consideration #2: you have to do completely separate read for the indirection which may incur an additional cache miss. But this is the cost of keeping the dense set dense and the…
Sorry I'm not going to look at specifics, but I'm not arguing with the article; I'm agreeing with it.
Ah, sorry, I completely misunderstood.
Re: Game Engine Containers – handle_map
#8Re: Game Engine Containers – handle_map
#9Do any languages have compilers that do this (semi-)automatically? Data layout optimizations are really lacking in the current state of compilers.
Re: Game Engine Containers – handle_map
#10Inspired by "Pitfalls of Object Oriented Programming"[0], i did something similar to this (in C). Idk how the cpu usage would be by doing it another way, but this way processing thousands of matrices is no problem.
[0] http://harmful.cat-v.org/software/OO_programming/_pdf/Pitfal...