31 questions
Regarding the example of cppreference, I don't understand this error.Both should be initialized with two constructors of arguments, but I would appreciate it if you could tell me why the first std:: i...
I would like to know the difference between int type, long type and long type in C++.In particular, I would like to know about the upper limit values that can be expressed, so I looked into them and f...
I have a question about the virtual function of c++.Prepare a very simple base and inherited Derived as follows:#include<iostream>US>structure Base {virtual void f(){ std::cout<<Base<&l...
Consider the following code:1. inline Specified Template Function func2. Class A accessing members of Class B through func3. Class B implementation is later than Class Atemplate<class T>inline f...
Consider the following code:1. inline Specified Template Function func2. Class A accessing members of Class B through func3. Class B implementation is later than Class Atemplate<class T>inline f...
Hello. Thank you for your continuous support.Now I'm making a game like Packman, and I'm making something like AI of enemy characters.At that time, I could ask for the shortest route to take the item,...
Thank you for your help.for use in gamesI don't think I can create a job system using std::thread.Possible interfaces are://Generate std::thread by specifying the number of coresint threadNum = 8;JobM...
C++11 has weak, shared, unique, but is it meaningful to use instance generation using only new and delete in an environment where these can be used?In C++11, is the method using only new, delete posit...
Some of the std::regex implementations in C++11 seem to not work well.std::regex_search overloads that are used in the following code are not compiled:#include<iostream># include <regex>in...
I don't really understand the thinking circuit of the algorithm in the code below.They seem to be using bit DP, but I don't know how to use bit operators to become DP (I don't know why DP is establish...
| - 1 - | » |
© 2024 OneMinuteCode. All rights reserved.