xhash File Reference

#include <cstring>
#include <cwchar>
#include <list>
#include <vector>

Classes
class	stdext::hash_compare< _Kty, _Pr >
class	_Uhash_compare< _Kty, _Hasher, _Keyeq >
class	_Hash< _Traits >

Namespaces
	stdext

Macros
#define	_XHASH_
#define	_HASH_SEED   (size_t)0xdeadbeef

Functions
template<class _Kty >
size_t	stdext::hash_value (const _Kty &_Keyval)
template<class _Elem , class _Traits , class _Alloc >
size_t	stdext::hash_value (const basic_string< _Elem, _Traits, _Alloc > &_Str)
size_t	stdext::hash_value (_In_z_ const char *_Str)
size_t	stdext::hash_value (_In_z_ const wchar_t *_Str)
template<class _Traits >
bool	_Hash_equal_elements (const _Hash< _Traits > &_Left, const _Hash< _Traits > &_Right, false_type)
template<class _Traits >
bool	_Hash_equal_elements (const _Hash< _Traits > &_Left, const _Hash< _Traits > &_Right, true_type)
template<class _Traits >
bool	_Hash_equal (const _Hash< _Traits > &_Left, const _Hash< _Traits > &_Right)

Macro Definition Documentation

#define _HASH_SEED   (size_t)0xdeadbeef

#define _XHASH_

Function Documentation

template<class _Traits >

bool _Hash_equal ( const _Hash< _Traits > &  _Left, const _Hash< _Traits > &  _Right  )

inline

    {   // test for _Hash equality
    return (_Left.size() == _Right.size() && _Hash_equal_elements(
        _Left, _Right, integral_constant<bool, _Traits::_Multi>()));
    }

template<class _Traits >

bool _Hash_equal_elements ( const _Hash< _Traits > &  _Left, const _Hash< _Traits > &  _Right, false_type    )

inline

    {   // test for _Hash equality (same size, unique keys)
    typedef typename _Hash<_Traits>::const_iterator _Iter;
    for (_Iter _Next1 = _Left.begin(); _Next1 != _Left.end(); ++_Next1)
        {   // look for element with equivalent key
        _Iter _Next2 = _Right.find(_Traits::_Kfn(*_Next1));
        if (_Next2 == _Right.end()
            || !(_Traits::_Nonkfn(*_Next1) == _Traits::_Nonkfn(*_Next2)))
            return (false);
        }
    return (true);
    }

template<class _Traits >

bool _Hash_equal_elements ( const _Hash< _Traits > &  _Left, const _Hash< _Traits > &  _Right, true_type    )

inline

    {   // test for _Hash equality (same size, equivalent keys)
    typedef typename _Hash<_Traits>::const_iterator _Iter;
    typedef pair<_Iter, _Iter> _Iter_pair;

    for (_Iter _Next1 = _Left.begin(); _Next1 != _Left.end(); )
        {   // look for elements with equivalent keys
        _Iter_pair _Lrange = _Left.equal_range(_Traits::_Kfn(*_Next1));
        _Iter_pair _Rrange = _Right.equal_range(_Traits::_Kfn(*_Next1));

        if (!_STD is_permutation(_Lrange.first, _Lrange.second,
            _Rrange.first, _Rrange.second))
            return (false);
        _Next1 = _Lrange.second;    // continue just past range
        }
    return (true);
    }