[Cuchulainn]

OK code?

#include <list>
#include <iostream>
using namespace std;


///
class Base
{ // Base class
private:

public:
Base() { }
public:
virtual ~Base() { cout << "Base destructor\n\n"; }
};

class Derived : public Base
{ // Derived class
private:

public:
Derived() : Base() { }
~Derived() { cout << "Derived destructor\n"; }
};



int main()
{

{ // Normal situation

Base* d1 = new Derived;
Base* d2 = new Derived;

list<Base*> myList; myList.push_back(d1); myList.push_back(d2);

list<Base*>::iterator it;
for (it = myList.begin(); it != myList.end(); ++it)
{
delete *it;
}

cout << "size of list " << myList.size() << endl;
}
return 0;
}

[Cuchulainn]

Thanks,
You are 100% correct. The vectors mut be sorted (see Josuttis STL book page 416)

// I added the following two lines:
sort(myVec3.begin(), myVec3.end());
sort(myVec4.begin(), myVec4.end());

[pierrechristophe]

Hello,

Please find both files

[Cuchulainn]

Please post the full code and we can compile it. Thanks.

[pierrechristophe]

I had two problems with this file and I was wondering if all compilers have the same result (I use Visual Studio 2008 trial). From my understanding, a cpp file including a STL class (eg #include <list>) and compiling/running with VS2008 should also compile/run with another compiler on linux for example.

First, one compile error is C2228 because the list<double> myList is created with the default constructor, giving a size to the constructor:
list<double> myList(myVec.size());
remove this compiled error. If we initialized with a size less than myVec.size() we have a runtime error.

Second, one assert runtime error: the merge function expects sorted vector:
sort(myVec3.begin(), myVec3.end());
sort(myVec4.begin(), myVec4.end());
merge(myVec3.begin(), myVec3.end(), myVec4.begin(), myVec4.end(),
myVec5.begin());

[Cuchulainn]

Exercises and Answers