Re: "pointer stack instead of object stack"
Fragment of a discussion from User talk:Skilgannon/KDTree
Jump to navigation
Jump to search
Yeah, that's exactly where I was trying to speed things up. The way it is now, any path that I don't descend never has its Node contents examined, because I don't have to open up the Node to get the index when checking the bounds anymore. This means the Node contents (and the pointer to it) is never loaded unless it is determined that the Node needs to be searched.
Benchmarking says it's just a *tiny* bit quicker, and I like it so it stays =)
Skilgannon (talk)
