|
The problem comes because as soon as you remove an element then all the rest effectively move nearer the beginning, and thus their positions are out of sync with the iterator. You could try a reverse iterator as detailed at std::vector - cppreference.com[^].
|
|
|
|
|
As you guessed, erase invalidates all iterators on the container. Your problem is known as the Erase–remove idiom[^] There are different ways of solving it:
1. The "manual" way:
auto pos = myVector.begin();
size_t i=0;
while (pos != myVector.end())
{
if (*pos ==3)
{
myVector.erase(pos);
pos = myVector.begin() + i;
}
else
{
++i;
++pos;
}
}
2. The "semi-automatic" way:
auto pos = myVector.begin();
while (pos != myVector.end())
{
if (*pos ==3)
pos = myVector.erase(pos); else
++pos;
}
3. The "old fully automatic way":
myVector.erase(std::remove(myVector.begin(),
myVector.end(), 3),
myVector.end());
4. The "new fully automatic way" (since C++20):
std::erase (myVector, 3);
Disclaimer: I didn't compile any of the code above; some errors may/will exist
Mircea
|
|
|
|
|
Hi,
Is it OK to call std::async(BYTE *p) from inside a worker thread?.
How would it be possible to make sure async calls gets executed in order of first came , first executed just like calling a function synchronously?
|
|
|
|
|
|
(probably a TOmato vs toMAto kind of questions... )
At what point should I use variadic functions vs. keeping it local ?
I have a library that handles SQL queries.
is there a difference between something like :
(overly simplified)
std::string fullyFormedQuery = sprintf (queryFormat, param1, param2, ... );
void DoRequest( std::string fullyFormedQuery){
}
void DoRequest( std::string queryFormat, param1, param2, ... ){
std::string fullyFormedQuery= queryFormat(format, param1, param2, ... );
}
CI/CD = Continuous Impediment/Continuous Despair
|
|
|
|
|
As you say it's more of a style question. My preference would be for the first option (pass fully formed string) because:
- there is less documenting to do
- some compilers (MSVC for one), check matching between format strings and parameters in (s)printf functions but don't do that in a user defined variadic function.
Mircea
|
|
|
|
|
thanks.
CI/CD = Continuous Impediment/Continuous Despair
|
|
|
|
|
Just noting that your examples leave out using bind variables.
My understanding, and I just googled to see if that seems to be correct, is that bind variables make optimizations in the database easier.
Not to mention of course that they are a better fit for avoiding SQL injection problems.
Setting up bind variables is rather complex so putting it in the method is going to be better.
|
|
|
|
|
Thanks.
We already have a complete (decades old) framework for SQL. (seems to be working fine)
maybe I should have left out the SQL reference and make it a more generic question.
CI/CD = Continuous Impediment/Continuous Despair
|
|
|
|
|
Maximilien wrote: complete (decades old) framework for SQL.
Then you should use the same idiom as the existing code. Changing it for some and not others just adds to the confusion. Although if a preference for one is given and there is a large amount of new work (new files not modifying existing code) then maybe go with there.
modified 20-Dec-23 12:00pm.
|
|
|
|
|
I will not change existing code; it's just too dangerous.
I'm just curious; if there's a best practice.
CI/CD = Continuous Impediment/Continuous Despair
|
|
|
|
|
My best practice doesn't fit either of your suggestions...
If I am creating a new database layer (which I have numerous times) then the caller would never provide the SQL.
If the business layer(s) need new database logic then the database layer should be modified to provide it.
The caller provides the parameters that would be used in the call.
Then within that database layer method it would decide how to process the parameters and SQL (provided by the method.)
So it looks like the following.
void DatabaseDoX(param1, param2,...)
{
std::string fullyFormedQuery = sprintf (SQL_X, param1, param2, ... );
There are quite a few variations on the above. For example consider the complication of a user initiated call where they might specify different 'query' terms (like data range, customer name, etc)
But all still hide the SQL.
Certainly there are design considerations for example your code might be coming from within the database layer (not a business call at all.) If so then I suspect that usage would actually vary depending on what the database layer was specifically doing in the code path.
|
|
|
|
|
I was playing around in Microsoft Visual C++, and I noticed something weird about this code:
void setname(char name[80])
{
strcpy_s(name, "joebob");
char name2[80];
strcpy_s(name2, "joebob");
}
It looks like the compiler complains about the first strcpy_s but not the second one. If I comment out the first one, the program compiles fine.
Can anyone explain this?
BTW, I know strcpy_s should probably take 3 arguments, but I'm trying to understand this weirdness.
Thanks.
|
|
|
|
|
Remember that in C arrays and pointers are the same thing so the argument name is a pointer to char. For the compiler, your code fragment is the same as:
void setname(char *name)
{
strcpy_s(name, "joebob");
char name2[80];
strcpy_s(name2, "joebob");
} In the case of the second call to strcpy_s , the compiler can figure out the size parameter through some template magic. For the first one however you have to use the explicit size form.
Mircea
|
|
|
|
|
It would help when posting questions that you include the exact error message(s), so it makes it clear what your problem is.
|
|
|
|
|
|
Should this work in C++?
long add1(a)
long a;
{
return a+1;
}
It doesn't seem to compile in Visual Studio. I got it from MIT's OpenCourseware.
Thanks.
|
|
|
|
|
That is the so called K&R syntax[^]. You can compile as C code but not as C++. The C++ version would be:
long add1 (long a) {
return a+1;
}
Mircea
|
|
|
|
|
mike7411 wrote: I got it from MIT's OpenCourseware.
I see the MIT is still at the cutting edge of technology !!
CI/CD = Continuous Impediment/Continuous Despair
|
|
|
|
|
I am a little confused about when to use delete and delete[].
Is this correct?
int* numArray = new int[100];
delete numArray;
Or should it be this?
int* numArray = new int[100];
delete[] numArray;
I saw the former in an MIT lecture, and it looked suspicious. Both of them compile.
Thanks.
|
|
|
|
|
If you create an array with operator new as above, then you must tell delete that it is an array. So example 2 is the correct way to do it.
|
|
|
|
|
Array delete operator, delete[] invokes the destructor of each array element before freeing the array. For an array of integers, it doesn't make any difference. Meanwhile, if the objects in the array have a non-trivial destructor you should call the delete[] operator.
Mircea
|
|
|
|
|
Mircea Neacsu wrote: For an array of integers, it doesn't make any difference.
It is true that no destructor is called for each element of an int[] array, but that does not mean that the memory layout is compatible with delete. For example, the compiler might allocate additional space for a variable containing the size of the array and return a pointer to memory after this variable. When using delete, the heap will be corrupted.
The heap layout is implementation-dependent, and therefore you should always match new/delete and new[]/delete[]!
Freedom is the freedom to say that two plus two make four. If that is granted, all else follows.
-- 6079 Smith W.
|
|
|
|
|
While you are absolutely right, I don't know of any heap manager that behaves the way you describe. Let's say that calling delete on an int array is a smaller sin, a "peccadillo" that will place you on one of the first circles of hell.
Mircea
|
|
|
|
|
As noted you should use the correct one.
I know for a fact that long ago using the wrong one would cause memory stack corruption.
I presume that now that isn't possible or is less likely.
Although I would be curious if the spec deals with that specific issue.
|
|
|
|