diff options
author | breakneck <breakneck@yandex-team.ru> | 2022-02-10 16:47:58 +0300 |
---|---|---|
committer | Daniil Cherednik <dcherednik@yandex-team.ru> | 2022-02-10 16:47:58 +0300 |
commit | e2021f9a0e54d13b7c48796318b13b66dc625e74 (patch) | |
tree | 5aed1691033eaf399ab80a10a137238922035fa8 /library/cpp/containers/sorted_vector | |
parent | 83602b1b564b92a80a1526d113fa2846661dd10e (diff) | |
download | ydb-e2021f9a0e54d13b7c48796318b13b66dc625e74.tar.gz |
Restoring authorship annotation for <breakneck@yandex-team.ru>. Commit 1 of 2.
Diffstat (limited to 'library/cpp/containers/sorted_vector')
-rw-r--r-- | library/cpp/containers/sorted_vector/sorted_vector.h | 30 |
1 files changed, 15 insertions, 15 deletions
diff --git a/library/cpp/containers/sorted_vector/sorted_vector.h b/library/cpp/containers/sorted_vector/sorted_vector.h index 123539af9e..ef709bf782 100644 --- a/library/cpp/containers/sorted_vector/sorted_vector.h +++ b/library/cpp/containers/sorted_vector/sorted_vector.h @@ -106,7 +106,7 @@ namespace NSorted { } // STL-compatible synonym - Y_FORCE_INLINE iterator insert(const value_type& value) { + Y_FORCE_INLINE iterator insert(const value_type& value) { return this->Insert(value); } @@ -119,7 +119,7 @@ namespace NSorted { // STL-compatible synonym template <class TIter> - Y_FORCE_INLINE void insert(TIter first, TIter last) { + Y_FORCE_INLINE void insert(TIter first, TIter last) { this->Insert(first, last); } @@ -136,7 +136,7 @@ namespace NSorted { } // STL-compatible synonym - Y_FORCE_INLINE std::pair<iterator, bool> insert_unique(const value_type& value) { + Y_FORCE_INLINE std::pair<iterator, bool> insert_unique(const value_type& value) { return this->InsertUnique(value); } @@ -150,7 +150,7 @@ namespace NSorted { // STL-compatible synonym template <class TIter> - Y_FORCE_INLINE void insert_unique(TIter first, TIter last) { + Y_FORCE_INLINE void insert_unique(TIter first, TIter last) { this->InsertUnique(first, last); } @@ -166,25 +166,25 @@ namespace NSorted { } // STL-compatible synonym - Y_FORCE_INLINE iterator insert_or_replace(const value_type& value) { + Y_FORCE_INLINE iterator insert_or_replace(const value_type& value) { return this->InsertOrReplace(value); } - Y_FORCE_INLINE void Sort() { + Y_FORCE_INLINE void Sort() { ::Sort(TBase::begin(), TBase::end(), TKeyCompare()); } // STL-compatible synonym - Y_FORCE_INLINE void sort() { + Y_FORCE_INLINE void sort() { this->Sort(); } - Y_FORCE_INLINE void Sort(iterator from, iterator to) { + Y_FORCE_INLINE void Sort(iterator from, iterator to) { ::Sort(from, to, TKeyCompare()); } // STL-compatible synonym - Y_FORCE_INLINE void sort(iterator from, iterator to) { + Y_FORCE_INLINE void sort(iterator from, iterator to) { this->Sort(from, to); } @@ -193,7 +193,7 @@ namespace NSorted { } // STL-compatible synonym - Y_FORCE_INLINE void make_unique() { + Y_FORCE_INLINE void make_unique() { this->MakeUnique(); } @@ -310,7 +310,7 @@ namespace NSorted { } // STL-compatible synonym - Y_FORCE_INLINE void erase(const key_type& key) { + Y_FORCE_INLINE void erase(const key_type& key) { this->Erase(key); } @@ -455,24 +455,24 @@ namespace NSorted { // Inserts value with unique key. Returns <iterator, bool> pair, // where the first member is the pointer to the inserted/existing value, and the // second member indicates either the value is inserted or not. - Y_FORCE_INLINE std::pair<iterator, bool> Insert(const TValueType& value) { + Y_FORCE_INLINE std::pair<iterator, bool> Insert(const TValueType& value) { return TBase::InsertUnique(value); } // STL-compatible synonym - Y_FORCE_INLINE std::pair<iterator, bool> insert(const TValueType& value) { + Y_FORCE_INLINE std::pair<iterator, bool> insert(const TValueType& value) { return TBase::InsertUnique(value); } // Inserts value range with unique keys. template <class TIter> - Y_FORCE_INLINE void Insert(TIter first, TIter last) { + Y_FORCE_INLINE void Insert(TIter first, TIter last) { TBase::InsertUnique(first, last); } // STL-compatible synonym template <class TIter> - Y_FORCE_INLINE void insert(TIter first, TIter last) { + Y_FORCE_INLINE void insert(TIter first, TIter last) { TBase::InsertUnique(first, last); } }; |