Hello,
I have two vectors (of different types) whose elements correspond to each other. I'm going through vector<foo> A using find_if and removing some elements. I want to remove the corresponding elements in vector<bar> B. What is the cleanest way? I don't think that
is a good idea. What do you think?Code:iter - A.begin()
"If you tell the truth, you don't have to remember anything"
-Mark Twain
You know what, I'm better off just going through manually beginning to end. This way I don't check the early elements multiple times DUH. But I'm still curious about the answer to my OP.
"If you tell the truth, you don't have to remember anything"
-Mark Twain
Well the desire to do so points to a design error. If vector B's element's depend on vector A's elements, then you should instead have a list of foo bar pairs, or perhaps one of the object types should hold the other.
But if you want to force a way to do it, then yeah iter-A.begin is as good a way as any. Or you can forget about find_if, and use an indexed for loop.
It is too clear and so it is hard to see.
A dunce once searched for fire with a lighted lantern.
Had he known what fire was,
He could have cooked his rice much sooner.
also, what you said, indicated that the order doesn't matter. If so, std::map would be a better and cleaner option.I have two vectors (of different types) whose elements correspond to each other
