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 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630
|
// ==========================================================================
// 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: David Weese <david.weese@fu-berlin.de>
// Author: Manuel Holtgrewe <manuel.holtgrewe@fu-berlin.de>
// ==========================================================================
#ifndef SEQAN_HEADER_MODIFIER_REVERSE_H
#define SEQAN_HEADER_MODIFIER_REVERSE_H
namespace seqan
{
// ==========================================================================
// Forwards
// ==========================================================================
// ==========================================================================
// Classes, Enums, Typedefs
// ==========================================================================
// --------------------------------------------------------------------------
// Class ModReverse Iterator
// --------------------------------------------------------------------------
/*!
* @class ModReverseIterator
* @extends ModifiedIterator
* @headerfile <seqan/modifier.h>
* @brief Mirror the characters from begin to end.
*
* @signature template <typename THost>
* class ModifiedIterator<THost, ModReverse>;
*
* @tparam THost original iterator.
*/
/*!
* @class ModReverseString
* @extends ModifiedString
* @headerfile <seqan/modifier.h>
* @brief Mirror the characters from begin to end.
*
* @signature template <typename THost>
* class ModifiedString<THost, ModReverse>;
*
* @tparam THost original string.
*/
struct ModReverse_;
typedef Tag<ModReverse_> ModReverse;
// ==========================================================================
// Metafunctions
// ==========================================================================
// --------------------------------------------------------------------------
// Metafunction Cargo [ModReverse ModifiedIterator]
// --------------------------------------------------------------------------
template <typename THost>
struct Cargo<ModifiedIterator<THost, ModReverse> >
{
typedef Cargo Type; // to reduce namespace pollution
bool _atEnd;
Cargo() : _atEnd(false)
{}
};
// --------------------------------------------------------------------------
// Metafunction Iterator [ModReverse ModifiedString]
// --------------------------------------------------------------------------
template <typename THost>
struct Iterator<ModifiedString<THost, ModReverse>, Standard>
{
typedef ModifiedIterator<typename Iterator<THost, Rooted>::Type, ModReverse> Type;
};
template <typename THost>
struct Iterator<ModifiedString<THost, ModReverse> const, Standard>
{
typedef ModifiedIterator<typename Iterator<THost, Rooted>::Type, ModReverse> Type;
};
// --------------------------------------------------------------------------
// Metafunction DefaultIteratorSpec [ModReverse ModifiedString]
// --------------------------------------------------------------------------
template <typename THost>
struct DefaultIteratorSpec< ModifiedString<THost, ModReverse> >
{
typedef Rooted Type;
};
// ==========================================================================
// Functions
// ==========================================================================
// --------------------------------------------------------------------------
// Function goNext() [ModReverse ModifiedIterator]
// --------------------------------------------------------------------------
template <typename THost>
inline void
goNext(ModifiedIterator<THost, ModReverse> & me)
{
if (atBegin(host(me)))
cargo(me)._atEnd = true;
else
goPrevious(host(me));
}
// --------------------------------------------------------------------------
// Function goPrevious() [ModReverse ModifiedIterator]
// --------------------------------------------------------------------------
template <typename THost>
inline void
goPrevious(ModifiedIterator<THost, ModReverse> & me)
{
if (cargo(me)._atEnd)
cargo(me)._atEnd = false;
else
goNext(host(me));
}
// --------------------------------------------------------------------------
// Function goEnd() [ModReverse ModifiedIterator]
// --------------------------------------------------------------------------
template <typename THost, typename TContainer>
inline void
goEnd(ModifiedIterator<THost, ModReverse> & me,
TContainer & container)
{
goBegin(host(me), host(container));
cargo(me)._atEnd = true;
}
// --------------------------------------------------------------------------
// Function goBegin() [ModReverse ModifiedIterator]
// --------------------------------------------------------------------------
template <typename THost, typename TContainer>
inline void
goBegin(ModifiedIterator<THost, ModReverse> & me,
TContainer & container)
{
typedef typename Host<TContainer>::Type THostContainer;
typename Parameter_<THostContainer>::Type hostContainer = host(container);
goEnd(host(me), hostContainer);
if (atBegin(host(me), hostContainer))
{
cargo(me)._atEnd = true;
}
else
{
cargo(me)._atEnd = false;
goPrevious(host(me));
}
}
//template <typename THost>
//inline void
//goBegin(ModifiedIterator<THost, ModReverse> & me)
//{
// goEnd(host(me));
// if (atBegin(host(me)))
// {
// cargo(me)._atEnd = true;
// }
// else
// {
// cargo(me)._atEnd = false;
// goPrevious(host(me));
// }
//}
// --------------------------------------------------------------------------
// Function operator+=() [ModReverse ModifiedIterator]
// --------------------------------------------------------------------------
template <typename THost, typename TDelta>
inline ModifiedIterator<THost, ModReverse> &
operator+=(ModifiedIterator<THost, ModReverse> & me, TDelta delta_)
{
typedef ModifiedIterator<THost, ModReverse> TIterator;
typedef typename Position<TIterator>::Type TPosition;
TPosition delta = delta_;
if (delta == 0)
{
return me;
}
if (delta > 0)
{
if (position(host(me)) < delta)
{
cargo(me)._atEnd = true;
--delta;
}
host(me) -= delta;
}
else
{
if (cargo(me)._atEnd)
{
cargo(me)._atEnd = false;
++delta;
}
host(me) -= delta;
}
return me;
}
// --------------------------------------------------------------------------
// Function operator-=() [ModReverse ModifiedIterator]
// --------------------------------------------------------------------------
template <typename THost, typename TDelta>
inline ModifiedIterator<THost, ModReverse> &
operator-=(ModifiedIterator<THost, ModReverse> & me, TDelta delta)
{
typedef typename Position<THost>::Type TPos;
typedef typename MakeSigned<TPos>::Type TSignedPos;
if (delta > 0)
{
if (cargo(me)._atEnd)
{
cargo(me)._atEnd = false;
--delta;
}
host(me) += delta;
}
else
{
if ((TSignedPos)position(host(me)) < -(TSignedPos)delta)
{
cargo(me)._atEnd = true;
++delta;
}
host(me) -= -delta;
}
return me;
}
// --------------------------------------------------------------------------
// Function operator-() [ModReverse ModifiedIterator]
// --------------------------------------------------------------------------
template <typename THost, typename TPos>
inline ModifiedIterator<THost, ModReverse>
operator-(ModifiedIterator<THost, ModReverse> me, TPos const i)
{
return me -= i;
}
// --------------------------------------------------------------------------
// Function operator-() [ModReverse ModifiedIterator]
// --------------------------------------------------------------------------
template <typename THost>
inline typename Difference< ModifiedIterator<THost, ModReverse> >::Type
operator-(ModifiedIterator<THost, ModReverse> const & a,
ModifiedIterator<THost, ModReverse> const & b)
{
typename Difference< ModifiedIterator<THost, ModReverse> >::Type diff = host(b) - host(a);
if (cargo(a)._atEnd)
++diff;
if (cargo(b)._atEnd)
--diff;
return diff;
}
// --------------------------------------------------------------------------
// Function position() [ModReverse ModifiedIterator]
// --------------------------------------------------------------------------
template <typename THost>
inline typename Position<ModifiedIterator<THost, ModReverse> const>::Type
position(ModifiedIterator<THost, ModReverse> const & me)
{
if (cargo(me)._atEnd)
return length(container(host(me)));
else
return length(container(host(me))) - 1 - position(host(me));
}
// rooted overload
template <typename TContainer1, typename TIterator, typename TSpec, typename TContainer2>
inline typename Position<ModifiedIterator<Iter<TContainer1, AdaptorIterator<TIterator, TSpec> >, ModReverse> const>::Type
position(ModifiedIterator<Iter<TContainer1, AdaptorIterator<TIterator, TSpec> >, ModReverse> const & me,
TContainer2 const &)
{
return position(me); // rooted has container
}
template <typename THost, typename TContainer>
inline typename Position<ModifiedIterator<THost, ModReverse> const>::Type
position(ModifiedIterator<THost, ModReverse> const & me, TContainer const &cont)
{
if (cargo(me)._atEnd)
return length(cont);
else
return length(cont) - 1 - position(host(me), cont);
}
// --------------------------------------------------------------------------
// Function setPosition() [ModReverse ModifiedIterator]
// --------------------------------------------------------------------------
template <typename THost, typename TPosition>
inline void
setPosition(ModifiedIterator<THost, ModReverse> const & me, TPosition pos)
{
setPosition(host(me), length(container(host(me))) - 1 - pos);
}
// --------------------------------------------------------------------------
// Function operator==() [ModReverse ModifiedIterator]
// --------------------------------------------------------------------------
template <typename THost>
inline bool
operator==(ModifiedIterator<THost, ModReverse> const & a,
ModifiedIterator<THost, ModReverse> const & b)
{
return cargo(a)._atEnd == cargo(b)._atEnd && host(a) == host(b);
}
// --------------------------------------------------------------------------
// Function operator<() [ModReverse ModifiedIterator]
// --------------------------------------------------------------------------
template <typename THost>
inline bool
operator<(ModifiedIterator<THost, ModReverse> const & a,
ModifiedIterator<THost, ModReverse> const & b)
{
return (!cargo(a)._atEnd && cargo(b)._atEnd) ||
(!cargo(a)._atEnd && !cargo(b)._atEnd && host(a) > host(b));
}
// --------------------------------------------------------------------------
// Function atEnd() [ModReverse ModifiedIterator]
// --------------------------------------------------------------------------
template <typename THost, typename TContainer>
inline bool
atBegin(ModifiedIterator<THost, ModReverse> const & me,
TContainer const & container)
{
return position(me, container) == 0;
}
template <typename THost>
inline bool
atBegin(ModifiedIterator<THost, ModReverse> const & me)
{
return position(me) == 0;
}
// --------------------------------------------------------------------------
// Function atEnd() [ModReverse ModifiedIterator]
// --------------------------------------------------------------------------
template <typename THost, typename TContainer>
inline bool
atEnd(ModifiedIterator<THost, ModReverse> const & me,
TContainer const & /*container*/)
{
return cargo(me)._atEnd;
}
template <typename THost>
inline bool
atEnd(ModifiedIterator<THost, ModReverse> const & me)
{
return cargo(me)._atEnd;
}
// --------------------------------------------------------------------------
// Function value() [ModReverse ModifiedString]
// --------------------------------------------------------------------------
template <typename THost, typename TPos>
inline typename Reference<ModifiedString<THost, ModReverse> >::Type
value(ModifiedString<THost, ModReverse> & me, TPos pos)
{
return value(host(me), (length(host(me)) - 1) - pos);
}
template <typename THost, typename TPos>
inline typename Reference<ModifiedString<THost, ModReverse> const>::Type
value(ModifiedString<THost, ModReverse> const & me, TPos pos)
{
return value(host(me), (length(host(me)) - 1) - pos);
}
// --------------------------------------------------------------------------
// Function begin() [ModReverse ModifiedString]
// --------------------------------------------------------------------------
template < typename THost>
inline typename Iterator< ModifiedString<THost, ModReverse> const >::Type
begin(ModifiedString<THost, ModReverse> const & me)
{
typename Iterator< ModifiedString<THost, ModReverse> const >::Type temp_(end(host(me), Rooted()));
_copyCargo(temp_, me);
goNext(temp_);
return temp_;
}
template < typename THost >
inline typename Iterator< ModifiedString<THost, ModReverse> >::Type
begin(ModifiedString<THost, ModReverse> & me)
{
typename Iterator< ModifiedString<THost, ModReverse> >::Type temp_(end(host(me), Rooted()));
_copyCargo(temp_, me);
goNext(temp_);
return temp_;
}
template < typename THost, typename TTagSpec >
inline typename Iterator< ModifiedString<THost, ModReverse> const, Tag<TTagSpec> const >::Type
begin(ModifiedString<THost, ModReverse> const & me, Tag<TTagSpec> const)
{
typename Iterator< ModifiedString<THost, ModReverse> const, Tag<TTagSpec> const >::Type temp_(end(host(me), Rooted()));
_copyCargo(temp_, me);
goNext(temp_);
return temp_;
}
template < typename THost, typename TTagSpec >
inline typename Iterator< ModifiedString<THost, ModReverse>, Tag<TTagSpec> const >::Type
begin(ModifiedString<THost, ModReverse> & me, Tag<TTagSpec> const)
{
typedef typename Iterator< ModifiedString<THost, ModReverse>, Tag<TTagSpec> const >::Type TIterator;
TIterator temp_(end(host(me), Rooted()));
_copyCargo(temp_, me);
goNext(temp_);
return temp_;
}
// --------------------------------------------------------------------------
// Function end() [ModReverse ModifiedString]
// --------------------------------------------------------------------------
template <typename THost >
inline typename Iterator<ModifiedString<THost, ModReverse> const >::Type
end(ModifiedString<THost, ModReverse> const & me)
{
typename Iterator<ModifiedString<THost, ModReverse> const >::Type temp_(begin(host(me), Rooted()));
_copyCargo(temp_, me);
goNext(temp_);
return temp_;
}
template <typename THost >
inline typename Iterator<ModifiedString<THost, ModReverse> >::Type
end(ModifiedString<THost, ModReverse> & me)
{
typename Iterator<ModifiedString<THost, ModReverse> >::Type temp_(begin(host(me), Rooted()));
_copyCargo(temp_, me);
goNext(temp_);
return temp_;
}
template <typename THost, typename TTagSpec >
inline typename Iterator<ModifiedString<THost, ModReverse> const, Tag<TTagSpec> const>::Type
end(ModifiedString<THost, ModReverse> const & me, Tag<TTagSpec> const)
{
typename Iterator<ModifiedString<THost, ModReverse> const, Tag<TTagSpec> const >::Type temp_(begin(host(me), Rooted()));
_copyCargo(temp_, me);
goNext(temp_);
return temp_;
}
template <typename THost, typename TTagSpec >
inline typename Iterator<ModifiedString<THost, ModReverse>, Tag<TTagSpec> const>::Type
end(ModifiedString<THost, ModReverse> & me, Tag<TTagSpec> const)
{
typename Iterator<ModifiedString<THost, ModReverse>, Tag<TTagSpec> const >::Type temp_(begin(host(me), Rooted()));
_copyCargo(temp_, me);
goNext(temp_);
return temp_;
}
// --------------------------------------------------------------------------
// Function reverse()
// --------------------------------------------------------------------------
/*!
* @fn reverse
* @headerfile <seqan/modifier.h>
* @brief Reverse a container in-place.
*
* @signature void reverse(sequence);
* @signature void reverse(stringSet);
*
* @param[in,out] sequence The sequence to reverse in-place.
* @param[in,out] stringSet The StringSet to reverse in-place.
*
* @section Remarks
*
* StringSet objects are reverse element-wise, i.e. the entries are reverse-complemented but their order itself
* remains the same.
*/
template <typename TValue>
inline bool
_reverseDoSequential(TValue size)
{
return size < (TValue)10000;
}
inline bool
_reverseDoSequential(unsigned char)
{
return true;
}
template < typename TSequence, typename TParallelTag >
inline void
reverse(TSequence & sequence, Tag<TParallelTag> parallelTag)
{
typedef typename Position<TSequence>::Type TPos;
typedef typename Iterator<TSequence, Standard>::Type TIter;
TIter itBeg = begin(sequence, Standard());
TIter itEnd = end(sequence, Standard());
Splitter<TPos> splitter(0, length(sequence) / 2, parallelTag);
// disable multi-threading if sequence is too small
// uint64_t cast is for 8bit size types for which comparison would be always true
if (IsSameType<Tag<TParallelTag>, Parallel>::VALUE && _reverseDoSequential(length(sequence)))
resize(splitter, 1);
// (weese:) We have to cast the result of length to int to circumvent an internal gcc compiler error
SEQAN_OMP_PRAGMA(parallel for num_threads((int)length(splitter)) schedule(static))
for (int job = 0; job < (int)length(splitter); ++job)
{
TIter it1 = itBeg + splitter[job];
TIter it2 = itEnd - (splitter[job] + 1);
TIter it1End = itBeg + splitter[job + 1];
for (; it1 != it1End; ++it1, --it2)
std::swap(*it1, *it2);
}
}
template < typename TSequence, typename TSpec, typename TParallelTag >
inline void
reverse(StringSet<TSequence, TSpec> & stringSet, Tag<TParallelTag>)
{
typedef typename Position<StringSet<TSequence, TSpec> >::Type TPos;
typedef typename MakeSigned<TPos>::Type TSPos;
TSPos seqCount = length(stringSet);
SEQAN_OMP_PRAGMA(parallel for if (IsSameType<Tag<TParallelTag>, Parallel>::VALUE))
for (TSPos seqNo = 0; seqNo < seqCount; ++seqNo)
reverse(stringSet[seqNo], Serial());
}
template < typename TText >
inline SEQAN_FUNC_DISABLE_IF(Is<StlContainerConcept<TText> >)
reverse(TText & text)
{
reverse(text, Parallel());
}
// const variants for segments/modifiers
//NOTE(h-2): why do we remove constnes??
template < typename TText >
inline void
reverse(TText const & text)
{
reverse(const_cast<TText &>(text), Parallel());
}
template < typename TText, typename TParallelTag >
inline void
reverse(TText const & text, Tag<TParallelTag> parallelTag)
{
reverse(const_cast<TText &>(text), parallelTag);
}
// --------------------------------------------------------------------------
// Function reverseString()
// --------------------------------------------------------------------------
template <typename THost>
inline ModifiedString<THost, ModReverse>
reverseString(THost & host)
{
return ModifiedString<THost, ModReverse>(host);
}
}
#endif
|