53 lines
1.6 KiB
C++
53 lines
1.6 KiB
C++
/*
|
|
TRAIT-SPECIAL.hpp - supplement, not so commonly used definitions and specialisations
|
|
|
|
Copyright (C) Lumiera.org
|
|
2010, Hermann Vosseler <Ichthyostega@web.de>
|
|
|
|
This program is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU General Public License as
|
|
published by the Free Software Foundation; either version 2 of
|
|
the License, or (at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to the Free Software
|
|
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
|
|
|
|
*/
|
|
|
|
|
|
#ifndef LIB_META_TRAIT_SPECIAL_H
|
|
#define LIB_META_TRAIT_SPECIAL_H
|
|
|
|
|
|
#include "lib/meta/trait.hpp"
|
|
|
|
#include <unordered_map>
|
|
|
|
|
|
namespace lib {
|
|
namespace meta {
|
|
|
|
|
|
/** the tr1 hashtable(s) are notoriously difficult to handle
|
|
* when it comes to detecting capabilities by metaprogramming,
|
|
* because the're built up from a generic baseclass and especially
|
|
* inherit their iterator-types as template specialisations.
|
|
*
|
|
* Thus we provide fixed diagnostics to bypass the traits check.
|
|
*/
|
|
template<typename KEY, typename VAL, typename HASH>
|
|
struct can_STL_ForEach<std::unordered_map<KEY,VAL,HASH> >
|
|
{
|
|
enum { value = true };
|
|
};
|
|
|
|
|
|
|
|
}} // namespace lib::meta
|
|
#endif
|