File: hash_fwd.hpp

package info (click to toggle)
rdkit 201809.1%2Bdfsg-6
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 123,688 kB
  • sloc: cpp: 230,509; python: 70,501; java: 6,329; ansic: 5,427; sql: 1,899; yacc: 1,739; lex: 1,243; makefile: 445; xml: 229; fortran: 183; sh: 123; cs: 93
file content (45 lines) | stat: -rw-r--r-- 1,262 bytes parent folder | download | duplicates (4)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45

// Copyright 2005-2009 Daniel James.
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

//  Based on Peter Dimov's proposal
//  http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1756.pdf
//  issue 6.18. 

#if !defined(GBOOST_FUNCTIONAL_HASH_FWD_HPP)
#define GBOOST_FUNCTIONAL_HASH_FWD_HPP

#if defined(_MSC_VER) && (_MSC_VER >= 1020)
# pragma once
#endif

#include <boost/cstdint.hpp>
namespace std{
  typedef boost::uint32_t hash_result_t;
}

#include <boost/config.hpp>
#include <cstddef>
#include <boost/detail/workaround.hpp>

namespace gboost
{
    template <class T> struct hash;

#if BOOST_WORKAROUND(BOOST_MSVC, < 1300)
    template <class T> void hash_combine(std::hash_result_t& seed, T& v);
#else
    template <class T> void hash_combine(std::hash_result_t& seed, T const& v);
#endif

    template <class It> std::hash_result_t hash_range(It, It);
    template <class It> void hash_range(std::hash_result_t&, It, It);

#if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x551))
    template <class T> inline std::hash_result_t hash_range(T*, T*);
    template <class T> inline void hash_range(std::hash_result_t&, T*, T*);
#endif
}

#endif