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
|
// ==========================================================================
// 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.
//
// ==========================================================================
#ifndef SEQAN_HEADER_SUMLIST_H
#define SEQAN_HEADER_SUMLIST_H
namespace seqan
{
//////////////////////////////////////////////////////////////////////////////
//Default Specialization Tag
template <typename TSpec = Default>
struct SkipSumList;
//////////////////////////////////////////////////////////////////////////////
template <unsigned int DIM, typename TValue, typename TSpec = SkipSumList<> >
class SumList;
//////////////////////////////////////////////////////////////////////////////
template <typename T>
struct DIMENSION
{
enum { VALUE = 1}; //dummy implementation to make VC++ happy
};
template <unsigned int DIM_, typename TValue, typename TSpec>
struct DIMENSION< SumList<DIM_, TValue, TSpec> >
{
enum { VALUE = DIM_};
};
template <unsigned int DIM_, typename TValue, typename TSpec>
struct DIMENSION< SumList<DIM_, TValue, TSpec> const>
{
enum { VALUE = DIM_};
};
//////////////////////////////////////////////////////////////////////////////
template <unsigned int DIM, typename TValue, typename TSpec>
struct Value< SumList<DIM, TValue, TSpec> >
{
typedef TValue Type;
};
template <unsigned int DIM, typename TValue, typename TSpec>
struct Value< SumList<DIM, TValue, TSpec> const >
{
typedef TValue Type;
};
//////////////////////////////////////////////////////////////////////////////
// SumListValues:
// Stores one DIM tupel of Values
//////////////////////////////////////////////////////////////////////////////
template <unsigned int DIM, typename TValue>
struct SumListValues
{
TValue values[DIM];
SumListValues(MinimalCtor)
{}
SumListValues()
{
clear(*this);
}
SumListValues(SumListValues const & other)
{
*this = other;
}
SumListValues(TValue const * arr)
{
*this = arr;
}
~SumListValues()
{
}
SumListValues const & operator = (SumListValues const & other)
{
arrayCopy(other.values, other.values + DIM, values);
return *this;
}
SumListValues const & operator = (TValue const * arr)
{
arrayCopy(arr, arr + DIM, values);
return *this;
}
TValue & operator [] (unsigned int pos)
{
return values[pos];
}
TValue const & operator [] (unsigned int pos) const
{
return values[pos];
}
};
//////////////////////////////////////////////////////////////////////////////
template <typename T>
struct Values;
template <unsigned int DIM, typename TValue, typename TSpec>
struct Values< SumList<DIM, TValue, TSpec> >
{
typedef SumListValues<DIM, TValue> Type;
};
//////////////////////////////////////////////////////////////////////////////
template <unsigned int DIM, typename TValue>
inline SumListValues<DIM, TValue> const &
operator += (SumListValues<DIM, TValue> & left,
SumListValues<DIM, TValue> const & right)
{
for (unsigned int i = 0; i < DIM; ++i)
{
left.values[i] += right.values[i];
}
return left;
}
//////////////////////////////////////////////////////////////////////////////
template <unsigned int DIM, typename TValue>
inline SumListValues<DIM, TValue> const &
operator -= (SumListValues<DIM, TValue> & left,
SumListValues<DIM, TValue> const & right)
{
for (unsigned int i = 0; i < DIM; ++i)
{
left.values[i] -= right.values[i];
}
return left;
}
//////////////////////////////////////////////////////////////////////////////
template <unsigned int DIM, typename TValue>
inline bool
operator == (SumListValues<DIM, TValue> const & left,
SumListValues<DIM, TValue> const & right)
{
for (unsigned int i = 0; i < DIM; ++i)
{
if (left.values[i] != right.values[i]) return false;
}
return true;
}
template <unsigned int DIM, typename TValue>
inline bool
operator != (SumListValues<DIM, TValue> const & left,
SumListValues<DIM, TValue> const & right)
{
for (unsigned int i = 0; i < DIM; ++i)
{
if (left.values[i] != right.values[i]) return true;
}
return false;
}
//////////////////////////////////////////////////////////////////////////////
template <unsigned int DIM, typename TValue>
inline void
clear(SumListValues<DIM, TValue> & me)
{
arrayFill(me.values, me.values + DIM, 0);
}
//////////////////////////////////////////////////////////////////////////////
//____________________________________________________________________________
//////////////////////////////////////////////////////////////////////////////
}// namespace seqan
#endif //#ifndef SEQAN_HEADER_...
|
