<algorithm>
	template<class T>
	gcd(T x, T y);
	// returns greatest common divisor of x and y
	
<complex>

	constructor  : complex(const complex x);
	not implemented, because a template constructor exist, which make
	this constructor redundant.

	operator = changed from :
	
	complex<T>& operator= (const complex<T>& x) 
	
	to a templated operator :

	template<class X>
	complex<T>& operator= (const complex<X>& x) 

	which make the = operator more general than this in the standard library.
		
<functional>

	5 operations added:
	
	Name            Operation   
	identity        unary       arg1
	binary_and      binary      arg1 & arg2
	binary_or       binary      arg1 | arg2
	binary_xor      binary      arg1 ^ arg2
	binary_not      unary      ~arg

... maybe << and >> (if I find a suitable name)

<iterator>

	new iterator trait definition for const pointers :

	template<class T>
	struct iterator_traits<const T*>;

<memory>

	Allocator :

	construct(p) - behaves like : construct(p, T());

	reallocate(pointer &p, size_type n);

	// reallocates MEMORY pointed to p to size n
	// doesn't care about construction / destruction (yet)

