It doesn’t matter to the downvoters. Here’s a deleted question closed as “too broad”: https://stackoverflow.com/questions/57064879 Copy-pasting below.
What is the best way in C++ to calculate the coordinate of a rectangle (hyper-rectangle) in n-dimension? I have dimensions of the rectangle in a 1d vector like {1d_min , 1d_max ,2d_min,2d_max, ...., nd_min,nd_max}. For example, in 2d the dimensions are {1d_min,1d_max ,2d_min,2d_max}. And the coordinates will be {1d_min,2d_min},{1d_min,2d_max},{1d_max,2d_min},{1d_max,2d_max}. However, I want it for n-dimension.
For people with even minimal background in geometry, it’s obvious the OP wants coordinates of all vertices of an axis aligned hyper-rectangle. A good question in my book, and it has very simple and elegant answer which I wrote there (using bits from an integer vertex index to select min or max coordinates).
Re:Tired of Stack Overflow
by andrewprock on Tuesday September 03, 2019 @05:22PM
(#20871316)
And to prove your point, the question has now been removed.
Oh my questions were very specific usually
(the hardest one I remember was how to put a borderless window inside another window (because it could change) and making it all work. Think some good amount of win32 quirkiness was needed for that to work the way I wanted)