[v3] Minor tweak to stl_map.h

[v3] Minor tweak to stl_map.h

[Paolo Carlini]

[-- Attachment #1: Type: text/plain, Size: 67 bytes --]

Hi,

committed to mainline and 4_2-branch.

Paolo.

//////////////

[-- Attachment #2: CL --]
[-- Type: text/plain, Size: 137 bytes --]

2007-04-03  Paolo Carlini  <pcarlini@suse.de>

	* include/bits/stl_map.h (map<>::insert(iterator, const value_type&):
	Uglify parameter.

[-- Attachment #3: p --]
[-- Type: text/plain, Size: 1196 bytes --]

Index: stl_map.h
===================================================================
--- stl_map.h	(revision 123450)
+++ stl_map.h	(working copy)
@@ -1,6 +1,7 @@
 // Map implementation -*- C++ -*-
 
-// Copyright (C) 2001, 2002, 2004, 2005, 2006 Free Software Foundation, Inc.
+// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
+// Free Software Foundation, Inc.
 //
 // This file is part of the GNU ISO C++ Library.  This library is free
 // software; you can redistribute it and/or modify it under the
@@ -394,7 +395,7 @@
        *
        *  Insertion requires logarithmic time.
        */
-      std::pair<iterator,bool>
+      std::pair<iterator, bool>
       insert(const value_type& __x)
       { return _M_t._M_insert_unique(__x); }
 
@@ -422,8 +423,8 @@
        *  Insertion requires logarithmic time (if the hint is not taken).
        */
       iterator
-      insert(iterator position, const value_type& __x)
-      { return _M_t._M_insert_unique_(position, __x); }
+      insert(iterator __position, const value_type& __x)
+      { return _M_t._M_insert_unique_(__position, __x); }
 
       /**
        *  @brief Template function that attemps to insert a range of elements.