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 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245
|
// ==========================================================================
// SeqAn - The Library for Sequence Analysis
// ==========================================================================
// Copyright (c) 2006-2018, Knut Reinert, FU Berlin
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
// * Neither the name of Knut Reinert or the FU Berlin nor the names of
// its contributors may be used to endorse or promote products derived
// from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL KNUT REINERT OR THE FU BERLIN BE LIABLE
// FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
// SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
// CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
// LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
// OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
// DAMAGE.
//
// ==========================================================================
// Author: Andreas Gogol-Döring <andreas.doering@mdc-berlin.de>
// ==========================================================================
// Adaptions of builting types such as bool, int, but also "builtin-level"
// user defined types such as wchar_t, int64_t, uint64_t to the alphabet
// concepts they are in.
// ==========================================================================
#ifndef SEQAN_INCLUDE_BASIC_ALPHABET_ADAPT_BUILTINS_H_
#define SEQAN_INCLUDE_BASIC_ALPHABET_ADAPT_BUILTINS_H_
#include <limits>
namespace seqan {
// ============================================================================
// Forwards
// ============================================================================
// ============================================================================
// Tags, Classes, Enums
// ============================================================================
// ============================================================================
// Metafunctions
// ============================================================================
// ----------------------------------------------------------------------------
// Metafunctions MaxValue_, MinValue_
// ----------------------------------------------------------------------------
// We would want to have this here, however this is not possible with the
// current implementation.
// ----------------------------------------------------------------------------
// Metafunction BitsPerValue
// ----------------------------------------------------------------------------
template <>
struct BitsPerValue<bool>
{
typedef int Type;
enum { VALUE = 1 };
};
// ----------------------------------------------------------------------------
// Metafunction IsCharType
// ----------------------------------------------------------------------------
// TODO(holtgrew): This should probably become a concept.
/*!
* @mfn IsCharType
* @headerfile <seqan/basic.h>
*
* @brief Return whether the argument is <tt>char</tt>, <tt>wchar_t</tt>, <tt>char const</tt>, or <tt>wchar_t
* const</tt>.
*
* @signature IsCharType<T>::Type;
* @signature IsCharType<T>::VALUE;
*
* @tparam T Type to check type of.
*
* This metafunction is used to enable and disable templated adaptions of arrays to sequences for builtin character
* types only.
*
* The return value is <tt>True</tt>/<tt>true</tt> for <tt>char</tt>, <tt>wchar_t</tt>, <tt>char const</tt>, and
* <tt>wchar_t const</tt>.
*/
template <typename T>
struct IsCharType;
template <typename T>
struct IsCharType
{
typedef False Type;
enum { VALUE = 0 };
};
template <typename T>
struct IsCharType<T const>
: IsCharType<T> {};
template <>
struct IsCharType<char>
{
typedef True Type;
enum { VALUE = 1 };
};
template <>
struct IsCharType<wchar_t>
{
typedef True Type;
enum { VALUE = 1 };
};
// ============================================================================
// Functions
// ============================================================================
// ----------------------------------------------------------------------------
// Function gapValueImpl() [char]
// ----------------------------------------------------------------------------
inline char const &
gapValueImpl(char *)
{
static char const _gap = '-';
return _gap;
}
inline char const &
gapValueImpl(char const *)
{
static char const _gap = '-';
return _gap;
}
// ----------------------------------------------------------------------------
// Function unknownValueImpl() [char]
// ----------------------------------------------------------------------------
inline char const &
unknownValueImpl(char *)
{
static char const _unknown = 'N';
return _unknown;
}
inline char const &
unknownValueImpl(char const *)
{
static char const _unknown = 'N';
return _unknown;
}
// ----------------------------------------------------------------------------
// Function supremumValueImpl()
// ----------------------------------------------------------------------------
template <typename T>
[[deprecated("Use std::numeric_limits<T>::max() instead.")]]
inline T const &
supremumValueImpl(T *)
{
static T const x = std::numeric_limits<T>::max();
return x;
}
[[deprecated("Use std::numeric_limits<T>::max() instead.")]]
inline long double const &
supremumValueImpl(long double *)
{
static long double const _value = std::numeric_limits<long double>::infinity( );
return _value;
}
[[deprecated("Use std::numeric_limits<T>::max() instead.")]]
inline double const &
supremumValueImpl(double *)
{
static double const _value = std::numeric_limits<double>::infinity( );
return _value;
}
[[deprecated("Use std::numeric_limits<T>::max() instead.")]]
inline float const &
supremumValueImpl(float *)
{
static float const _value = std::numeric_limits<float>::infinity( );
return _value;
}
// ----------------------------------------------------------------------------
// Function infimumValueImpl()
// ----------------------------------------------------------------------------
template <typename T>
[[deprecated("Use std::numeric_limits<T>::min() instead.")]]
inline T const &
infimumValueImpl(T *)
{
static T const x = std::numeric_limits<T>::min();
return x;
}
[[deprecated("Use std::numeric_limits<T>::min() instead.")]]
inline float const &
infimumValueImpl(float *)
{
static float const _value = -std::numeric_limits<float>::infinity( );
return _value;
}
[[deprecated("Use std::numeric_limits<T>::min() instead.")]]
inline double const &
infimumValueImpl(double *)
{
static double const _value = -std::numeric_limits<double>::infinity( );
return _value;
}
[[deprecated("Use std::numeric_limits<T>::min() instead.")]]
inline long double const &
infimumValueImpl(long double *)
{
static long double const _value = -std::numeric_limits<long double>::infinity( );
return _value;
}
} // namespace seqan
#endif // #ifndef SEQAN_INCLUDE_BASIC_ALPHABET_ADAPT_BUILTINS_H_
|