Restoring authorship annotation for <orivej@yandex-team.ru>. Commit 2 of 2.

1 files changed, 25 insertions, 25 deletions

diff --git a/contrib/tools/cython/Cython/Includes/libcpp/map.pxd b/contrib/tools/cython/Cython/Includes/libcpp/map.pxd
index 4507baf2a6..624a7ac026 100644
--- a/contrib/tools/cython/Cython/Includes/libcpp/map.pxd
+++ b/contrib/tools/cython/Cython/Includes/libcpp/map.pxd
@@ -1,12 +1,12 @@
 from .utility cimport pair
 
 cdef extern from "<map>" namespace "std" nogil:
-    cdef cppclass map[T, U, COMPARE=*, ALLOCATOR=*]: 
-        ctypedef T key_type 
-        ctypedef U mapped_type 
-        ctypedef pair[const T, U] value_type 
-        ctypedef COMPARE key_compare 
-        ctypedef ALLOCATOR allocator_type 
+    cdef cppclass map[T, U, COMPARE=*, ALLOCATOR=*]:
+        ctypedef T key_type
+        ctypedef U mapped_type
+        ctypedef pair[const T, U] value_type
+        ctypedef COMPARE key_compare
+        ctypedef ALLOCATOR allocator_type
         cppclass iterator:
             pair[T, U]& operator*()
             iterator operator++()
@@ -19,10 +19,10 @@ cdef extern from "<map>" namespace "std" nogil:
             iterator operator--()
             bint operator==(reverse_iterator)
             bint operator!=(reverse_iterator)
-        cppclass const_iterator(iterator): 
-            pass 
-        cppclass const_reverse_iterator(reverse_iterator): 
-            pass 
+        cppclass const_iterator(iterator):
+            pass
+        cppclass const_reverse_iterator(reverse_iterator):
+            pass
         map() except +
         map(map&) except +
         #map(key_compare&)
@@ -34,35 +34,35 @@ cdef extern from "<map>" namespace "std" nogil:
         bint operator>(map&, map&)
         bint operator<=(map&, map&)
         bint operator>=(map&, map&)
-        U& at(const T&) except + 
-        const U& const_at "at"(const T&) except + 
+        U& at(const T&) except +
+        const U& const_at "at"(const T&) except +
         iterator begin()
         const_iterator const_begin "begin" ()
         void clear()
-        size_t count(const T&) 
+        size_t count(const T&)
         bint empty()
         iterator end()
         const_iterator const_end "end" ()
-        pair[iterator, iterator] equal_range(const T&) 
+        pair[iterator, iterator] equal_range(const T&)
         #pair[const_iterator, const_iterator] equal_range(key_type&)
         void erase(iterator)
         void erase(iterator, iterator)
-        size_t erase(const T&) 
-        iterator find(const T&) 
-        const_iterator const_find "find" (const T&) 
-        pair[iterator, bint] insert(pair[T, U]) except + # XXX pair[T,U]& 
-        iterator insert(iterator, pair[T, U]) except + # XXX pair[T,U]& 
+        size_t erase(const T&)
+        iterator find(const T&)
+        const_iterator const_find "find" (const T&)
+        pair[iterator, bint] insert(pair[T, U]) except + # XXX pair[T,U]&
+        iterator insert(iterator, pair[T, U]) except + # XXX pair[T,U]&
         #void insert(input_iterator, input_iterator)
         #key_compare key_comp()
-        iterator lower_bound(const T&) 
-        const_iterator const_lower_bound "lower_bound"(const T&) 
+        iterator lower_bound(const T&)
+        const_iterator const_lower_bound "lower_bound"(const T&)
         size_t max_size()
         reverse_iterator rbegin()
-        const_reverse_iterator const_rbegin "rbegin"() 
+        const_reverse_iterator const_rbegin "rbegin"()
         reverse_iterator rend()
-        const_reverse_iterator const_rend "rend"() 
+        const_reverse_iterator const_rend "rend"()
         size_t size()
         void swap(map&)
-        iterator upper_bound(const T&) 
-        const_iterator const_upper_bound "upper_bound"(const T&) 
+        iterator upper_bound(const T&)
+        const_iterator const_upper_bound "upper_bound"(const T&)
         #value_compare value_comp()