T& operator[]( const Key& key ); (1)

iterator insert_after( const_iterator pos, const T& value );

local_iterator end( size_type n );

reverse_iterator rend();

template< class T, class Container > bool operator==( stack<T,Container>&

reference operator[]( size_type pos );

reference back();

key_equal key_eq() const;

iterator erase( const_iterator pos ); (1)

template< class T, class Container > void