testTypedef.cxx File Reference

#include <cassert>
#include <iostream>

Include dependency graph for testTypedef.cxx:

Go to the source code of this file.

Classes
class	resip::IntrusiveListElement< P >
class	resip::IntrusiveListElement< P >::iterator
class	resip::IntrusiveListElement1< P >
class	resip::IntrusiveListElement1< P >::iterator
class	resip::IntrusiveListElement2< P >
class	resip::IntrusiveListElement2< P >::iterator
class	Foo
class	FooFoo
Namespaces
namespace	resip
	SERNonceHelper implements the makeNonce function in the same way as SIP Express Router (SER) - http://www.iptel.org/ser.
Functions
int	main (int argc, char *argv[])

---

Function Documentation

int main	(	int	argc,
		char *	argv[]
	)

Definition at line 445 of file testTypedef.cxx.

References resip::IntrusiveListElement< P >::begin(), resip::IntrusiveListElement< P >::empty(), resip::IntrusiveListElement< P >::end(), resip::IntrusiveListElement< Foo * >::iterator, resip::IntrusiveListElement< Foo * >::makeList(), resip::IntrusiveListElement< P >::push_front(), Foo::va1, and FooFoo::va1.

{
   {
      Foo* fooHead = new Foo(-1);
      Foo* foo1 = new Foo(1);
      Foo* foo2 = new Foo(2);
      Foo* foo3 = new Foo(3);
      Foo* foo4 = new Foo(4);

      Foo::makeList(fooHead);
      assert(fooHead->empty());
      for (Foo::iterator f = fooHead->begin(); f != fooHead->end(); ++f)
      {
         cerr << (*f)->va1 << endl;
      }

      fooHead->push_front(foo1);
      assert(!fooHead->empty());
      cerr << endl << "first" << endl;
      assert((*fooHead->begin())->va1 == 1);
      assert((*fooHead->end())->va1 == -1);

      Foo::iterator j = fooHead->begin();
      ++j;
      cerr << (*j)->va1 << endl;
      assert((*j)->va1 == -1);      
      assert(*j == *fooHead->end());

      for (Foo::iterator f = fooHead->begin(); f != fooHead->end(); ++f)
      {
         cerr << (*f)->va1 << endl;
      }

      fooHead->push_front(foo2);
      cerr << endl << "second" << endl;
      for (Foo::iterator f = fooHead->begin(); f != fooHead->end(); ++f)
      {
         cerr << (*f)->va1 << endl;
      }

      fooHead->push_front(foo3);   
      cerr << endl << "third" << endl;
      for (Foo::iterator f = fooHead->begin(); f != fooHead->end(); ++f)
      {
         cerr << (*f)->va1 << endl;
      }

      cerr << endl << "deleted second" << endl;
      delete foo2;
      for (Foo::iterator f = fooHead->begin(); f != fooHead->end(); ++f)
      {
         cerr << (*f)->va1 << endl;
      }

      cerr << endl << "fourth" << endl;
      fooHead->push_front(foo4);
      for (Foo::iterator f = fooHead->begin(); f != fooHead->end(); ++f)
      {
         cerr << (*f)->va1 << endl;
      }

      cerr << endl << "deleted fourth, first" << endl;
      delete foo1;
      delete foo4;
      for (Foo::iterator f = fooHead->begin(); f != fooHead->end(); ++f)
      {
         cerr << (*f)->va1 << endl;
      }
   
      cerr << endl << "deleted third (empty)" << endl;
      delete foo3;
      for (Foo::iterator f = fooHead->begin(); f != fooHead->end(); ++f)
      {
         cerr << (*f)->va1 << endl;
      }
   }

// .abr. Yes, this really is necessary just to get things to compile. Don't ask
// why -- it's clearly a compiler bug. But you would be well advised not to
// comment it out unless you're actually using the SunPRO compiler, and have
// found an alternate workaround.
#if defined(__SUNPRO_CC)
   typedef IntrusiveListElement<FooFoo*> read;
   typedef IntrusiveListElement1<FooFoo*> write;
#endif

   //=============================================================================
   // Read version
   //=============================================================================
   cerr << endl << "READ VERSION" << endl;
   {
      FooFoo* fooFooHead = new FooFoo(-1);
      FooFoo* fooFoo1 = new FooFoo(1);
      FooFoo* fooFoo2 = new FooFoo(2);
      FooFoo* fooFoo3 = new FooFoo(3);
      FooFoo* fooFoo4 = new FooFoo(4);

      FooFoo::read::makeList(fooFooHead);
      FooFoo::write::makeList(fooFooHead);
      assert(fooFooHead->read::empty());
      assert(fooFooHead->write::empty());
      for (FooFoo::read::iterator f = fooFooHead->read::begin(); f != fooFooHead->read::end(); ++f)
      {
         cerr << (*f)->va1 << endl;
      }

      fooFooHead->read::push_front(fooFoo1);
      assert(!fooFooHead->read::empty());
      assert(fooFooHead->write::empty());
      cerr << endl << "first" << endl;
      for (FooFoo::read::iterator f = fooFooHead->read::begin(); f != fooFooHead->read::end(); ++f)
      {
         cerr << (*f)->va1 << endl;
      }

      fooFooHead->read::push_front(fooFoo2);
      cerr << endl << "second" << endl;
      for (FooFoo::read::iterator f = fooFooHead->read::begin(); f != fooFooHead->read::end(); ++f)
      {
         cerr << (*f)->va1 << endl;
      }

      fooFooHead->read::push_front(fooFoo3);   
      cerr << endl << "third" << endl;
      for (FooFoo::read::iterator f = fooFooHead->read::begin(); f != fooFooHead->read::end(); ++f)
      {
         cerr << (*f)->va1 << endl;
      }

      cerr << endl << "deleted second" << endl;
      delete fooFoo2;
      for (FooFoo::read::iterator f = fooFooHead->read::begin(); f != fooFooHead->read::end(); ++f)
      {
         cerr << (*f)->va1 << endl;
      }

      cerr << endl << "fourth" << endl;
      fooFooHead->read::push_front(fooFoo4);
      for (FooFoo::read::iterator f = fooFooHead->read::begin(); f != fooFooHead->read::end(); ++f)
      {
         cerr << (*f)->va1 << endl;
      }

      cerr << endl << "deleted fourth, first" << endl;
      delete fooFoo1;
      delete fooFoo4;
      for (FooFoo::read::iterator f = fooFooHead->read::begin(); f != fooFooHead->read::end(); ++f)
      {
         cerr << (*f)->va1 << endl;
      }
   
      cerr << endl << "deleted third (empty)" << endl;
      delete fooFoo3;
      for (FooFoo::read::iterator f = fooFooHead->read::begin(); f != fooFooHead->read::end(); ++f)
      {
         cerr << (*f)->va1 << endl;
      }
   }

   //=============================================================================
   // Write version
   //=============================================================================
   cerr << endl << "WRITE VERSION" << endl;
   {      
      FooFoo* fooFooHead = new FooFoo(-1);
      FooFoo* fooFoo1 = new FooFoo(1);
      FooFoo* fooFoo2 = new FooFoo(2);
      FooFoo* fooFoo3 = new FooFoo(3);
      FooFoo* fooFoo4 = new FooFoo(4);

      FooFoo::write::makeList(fooFooHead);
      FooFoo::read::makeList(fooFooHead);
      assert(fooFooHead->write::empty());
      assert(fooFooHead->read::empty());
      for (FooFoo::write::iterator f = fooFooHead->write::begin(); f != fooFooHead->write::end(); ++f)
      {
         cerr << (*f)->va1 << endl;
      }

      fooFooHead->write::push_front(fooFoo1);
      assert(!fooFooHead->write::empty());
      assert(fooFooHead->read::empty());
      cerr << endl << "first" << endl;
      for (FooFoo::write::iterator f = fooFooHead->write::begin(); f != fooFooHead->write::end(); ++f)
      {
         cerr << (*f)->va1 << endl;
      }

      fooFooHead->write::push_front(fooFoo2);
      cerr << endl << "second" << endl;
      for (FooFoo::write::iterator f = fooFooHead->write::begin(); f != fooFooHead->write::end(); ++f)
      {
         cerr << (*f)->va1 << endl;
      }

      fooFooHead->write::push_front(fooFoo3);   
      cerr << endl << "third" << endl;
      for (FooFoo::write::iterator f = fooFooHead->write::begin(); f != fooFooHead->write::end(); ++f)
      {
         cerr << (*f)->va1 << endl;
      }

      cerr << endl << "deleted second" << endl;
      delete fooFoo2;
      for (FooFoo::write::iterator f = fooFooHead->write::begin(); f != fooFooHead->write::end(); ++f)
      {
         cerr << (*f)->va1 << endl;
      }

      cerr << endl << "fourth" << endl;
      fooFooHead->write::push_front(fooFoo4);
      for (FooFoo::write::iterator f = fooFooHead->write::begin(); f != fooFooHead->write::end(); ++f)
      {
         cerr << (*f)->va1 << endl;
      }

      cerr << endl << "deleted fourth, first" << endl;
      delete fooFoo1;
      delete fooFoo4;
      for (FooFoo::write::iterator f = fooFooHead->write::begin(); f != fooFooHead->write::end(); ++f)
      {
         cerr << (*f)->va1 << endl;
      }
   
      cerr << endl << "deleted third (empty)" << endl;
      delete fooFoo3;
      for (FooFoo::write::iterator f = fooFooHead->write::begin(); f != fooFooHead->write::end(); ++f)
      {
         cerr << (*f)->va1 << endl;
      }
   }

   return 0;
}

Here is the call graph for this function: