I see it says that it may throw bad_alloc, but it's not clear why, since the algorithm itself (e.g see "Possible implementation" below) can easily be done in-place.
I'm wondering if the bad_alloc might be because a single temporary element (of whatever type the iterators point to) is going to be needed to swap each pair of elements, or maybe to allow for an inefficient implementation that chose not to do it in-place?
Probably because there's internal conflicts between the store team and the applications group, that neither of them want to deal with anymore, this might have been for the windows S support (remember store only windows).
They have their own distribution system, so they don't need this anymore.
clickonce for a brief shining moment was the closest we ever got to being able to deploy an application like a webpage.
I did run into a lot of issues with the store/winrt APIs where there were backdoors that the NTDev team used to work around all the limitations, but they would never publish them.
I wish I could make the borrow checker give warnings not errors.
It would make exploration so much easier, so I don’t have to fight the borrow checker until I know how to build what I want.
reply