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 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362
|
// ==========================================================================
// SeqAn - The Library for Sequence Analysis
// ==========================================================================
// Copyright (c) 2006-2013, 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: Manuel Holtgrewe <manuel.holtgrewe@fu-berlin.de>
// ==========================================================================
// Adaptions for STL vectors to SeqAn sequences.
// ==========================================================================
// SEQAN_NO_GENERATED_FORWARDS: No forwards are generated for this file.
#ifndef SEQAN_SEQUENCE_ADAPT_STD_LIST_H_
#define SEQAN_SEQUENCE_ADAPT_STD_LIST_H_
namespace seqan {
// ===========================================================================
// Enums, Tags, Classes, Specializations
// ===========================================================================
/**
.Adaption."std::list"
..summary:Adaption for STL list objects.
*/
// ===========================================================================
// Metafunctions
// ===========================================================================
///.Metafunction.IsContiguous.param.T.type:Adaption.std::list
///.Metafunction.IsContiguous.class:Adaption.std::list
template <typename TValue, typename TAlloc>
struct IsContiguous< std::list<TValue, TAlloc> >
{
enum { VALUE = false };
};
template <typename TValue, typename TAlloc>
struct IsContiguous< std::list<TValue, TAlloc> const>
: IsContiguous< std::list<TValue, TAlloc> > {};
///.Metafunction.Value.param.T.type:Adaption.std::list
///.Metafunction.Value.class:Adaption.std::list
template <typename TValue, typename TAlloc>
struct Value< std::list<TValue, TAlloc> >
{
typedef typename std::list<TValue, TAlloc>::value_type Type;
};
template <typename TValue, typename TAlloc>
struct Value< std::list<TValue, TAlloc> const>
: Value< std::list<TValue, TAlloc> > {};
///.Metafunction.GetValue.param.T.type:Adaption.std::list
// TODO(holtgrew): GetValue is a reference?! I thought the reverse was true in respect to Value<>.
///.Metafunction.GetValue.class:Adaption.std::list
template <typename TValue, typename TAlloc>
struct GetValue< std::list<TValue, TAlloc> >
{
typedef typename std::list<TValue, TAlloc>::reference Type;
};
template <typename TValue, typename TAlloc>
struct GetValue< std::list<TValue, TAlloc> const>
{
typedef typename std::list<TValue, TAlloc>::const_reference Type;
};
///.Metafunction.Reference.param.T.type:Adaption.std::vector
///.Metafunction.Reference.class:Adaption.std::vector
template <typename TValue, typename TAlloc>
struct Reference< std::list<TValue, TAlloc> >
{
typedef typename std::list<TValue, TAlloc>::reference Type;
};
template <typename TValue, typename TAlloc>
struct Reference< std::list<TValue, TAlloc> const>
{
typedef typename std::list<TValue, TAlloc>::const_reference Type;
};
///.Metafunction.Iterator.param.T.type:Adaption.std::list
///.Metafunction.Iterator.class:Adaption.std::list
template <typename TValue, typename TAlloc>
struct Iterator< std::list<TValue, TAlloc>, Rooted>
{
typedef std::list<TValue, TAlloc> TString_;
typedef Iter<TString_, StdIteratorAdaptor> TIterator_;
typedef Iter<TString_, AdaptorIterator<TIterator_> > Type;
};
template <typename TValue, typename TAlloc>
struct Iterator< std::list<TValue, TAlloc> const, Rooted>
{
typedef std::list<TValue, TAlloc> const TString_;
typedef Iter<TString_, StdIteratorAdaptor> TIterator_;
typedef Iter<TString_, AdaptorIterator<TIterator_> > Type;
};
template <typename TValue, typename TAlloc>
struct Iterator< std::list<TValue, TAlloc>, Standard>
{
typedef Iter< std::list<TValue, TAlloc>, StdIteratorAdaptor> Type;
};
template <typename TValue, typename TAlloc>
struct Iterator< std::list<TValue, TAlloc> const, Standard>
{
typedef Iter< std::list<TValue, TAlloc> const, StdIteratorAdaptor> Type;
};
///.Metafunction.Position.param.T.type:Adaption.std::list
///.Metafunction.Position.class:Adaption.std::list
template <typename TValue, typename TAlloc>
struct Position< std::list<TValue, TAlloc> >
{
typedef typename std::list<TValue, TAlloc>::size_type Type;
};
template <typename TValue, typename TAlloc>
struct Position< std::list<TValue, TAlloc> const>
: Position< std::list<TValue, TAlloc> > {};
///.Metafunction.Size.param.T.type:Adaption.std::list
///.Metafunction.Size.class:Adaption.std::list
template <typename TValue, typename TAlloc>
struct Size< std::list<TValue, TAlloc> >
{
typedef typename std::list<TValue, TAlloc>::size_type Type;
};
template <typename TValue, typename TAlloc>
struct Size< std::list<TValue, TAlloc> const>
: Size< std::list<TValue, TAlloc> > {};
///.Metafunction.StdContainerIterator.param.T.type:Adaption.std::list
///.Metafunction.StdContainerIterator.class:Adaption.std::list
template <typename TValue, typename TAlloc>
struct StdContainerIterator< std::list<TValue, TAlloc> >
{
typedef std::list<TValue, TAlloc> TContainer_;
typedef typename TContainer_::iterator Type;
};
template <typename TValue, typename TAlloc>
struct StdContainerIterator< std::list<TValue, TAlloc> const>
{
typedef std::list<TValue, TAlloc> TContainer_;
typedef typename TContainer_::const_iterator Type;
};
// ===========================================================================
// Functions
// ===========================================================================
///.Function.begin.param.object.type:Adaption.std::list
///.Function.begin.class:Adaption.std::list
template<typename TValue>
inline
typename Iterator<std::list<TValue>, Standard>::Type
begin(std::list<TValue> & list,
Standard const &)
{
SEQAN_CHECKPOINT;
return list.begin();
}
template <typename TValue>
inline
typename Iterator<std::list<TValue> const, Standard>::Type
begin(std::list<TValue> const & list,
Standard const &)
{
SEQAN_CHECKPOINT;
return list.begin();
}
///.Function.end.param.object.type:Adaption.std::list
///.Function.end.class:Adaption.std::list
template<typename TValue>
inline
typename Iterator<std::list<TValue>, Standard>::Type
end(std::list<TValue> & list,
Standard const &)
{
SEQAN_CHECKPOINT;
return list.end();
}
template <typename TValue>
inline
typename Iterator<std::list<TValue> const, Standard>::Type
end(std::list<TValue> const & list,
Standard const &)
{
SEQAN_CHECKPOINT;
return list.end();
}
///.Function.front.param.container.type:Adaption.std::list
///.Function.front.class:Adaption.std::list
template <typename TValue>
inline typename Reference<std::list<TValue> >::Type
front(std::list<TValue> & list)
{
SEQAN_CHECKPOINT;
return list.front();
}
template <typename TValue>
inline typename Reference<std::list<TValue> const>::Type
front(std::list<TValue> const & list)
{
SEQAN_CHECKPOINT;
return list.front();
}
///.Function.back.param.container.type:Adaption.std::list
///.Function.back.class:Adaption.std::list
template <typename TValue>
inline typename Reference<std::list<TValue> >::Type
back(std::list<TValue> & list)
{
SEQAN_CHECKPOINT;
return list.back();
}
template <typename TValue>
inline typename Reference<std::list<TValue> const>::Type
back(std::list<TValue> const & list)
{
SEQAN_CHECKPOINT;
return list.back();
}
///.Function.length.param.object.type:Adaption.std::list
///.Function.length.class:Adaption.std::list
template <typename TValue>
inline typename Size<std::list<TValue> >::Type
length(std::list<TValue> & list)
{
SEQAN_CHECKPOINT;
return list.size();
}
template <typename TValue>
inline typename Size<std::list<TValue> const>::Type
length(std::list<TValue> const & list)
{
SEQAN_CHECKPOINT;
return list.size();
}
/**
.Function.prependValue:
..cat:Sequences
..summary:Prepend a value to a container.
..signature:prependValue(container, value)
..param.container:The container to prepend to.
...type:Adaption.std::list
..param.value:The value to prepend to the container.
..include:seqan/sequence.h
*/
///.Function.prependValue.class:Adaption.std::list
template <typename T, typename T2>
inline void
prependValue(std::list<T> & list,
T2 value)
{
SEQAN_CHECKPOINT;
list.push_front(value);
}
///.Function.appendValue.param.target.type:Adaption.std::list
///.Function.appendValue.class:Adaption.std::list
template <typename T, typename T2>
inline void
appendValue(std::list<T> & list,
T2 value)
{
SEQAN_CHECKPOINT;
list.push_back(value);
}
///.Function.clear.param.object.type:Adaption.std::list
///.Function.clear.class:Adaption.std::list
template <typename T>
inline void
clear(std::list<T> & list)
{
SEQAN_CHECKPOINT;
list.clear();
}
///.Function.reserve.param.object.type:Adaption.std::list
///.Function.reserve.class:Adaption.std::list
template <typename T, typename TTag>
inline void
reserve(std::list<T> & /*list*/, TTag const & /*tag*/)
{
SEQAN_CHECKPOINT;
}
///.Function.capacity.param.object.type:Adaption.std::list
///.Function.capacity.class:Adaption.std::list
template <typename T>
inline typename Size<std::list<T> >::Type
capacity(std::list<T> const & list)
{
SEQAN_CHECKPOINT;
return length(list);
}
} // namespace seqan
#endif // #ifndef SEQAN_SEQUENCE_ADAPT_STD_LIST_H_
|