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
|
// ==========================================================================
// 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>
// ==========================================================================
// Utility code for enumerating all strings in edit or Hamming distance
// around a given string.
// ==========================================================================
// TODO(holtgrew): It would be nice if the maximal distance would be given as a run time parameter.
// TODO(holtgrew): Document iterator?
#ifndef SEQAN_INCLUDE_MISC_EDIT_ENVIRONMENT_H_
#define SEQAN_INCLUDE_MISC_EDIT_ENVIRONMENT_H_
namespace seqan {
// ==========================================================================
// Forwards
// ==========================================================================
template <typename TDistanceSpec, unsigned DISTANCE /*= 1*/>
struct EditEnvironment;
// ==========================================================================
// Tags, Classes, Enums
// ==========================================================================
// --------------------------------------------------------------------------
// Class StringEnumerator
// --------------------------------------------------------------------------
/*!
* @class StringEnumerator
* @headerfile <seqan/misc/edit_environment.h>
* @brief Class to enumerate all strings within a given edit/Hamming distance.
*
* @signature template <typename TString, typename TSpec>
* class StringEnumerator<TString, TSpec>;
*
* @tparam TString Type of the string to enumerate the environment of.
* @tparam TSpec Specialization tag.
*
*
* @fn StringEnumerator::StringEnumerator
* @brief Constructor
*
* @signature StringEnumerator::StringEnumerator(string[, minDist]);
*
* @param[in] string The string to use as the center. Types: <tt>TString</tt>.
* @param[in] minDist The smallest distance to generate strings with. Type: <tt>unsigned</tt>. Default: 0
*
*
* @var bool StringEnumerator::trim
* @brief Indicate whether to ignore substitutions in first or last character of string in Levenshtein mode
* (optimization for approximate search).
*
* This is useful when searching for such enumerated strings in large texts. Patterns with substitutions in the first
* base would also be found.
*
* @section Examples
*
* @include demos/dox/misc/enumerate_strings.cpp
*
* @include demos/dox/misc/enumerate_strings.cpp.stdout
*/
/*!
* @class HammingStringEnumerator
* @extends StringEnumerator
* @headerfile <seqan/misc/edit_environment.h>
* @brief Enumerate all strings within a given edit distance of a "center string".
*
* @signature template <typename TString, unsigned DISTANCE>
* class StringEnumerator<TString, EditEnvironment<HammingDistance, DISTANCE> >;
*
* @tparam TString Type of the string to enumerate the environment of.
* @tparam DISTANCE The maximal distance to generate strings with.
*
* See @link StringEnumerator @endlink for examples.
*/
/*!
* @class LevenshteinStringEnumerator
* @extends StringEnumerator
* @headerfile <seqan/misc/edit_environment.h>
* @brief Enumerate all strings within a given edit distance of a "center string" (of edit distance < 3).
*
* @signature template <typename TString, unsigned DISTANCE>
* class StringEnumerator<TString, EditEnvironment<LevenshteinDistance, DISTANCE> >;
*
* @tparam TString Type of the string to enumerate the environment of.
* @tparam DISTANCE The maximal distance to generate strings with.
*
* See @link StringEnumerator @endlink for examples.
*
* @note The @link StringEnumerator#length LevenshteinStringEnumerator#length @endlink function does not work for
* <tt>DISTANCE > 2</tt>.
*/
template <typename TObject, typename TSpec>
class StringEnumerator
{
public:
Holder<TObject> data_host;
unsigned minDist;
bool trim;
StringEnumerator(TObject & _original) : data_host(_original), minDist(0), trim(true)
{}
StringEnumerator(TObject & _original, unsigned _minDist) : data_host(_original), minDist(_minDist), trim(true)
{}
StringEnumerator(TObject const & _original) : data_host(_original), minDist(0), trim(true)
{}
StringEnumerator(TObject const & _original, unsigned _minDist) : data_host(_original), minDist(_minDist), trim(true)
{}
};
// --------------------------------------------------------------------------
// Spec EditEnvironment Iter for Hamming Distance
// --------------------------------------------------------------------------
template <typename TSize>
struct StringEnumeratorHammingModifier_
{
TSize errorPos; // position of substitution
unsigned character; // replacement character
unsigned skipChar; // skip the original character
StringEnumeratorHammingModifier_() : errorPos(0), character(0), skipChar(0)
{}
};
template <typename TObject, unsigned DISTANCE>
class Iter<StringEnumerator<TObject, EditEnvironment<HammingDistance, DISTANCE> >, Standard>
{
public:
typedef typename Value<TObject>::Type TValue;
typedef typename Size<TObject>::Type TSize;
typedef typename MakeSigned_<TSize>::Type TSignedSize;
typedef StringEnumeratorHammingModifier_<TSignedSize> TModifier;
TObject & orig;
// typename RemoveConst_<TObject>::Type tmp;
String<TValue> tmp;
TModifier mod[DISTANCE];
unsigned minDist;
bool trim;
Iter(TObject & _original) :
orig(_original),
minDist(0),
trim(true)
{
goBegin(*this);
}
Iter(TObject & _original, unsigned _minDist, bool _trim) :
orig(_original),
minDist(_minDist),
trim(_trim)
{
goBegin(*this);
}
Iter(TObject & _original, MinimalCtor) :
orig(_original),
minDist(0),
trim(true) {}
Iter(TObject & _original, unsigned _minDist, bool _trim, MinimalCtor) :
orig(_original),
minDist(_minDist),
trim(_trim) {}
};
// --------------------------------------------------------------------------
// Spec EditEnvironment Iter for Edit Distance
// --------------------------------------------------------------------------
template <typename TSize>
struct StringEnumeratorLevenshteinModifier_
{
enum TState {DISABLED_, SUBST_, DELETE_, INSERT_, Eof_};
TSize errorPosOrig; // position of edit operation in original string
TSize errorPos; // position of edit operation in modified string
TSize errorPosEnd; // errorPos < errorPosEnd must be fulfilled
unsigned character; // replacement character
unsigned skipChar; // skip the original character
TState state; // current state subst/insert before/delete
StringEnumeratorLevenshteinModifier_() :
errorPosOrig(0), errorPos(0), errorPosEnd(0), character(0), skipChar(0), state(DISABLED_)
{}
};
template <typename TObject, unsigned DISTANCE>
class Iter<StringEnumerator<TObject, EditEnvironment<LevenshteinDistance, DISTANCE> >, Standard>
{
public:
typedef typename Value<TObject>::Type TValue;
typedef typename Size<TObject>::Type TSize;
typedef typename MakeSigned_<TSize>::Type TSignedSize;
typedef StringEnumeratorLevenshteinModifier_<TSignedSize> TModifier;
TObject & orig;
// typename RemoveConst_<TObject>::Type tmp;
String<TValue> tmp;
TModifier mod[DISTANCE + 1];
unsigned minDist;
unsigned currentDistance; // upper bound for dist(original, *this)
bool trim;
Iter(TObject & _original) :
orig(_original),
minDist(0),
currentDistance(0),
trim(true)
{
goBegin(*this);
}
Iter(TObject & _original, unsigned _minDist, bool _trim) :
orig(_original),
minDist(_minDist),
currentDistance(0),
trim(_trim)
{
goBegin(*this);
}
Iter(TObject & _original, MinimalCtor) :
orig(_original),
minDist(0),
currentDistance(0),
trim(true) {}
Iter(TObject & _original, unsigned _minDist, bool _trim, MinimalCtor) :
orig(_original),
minDist(_minDist),
currentDistance(0),
trim(_trim) {}
inline bool _reinit(int pos, int posOrig)
{
tmp = orig;
int posOrigEnd = length(tmp);
typename TModifier::TState lastState = TModifier::DISABLED_;
// i from high to low = modifier from left to right
for (int i = currentDistance - 1; i >= 0; --i)
{
TModifier & _mod = mod[i];
switch (_mod.state)
{
case TModifier::SUBST_:
// INSERT+SUBST is SUBST+INSERT (already enumerated)
// DELETE+SUBST is SUBST+DELETE (already enumerated)
// eventually trim front SUBSTs
if (lastState == TModifier::INSERT_ || lastState == TModifier::DELETE_ ||
(trim && posOrig == 0))
{
++posOrig;
++pos;
}
if (posOrig >= posOrigEnd)
return false;
_mod.errorPosOrig = posOrig;
_mod.errorPos = pos;
_mod.skipChar = ordValue(orig[posOrig]);
_mod.character = (0 == _mod.skipChar) ? 1 : 0;
assignValue(tmp, pos, (TValue) _mod.character);
++pos;
++posOrig;
break;
case TModifier::DELETE_:
// INSERT after DELETE is one SUBST (already enumerated)
if (lastState == TModifier::INSERT_)
{
++posOrig;
++pos;
}
if (posOrig >= posOrigEnd)
return false;
_mod.errorPosOrig = posOrig;
_mod.errorPos = pos;
_mod.character = ValueSize<TValue>::VALUE - 1;
_mod.skipChar = -1;
++posOrig;
erase(tmp, pos);
break;
case TModifier::INSERT_:
default:
// DELETE after INSERT is one SUBST (already enumerated)
// eventually trim front SUBSTs
if (lastState == TModifier::DELETE_ || (trim && posOrig == 0))
{
++posOrig;
++pos;
}
if (posOrig > posOrigEnd)
return false;
_mod.errorPosOrig = posOrig;
_mod.errorPos = pos;
_mod.character = 0;
_mod.skipChar = -1;
insertValue(tmp, pos, (TValue)0);
++pos;
break;
}
lastState = _mod.state;
}
pos = length(tmp);
bool cut = trim;
for (unsigned i = 0; i < currentDistance; ++i)
{
TModifier & _mod = mod[i];
if (_mod.state != TModifier::DELETE_)
{
if (cut)
{
if (_mod.errorPos >= (TSignedSize)(pos - 1))
return false;
_mod.errorPosEnd = pos - 1;
}
else
{
if (_mod.errorPos >= (TSignedSize)pos)
return false;
_mod.errorPosEnd = pos;
}
--pos;
}
else
{
cut = false;
if (_mod.errorPos > (TSignedSize)pos)
return false;
_mod.errorPosEnd = pos + 1;
}
}
return true;
}
};
// ==========================================================================
// Metafunctions
// ==========================================================================
// --------------------------------------------------------------------------
// Metafunction Value StringEnumerator
// --------------------------------------------------------------------------
/*!
* @mfn StringEnumerator#Value
* @brief Return value type of the string to enumerate.
*
* @signature Value<TStringEnumerator>::Type;
*/
template <typename TObject, typename TSpec>
struct Value<StringEnumerator<TObject, TSpec> > : Value<TObject>
{};
// --------------------------------------------------------------------------
// Metafunction Reference StringEnumerator
// --------------------------------------------------------------------------
/*!
* @mfn StringEnumerator#Reference
* @brief Returns reference type of the enumerated strings.
*
* @signature Reference<TStringEnumerator>::Type;
*/
template <typename TObject, typename TSpec>
struct Reference<StringEnumerator<TObject, TSpec> >
{
typedef TObject & Type;
};
template <typename TObject, typename TSpec>
struct Reference<StringEnumerator<TObject, TSpec> const>
{
typedef TObject const & Type;
};
// --------------------------------------------------------------------------
// Metafunction Size StringEnumerator
// --------------------------------------------------------------------------
/*!
* @mfn StringEnumerator#Size
* @brief Returns size type.
*
* @signature Size<TStringEnumerator>::Type;
*/
template <typename TObject, typename TSpec>
struct Size<StringEnumerator<TObject, TSpec> > : Size<TObject>
{};
// --------------------------------------------------------------------------
// Metafunction Difference StringEnumerator
// --------------------------------------------------------------------------
/*!
* @mfn StringEnumerator#Difference
* @brief Returns difference type.
*
* @signature Difference<TStringEnumerator>::Type;
*/
template <typename TObject, typename TSpec>
struct Difference<StringEnumerator<TObject, TSpec> > : Difference<TObject>
{};
// --------------------------------------------------------------------------
// Metafunction Position StringEnumerator
// --------------------------------------------------------------------------
/*!
* @mfn StringEnumerator#Position
* @brief Returns position type.
*
* @signature Position<TStringEnumerator>::Type;
*/
template <typename TObject, typename TSpec>
struct Position<StringEnumerator<TObject, TSpec> > : Position<TObject>
{};
// --------------------------------------------------------------------------
// Metafunction Iterator StringEnumerator
// --------------------------------------------------------------------------
/*!
* @mfn StringEnumerator#Iterator
* @brief Returns iterator type.
*
* @signature Position<TStringEnumerator, TSpec>::Type;
*/
template <typename TObject, typename TSpec>
struct Iterator<StringEnumerator<TObject, TSpec>, Standard>
{
typedef Iter<StringEnumerator<TObject, TSpec>, Standard> Type;
};
template <typename TObject, typename TSpec>
struct Iterator<StringEnumerator<TObject, TSpec> const, Standard>
{
typedef Iter<StringEnumerator<TObject, TSpec>, Standard> Type;
};
// --------------------------------------------------------------------------
// Metafunction Host StringEnumerator
// --------------------------------------------------------------------------
/*!
* @mfn StringEnumerator#Host
* @brief Returns host type.
*
* @signature Host<TStringEnumerator>::Type;
*/
template <typename TObject, typename TSpec>
struct Host<StringEnumerator<TObject, TSpec> >
{
typedef TObject Type;
};
template <typename TObject, typename TSpec>
struct Host<StringEnumerator<TObject, TSpec> const>
{
typedef TObject const Type;
};
// ==========================================================================
// Functions
// ==========================================================================
// --------------------------------------------------------------------------
// Function _dataHost() StringEnumerator
// --------------------------------------------------------------------------
template <typename TText, typename TSpec>
inline Holder<TText> &
_dataHost(StringEnumerator<TText, TSpec> & enumerator)
{
return enumerator.data_host;
}
template <typename TText, typename TSpec>
inline Holder<TText> const &
_dataHost(StringEnumerator<TText, TSpec> const & enumerator)
{
return enumerator.data_host;
}
// --------------------------------------------------------------------------
// Function begin() StringEnumerator
// --------------------------------------------------------------------------
/*!
* @fn StringEnumerator#begin
* @brief Return begin iterator.
*
* @signature TIter begin(stringEnum[, tag]);
*
* @param[in] stringEnum StringEnumerator to query.
* @param[in] tag Iterator tag to use.
*
* @return TIter Iterator to the first string in the enumerator.
*/
template <typename TObject, typename TSpec>
inline Iter<StringEnumerator<TObject, TSpec>, Standard>
begin(StringEnumerator<TObject, TSpec> & enumerator, Standard)
{
return Iter<StringEnumerator<TObject, TSpec>, Standard>(host(enumerator), enumerator.minDist, enumerator.trim);
}
template <typename TObject, typename TSpec>
inline Iter<StringEnumerator<TObject, TSpec>, Standard>
begin(StringEnumerator<TObject, TSpec> const & enumerator, Standard)
{
return Iter<StringEnumerator<TObject, TSpec>, Standard>(host(enumerator), enumerator.minDist, enumerator.trim);
}
// --------------------------------------------------------------------------
// Function end() StringEnumerator
// --------------------------------------------------------------------------
/*!
* @fn StringEnumerator#end
* @brief Return end iterator.
*
* @signature TIter end(stringEnum[, tag]);
*
* @param[in] stringEnum StringEnumerator to query.
* @param[in] tag Iterator tag to use.
*
* @return TIter End iterator for the string enumerator.
*/
template <typename TObject, typename TSpec>
inline Iter<StringEnumerator<TObject, TSpec>, Standard>
end(StringEnumerator<TObject, TSpec> & enumerator, Standard)
{
Iter<StringEnumerator<TObject, TSpec>, Standard> iter(host(enumerator), enumerator.minDist, enumerator.trim, MinimalCtor());
goEnd(iter);
return iter;
}
template <typename TObject, typename TSpec>
inline Iter<StringEnumerator<TObject, TSpec>, Standard>
end(StringEnumerator<TObject, TSpec> const & enumerator, Standard)
{
Iter<StringEnumerator<TObject, TSpec>, Standard> iter(host(enumerator), enumerator.minDist, enumerator.trim, MinimalCtor());
goEnd(iter);
return iter;
}
// --------------------------------------------------------------------------
// Function length() Hamming StringEnumerator
// --------------------------------------------------------------------------
/*!
* @fn StringEnumerator#length
* @brief Return number of strings that will be enumerated.
*
* @signature TSize length(stringEnum);
*
* @param[in] stringEnum StringEnumerator to query.
*
* @return TSize The number of elements in the enumerator (Metafunction: @link StringEnumerator#Size @endlink).
*/
template <typename TObject, unsigned DISTANCE>
inline typename Size<StringEnumerator<TObject, EditEnvironment<HammingDistance, DISTANCE> > >::Type
length(StringEnumerator<TObject, EditEnvironment<HammingDistance, DISTANCE> > const & me)
{
typedef typename Value<TObject>::Type TValue;
typedef typename Size<TObject>::Type TSize;
static const unsigned alphabetSize = ValueSize<TValue>::VALUE;
TSize sum = 0;
TSize numerator = 1;
TSize alpha = 1;
TSize divisor = 1;
for (unsigned i = 0; i <= DISTANCE; ++i)
{
if (i >= me.minDist)
sum += alpha * (numerator / divisor);
divisor *= i + 1;
numerator *= length(host(me)) - i;
alpha *= alphabetSize - 1;
}
return sum;
}
// --------------------------------------------------------------------------
// Function operator*() StringEnumerator Iter
// --------------------------------------------------------------------------
template <typename TObject, typename TSpec>
inline TObject const &
operator*(Iter<StringEnumerator<TObject, TSpec>, Standard> & it)
{
return it.tmp;
}
template <typename TObject, typename TSpec>
inline TObject const &
operator*(Iter<StringEnumerator<TObject, TSpec>, Standard> const & it)
{
return it.tmp;
}
// --------------------------------------------------------------------------
// Function goBegin() Hamming StringEnumerator Iter
// --------------------------------------------------------------------------
template <typename TObject, unsigned DISTANCE>
inline void
goBegin(Iter<StringEnumerator<TObject, EditEnvironment<HammingDistance, DISTANCE> >, Standard> & it)
{
typedef typename Value<TObject>::Type TValue;
typedef typename Size<TObject>::Type TSize;
typedef typename MakeSigned_<TSize>::Type TSignedSize;
typedef StringEnumeratorHammingModifier_<TSignedSize> TModifier;
if (empty(it.orig) || it.minDist > DISTANCE || it.minDist > length(it.orig))
{
goEnd(it);
return;
}
it.tmp = it.orig;
unsigned i = 0;
unsigned mDist = it.minDist;
if (mDist > length(it.orig))
mDist = length(it.orig);
if (mDist == 0)
{
it.mod[0].errorPos = 0;
it.mod[0].skipChar = -1;
it.mod[0].character = 0;
assignValue(it.tmp, 0, (TValue) 0);
i = 1;
}
else
for (; i < mDist; ++i)
{
TModifier & mod = it.mod[i];
mod.errorPos = (mDist - 1) - i;
mod.skipChar = ordValue(it.orig[mod.errorPos]);
mod.character = (0 == mod.skipChar) ? 1 : 0;
assignValue(it.tmp, mod.errorPos, (TValue) mod.character);
}
for (; i < DISTANCE; ++i)
{
TModifier & mod = it.mod[i];
mod.errorPos = -1;
mod.character = 0;
mod.skipChar = -1;
}
}
// --------------------------------------------------------------------------
// Function atBegin() Hamming StringEnumerator Iter
// --------------------------------------------------------------------------
template <typename TObject, unsigned DISTANCE>
inline void
atBegin(Iter<StringEnumerator<TObject, EditEnvironment<HammingDistance, DISTANCE> >, Standard> const & it)
{
Iter<StringEnumerator<TObject, EditEnvironment<HammingDistance, DISTANCE> >, Standard> tmp(it.orig, it.minDist, it.trim);
return tmp == it;
}
template <typename TObject, unsigned DISTANCE>
inline bool
atBegin(Iter<StringEnumerator<TObject, EditEnvironment<HammingDistance, DISTANCE> >, Standard> & it)
{
return atBegin(const_cast<Iter<StringEnumerator<TObject, EditEnvironment<HammingDistance, DISTANCE> >, Standard> const &>(it));
}
// --------------------------------------------------------------------------
// Function goEnd() StringEnumerator Iter Hamming
// --------------------------------------------------------------------------
template <typename TObject, unsigned DISTANCE>
inline void
goEnd(Iter<StringEnumerator<TObject, EditEnvironment<HammingDistance, DISTANCE> >, Standard> & it)
{
typedef typename Size<TObject>::Type TSize;
typedef typename MakeSigned_<TSize>::Type TSignedSize;
typedef StringEnumeratorHammingModifier_<TSignedSize> TModifier;
for (unsigned i = 0; i < DISTANCE; ++i)
{
TModifier & mod = it.mod[i];
mod.errorPos = -1;
mod.character = 0;
}
}
// --------------------------------------------------------------------------
// Function atEnd() Hamming StringEnumerator Iter
// --------------------------------------------------------------------------
template <typename TObject, unsigned DISTANCE>
inline bool
atEnd(Iter<StringEnumerator<TObject, EditEnvironment<HammingDistance, DISTANCE> >, Standard> const & it)
{
typedef typename Size<TObject>::Type TSize;
typedef typename MakeSigned_<TSize>::Type TSignedSize;
typedef StringEnumeratorHammingModifier_<TSignedSize> TModifier;
for (unsigned i = 0; i < DISTANCE; ++i)
{
TModifier const & mod = it.mod[i];
if (mod.errorPos != (TSignedSize) - 1 || mod.character != 0u)
return false;
}
return true;
}
template <typename TObject, unsigned DISTANCE>
inline bool
atEnd(Iter<StringEnumerator<TObject, EditEnvironment<HammingDistance, DISTANCE> >, Standard> & it)
{
return atEnd(const_cast<Iter<StringEnumerator<TObject, EditEnvironment<HammingDistance, DISTANCE> >, Standard> const &>(it));
}
// --------------------------------------------------------------------------
// Function operator++() Hamming StringEnumerator Iter
// --------------------------------------------------------------------------
template <typename TObject, unsigned DISTANCE>
inline Iter<StringEnumerator<TObject, EditEnvironment<HammingDistance, DISTANCE> >, Standard> &
operator++(Iter<StringEnumerator<TObject, EditEnvironment<HammingDistance, DISTANCE> >, Standard> & it)
{
typedef typename Value<TObject>::Type TValue;
typedef typename Size<TObject>::Type TSize;
typedef typename MakeSigned_<TSize>::Type TSignedSize;
typedef StringEnumeratorHammingModifier_<TSignedSize> TModifier;
for (unsigned i = 0; true; )
{
TModifier * mod = &it.mod[i];
// next replacement value
if (++mod->character < ValueSize<TValue>::VALUE)
{
// output the original tuple only once
if (mod->character == mod->skipChar)
continue;
assignValue(it.tmp, mod->errorPos, (TValue) mod->character);
break;
}
mod->character = (0 == mod->skipChar) ? 1 : 0;
assignValue(it.tmp, mod->errorPos, (TValue) mod->character);
if (++i == DISTANCE || (mod + 1)->errorPos == (TSignedSize) - 1)
{
for (i = 0; i < DISTANCE; ++i)
{
mod = &it.mod[i];
// restore char at old position
if (mod->errorPos >= 0)
{
// std::cout << "org" << it.orig << " tmp" << it.tmp << " ___ ";
assignValue(it.tmp, mod->errorPos, it.orig[mod->errorPos]);
// std::cout << "org" << it.orig << " tmp" << it.tmp << std::endl;
}
// next error position
if (++(mod->errorPos) < (TSignedSize)(length(it.tmp) - i))
{
mod->skipChar = ordValue(it.orig[mod->errorPos]);
mod->character = (0 == mod->skipChar) ? 1 : 0;
assignValue(it.tmp, mod->errorPos, (TValue) mod->character);
for (; i > 0; )
{
it.mod[i - 1].errorPos = mod->errorPos + 1;
mod = &it.mod[--i];
mod->skipChar = ordValue(it.orig[mod->errorPos]);
mod->character = (0 == mod->skipChar) ? 1 : 0;
assignValue(it.tmp, mod->errorPos, (TValue) mod->character);
}
return it;
}
}
// end
for (i = 0; i < DISTANCE; ++i)
{
mod = &it.mod[i];
mod->errorPos = -1;
mod->character = 0;
}
return it;
}
}
return it;
}
// --------------------------------------------------------------------------
// Function goBegin() Levensthein StringEnumerator Iter
// --------------------------------------------------------------------------
template <typename TObject, unsigned DISTANCE>
inline void
goBegin(Iter<StringEnumerator<TObject, EditEnvironment<LevenshteinDistance, DISTANCE> >, Standard> & it)
{
typedef typename Value<TObject>::Type TValue;
typedef typename Size<TObject>::Type TSize;
typedef typename MakeSigned_<TSize>::Type TSignedSize;
typedef StringEnumeratorLevenshteinModifier_<TSignedSize> TModifier;
if (empty(it.orig) || it.minDist > DISTANCE || it.minDist > length(it.orig))
{
goEnd(it);
return;
}
it.tmp = it.orig;
for (unsigned i = 0; i <= DISTANCE; ++i)
{
it.mod[i].errorPosOrig = -1;
it.mod[i].errorPos = -1;
it.mod[i].errorPosEnd = -1;
it.mod[i].character = ValueSize<TValue>::VALUE - 1;
it.mod[i].state = TModifier::DISABLED_;
}
it.currentDistance = it.minDist;
if (!it._reinit(0, 0))
goEnd(it);
}
// --------------------------------------------------------------------------
// Function goEnd() Levensthein StringEnumerator Iter
// --------------------------------------------------------------------------
template <typename TObject, unsigned DISTANCE>
inline void
goEnd(Iter<StringEnumerator<TObject, EditEnvironment<LevenshteinDistance, DISTANCE> >, Standard> & it)
{
typedef typename Size<TObject>::Type TSize;
typedef typename MakeSigned_<TSize>::Type TSignedSize;
typedef StringEnumeratorLevenshteinModifier_<TSignedSize> TModifier;
for (unsigned i = 0; i < DISTANCE; ++i)
{
TModifier & mod = it.mod[i];
mod.errorPos = -1;
mod.character = 0;
mod.state = TModifier::SUBST_;
}
}
// --------------------------------------------------------------------------
// Function atEnd() Edit StringEnumerator Iter
// --------------------------------------------------------------------------
template <typename TObject, unsigned DISTANCE>
inline bool
atEnd(Iter<StringEnumerator<TObject, EditEnvironment<LevenshteinDistance, DISTANCE> >, Standard> const & it)
{
typedef typename Size<TObject>::Type TSize;
typedef typename MakeSigned_<TSize>::Type TSignedSize;
typedef StringEnumeratorLevenshteinModifier_<TSignedSize> TModifier;
for (unsigned i = 0; i < DISTANCE; ++i)
{
TModifier const & mod = it.mod[i];
if (mod.errorPos != -1 || mod.character != 0u || mod.state != TModifier::SUBST_)
return false;
}
return true;
}
template <typename TObject, unsigned DISTANCE>
inline bool
atEnd(Iter<StringEnumerator<TObject, EditEnvironment<LevenshteinDistance, DISTANCE> >, Standard> & it)
{
return atEnd(const_cast<Iter<StringEnumerator<TObject, EditEnvironment<LevenshteinDistance, DISTANCE> >, Standard> const &>(it));
}
// --------------------------------------------------------------------------
// Function operator++() Levensthein StringEnumerator Iter
// --------------------------------------------------------------------------
template <typename TObject, unsigned DISTANCE>
inline Iter<StringEnumerator<TObject, EditEnvironment<LevenshteinDistance, DISTANCE> >, Standard> &
operator++(Iter<StringEnumerator<TObject, EditEnvironment<LevenshteinDistance, DISTANCE> >, Standard> & it)
{
typedef typename Value<TObject>::Type TValue;
typedef typename Size<TObject>::Type TSize;
typedef typename MakeSigned_<TSize>::Type TSignedSize;
typedef StringEnumeratorLevenshteinModifier_<TSignedSize> TModifier;
typedef typename TModifier::TState TState;
// increment characters
TModifier * mod = it.mod;
do
{
// next replacement/insert value (loop core)
if (++(mod->character) < ValueSize<TValue>::VALUE)
{
// output the original tuple only once
if (mod->character == mod->skipChar)
continue;
if (mod->errorPos >= 0)
assignValue(it.tmp, mod->errorPos, (TValue) mod->character);
return it;
}
// reset counter
if (mod->state != mod->DELETE_)
{
mod->character = (0 == mod->skipChar) ? 1 : 0;
if (mod->errorPos >= 0)
assignValue(it.tmp, mod->errorPos, (TValue) mod->character);
}
// next modifier
++mod;
}
while (mod->state != TModifier::DISABLED_);
// increment positions
mod = it.mod;
do
{
// restore char at old position
if (mod->errorPos >= 0 && static_cast<unsigned>(mod->errorPos) < length(it.tmp))
assignValue(it.tmp, mod->errorPos, it.orig[mod->errorPosOrig]);
// int iMax = (TSignedSize)(length(it.tmp) - i);
// if (mod->state == mod->INSERT_) ++iMax;
// next error position
if (++(mod->errorPos) < mod->errorPosEnd)
{
++(mod->errorPosOrig);
// set next char
if (mod == it.mod) // for the first modifier we use an optimization
{
if (mod->state != mod->DELETE_)
{
if (mod->state == mod->SUBST_)
mod->skipChar = ordValue(it.orig[mod->errorPosOrig]);
else
mod->skipChar = -1;
mod->character = (0 == mod->skipChar) ? 1 : 0;
assignValue(it.tmp, mod->errorPos, (TValue) mod->character);
}
}
else if (!it._reinit(mod->errorPos, mod->errorPosOrig))
break;
return it;
}
++mod;
}
while (mod->state != TModifier::DISABLED_);
// increment states
mod = it.mod;
TModifier * modEnd = mod + DISTANCE;
do
{
// next edit state (subst->delete->insert)
if (mod->state != mod->INSERT_)
{
mod->state = (TState)(mod->state + 1);
if (mod->state == TModifier::SUBST_)
++it.currentDistance;
if (!it._reinit(0, 0))
{
mod = it.mod;
continue;
}
return it;
}
else
mod->state = mod->SUBST_;
++mod;
}
while (mod != modEnd);
// end
goEnd(it);
return it;
}
// --------------------------------------------------------------------------
// Function length() Levensthein StringEnumerator Iter
// --------------------------------------------------------------------------
template <typename TObject, unsigned DISTANCE>
inline typename Size<StringEnumerator<TObject, EditEnvironment<LevenshteinDistance, DISTANCE> > >::Type
length(StringEnumerator<TObject, EditEnvironment<LevenshteinDistance, DISTANCE> > const & me)
{
typedef typename Value<TObject>::Type TValue;
typedef typename Size<TObject>::Type TSize;
static const unsigned alpha = ValueSize<TValue>::VALUE;
TSize sum = 0;
// TSize numerator = 1;
// TSize divisor = 1;
TSize len = length(host(me));
if (me.minDist == 0 && len > 0)
++sum;
if (me.minDist <= 1 && DISTANCE >= 1)
{
if (me.trim)
{
if (len > 2)
sum += (alpha - 1) * (len - 2); // substitutions
sum += len; // deletions
if (len > 1)
sum += alpha * (len - 1); // inserts
}
else
{
sum += (alpha - 1) * len; // substitutions
sum += len; // deletions
sum += alpha * (len + 1); // inserts
}
}
if (me.minDist <= 2 && DISTANCE >= 2)
{
if (me.trim)
{
sum += (alpha - 1) * (alpha - 1) * len * (len - 1) / 2; // subst^2
sum += (alpha - 1) * (len - 1) * (len - 1); // subst*del
sum += (alpha - 1) * alpha * len * (len + 1); // subst*ins
sum += len * (len - 1) / 2; // del^2
sum += alpha * alpha * (len + 1) * (len + 1) / 2; // ins^2
}
else
{
sum += (alpha - 1) * (alpha - 1) * len * (len - 1) / 2; // subst^2
sum += (alpha - 1) * (len - 1) * (len - 1); // subst*del
sum += (alpha - 1) * alpha * len * (len + 1); // subst*ins
sum += len * (len - 1) / 2; // del^2
sum += alpha * alpha * (len + 1) * (len + 1) / 2; // ins^2
}
}
// TODO: length function for DISTANCE >= 3 (if anyone needs should this)
if (DISTANCE > 2u)
SEQAN_FAIL("length() not implemented for DISTANCE >= 3!");
return sum;
}
// --------------------------------------------------------------------------
// Function operator==() Hamming StringEnumerator Iter
// --------------------------------------------------------------------------
template <typename TObject, unsigned DISTANCE>
inline bool
operator==(
Iter<StringEnumerator<TObject, EditEnvironment<HammingDistance, DISTANCE> >, Standard> const & a,
Iter<StringEnumerator<TObject, EditEnvironment<HammingDistance, DISTANCE> >, Standard> const & b)
{
typedef typename Size<TObject>::Type TSize;
typedef typename MakeSigned_<TSize>::Type TSignedSize;
typedef StringEnumeratorHammingModifier_<TSignedSize> TModifier;
if (&a.orig != &b.orig)
return false;
for (unsigned i = 0; i < DISTANCE; ++i)
{
TModifier const & modA = a.mod[i];
TModifier const & modB = b.mod[i];
if (modA.errorPos != modB.errorPos || modA.character != modB.character)
return false;
}
return true;
}
// --------------------------------------------------------------------------
// Function operator!=() Hamming StringEnumerator Iter
// --------------------------------------------------------------------------
template <typename TObject, unsigned DISTANCE>
inline bool
operator!=(
Iter<StringEnumerator<TObject, EditEnvironment<HammingDistance, DISTANCE> >, Standard> const & a,
Iter<StringEnumerator<TObject, EditEnvironment<HammingDistance, DISTANCE> >, Standard> const & b)
{
typedef typename Size<TObject>::Type TSize;
typedef typename MakeSigned_<TSize>::Type TSignedSize;
typedef StringEnumeratorHammingModifier_<TSignedSize> TModifier;
if (&a.orig != &b.orig)
return true;
for (unsigned i = 0; i < DISTANCE; ++i)
{
TModifier const & modA = a.mod[i];
TModifier const & modB = b.mod[i];
if (modA.errorPos != modB.errorPos || modA.character != modB.character)
return true;
}
return false;
}
// --------------------------------------------------------------------------
// Function operator==() Levensthein StringEnumerator Iter
// --------------------------------------------------------------------------
template <typename TObject, unsigned DISTANCE>
inline bool
operator==(
Iter<StringEnumerator<TObject, EditEnvironment<LevenshteinDistance, DISTANCE> >, Standard> const & a,
Iter<StringEnumerator<TObject, EditEnvironment<LevenshteinDistance, DISTANCE> >, Standard> const & b)
{
typedef typename Size<TObject>::Type TSize;
typedef typename MakeSigned_<TSize>::Type TSignedSize;
typedef StringEnumeratorLevenshteinModifier_<TSignedSize> TModifier;
if (&a.orig != &b.orig)
return false;
for (unsigned i = 0; i < DISTANCE; ++i)
{
TModifier const & modA = a.mod[i];
TModifier const & modB = b.mod[i];
if (modA.errorPos != modB.errorPos ||
modA.character != modB.character ||
modA.state != modB.state)
return false;
}
return true;
}
// --------------------------------------------------------------------------
// Function operator!=() Levenshtein StringEnumerator Iter
// --------------------------------------------------------------------------
template <typename TObject, unsigned DISTANCE>
inline bool
operator!=(
Iter<StringEnumerator<TObject, EditEnvironment<LevenshteinDistance, DISTANCE> >, Standard> const & a,
Iter<StringEnumerator<TObject, EditEnvironment<LevenshteinDistance, DISTANCE> >, Standard> const & b)
{
typedef typename Size<TObject>::Type TSize;
typedef typename MakeSigned_<TSize>::Type TSignedSize;
typedef StringEnumeratorLevenshteinModifier_<TSignedSize> TModifier;
if (&a.orig != &b.orig)
return true;
for (unsigned i = 0; i < DISTANCE; ++i)
{
TModifier const & modA = a.mod[i];
TModifier const & modB = b.mod[i];
if (modA.errorPos != modB.errorPos ||
modA.character != modB.character ||
modA.state != modB.state)
return true;
}
return false;
}
} // namespace seqan
#endif // #ifndef SEQAN_INCLUDE_MISC_EDIT_ENVIRONMENT_H_
// LocalWords: StringEnumerator
|