stdext::hash_compare< _Kty, _Pr > Class Template Reference

Public Types
enum	{ bucket_size = 1 }

Public Member Functions
	hash_compare (_Pr _Pred=_Pr())
size_t	operator() (const _Kty &_Keyval) const
bool	operator() (const _Kty &_Keyval1, const _Kty &_Keyval2) const

Public Attributes
_Pr	comp

Member Enumeration Documentation

template<class _Kty , class _Pr = less<_Kty>>

anonymous enum

Enumerator
bucket_size

        {   // parameters for hash table
        bucket_size = 1     // 0 < bucket_size
        };

Constructor & Destructor Documentation

template<class _Kty , class _Pr = less<_Kty>>

stdext::hash_compare< _Kty, _Pr >::hash_compare ( _Pr  _Pred = _Pr() )

inline

        : comp(_Pred)
        {   // construct with _Pred comparator
        }

Member Function Documentation

template<class _Kty , class _Pr = less<_Kty>>

size_t stdext::hash_compare< _Kty, _Pr >::operator() ( const _Kty &  _Keyval ) const

inline

        {   // hash _Keyval to size_t value by pseudorandomizing transform
        long _Quot = (long)(hash_value(_Keyval) & LONG_MAX);
        ldiv_t _Qrem = _CSTD ldiv(_Quot, 127773);

        _Qrem.rem = 16807 * _Qrem.rem - 2836 * _Qrem.quot;
        if (_Qrem.rem < 0)
            _Qrem.rem += LONG_MAX;
        return ((size_t)_Qrem.rem);
        }

template<class _Kty , class _Pr = less<_Kty>>

bool stdext::hash_compare< _Kty, _Pr >::operator() ( const _Kty &  _Keyval1, const _Kty &  _Keyval2  ) const

inline

        {   // test if _Keyval1 ordered before _Keyval2
        return (comp(_Keyval1, _Keyval2));
        }

Member Data Documentation

template<class _Kty , class _Pr = less<_Kty>>

_Pr stdext::hash_compare< _Kty, _Pr >::comp

---

The documentation for this class was generated from the following file:

• VS2015/inc/xhash