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 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339
|
// ==========================================================================
// SeqAn - The Library for Sequence Analysis
// ==========================================================================
// Copyright (c) 2006-2026, 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: Hannes Hauswedell <hannes.hauswedell@fu-berlin.de>
// ==========================================================================
// Adaptions for STL containers to SeqAn sequences.
// ==========================================================================
#ifndef SEQAN_SEQUENCE_ADAPT_STL_CONTAINER_H_
#define SEQAN_SEQUENCE_ADAPT_STL_CONTAINER_H_
namespace seqan2 {
// ===========================================================================
// Enums, Tags, Classes, Specializations
// ===========================================================================
// ===========================================================================
// Concepts
// ===========================================================================
template <typename TChar, typename TAlloc>
SEQAN_CONCEPT_IMPL((std::vector<TChar, TAlloc>), (StlContainerConcept));
template <typename TChar, typename TAlloc>
SEQAN_CONCEPT_IMPL((std::vector<TChar, TAlloc> const), (StlContainerConcept));
template <typename TChar, typename TAlloc>
SEQAN_CONCEPT_IMPL((std::deque<TChar, TAlloc>), (StlContainerConcept));
template <typename TChar, typename TAlloc>
SEQAN_CONCEPT_IMPL((std::deque<TChar, TAlloc> const), (StlContainerConcept));
template <typename TChar, typename TAlloc>
SEQAN_CONCEPT_IMPL((std::list<TChar, TAlloc>), (StlContainerConcept));
template <typename TChar, typename TAlloc>
SEQAN_CONCEPT_IMPL((std::list<TChar, TAlloc> const), (StlContainerConcept));
template<typename TChar, typename TTraits, typename TAlloc>
SEQAN_CONCEPT_IMPL((std::basic_string<TChar, TTraits, TAlloc>), (StlContainerConcept));
template<typename TChar, typename TTraits, typename TAlloc>
SEQAN_CONCEPT_IMPL((std::basic_string<TChar, TTraits, TAlloc> const), (StlContainerConcept));
template <typename TChar, typename TAlloc>
SEQAN_CONCEPT_IMPL((std::forward_list<TChar, TAlloc>), (StlContainerConcept));
template <typename TChar, typename TAlloc>
SEQAN_CONCEPT_IMPL((std::forward_list<TChar, TAlloc> const), (StlContainerConcept));
template <typename TChar, std::size_t N>
SEQAN_CONCEPT_IMPL((std::array<TChar, N>), (StlContainerConcept));
template <typename TChar, std::size_t N>
SEQAN_CONCEPT_IMPL((std::array<TChar, N> const), (StlContainerConcept));
/* NOTE(h-2) on ConceptChecking and universal references
*
* When type deduction takes place before && then && can act as both && or &
* [https://isocpp.org/blog/2012/11/universal-references-in-c11-scott-meyers]
*
* This has the effect that in
* foobar(T &&)
* T actually can be "int &". Consequently the above becomes "int & &&" which
* collapses to "int &". The important thing is that in
* template<typename EnableIf<Is<SuperConcept<T> >
* this will result in the ConceptCheck always failing (because the Concept is
* not defined for reference types).
*
* So in the following you will see a RemoveReference< > around the type
* whenever the function takes a && argument AND it shall act as univeral
* reference (e.g. length()). But in some cases it shall not (because there is a
* different overload for the l-value-reference arg) and it is intentionally
* omitted, e.g. value().
*/
// ===========================================================================
// Metafunctions
// ===========================================================================
// ----------------------------------------------------------------------------
// Metafunctions that are the same for all STL containers
// ----------------------------------------------------------------------------
#define COMMA ,
#define SUPERMACRO__(CONT, TMPL) \
template <TMPL> \
struct Value<CONT> \
{ \
typedef typename CONT::value_type Type; \
};\
template <TMPL> \
struct Value<CONT const> \
{ \
typedef typename CONT::value_type Type; \
};\
template <TMPL> \
struct Reference<CONT> \
{ \
typedef typename CONT::reference Type; \
};\
template <TMPL> \
struct Reference<CONT const> \
{ \
typedef typename CONT::const_reference Type; \
};\
template <TMPL> \
struct GetValue<CONT> \
{ \
typedef typename CONT::const_reference Type; \
};\
template <TMPL> \
struct GetValue<CONT const> \
{ \
typedef typename CONT::const_reference Type; \
};\
template <TMPL> \
struct Position<CONT> \
{ \
typedef typename CONT::size_type Type; \
};\
template <TMPL> \
struct Position<CONT const> \
{ \
typedef typename CONT::size_type Type; \
};\
template <TMPL> \
struct Size<CONT> \
{ \
typedef typename CONT::size_type Type; \
};\
template <TMPL> \
struct Size<CONT const> \
{ \
typedef typename CONT::size_type Type; \
};\
template <TMPL> \
struct Iterator<CONT, Standard> \
{ \
typedef Iter<CONT, StdIteratorAdaptor> Type;\
};\
template <TMPL> \
struct Iterator<CONT const, Standard> \
{ \
typedef Iter<CONT const, StdIteratorAdaptor> Type;\
};\
template <TMPL> \
struct Iterator<CONT, Rooted> \
{ \
typedef Iter<CONT, AdaptorIterator<Iter<CONT, StdIteratorAdaptor> > > Type;\
}; \
template <TMPL> \
struct Iterator<CONT const, Rooted> \
{ \
typedef Iter<CONT const, AdaptorIterator<Iter<CONT const, StdIteratorAdaptor> > > Type;\
};
SUPERMACRO__(std::vector<TChar COMMA TAlloc>, typename TChar COMMA typename TAlloc)
SUPERMACRO__(std::deque<TChar COMMA TAlloc>, typename TChar COMMA typename TAlloc)
SUPERMACRO__(std::list<TChar COMMA TAlloc>, typename TChar COMMA typename TAlloc)
SUPERMACRO__(std::forward_list<TChar COMMA TAlloc>,typename TChar COMMA typename TAlloc)
SUPERMACRO__(std::array<TChar COMMA N>, typename TChar COMMA std::size_t N)
SUPERMACRO__(std::basic_string<TChar COMMA TTraits COMMA TAlloc>, typename TChar COMMA typename TTraits COMMA typename TAlloc)
// ----------------------------------------------------------------------------
// Mfn IsContiguous (default is False)
// ----------------------------------------------------------------------------
template <typename TChar, typename TAlloc>
struct IsContiguous<std::vector<TChar, TAlloc> > :
public True
{};
template <typename TChar, typename TAlloc>
struct IsContiguous<std::vector<TChar, TAlloc> const> :
public True
{};
template <typename TChar, typename TTraits, typename TAlloc>
struct IsContiguous<std::basic_string<TChar, TTraits, TAlloc> > :
public True
{};
template <typename TChar, typename TTraits, typename TAlloc>
struct IsContiguous<std::basic_string<TChar, TTraits, TAlloc> const> :
public True
{};
template <typename TChar, size_t N>
struct IsContiguous<std::array<TChar, N> > :
public True
{};
template <typename TChar, size_t N>
struct IsContiguous<std::array<TChar, N> const> :
public True
{};
// ----------------------------------------------------------------------------
// Mfn HasSubscriptOperator (different for e.g. std::deque)
// ----------------------------------------------------------------------------
template <typename TChar, typename TAlloc>
struct HasSubscriptOperator<std::deque<TChar, TAlloc> > :
public True
{};
template <typename TChar, typename TAlloc>
struct HasSubscriptOperator<std::deque<TChar, TAlloc> const> :
public True
{};
// ----------------------------------------------------------------------------
// Mfn IsSequence
// ----------------------------------------------------------------------------
//NOTE(h-2): shouldnt we be using Is<StringConcept> or IsContiguous<> or ...?
template <typename TChar, typename TAlloc>
struct IsSequence<std::vector<TChar, TAlloc> > : True {};
template <typename TChar, typename TAlloc>
struct IsSequence<std::deque<TChar, TAlloc> > : True {};
template <typename TChar, typename TAlloc>
struct IsSequence<std::list<TChar, TAlloc> > : True {};
template <typename TChar, typename TAlloc>
struct IsSequence<std::forward_list<TChar, TAlloc> > : True {};
//NOTE(h-2): array isn't by SeqAn definition, right?
template <typename TChar, typename TCharTraits, typename TAlloc>
struct IsSequence<std::basic_string<TChar, TCharTraits, TAlloc> > : True {};
// ----------------------------------------------------------------------------
// Mfn FixedSize_ (private)
// ----------------------------------------------------------------------------
template <typename TContainer>
struct FixedSize_ : public False {};
template <typename TChar, size_t N>
struct FixedSize_<std::array<TChar, N> > : public True {};
// ===========================================================================
// Functions
// ===========================================================================
// ----------------------------------------------------------------------------
// Function getObjectId
// ----------------------------------------------------------------------------
template <typename TContainer>
inline SEQAN_FUNC_ENABLE_IF(Is<StlContainerConcept<typename RemoveReference<TContainer>::Type> >, void const *)
getObjectId(TContainer && me)
{
if (me.empty())
return NULL;
else
return (& *(me.end() - 1)) + 1;
}
// ----------------------------------------------------------------------------
// Function begin (standard)
// ----------------------------------------------------------------------------
template <typename TContainer>
inline SEQAN_FUNC_ENABLE_IF(Is<StlContainerConcept<TContainer> >, typename Iterator<TContainer, Standard>::Type)
begin(TContainer & me, Standard const &)
{
return me.begin();
}
template <typename TContainer>
inline SEQAN_FUNC_ENABLE_IF(Is<StlContainerConcept<TContainer> >, typename Iterator<TContainer const, Standard>::Type)
begin(TContainer const & me, Standard const &)
{
return me.begin();
}
// ----------------------------------------------------------------------------
// Function begin (rooted)
// ----------------------------------------------------------------------------
template <typename TContainer>
inline SEQAN_FUNC_ENABLE_IF(Is<StlContainerConcept<TContainer> >, typename Iterator<TContainer, Rooted>::Type)
begin(TContainer & me, Rooted const &)
{
return _beginDefault(me, Rooted());
}
template <typename TContainer>
inline SEQAN_FUNC_ENABLE_IF(Is<StlContainerConcept<TContainer> >, typename Iterator<TContainer const, Rooted>::Type)
begin(TContainer const & me, Rooted const &)
{
return _beginDefault(me, Rooted());
}
// ----------------------------------------------------------------------------
// Function end (standard)
// ----------------------------------------------------------------------------
template <typename TContainer>
inline SEQAN_FUNC_ENABLE_IF(Is<StlContainerConcept<TContainer> >, typename Iterator<TContainer, Standard>::Type)
end(TContainer & me, Standard const &)
{
return me.end();
}
template <typename TContainer>
inline SEQAN_FUNC_ENABLE_IF(Is<StlContainerConcept<TContainer> >, typename Iterator<TContainer const, Standard>::Type)
end(TContainer const & me, Standard const &)
{
return me.end();
}
// ----------------------------------------------------------------------------
// Function end (rooted)
// ----------------------------------------------------------------------------
template <typename TContainer>
inline SEQAN_FUNC_ENABLE_IF(Is<StlContainerConcept<TContainer> >, typename Iterator<TContainer, Rooted>::Type)
end(TContainer & me, Rooted const &)
{
return _endDefault(me, Rooted());
}
template <typename TContainer>
inline SEQAN_FUNC_ENABLE_IF(Is<StlContainerConcept<TContainer> >, typename Iterator<TContainer const, Rooted>::Type)
end(TContainer const & me, Rooted const &)
{
return _endDefault(me, Rooted());
}
// ----------------------------------------------------------------------------
// Function _iterStl (like seqan's iter() but for stl-iterators)
// ----------------------------------------------------------------------------
template <typename TContainer,
typename TPos>
inline typename TContainer::iterator
_iterStl(TContainer & me,
TPos const pos)
{
SEQAN_ASSERT_LEQ_MSG(pos,
static_cast<TPos>(length(me)),
"Trying to get an iterator behind a container through _iterStl().");
return std::next(me.begin(), pos);
}
template <typename TContainer,
typename TPos>
inline typename TContainer::const_iterator
_iterStl(TContainer const & me,
TPos const pos)
{
SEQAN_ASSERT_LEQ_MSG(pos,
static_cast<TPos>(length(me)),
"Trying to get an iterator behind a container through _iterStl().");
return std::next(me.begin(), pos);
}
// ----------------------------------------------------------------------------
// Function iter (Standard) (only overloaded for non-contiguous)
// ----------------------------------------------------------------------------
template <typename TChar, typename TAlloc, typename TPos>
inline typename Iterator<std::list<TChar, TAlloc>, Standard>::Type
iter(std::list<TChar, TAlloc> & me,
TPos const pos,
Standard const &)
{
return _iterStl(me, pos);
}
template <typename TChar, typename TAlloc, typename TPos>
inline typename Iterator<std::list<TChar, TAlloc> const, Standard>::Type
iter(std::list<TChar, TAlloc> const & me,
TPos const pos,
Standard const &)
{
return _iterStl(me, pos);
}
template <typename TChar, typename TAlloc, typename TPos>
inline typename Iterator<std::forward_list<TChar, TAlloc>, Standard const>::Type
iter(std::forward_list<TChar, TAlloc> & me,
TPos const pos,
Standard const &)
{
return _iterStl(me, pos);
}
template <typename TChar, typename TAlloc, typename TPos>
inline typename Iterator<std::forward_list<TChar, TAlloc> const, Standard>::Type
iter(std::forward_list<TChar, TAlloc> const & me,
TPos const pos,
Standard const &)
{
return _iterStl(me, pos);
}
// ----------------------------------------------------------------------------
// Function iter (Rooted) (only overloaded for non-contiguous)
// ----------------------------------------------------------------------------
template <typename TChar, typename TAlloc, typename TPos>
inline typename Iterator<std::list<TChar, TAlloc>, Rooted>::Type
iter(std::list<TChar, TAlloc> & me,
TPos const pos,
Rooted const &)
{
typedef typename Iterator<std::list<TChar, TAlloc>, Rooted>::Type TIterator;
return TIterator(me, iter(me, pos, Standard()));
}
template <typename TChar, typename TAlloc, typename TPos>
inline typename Iterator<std::list<TChar, TAlloc> const, Rooted>::Type
iter(std::list<TChar, TAlloc> const & me,
TPos const pos,
Rooted const &)
{
typedef typename Iterator<std::list<TChar, TAlloc> const, Rooted>::Type TIterator;
return TIterator(me, iter(me, pos, Standard()));
}
template <typename TChar, typename TAlloc, typename TPos>
inline typename Iterator<std::forward_list<TChar, TAlloc>, Rooted>::Type
iter(std::forward_list<TChar, TAlloc> & me,
TPos const pos,
Rooted const &)
{
typedef typename Iterator<std::forward_list<TChar, TAlloc>, Rooted>::Type TIterator;
return TIterator(me, iter(me, pos, Standard()));
}
template <typename TChar, typename TAlloc, typename TPos>
inline typename Iterator<std::forward_list<TChar, TAlloc> const, Rooted>::Type
iter(std::forward_list<TChar, TAlloc> const & me,
TPos const pos,
Rooted const &)
{
typedef typename Iterator<std::forward_list<TChar, TAlloc> const, Rooted>::Type TIterator;
return TIterator(me, iter(me, pos, Standard()));
}
// ----------------------------------------------------------------------------
// Function length
// ----------------------------------------------------------------------------
template <typename TContainer>
inline SEQAN_FUNC_ENABLE_IF(Is<StlContainerConcept<TContainer> >, typename Size<TContainer>::Type)
length(TContainer const & me)
{
return me.size();
}
template <typename TChar, typename TAlloc>
inline typename Size<std::forward_list<TChar, TAlloc> >::Type
length(std::forward_list<TChar, TAlloc> const & me)
{
typename Size<std::forward_list<TChar, TAlloc> >::Type l = 0;
for (auto it = me.begin(), itEnd = me.end(); it != itEnd; ++it, ++l);
return l;
}
template <typename TChar, std::size_t N>
constexpr std::size_t
length(std::array<TChar, N> const & me)
{
return me.size();
}
// ----------------------------------------------------------------------------
// Function capacity
// ----------------------------------------------------------------------------
template <typename TChar, typename TAlloc>
inline typename Size<std::vector<TChar, TAlloc> >::Type
capacity(std::vector<TChar, TAlloc> const & me)
{
return me.capacity();
}
template <typename TChar, typename TTraits, typename TAlloc>
inline typename Size<std::basic_string<TChar, TTraits, TAlloc> >::Type
capacity(std::basic_string<TChar, TTraits, TAlloc> const & me)
{
return me.capacity();
}
template <typename TChar, std::size_t N>
constexpr std::size_t
capacity(std::array<TChar, N> const & me)
{
return me.size();
}
// for other types the default overload to length holds
// ----------------------------------------------------------------------------
// Function empty
// ----------------------------------------------------------------------------
// VC2015 implements some C++17 functions which would collide for
// applications that do using namespace std
// https://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4280.pdf
// Disable those functions for C++17 and upwards (pre-C++17 defines __cplusplus as <=201402L).
#if !(defined(STDLIB_VS) || __cplusplus > 201402L)
template <typename TContainer>
inline SEQAN_FUNC_ENABLE_IF(Is<StlContainerConcept<TContainer> >, bool)
empty(TContainer const & me)
{
return me.empty();
}
template <typename TChar, std::size_t N>
constexpr bool
empty(std::array<TChar, N> const & me)
{
return me.empty();
}
#endif
// ----------------------------------------------------------------------------
// Function reserve
// ----------------------------------------------------------------------------
template <typename TChar, typename TAlloc, typename TSize, typename TExpand>
inline typename Size<std::vector<TChar, TAlloc> >::Type
reserve(std::vector<TChar, TAlloc> & me,
TSize const s,
Tag<TExpand> const &)
{
me.reserve(s);
return capacity(me);
}
template <typename TChar, typename TTraits, typename TAlloc, typename TSize, typename TExpand>
inline typename Size<std::basic_string<TChar, TTraits, TAlloc> >::Type
reserve(std::basic_string<TChar, TTraits, TAlloc> & me,
TSize const s,
Tag<TExpand> const &)
{
me.reserve(s);
return capacity(me);
}
template <typename TChar, typename TAlloc, typename TSize, typename TExpand>
inline typename Size<std::vector<TChar, TAlloc> >::Type
reserve(std::vector<TChar, TAlloc> && me,
TSize const s,
Tag<TExpand> const &)
{
me.reserve(s);
return capacity(me);
}
template <typename TChar, typename TTraits, typename TAlloc, typename TSize, typename TExpand>
inline typename Size<std::basic_string<TChar, TTraits, TAlloc> >::Type
reserve(std::basic_string<TChar, TTraits, TAlloc> && me,
TSize const s,
Tag<TExpand> const &)
{
me.reserve(s);
return capacity(me);
}
// for other types the default overload holds
// ----------------------------------------------------------------------------
// Function resize
// ----------------------------------------------------------------------------
template <typename TContainer,
typename TSize,
typename TExpand>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<typename RemoveReference<TContainer>::Type> >,
Not<FixedSize_<typename RemoveReference<TContainer>::Type> > >,
typename Size<typename RemoveReference<TContainer>::Type>::Type)
resize(TContainer && me,
TSize const s,
Tag<TExpand> const &)
{
me.resize(s);
return length(me);
}
template <typename TContainer,
typename TSize,
typename TExpand>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<typename RemoveReference<TContainer>::Type> >,
Not<FixedSize_<typename RemoveReference<TContainer>::Type> > >,
typename Size<typename RemoveReference<TContainer>::Type>::Type)
resize(TContainer && me,
TSize const s,
typename Value<typename RemoveReference<TContainer>::Type>::Type const & val,
Tag<TExpand> const &)
{
me.resize(s, val);
return length(me);
}
// ----------------------------------------------------------------------------
// Function clear
// ----------------------------------------------------------------------------
template <typename TContainer>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<typename RemoveReference<TContainer>::Type> >,
Not<FixedSize_<typename RemoveReference<TContainer>::Type> > >, void)
clear(TContainer && me)
{
me.clear();
}
// ----------------------------------------------------------------------------
// Function value
// ----------------------------------------------------------------------------
template <typename TContainer,
typename TPos>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<TContainer> >,
HasSubscriptOperator<TContainer> >, typename Reference<TContainer>::Type)
value(TContainer & me, TPos const pos)
{
return me[pos];
}
template <typename TContainer,
typename TPos>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<TContainer> >,
HasSubscriptOperator<TContainer> >, typename Reference<TContainer const>::Type)
value(TContainer const & me, TPos const pos)
{
return me[pos];
}
template <typename TContainer,
typename TPos>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<TContainer> >,
HasSubscriptOperator<TContainer> >, typename Value<TContainer>::Type)
value(TContainer && me, TPos const pos)
{
return me[pos];
}
// linear complexity for list and fwd list
template <typename TContainer,
typename TPos>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<TContainer> >,
Not<HasSubscriptOperator<TContainer> > >, typename Reference<TContainer>::Type)
value(TContainer & me, TPos const pos)
{
return *(_iterStl(me, pos));
}
template <typename TContainer,
typename TPos>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<TContainer> >,
Not<HasSubscriptOperator<TContainer> > >, typename Reference<TContainer const>::Type)
value(TContainer const & me, TPos const pos)
{
return *(_iterStl(me, pos));
}
template <typename TContainer,
typename TPos>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<TContainer> >,
Not<HasSubscriptOperator<TContainer> > >, typename Value<TContainer>::Type)
value(TContainer && me, TPos const pos)
{
return *(_iterStl(me, pos));
}
// --------------------------------------------------------------------------
// Function getValue
// --------------------------------------------------------------------------
template <typename TContainer,
typename TPos>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<TContainer> >,
HasSubscriptOperator<TContainer> >, typename Reference<TContainer const>::Type)
getValue(TContainer const & me, TPos const pos)
{
return me[pos];
}
template <typename TContainer,
typename TPos>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<TContainer> >,
HasSubscriptOperator<TContainer> >, typename Value<TContainer>::Type)
getValue(TContainer && me, TPos const pos)
{
return me[pos];
}
// linear complexity for list and fwd list
template <typename TContainer,
typename TPos>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<TContainer> >,
Not<HasSubscriptOperator<TContainer> > >, typename Reference<TContainer const>::Type)
getValue(TContainer const & me, TPos const pos)
{
return *(_iterStl(me, pos));
}
template <typename TContainer,
typename TPos>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<TContainer> >,
Not<HasSubscriptOperator<TContainer> > >, typename Value<TContainer>::Type)
getValue(TContainer && me, TPos const pos)
{
return *(_iterStl(me, pos));
}
// ----------------------------------------------------------------------------
// Function front
// ----------------------------------------------------------------------------
// default implementation used
// ----------------------------------------------------------------------------
// Function back
// ----------------------------------------------------------------------------
// default implementation used
// forward_list doesnt have back, we achieve it in linear time
template <typename TChar, typename TAlloc>
inline TChar &
back(std::forward_list<TChar, TAlloc> & me)
{
SEQAN_ASSERT(!me.empty());
return *(std::next(me.begin(), length(me) - 1));
}
template <typename TChar, typename TAlloc>
inline TChar const &
back(std::forward_list<TChar, TAlloc> const & me)
{
SEQAN_ASSERT(!me.empty());
return *(std::next(me.begin(), length(me) - 1));
}
template <typename TChar, typename TAlloc>
inline TChar
back(std::forward_list<TChar, TAlloc> && me)
{
SEQAN_ASSERT(!me.empty());
return *(std::next(me.begin(), length(me) - 1));
}
// ----------------------------------------------------------------------------
// Function assign
// ----------------------------------------------------------------------------
template <typename TContainer>
inline SEQAN_FUNC_ENABLE_IF(Is<StlContainerConcept<typename RemoveReference<TContainer>::Type> >, void)
assign(TContainer && me,
typename RemoveReference<TContainer>::Type source)
{
std::swap(me, source);
}
template <typename TContainer,
typename TSource>
inline SEQAN_FUNC_ENABLE_IF(And<Not<IsSameType<typename RemoveReference<TContainer>::Type, TSource> >,
Is<StlContainerConcept<typename RemoveReference<TContainer>::Type> > >, void)
assign(TContainer && me,
TSource const & source)
{
me.assign(begin(source, Standard()), end(source, Standard()));
}
template <typename TContainer,
typename TSource>
inline SEQAN_FUNC_ENABLE_IF(Is<StlContainerConcept<typename RemoveReference<TContainer>::Type> >, void)
assign(TContainer && me,
TSource const & source,
typename Size<TSource>::Type limit)
{
me.assign(begin(source, Standard()),
iter(source, std::min(length(source), limit), Standard()));
}
// ----------------------------------------------------------------------------
// Function insert
// ----------------------------------------------------------------------------
template <typename TContainer,
typename TSource,
typename TExpand>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<typename RemoveReference<TContainer>::Type> >,
Not<FixedSize_<typename RemoveReference<TContainer>::Type> > >, void)
insert(TContainer && me,
typename Size<typename RemoveReference<TContainer>::Type>::Type const pos,
TSource const & source,
Tag<TExpand> const &)
{
me.insert(_iterStl(std::forward<TContainer>(me), pos),
begin(source, Standard()),
end(source, Standard()));
}
template <typename TContainer,
typename TSource,
typename TExpand>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<typename RemoveReference<TContainer>::Type> >,
Not<FixedSize_<typename RemoveReference<TContainer>::Type> > >, void)
insert(TContainer && me,
typename Size<typename RemoveReference<TContainer>::Type>::Type const pos,
TSource const & source,
typename Size<TSource>::Type const limit,
Tag<TExpand> const &)
{
me.insert(_iterStl(std::forward<TContainer>(me), pos),
begin(source, Standard()),
iter(source, std::min(length(source), limit), Standard()));
}
// forward_list doesnt have insert, we achieve it slower
template <typename TChar, typename TAlloc, typename TSource, typename TExpand>
inline void
insert(std::forward_list<TChar, TAlloc> & me,
typename Size<std::forward_list<TChar, TAlloc> >::Type const pos,
TSource const & source,
Tag<TExpand> const &)
{
me.insert_after(std::next(me.before_begin(), pos), begin(source, Standard()), end(source, Standard()));
}
template <typename TChar, typename TAlloc, typename TSource, typename TExpand>
inline void
insert(std::forward_list<TChar, TAlloc> && me,
typename Size<std::forward_list<TChar, TAlloc> >::Type const pos,
TSource const & source,
Tag<TExpand> const &)
{
insert(me, pos, source);
}
template <typename TChar, typename TAlloc, typename TSource, typename TExpand>
inline void
insert(std::forward_list<TChar, TAlloc> & me,
typename Size<std::forward_list<TChar, TAlloc> >::Type const pos,
TSource const & source,
typename Size<std::forward_list<TChar, TAlloc> >::Type const limit,
Tag<TExpand> const &)
{
me.insert_after(std::next(me.before_begin(), pos),
begin(source, Standard()),
iter(source, std::min(length(source), limit), Standard()));
}
template <typename TChar, typename TAlloc, typename TSource, typename TExpand>
inline void
insert(std::forward_list<TChar, TAlloc> && me,
typename Size<std::forward_list<TChar, TAlloc> >::Type const pos,
TSource const & source,
typename Size<std::forward_list<TChar, TAlloc> >::Type const limit,
Tag<TExpand> const &)
{
insert(me, pos, source, limit);
}
// ----------------------------------------------------------------------------
// Function append
// ----------------------------------------------------------------------------
template <typename TContainer,
typename TSource,
typename TExpand>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<typename RemoveReference<TContainer>::Type> >,
Not<FixedSize_<typename RemoveReference<TContainer>::Type> > >, void)
append(TContainer && me,
TSource const & source,
Tag<TExpand> const &)
{
insert(std::forward<TContainer>(me), length(me), source);
}
template <typename TContainer,
typename TSource,
typename TExpand>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<typename RemoveReference<TContainer>::Type> >,
Not<FixedSize_<typename RemoveReference<TContainer>::Type> > >, void)
append(TContainer && me,
TSource const & source,
typename Size<typename RemoveReference<TContainer>::Type>::Type const limit,
Tag<TExpand> const &)
{
insert(std::forward<TContainer>(me), length(me), source, limit);
}
// forward list is handled downstream in insert
// ----------------------------------------------------------------------------
// Function prepend
// ----------------------------------------------------------------------------
template <typename TContainer,
typename TSource>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<typename RemoveReference<TContainer>::Type> >,
Not<FixedSize_<typename RemoveReference<TContainer>::Type> > >, void)
prepend(TContainer && me,
TSource const & source)
{
insert(std::forward<TContainer>(me), 0, source);
}
template <typename TContainer,
typename TSource,
typename TExpand>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<typename RemoveReference<TContainer>::Type> >,
Not<FixedSize_<typename RemoveReference<TContainer>::Type> > >, void)
prepend(TContainer && me,
TSource const & source,
Tag<TExpand> const &)
{
insert(std::forward<TContainer>(me), 0, source);
}
template <typename TContainer,
typename TSource,
typename TExpand>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<typename RemoveReference<TContainer>::Type> >,
Not<FixedSize_<typename RemoveReference<TContainer>::Type> > >, void)
prepend(TContainer && me,
TSource const & source,
typename Size<typename RemoveReference<TContainer>::Type>::Type const limit)
{
insert(std::forward<TContainer>(me), 0, source, limit);
}
template <typename TContainer,
typename TSource,
typename TExpand>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<typename RemoveReference<TContainer>::Type> >,
Not<FixedSize_<typename RemoveReference<TContainer>::Type> > >, void)
prepend(TContainer && me,
TSource const & source,
typename Size<typename RemoveReference<TContainer>::Type>::Type const limit,
Tag<TExpand> const &)
{
insert(std::forward<TContainer>(me), 0, source, limit);
}
// forward list is handled downstream in insert
// ----------------------------------------------------------------------------
// Function insertValue
// ----------------------------------------------------------------------------
template <typename TContainer,
typename TSource,
typename TExpand>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<typename RemoveReference<TContainer>::Type> >,
Not<FixedSize_<typename RemoveReference<TContainer>::Type> > >, void)
insertValue(TContainer && me,
typename Size<typename RemoveReference<TContainer>::Type>::Type const pos,
TSource && source,
Tag<TExpand> const &)
{
me.insert(_iterStl(std::forward<TContainer>(me), pos), std::forward<TSource>(source));
}
template <typename TChar, typename TAlloc, typename TSource, typename TExpand>
inline void
insertValue(std::forward_list<TChar, TAlloc> & me,
typename Size<std::forward_list<TChar, TAlloc> >::Type const pos,
TSource && source,
Tag<TExpand> const &)
{
me.insert_after(std::next(me.before_begin(), pos), std::forward<TSource>(source));
}
template <typename TChar, typename TAlloc, typename TSource, typename TExpand>
inline void
insertValue(std::forward_list<TChar, TAlloc> && me,
typename Size<std::forward_list<TChar, TAlloc> >::Type const pos,
TSource && source,
Tag<TExpand> const &)
{
insertValue(me, pos, source);
}
// ----------------------------------------------------------------------------
// Function appendValue
// ----------------------------------------------------------------------------
template <typename TContainer,
typename TSource,
typename TExpand>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<typename RemoveReference<TContainer>::Type> >,
Not<FixedSize_<typename RemoveReference<TContainer>::Type> > >, void)
appendValue(TContainer && me,
TSource && source,
Tag<TExpand> const &)
{
me.push_back(std::forward<TSource>(source));
}
template <typename TChar, typename TAlloc, typename TSource, typename TExpand>
inline void
appendValue(std::forward_list<TChar, TAlloc> & me,
TSource && source,
Tag<TExpand> const &)
{
insertValue(me, length(me), std::forward<TSource>(source));
}
template <typename TChar, typename TAlloc, typename TSource, typename TExpand>
inline void
appendValue(std::forward_list<TChar, TAlloc> && me,
TSource && source,
Tag<TExpand> const &)
{
appendValue(me, source);
}
// ----------------------------------------------------------------------------
// Function prependValue
// ----------------------------------------------------------------------------
template <typename TContainer,
typename TSource>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<typename RemoveReference<TContainer>::Type> >,
Not<FixedSize_<typename RemoveReference<TContainer>::Type> > >, void)
prependValue(TContainer && me,
TSource && source)
{
me.push_front(std::forward<TSource>(source));
}
template <typename TContainer,
typename TSource,
typename TExpand>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<typename RemoveReference<TContainer>::Type> >,
Not<FixedSize_<typename RemoveReference<TContainer>::Type> > >, void)
prependValue(TContainer && me,
TSource && source,
Tag<TExpand> const &)
{
prependValue(std::forward<TContainer>(me), std::forward<TSource>(source));
}
// vector and string dont have push_front, we achieve it in linear time
template <typename TChar, typename TAlloc, typename TSource>
inline void
prependValue(std::vector<TChar, TAlloc> & me,
TSource && source)
{
insertValue(me, 0, std::forward<TSource>(source));
}
template <typename TChar, typename TTraits, typename TAlloc, typename TSource>
inline void
prependValue(std::basic_string<TChar, TTraits, TAlloc> & me,
TSource && source)
{
insertValue(me, 0, std::forward<TSource>(source));
}
// && to &
template <typename TChar, typename TAlloc, typename TSource>
inline void
prependValue(std::vector<TChar, TAlloc> && me,
TSource && source)
{
prependValue(me, std::forward<TSource>(source));
}
template <typename TChar, typename TTraits, typename TAlloc, typename TSource>
inline void
prependValue(std::basic_string<TChar, TTraits, TAlloc> && me,
TSource && source)
{
prependValue(me, std::forward<TSource>(source));
}
// ----------------------------------------------------------------------------
// Function erase
// ----------------------------------------------------------------------------
template <typename TContainer>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<typename RemoveReference<TContainer>::Type> >,
Not<FixedSize_<typename RemoveReference<TContainer>::Type> > >, void)
erase(TContainer && me,
typename Size<typename RemoveReference<TContainer>::Type>::Type const pos,
typename Size<typename RemoveReference<TContainer>::Type>::Type const posEnd)
{
me.erase(_iterStl(me, pos), _iterStl(me, posEnd));
}
template <typename TChar, typename TAlloc>
inline void
erase(std::forward_list<TChar, TAlloc> & me,
typename Size<std::forward_list<TChar, TAlloc> >::Type const pos,
typename Size<std::forward_list<TChar, TAlloc> >::Type const posEnd)
{
me.erase_after(std::next(me.before_begin(), pos), std::next(me.begin(), posEnd));
}
template <typename TChar, typename TAlloc>
inline void
erase(std::forward_list<TChar, TAlloc> && me,
typename Size<std::forward_list<TChar, TAlloc> >::Type const pos,
typename Size<std::forward_list<TChar, TAlloc> >::Type const posEnd)
{
erase(me, pos, posEnd);
}
template <typename TContainer>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<typename RemoveReference<TContainer>::Type> >,
Not<FixedSize_<typename RemoveReference<TContainer>::Type> > >, void)
erase(TContainer && me,
typename Size<typename RemoveReference<TContainer>::Type>::Type const pos)
{
erase(std::forward<TContainer>(me), pos, pos + 1);
}
// ----------------------------------------------------------------------------
// Function eraseFront
// ----------------------------------------------------------------------------
template <typename TContainer>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<typename RemoveReference<TContainer>::Type> >,
Not<FixedSize_<typename RemoveReference<TContainer>::Type> > >, void)
eraseFront(TContainer && me)
{
me.pop_front();
}
template <typename TChar, typename TAlloc>
inline void
eraseFront(std::vector<TChar, TAlloc> & me)
{
me.erase(me.begin());
}
template <typename TChar, typename TTraits, typename TAlloc>
inline void
eraseFront(std::basic_string<TChar, TTraits, TAlloc> & me)
{
me.erase(me.begin());
}
template <typename TChar, typename TAlloc>
inline void
eraseFront(std::vector<TChar, TAlloc> && me)
{
me.erase(me.begin());
}
template <typename TChar, typename TTraits, typename TAlloc>
inline void
eraseFront(std::basic_string<TChar, TTraits, TAlloc> && me)
{
me.erase(me.begin());
}
// ----------------------------------------------------------------------------
// Function eraseBack
// ----------------------------------------------------------------------------
template <typename TContainer>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<typename RemoveReference<TContainer>::Type> >,
Not<FixedSize_<typename RemoveReference<TContainer>::Type> > >, void)
eraseBack(TContainer && me)
{
me.pop_back();
}
template <typename TChar, typename TAlloc>
inline void
eraseBack(std::forward_list<TChar, TAlloc> & me)
{
if (!empty(me))
{
auto it = me.before_begin(), itN = std::next(me.begin()), itEnd = me.end();
while (itN != itEnd)
{
++it;
++itN;
}
me.erase_after(it);
}
}
template <typename TChar, typename TAlloc>
inline void
eraseBack(std::forward_list<TChar, TAlloc> && me)
{
eraseBack(me);
}
// ----------------------------------------------------------------------------
// Function replace
// ----------------------------------------------------------------------------
template <typename TContainer,
typename TSource,
typename TExpand>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<typename RemoveReference<TContainer>::Type> >,
Not<FixedSize_<typename RemoveReference<TContainer>::Type> > >, void)
replace(TContainer && me,
typename Size<typename RemoveReference<TContainer>::Type>::Type const pos,
typename Size<typename RemoveReference<TContainer>::Type>::Type const posEnd,
TSource const & source,
typename Size<TSource>::Type const limit,
Tag<TExpand> const &)
{
erase(me, pos, posEnd);
insert(me, pos, source, limit);
}
template <typename TContainer,
typename TSource,
typename TExpand>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<typename RemoveReference<TContainer>::Type> >,
Not<FixedSize_<typename RemoveReference<TContainer>::Type> > >, void)
replace(TContainer && me,
typename Size<typename RemoveReference<TContainer>::Type>::Type const pos,
typename Size<typename RemoveReference<TContainer>::Type>::Type const posEnd,
TSource const & source,
Tag<TExpand> const &)
{
erase(me, pos, posEnd);
insert(me, pos, source, length(source));
}
// ----------------------------------------------------------------------------
// Function reverse
// ----------------------------------------------------------------------------
// NOTE(h-2): seqan's reverse doesn't work for some stl containers
template <typename TContainer>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<TContainer> >, HasSubscriptOperator<TContainer> >)
reverse(TContainer && me)
{
std::reverse(me.begin(), me.end());
}
template <typename TContainer>
inline SEQAN_FUNC_ENABLE_IF(And<Is<StlContainerConcept<TContainer> >, Not<HasSubscriptOperator<TContainer> > >)
reverse(TContainer && me)
{
me.reverse();
}
// ----------------------------------------------------------------------------
// Function toCString
// ----------------------------------------------------------------------------
template <typename TChar, typename TTraits, typename TAlloc>
inline const TChar*
toCString(std::basic_string<TChar, TTraits, TAlloc> const & me)
{
return me.c_str();
}
// ----------------------------------------------------------------------------
// Function assign (from CString)
// ----------------------------------------------------------------------------
// NOTE(h-2): is this optimal if container is not Contiguous?
template <typename TContainer>
inline SEQAN_FUNC_ENABLE_IF(Is<StlContainerConcept<TContainer> >, void)
assign(TContainer & me,
char const * source)
{
resize(me, length(source));
std::copy(source, source + std::strlen(source), me.begin());
}
template <typename TTraits, typename TAlloc>
inline void
assign(std::basic_string<char, TTraits, TAlloc> & me,
char const * source)
{
me = source;
}
template <typename TContainer>
inline SEQAN_FUNC_ENABLE_IF(Is<StlContainerConcept<TContainer> >, void)
assign(TContainer && me,
char const * source)
{
assign(me, source);
}
template <typename TTraits, typename TAlloc>
inline void
assign(std::basic_string<char, TTraits, TAlloc> && me,
char const * source)
{
me = source;
}
}
#undef SUPERMACRO__
#undef COMMA
#endif
|