Swiftdiff options
| author | Remko Tronçon <git@el-tramo.be> | 2011-02-12 13:54:17 (GMT) |
|---|---|---|
| committer | Remko Tronçon <git@el-tramo.be> | 2011-02-12 14:27:05 (GMT) |
| commit | b734b6a5986703b6b10ea548c93af11f9df771bf (patch) | |
| tree | b7cb4230b556fe4104e5901941e055a2beae51cd /3rdParty/Boost/src/boost/unordered/unordered_map_fwd.hpp | |
| parent | b75cf274d8c3cf255fd1d8932a9f6a6cfa8cb9b4 (diff) | |
| download | swift-b734b6a5986703b6b10ea548c93af11f9df771bf.zip swift-b734b6a5986703b6b10ea548c93af11f9df771bf.tar.bz2 | |
Cache stringprep results for JIDs.
Diffstat (limited to '3rdParty/Boost/src/boost/unordered/unordered_map_fwd.hpp')
| -rw-r--r-- | 3rdParty/Boost/src/boost/unordered/unordered_map_fwd.hpp | 53 |
1 files changed, 53 insertions, 0 deletions
diff --git a/3rdParty/Boost/src/boost/unordered/unordered_map_fwd.hpp b/3rdParty/Boost/src/boost/unordered/unordered_map_fwd.hpp new file mode 100644 index 0000000..5e9bb07 --- /dev/null +++ b/3rdParty/Boost/src/boost/unordered/unordered_map_fwd.hpp @@ -0,0 +1,53 @@ + +// Copyright (C) 2008-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) + +#ifndef BOOST_UNORDERED_MAP_FWD_HPP_INCLUDED +#define BOOST_UNORDERED_MAP_FWD_HPP_INCLUDED + +#if defined(_MSC_VER) && (_MSC_VER >= 1020) +# pragma once +#endif + +#include <boost/config.hpp> +#include <memory> +#include <functional> +#include <boost/functional/hash_fwd.hpp> + +namespace boost +{ + template <class K, + class T, + class H = hash<K>, + class P = std::equal_to<K>, + class A = std::allocator<std::pair<const K, T> > > + class unordered_map; + template <class K, class T, class H, class P, class A> + bool operator==(unordered_map<K, T, H, P, A> const&, + unordered_map<K, T, H, P, A> const&); + template <class K, class T, class H, class P, class A> + bool operator!=(unordered_map<K, T, H, P, A> const&, + unordered_map<K, T, H, P, A> const&); + template <class K, class T, class H, class P, class A> + void swap(unordered_map<K, T, H, P, A>&, + unordered_map<K, T, H, P, A>&); + + template <class K, + class T, + class H = hash<K>, + class P = std::equal_to<K>, + class A = std::allocator<std::pair<const K, T> > > + class unordered_multimap; + template <class K, class T, class H, class P, class A> + bool operator==(unordered_multimap<K, T, H, P, A> const&, + unordered_multimap<K, T, H, P, A> const&); + template <class K, class T, class H, class P, class A> + bool operator!=(unordered_multimap<K, T, H, P, A> const&, + unordered_multimap<K, T, H, P, A> const&); + template <class K, class T, class H, class P, class A> + void swap(unordered_multimap<K, T, H, P, A>&, + unordered_multimap<K, T, H, P, A>&); +} + +#endif |