catboost 1.25.1 → 1.26.0

package/inc/util/generic/hash_primes.h

@@ -1,140 +0,0 @@
-#pragma once
-
-#include <util/system/compiler.h>
-#include <util/system/types.h>
-
-#if defined(_MSC_VER) && defined(_M_X64)
-#include <intrin.h>
-#endif
-
-
-
-/**
- * Calculates the number of buckets for the hash table that will hold the given
- * number of elements.
- *
- * @param elementCount                  Number of elements that the hash table will hold.
- * @returns                             Number of buckets, a prime number that is
- *                                      greater or equal to `elementCount`.
- */
-Y_CONST_FUNCTION
-unsigned long HashBucketCount(unsigned long elementCount);
-
-
-namespace NPrivate {
-
-    /// Implementation of algorithm 4.1 from: Torbjörn Granlund and Peter L. Montgomery. 1994. Division by invariant integers using multiplication.
-    /// @see https://gmplib.org/~tege/divcnst-pldi94.pdf
-    template <typename TDivisor, typename TDividend, typename MulUnsignedUpper>
-    class TReciprocalDivisor {
-        static_assert(sizeof(TDivisor) <= sizeof(TDividend), "TDivisor and TDividend should have the same size");
-    public:
-        constexpr TReciprocalDivisor() noexcept = default;
-
-        constexpr TReciprocalDivisor(TDividend reciprocal, ui8 reciprocalShift, i8 hint, TDivisor divisor) noexcept
-            : Reciprocal(reciprocal)
-            , Divisor(divisor)
-            , ReciprocalShift(reciprocalShift)
-            , Hint(hint)
-        {
-        }
-
-        /// Return (dividend % Divisor)
-        Y_FORCE_INLINE TDividend Remainder(TDividend dividend) const noexcept {
-            if (Y_UNLIKELY(Divisor == 1)) {
-                return 0;
-            }
-            TDividend r = dividend - Quotent(dividend) * Divisor;
-            return r;
-        }
-
-        Y_FORCE_INLINE TDivisor operator()() const noexcept {
-            return Divisor;
-        }
-
-        Y_FORCE_INLINE static constexpr TReciprocalDivisor One() noexcept {
-            return {1u, 0u, -1, 1u};
-        }
-
-    private:
-        /// returns (dividend / Divisor)
-        Y_FORCE_INLINE TDividend Quotent(TDividend dividend) const noexcept {
-            const TDividend t = MulUnsignedUpper{}(dividend, Reciprocal);
-            const TDividend q = (t + ((dividend - t) >> 1)) >> ReciprocalShift;
-            return q;
-        }
-
-    public:
-        TDividend Reciprocal = 0;
-        TDivisor Divisor = 0;
-        ui8 ReciprocalShift = 0;
-        i8 Hint = 0; ///< Additional data: needless for division, but useful for the adjacent divisors search
-    };
-
-    template <typename T, typename TExtended, size_t shift>
-    struct TMulUnsignedUpper {
-        /// Return the high bits of the product of two unsigned integers.
-        Y_FORCE_INLINE T operator()(T a, T b) const noexcept {
-            return (static_cast<TExtended>(a) * static_cast<TExtended>(b)) >> shift;
-        }
-    };
-
-#if defined(_32_)
-    using THashDivisor = ::NPrivate::TReciprocalDivisor<ui32, ui32, TMulUnsignedUpper<ui32, ui64, 32>>;
-#else
-#if defined(Y_HAVE_INT128)
-    using THashDivisor = ::NPrivate::TReciprocalDivisor<ui32, ui64, TMulUnsignedUpper<ui64, unsigned __int128, 64>>;
-#elif defined(_MSC_VER) && defined(_M_X64)
-    struct TMulUnsignedUpperVCIntrin {
-        /// Return the high 64 bits of the product of two 64-bit unsigned integers.
-        Y_FORCE_INLINE ui64 operator()(ui64 a, ui64 b) const noexcept {
-            return __umulh(a, b);
-        }
-    };
-    using THashDivisor = ::NPrivate::TReciprocalDivisor<ui32, ui64, TMulUnsignedUpperVCIntrin>;
-#else
-    template <typename TDivisor, typename TDividend>
-    class TNaiveDivisor {
-    public:
-        constexpr TNaiveDivisor() noexcept = default;
-
-        constexpr TNaiveDivisor(TDivisor divisor) noexcept
-            : Divisor(divisor)
-        {
-        }
-
-        constexpr TNaiveDivisor(TDividend reciprocal, ui8 reciprocalShift, i8 hint, TDivisor divisor) noexcept
-            : TNaiveDivisor(divisor)
-        {
-            Y_UNUSED(reciprocal);
-            Y_UNUSED(reciprocalShift);
-            Y_UNUSED(hint);
-        }
-
-        Y_FORCE_INLINE TDividend Remainder(TDividend dividend) const noexcept {
-            return dividend % Divisor;
-        }
-
-        Y_FORCE_INLINE TDivisor operator()() const noexcept {
-            return Divisor;
-        }
-
-        Y_FORCE_INLINE static constexpr TNaiveDivisor One() noexcept {
-            return {1u};
-        }
-
-    public:
-        TDivisor Divisor = 0;
-        static constexpr i8 Hint = -1;
-    };
-
-    using THashDivisor = ::NPrivate::TNaiveDivisor<ui32, ui64>;
-#endif
-#endif
-}
-
-Y_CONST_FUNCTION
-::NPrivate::THashDivisor HashBucketCountExt(unsigned long elementCount);
-
-Y_CONST_FUNCTION
-::NPrivate::THashDivisor HashBucketCountExt(unsigned long elementCount, int hint);

package/inc/util/generic/hash_set.h

@@ -1,490 +0,0 @@
-#pragma once
-
-#include "fwd.h"
-#include "hash.h"
-
-#include <initializer_list>
-#include <utility>
-
-#undef value_type
-
-template <class Value, class HashFcn, class EqualKey, class Alloc>
-class THashSet {
-private:
-    using ht = THashTable<Value, Value, HashFcn, ::TIdentity, EqualKey, Alloc>;
-    ht rep;
-
-    using mutable_iterator = typename ht::iterator;
-
-public:
-    using key_type = typename ht::key_type;
-    using value_type = typename ht::value_type;
-    using hasher = typename ht::hasher;
-    using key_equal = typename ht::key_equal;
-    using allocator_type = typename ht::allocator_type;
-    using node_allocator_type = typename ht::node_allocator_type;
-
-    using size_type = typename ht::size_type;
-    using difference_type = typename ht::difference_type;
-    using pointer = typename ht::const_pointer;
-    using const_pointer = typename ht::const_pointer;
-    using reference = typename ht::const_reference;
-    using const_reference = typename ht::const_reference;
-
-    using iterator = typename ht::const_iterator;
-    using const_iterator = typename ht::const_iterator;
-    using insert_ctx = typename ht::insert_ctx;
-
-    hasher hash_function() const {
-        return rep.hash_function();
-    }
-    key_equal key_eq() const {
-        return rep.key_eq();
-    }
-
-public:
-    THashSet() {
-    }
-    template <class TT>
-    explicit THashSet(TT* allocParam, size_type n = 0)
-        : rep(n, hasher(), key_equal(), allocParam)
-    {
-    }
-    explicit THashSet(size_type n)
-        : rep(n, hasher(), key_equal())
-    {
-    }
-    THashSet(size_type n, const hasher& hf)
-        : rep(n, hf, key_equal())
-    {
-    }
-    THashSet(size_type n, const hasher& hf, const key_equal& eql)
-        : rep(n, hf, eql)
-    {
-    }
-
-    THashSet(std::initializer_list<value_type> list)
-        : rep(list.size(), hasher(), key_equal())
-    {
-        rep.insert_unique(list.begin(), list.end());
-    }
-    THashSet(std::initializer_list<value_type> list, size_type n)
-        : rep(n, hasher(), key_equal())
-    {
-        rep.insert_unique(list.begin(), list.end());
-    }
-    THashSet(std::initializer_list<value_type> list, size_type n, const hasher& hf)
-        : rep(n, hf, key_equal())
-    {
-        rep.insert_unique(list.begin(), list.end());
-    }
-    THashSet(std::initializer_list<value_type> list, size_type n, const hasher& hf, const key_equal& eql)
-        : rep(n, hf, eql)
-    {
-        rep.insert_unique(list.begin(), list.end());
-    }
-
-    template <class InputIterator>
-    THashSet(InputIterator f, InputIterator l)
-        : rep(0, hasher(), key_equal())
-    {
-        rep.insert_unique(f, l);
-    }
-    template <class InputIterator>
-    THashSet(InputIterator f, InputIterator l, size_type n)
-        : rep(n, hasher(), key_equal())
-    {
-        rep.insert_unique(f, l);
-    }
-    template <class InputIterator>
-    THashSet(InputIterator f, InputIterator l, size_type n,
-             const hasher& hf)
-        : rep(n, hf, key_equal())
-    {
-        rep.insert_unique(f, l);
-    }
-    template <class InputIterator>
-    THashSet(InputIterator f, InputIterator l, size_type n,
-             const hasher& hf, const key_equal& eql)
-        : rep(n, hf, eql)
-    {
-        rep.insert_unique(f, l);
-    }
-
-    // THashSet has implicit copy/move constructors and copy-/move-assignment operators
-    // because its implementation is backed by THashTable.
-    // See hash_ut.cpp
-
-public:
-    size_type size() const {
-        return rep.size();
-    }
-    size_type max_size() const {
-        return rep.max_size();
-    }
-
-    Y_PURE_FUNCTION
-    bool empty() const {
-        return rep.empty();
-    }
-    explicit operator bool() const noexcept {
-        return !empty();
-    }
-    void swap(THashSet& hs) {
-        rep.swap(hs.rep);
-    }
-
-    iterator begin() const {
-        return rep.begin();
-    }
-    iterator end() const {
-        return rep.end();
-    }
-    iterator cbegin() const {
-        return rep.begin();
-    }
-    iterator cend() const {
-        return rep.end();
-    }
-
-public:
-    void insert(std::initializer_list<value_type> ilist) {
-        insert(ilist.begin(), ilist.end());
-    }
-
-    template <class InputIterator>
-    void insert(InputIterator f, InputIterator l) {
-        rep.insert_unique(f, l);
-    }
-
-    std::pair<iterator, bool> insert(const value_type& obj) {
-        std::pair<mutable_iterator, bool> p = rep.insert_unique(obj);
-        return std::pair<iterator, bool>(p.first, p.second);
-    }
-    template <typename... Args>
-    std::pair<iterator, bool> emplace(Args&&... args) {
-        std::pair<mutable_iterator, bool> p = rep.emplace_unique(std::forward<Args>(args)...);
-        return std::pair<iterator, bool>(p.first, p.second);
-    }
-
-    iterator insert(const_iterator, const value_type& obj) { // insert_hint
-        std::pair<mutable_iterator, bool> p = rep.insert_unique(obj);
-        return p.first;
-    }
-
-    std::pair<iterator, bool> insert_noresize(const value_type& obj) {
-        std::pair<mutable_iterator, bool> p = rep.insert_unique_noresize(obj);
-        return std::pair<iterator, bool>(p.first, p.second);
-    }
-    template <typename... Args>
-    std::pair<iterator, bool> emplace_noresize(Args&&... args) {
-        std::pair<mutable_iterator, bool> p = rep.emplace_unique_noresize(std::forward<Args>(args)...);
-        return std::pair<iterator, bool>(p.first, p.second);
-    }
-
-    template <class TheObj>
-    iterator insert_direct(const TheObj& obj, const insert_ctx& ins) {
-        return rep.insert_direct(obj, ins);
-    }
-    template <typename... Args>
-    iterator emplace_direct(const insert_ctx& ins, Args&&... args) {
-        return rep.emplace_direct(ins, std::forward<Args>(args)...);
-    }
-
-    template <class TheKey>
-    const_iterator find(const TheKey& key) const {
-        return rep.find(key);
-    }
-    template <class TheKey>
-    iterator find(const TheKey& key, insert_ctx& ins) {
-        return rep.find_i(key, ins);
-    }
-
-    template <class TheKey>
-    bool contains(const TheKey& key) const {
-        return rep.find(key) != rep.end();
-    }
-    template <class TheKey>
-    bool contains(const TheKey& key, insert_ctx& ins) {
-        return rep.find_i(key, ins) != rep.end();
-    }
-
-    template <class TKey>
-    size_type count(const TKey& key) const {
-        return rep.count(key);
-    }
-
-    template <class TKey>
-    std::pair<iterator, iterator> equal_range(const TKey& key) const {
-        return rep.equal_range(key);
-    }
-
-    size_type erase(const key_type& key) {
-        return rep.erase(key);
-    }
-    void erase(iterator it) {
-        rep.erase(it);
-    }
-    void erase(iterator f, iterator l) {
-        rep.erase(f, l);
-    }
-    void clear() {
-        rep.clear();
-    }
-    void clear(size_t downsize_hint) {
-        rep.clear(downsize_hint);
-    }
-    void basic_clear() {
-        rep.basic_clear();
-    }
-    void release_nodes() {
-        rep.release_nodes();
-    }
-
-    template <class KeySaver>
-    int save_for_st(IOutputStream* stream, KeySaver& ks) const {
-        return rep.template save_for_st<KeySaver>(stream, ks);
-    }
-
-public:
-    void reserve(size_type hint) {
-        rep.reserve(hint);
-    }
-    size_type bucket_count() const {
-        return rep.bucket_count();
-    }
-    size_type bucket_size(size_type n) const {
-        return rep.bucket_size(n);
-    }
-    node_allocator_type& GetNodeAllocator() {
-        return rep.GetNodeAllocator();
-    }
-};
-
-template <class Value, class HashFcn, class EqualKey, class Alloc>
-inline bool operator==(const THashSet<Value, HashFcn, EqualKey, Alloc>& hs1, const THashSet<Value, HashFcn, EqualKey, Alloc>& hs2) {
-    if (hs1.size() != hs2.size()) {
-        return false;
-    }
-    for (const auto& it : hs1) {
-        if (!hs2.contains(it)) {
-            return false;
-        }
-    }
-    return true;
-}
-
-template <class Value, class HashFcn, class EqualKey, class Alloc>
-inline bool operator!=(const THashSet<Value, HashFcn, EqualKey, Alloc>& hs1, const THashSet<Value, HashFcn, EqualKey, Alloc>& hs2) {
-    return !(hs1 == hs2);
-}
-
-template <class Value, class HashFcn, class EqualKey, class Alloc>
-class THashMultiSet {
-private:
-    using ht = THashTable<Value, Value, HashFcn, ::TIdentity, EqualKey, Alloc>;
-    ht rep;
-
-public:
-    using key_type = typename ht::key_type;
-    using value_type = typename ht::value_type;
-    using hasher = typename ht::hasher;
-    using key_equal = typename ht::key_equal;
-    using allocator_type = typename ht::allocator_type;
-    using node_allocator_type = typename ht::node_allocator_type;
-
-    using size_type = typename ht::size_type;
-    using difference_type = typename ht::difference_type;
-    using pointer = typename ht::const_pointer;
-    using const_pointer = typename ht::const_pointer;
-    using reference = typename ht::const_reference;
-    using const_reference = typename ht::const_reference;
-
-    using iterator = typename ht::const_iterator;
-    using const_iterator = typename ht::const_iterator;
-
-    hasher hash_function() const {
-        return rep.hash_function();
-    }
-    key_equal key_eq() const {
-        return rep.key_eq();
-    }
-
-public:
-    THashMultiSet()
-        : rep(0, hasher(), key_equal())
-    {
-    }
-    explicit THashMultiSet(size_type n)
-        : rep(n, hasher(), key_equal())
-    {
-    }
-    THashMultiSet(size_type n, const hasher& hf)
-        : rep(n, hf, key_equal())
-    {
-    }
-    THashMultiSet(size_type n, const hasher& hf, const key_equal& eql)
-        : rep(n, hf, eql)
-    {
-    }
-
-    template <class InputIterator>
-    THashMultiSet(InputIterator f, InputIterator l)
-        : rep(0, hasher(), key_equal())
-    {
-        rep.insert_equal(f, l);
-    }
-    template <class InputIterator>
-    THashMultiSet(InputIterator f, InputIterator l, size_type n)
-        : rep(n, hasher(), key_equal())
-    {
-        rep.insert_equal(f, l);
-    }
-    template <class InputIterator>
-    THashMultiSet(InputIterator f, InputIterator l, size_type n,
-                  const hasher& hf)
-        : rep(n, hf, key_equal())
-    {
-        rep.insert_equal(f, l);
-    }
-    template <class InputIterator>
-    THashMultiSet(InputIterator f, InputIterator l, size_type n,
-                  const hasher& hf, const key_equal& eql)
-        : rep(n, hf, eql)
-    {
-        rep.insert_equal(f, l);
-    }
-
-    THashMultiSet(std::initializer_list<value_type> list)
-        : rep(list.size(), hasher(), key_equal())
-    {
-        rep.insert_equal(list.begin(), list.end());
-    }
-
-    // THashMultiSet has implicit copy/move constructors and copy-/move-assignment operators
-    // because its implementation is backed by THashTable.
-    // See hash_ut.cpp
-
-public:
-    size_type size() const {
-        return rep.size();
-    }
-    size_type max_size() const {
-        return rep.max_size();
-    }
-
-    Y_PURE_FUNCTION
-    bool empty() const {
-        return rep.empty();
-    }
-    explicit operator bool() const noexcept {
-        return !empty();
-    }
-    void swap(THashMultiSet& hs) {
-        rep.swap(hs.rep);
-    }
-
-    iterator begin() const {
-        return rep.begin();
-    }
-    iterator end() const {
-        return rep.end();
-    }
-    iterator cbegin() const {
-        return rep.begin();
-    }
-    iterator cend() const {
-        return rep.end();
-    }
-
-public:
-    iterator insert(const value_type& obj) {
-        return rep.insert_equal(obj);
-    }
-    template <typename... Args>
-    iterator emplace(Args&&... args) {
-        return rep.emplace_equal(std::forward<Args>(args)...);
-    }
-    template <class InputIterator>
-    void insert(InputIterator f, InputIterator l) {
-        rep.insert_equal(f, l);
-    }
-    iterator insert_noresize(const value_type& obj) {
-        return rep.insert_equal_noresize(obj);
-    }
-
-    template <class TKey>
-    iterator find(const TKey& key) const {
-        return rep.find(key);
-    }
-
-    template <class TKey>
-    size_type count(const TKey& key) const {
-        return rep.count(key);
-    }
-
-    template <class TKey>
-    std::pair<iterator, iterator> equal_range(const TKey& key) const {
-        return rep.equal_range(key);
-    }
-
-    size_type erase(const key_type& key) {
-        return rep.erase(key);
-    }
-    void erase(iterator it) {
-        rep.erase(it);
-    }
-    void erase(iterator f, iterator l) {
-        rep.erase(f, l);
-    }
-    void clear() {
-        rep.clear();
-    }
-    void clear(size_t downsize_hint) {
-        rep.clear(downsize_hint);
-    }
-    void basic_clear() {
-        rep.basic_clear();
-    }
-    void release_nodes() {
-        rep.release_nodes();
-    }
-
-public:
-    void reserve(size_type hint) {
-        rep.reserve(hint);
-    }
-    size_type bucket_count() const {
-        return rep.bucket_count();
-    }
-    size_type bucket_size(size_type n) const {
-        return rep.bucket_size(n);
-    }
-    node_allocator_type& GetNodeAllocator() {
-        return rep.GetNodeAllocator();
-    }
-};
-
-template <class Val, class HashFcn, class EqualKey, class Alloc>
-inline bool operator==(const THashMultiSet<Val, HashFcn, EqualKey, Alloc>& hs1, const THashMultiSet<Val, HashFcn, EqualKey, Alloc>& hs2) {
-    if (hs1.size() != hs2.size()) {
-        return false;
-    }
-    EqualKey equalKey;
-    auto it = hs1.begin();
-    while (it != hs1.end()) {
-        const auto& value = *it;
-        size_t count = 0;
-        for (; (it != hs1.end()) && (equalKey(*it, value)); ++it, ++count) {
-        }
-        if (hs2.count(value) != count) {
-            return false;
-        }
-    }
-    return true;
-}
-
-template <class Val, class HashFcn, class EqualKey, class Alloc>
-inline bool operator!=(const THashMultiSet<Val, HashFcn, EqualKey, Alloc>& hs1, const THashMultiSet<Val, HashFcn, EqualKey, Alloc>& hs2) {
-    return !(hs1 == hs2);
-}

package/inc/util/generic/hide_ptr.h

@@ -1,3 +0,0 @@
-#pragma once
-
-void* HidePointerOrigin(void*);