#include<iostream.h>
#include<LINK/basic/DList.h>

main()
{
	DList<int> l;

	ContainerNode *cn = l.insert(3);
	l.insertBefore(4, cn);
	cout << l << endl;

	cout << "value: " << l.info(l.predecessor(cn)) << endl; 
}