Optimize `stacktrace` by avoid large allocation

@achabense observed that pre-initializing internal vector in stacktrace to the maximum possible depth has noticeable performance impact:

https://github.com/microsoft/STL/blob/2261f7edb760eb3fe0726187c818b796dc7ea798/stl/inc/stacktrace#L142
https://github.com/microsoft/STL/blob/2261f7edb760eb3fe0726187c818b796dc7ea798/stl/inc/stacktrace#L303

The CaptureStackBackTrace API does not have a way for determining the needed amount in advance.

Currently we don't maintain own array management in stacktrace and using vector to avoid dealing in one more place with:

• copying/moving/assignments
• allocators
• ASan

What could we do:

• @AlexGuteniev suggested that we can create a secret constructor for vector without initialization.
• @StephanTLavavej suggested we can use smaller allocation on stack, and then try maximum if smaller overflow, otherwise copy data from the stack and not allocate large amount. Smaller could be 32 entries, which is 32*sizeof(void*) bytes,
• @strega-nil-ms suggested we could start with smaller allocations and grow in a geometric progression

Start at stl/inc/stacktrace around the referenced lines and review how CaptureStackBackTrace fills the vector. Compare the proposed smaller-stack, geometric-growth, or uninitialized-vector approaches; done means avoiding maximum-size initialization while preserving copying, moving, assignment, allocator, and ASan behavior.