If you're using std::string/std::wstring contained in a std::map/std::set, there shouldn't be any leaking, unless you're doing something really wrong. The nice thing about std::string, set, map, etc. is that they help reduce the coded needed to avoid leaking. My main motive for suggesting std::set is that finding userIDs would be O(log(n)) instead of O(n)Originally Posted by cpjust
Be sure that access to the container and its contents is thread-safe, of course.
long time; /* know C? */
Unprecedented performance: Nothing ever ran this slow before.
Any sufficiently advanced bug is indistinguishable from a feature.
Real Programmers confuse Halloween and Christmas, because dec 25 == oct 31.
The best way to accelerate an IBM is at 9.8 m/s/s.
recursion (re - cur' - zhun) n. 1. (see recursion)
Oh thanks, that's another good reason to use a std::set that I didn't think of.
The "memory leak" I was talking about is that I have 1 function adding users to the vector and another taking them off the vector. If something goes wrong and the 2nd function doesn't get called and therefore never removes the users from the vector, it would keep getting bigger and bigger. Also, since vectors allow duplicate entries, it grows indefinitely, whereas a std::set doesn't allow duplicates, so even if the users aren't removed, there wouldn't be that many users in the company to cause a huge memory leak. But that's just a cover my ass scenario, since I can't see a reason why the 2nd function wouldn't get called.
