slist: Move into __gnu_cxx, tweak, add using declarations.

2001-12-31  Paolo Carlini  <pcarlini@unitus.it>

	* include/ext/slist:  Move into __gnu_cxx,
	tweak, add using declarations.

From-SVN: r48423

libstdc++-v3/ChangeLog

 2001-12-31  Paolo Carlini  <pcarlini@unitus.it>
 
+	* include/ext/slist:  Move into __gnu_cxx,
+        tweak, add using declarations.
+
+2001-12-31  Paolo Carlini  <pcarlini@unitus.it>
+
 	* include/ext/hash_map:  Move into __gnu_cxx,
 	tweak, add using declarations.
 	* include/ext/hash_set:  Ditto.

libstdc++-v3/include/ext/slist

@@ -55,8 +55,14 @@
 #include <bits/stl_uninitialized.h>
 #include <bits/concept_check.h>
 
-namespace std
+namespace __gnu_cxx
 { 
+using std::size_t;
+using std::ptrdiff_t;
+using std::_Alloc_traits;
+using std::_Construct;
+using std::_Destroy;
+using std::allocator;
 
 struct _Slist_node_base
 {
@@ -147,7 +153,7 @@ struct _Slist_iterator_base
 {
   typedef size_t                    size_type;
   typedef ptrdiff_t                 difference_type;
-  typedef forward_iterator_tag iterator_category;
+  typedef std::forward_iterator_tag iterator_category;
 
   _Slist_node_base* _M_node;
 
@@ -707,7 +713,7 @@ template <class _Tp, class _Alloc>
 inline bool
 operator<(const slist<_Tp,_Alloc>& _SL1, const slist<_Tp,_Alloc>& _SL2)
 {
-  return lexicographical_compare(_SL1.begin(), _SL1.end(), 
+  return std::lexicographical_compare(_SL1.begin(), _SL1.end(), 
 				      _SL2.begin(), _SL2.end());
 }
 
@@ -897,13 +903,17 @@ void slist<_Tp,_Alloc>::sort(_StrictWeakOrdering __comp)
   }
 }
 
+} // namespace __gnu_cxx
+
+namespace std
+{
 // Specialization of insert_iterator so that insertions will be constant
 // time rather than linear time.
 
 template <class _Tp, class _Alloc>
-class insert_iterator<slist<_Tp, _Alloc> > {
+class insert_iterator<__gnu_cxx::slist<_Tp, _Alloc> > {
 protected:
-  typedef slist<_Tp, _Alloc> _Container;
+  typedef __gnu_cxx::slist<_Tp, _Alloc> _Container;
   _Container* container;
   typename _Container::iterator iter;
 public: