aboutsummaryrefslogtreecommitdiffstats
path: root/util/generic
diff options
context:
space:
mode:
authorbrutalman <brutalman@yandex-team.ru>2022-02-10 16:52:07 +0300
committerDaniil Cherednik <dcherednik@yandex-team.ru>2022-02-10 16:52:07 +0300
commit33a36fa4bfa78e09ac7d34729ff62e5c6148e104 (patch)
tree06eec8bc70dccaf0e1603505597c56afdc534079 /util/generic
parentc196be500c6371f425949a6222589722bf08e2de (diff)
downloadydb-33a36fa4bfa78e09ac7d34729ff62e5c6148e104.tar.gz
Restoring authorship annotation for <brutalman@yandex-team.ru>. Commit 1 of 2.
Diffstat (limited to 'util/generic')
-rw-r--r--util/generic/hash.pxd62
1 files changed, 31 insertions, 31 deletions
diff --git a/util/generic/hash.pxd b/util/generic/hash.pxd
index 385c10d805..740edf9606 100644
--- a/util/generic/hash.pxd
+++ b/util/generic/hash.pxd
@@ -1,17 +1,17 @@
-from libcpp.pair cimport pair
-
-cdef extern from "util/generic/hash.h" nogil:
+from libcpp.pair cimport pair
+
+cdef extern from "util/generic/hash.h" nogil:
cdef cppclass THashMap[T, U]:
- cppclass iterator:
- pair[T, U]& operator*()
- iterator operator++()
- iterator operator--()
- bint operator==(iterator)
- bint operator!=(iterator)
-
- cppclass const_iterator(iterator):
- pass
-
+ cppclass iterator:
+ pair[T, U]& operator*()
+ iterator operator++()
+ iterator operator--()
+ bint operator==(iterator)
+ bint operator!=(iterator)
+
+ cppclass const_iterator(iterator):
+ pass
+
cppclass reverse_iterator:
pair[T, U]& operator*()
iterator operator++()
@@ -24,35 +24,35 @@ cdef extern from "util/generic/hash.h" nogil:
THashMap() except +
THashMap(THashMap&) except +
- U& operator[](T&)
+ U& operator[](T&)
THashMap& operator=(THashMap&)
-
+
bint operator==(THashMap&)
bint operator!=(THashMap&)
bint operator<(THashMap&)
bint operator>(THashMap&)
bint operator<=(THashMap&)
bint operator>=(THashMap&)
-
+
U& at(T&) except +
- iterator begin()
- const_iterator const_begin "begin"()
- void clear()
- size_t count(T&)
- bint empty()
- iterator end()
- const_iterator const_end "end"()
- pair[iterator, iterator] equal_range(T&)
+ iterator begin()
+ const_iterator const_begin "begin"()
+ void clear()
+ size_t count(T&)
+ bint empty()
+ iterator end()
+ const_iterator const_end "end"()
+ pair[iterator, iterator] equal_range(T&)
void erase(iterator) except +
void erase(iterator, iterator) except +
- size_t erase(T&)
- iterator find(T&)
+ size_t erase(T&)
+ iterator find(T&)
bint contains(T&)
- const_iterator const_find "find"(T&)
- pair[iterator, bint] insert(pair[T, U]) # XXX pair[T,U]&
- iterator insert(iterator, pair[T, U]) # XXX pair[T,U]&
- size_t max_size()
- size_t size()
+ const_iterator const_find "find"(T&)
+ pair[iterator, bint] insert(pair[T, U]) # XXX pair[T,U]&
+ iterator insert(iterator, pair[T, U]) # XXX pair[T,U]&
+ size_t max_size()
+ size_t size()
void swap(THashMap&)
iterator lower_bound(T&)
const_iterator const_lower_bound "lower_bound"(T&)