I want to transform a self-defined structure into a std::string,and it occurs to me to use std::stringstream because it can easily transform various kind of type into std::string.

The newest version of Visual Studio C++ compiler broke our code. Our application uses
STL algorithm like std::minmax_element on measured samples. Sometimes the devices do not deliver a valid sample and a NaN element is inserted instead.

I’m using Sublime Text as my IDE, anyone can tell me how to install c++ 17 to programm pls!
IN sublime text’s package just support c++ 11, i can’t find any version of c++ in sublime text
help me !!!
Oh, 1 more thing, what is this?
C:WindowsSystem32>g++ –version
g++ (Rev3, Built by MSYS2 project) 13.2.0
Copyright (C) 2023 Free Software Foundation, Inc.
This is free software; see the source for copying conditions. There is NO
warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
i use c++ builder minghang-yang so i don’t remember did i install mingw.

Good day!
I hope you can help me out on this one.
I’m currently having some trouble with the PixelSearch.
Whenever there is a same multiple color shown, the mouse will only be stuck at the first color and will not move to the next one right after.

I have this compile error because of polymorphisme (i guess)

You are given two integers red and blue representing the count of red and blue colored balls. You have to arrange these balls to form a triangle such that the 1st row will have 1 ball, the 2nd row will have 2 balls, the 3rd row will have 3 balls, and so on.

How can I accomplish this? Currently getting the following compilation error

I’m having trouble declaring friend classes using macros and template metaprogramming. The specific error is C2065: “N”: undeclared identifier, which is usually because the identifier N is not handled correctly when the macro is expanded.”N”: undeclared identifier dufomap_run line 74.

I’ve optimized some of the source code for someone to find the nth digit of the pie, but the problem is that n is possible up to a million, and this operation has to be completed in 1 second. I’ve already optimized it, but it’s still not enough. Maybe the use of the BBP algorithm is wrong. How do I optimize the code to make the overall time complexity O(nlogn)?

I have wrote timer class, but it does not work the way I needed it to. Can anyone tell me what is wrong with this?