ATL / WTL / STL

mellib wrote:

However this seems a little inefficient to me, and I would prefer to use the bitwise operator on the whole string, as a chunk of memory.

mellib wrote:

Is there a more efficient way of doing it that iterating through the strings?

Rahul Vaishnav wrote:

mfcs42

1. The outer tempString will always leak one allocation.
2. If count == 0, outputString will not be deallocated
3. If count == 0, outputTempString will never be assigned to, so you'll return an indeterminate value

JimmyAberg wrote:

Do i have to call sort myself or does the containers sort themself?

JimmyAberg wrote:

If they sort themselves: When do they sort?

JimmyAberg wrote:

I am using the set and map to contain pointers to my "GameObject" class (such as "wall", "room", "enemy" etc) - so how should i define a function-object or function to sort them out? Thought of sorting them by memory adress (bad idea)? And is there a default sort function for pointers?

   struct YourOrderingFunction : public binary_function <KeyType, KeyType, bool> 
   {
      bool operator()(const KeyType& _Left, const KeyType& _Right) const
      {
         return true if _Left is less than _Right;
      }
   };

• APIs and Libraries[^]
• Connectors[^]