diff options
author | Anton Samokhvalov <pg83@yandex.ru> | 2022-02-10 16:45:17 +0300 |
---|---|---|
committer | Daniil Cherednik <dcherednik@yandex-team.ru> | 2022-02-10 16:45:17 +0300 |
commit | d3a398281c6fd1d3672036cb2d63f842d2cb28c5 (patch) | |
tree | dd4bd3ca0f36b817e96812825ffaf10d645803f2 /contrib/tools/cython/Cython/Includes/libcpp/unordered_set.pxd | |
parent | 72cb13b4aff9bc9cf22e49251bc8fd143f82538f (diff) | |
download | ydb-d3a398281c6fd1d3672036cb2d63f842d2cb28c5.tar.gz |
Restoring authorship annotation for Anton Samokhvalov <pg83@yandex.ru>. Commit 2 of 2.
Diffstat (limited to 'contrib/tools/cython/Cython/Includes/libcpp/unordered_set.pxd')
-rw-r--r-- | contrib/tools/cython/Cython/Includes/libcpp/unordered_set.pxd | 88 |
1 files changed, 44 insertions, 44 deletions
diff --git a/contrib/tools/cython/Cython/Includes/libcpp/unordered_set.pxd b/contrib/tools/cython/Cython/Includes/libcpp/unordered_set.pxd index 9379003a45..5aa2417528 100644 --- a/contrib/tools/cython/Cython/Includes/libcpp/unordered_set.pxd +++ b/contrib/tools/cython/Cython/Includes/libcpp/unordered_set.pxd @@ -1,64 +1,64 @@ -from .utility cimport pair - -cdef extern from "<unordered_set>" namespace "std" nogil: +from .utility cimport pair + +cdef extern from "<unordered_set>" namespace "std" nogil: cdef cppclass unordered_set[T,HASH=*,PRED=*,ALLOCATOR=*]: ctypedef T value_type - cppclass iterator: - T& operator*() - iterator operator++() - iterator operator--() - bint operator==(iterator) - bint operator!=(iterator) - cppclass reverse_iterator: - T& operator*() - iterator operator++() - iterator operator--() - bint operator==(reverse_iterator) - bint operator!=(reverse_iterator) + cppclass iterator: + T& operator*() + iterator operator++() + iterator operator--() + bint operator==(iterator) + bint operator!=(iterator) + cppclass reverse_iterator: + T& operator*() + iterator operator++() + iterator operator--() + bint operator==(reverse_iterator) + bint operator!=(reverse_iterator) cppclass const_iterator(iterator): pass cppclass const_reverse_iterator(reverse_iterator): pass - unordered_set() except + - unordered_set(unordered_set&) except + - #unordered_set(key_compare&) - #unordered_set& operator=(unordered_set&) - bint operator==(unordered_set&, unordered_set&) - bint operator!=(unordered_set&, unordered_set&) - bint operator<(unordered_set&, unordered_set&) - bint operator>(unordered_set&, unordered_set&) - bint operator<=(unordered_set&, unordered_set&) - bint operator>=(unordered_set&, unordered_set&) - iterator begin() + unordered_set() except + + unordered_set(unordered_set&) except + + #unordered_set(key_compare&) + #unordered_set& operator=(unordered_set&) + bint operator==(unordered_set&, unordered_set&) + bint operator!=(unordered_set&, unordered_set&) + bint operator<(unordered_set&, unordered_set&) + bint operator>(unordered_set&, unordered_set&) + bint operator<=(unordered_set&, unordered_set&) + bint operator>=(unordered_set&, unordered_set&) + iterator begin() const_iterator const_begin "begin"() - void clear() - size_t count(T&) - bint empty() - iterator end() + void clear() + size_t count(T&) + bint empty() + iterator end() const_iterator const_end "end"() - pair[iterator, iterator] equal_range(T&) + pair[iterator, iterator] equal_range(T&) pair[const_iterator, const_iterator] const_equal_range "equal_range"(T&) iterator erase(iterator) iterator erase(iterator, iterator) - size_t erase(T&) - iterator find(T&) + size_t erase(T&) + iterator find(T&) const_iterator const_find "find"(T&) - pair[iterator, bint] insert(T&) - iterator insert(iterator, T&) - #key_compare key_comp() + pair[iterator, bint] insert(T&) + iterator insert(iterator, T&) + #key_compare key_comp() iterator insert(iterator, iterator) - iterator lower_bound(T&) + iterator lower_bound(T&) const_iterator const_lower_bound "lower_bound"(T&) - size_t max_size() - reverse_iterator rbegin() + size_t max_size() + reverse_iterator rbegin() const_reverse_iterator const_rbegin "rbegin"() - reverse_iterator rend() + reverse_iterator rend() const_reverse_iterator const_rend "rend"() - size_t size() - void swap(unordered_set&) - iterator upper_bound(T&) + size_t size() + void swap(unordered_set&) + iterator upper_bound(T&) const_iterator const_upper_bound "upper_bound"(T&) - #value_compare value_comp() + #value_compare value_comp() void max_load_factor(float) float max_load_factor() void rehash(size_t) |