| 869 | }; |
| 870 | |
| 871 | class RepeatInstance |
| 872 | { |
| 873 | |
| 874 | public: |
| 875 | RepeatInstance( |
| 876 | const ContigNode instance, |
| 877 | const ContigNode original, |
| 878 | const std::vector<ContigNode> originalIntigs, |
| 879 | const std::vector<ContigNode> originalOutigs) |
| 880 | : instance(instance) |
| 881 | , original(original) |
| 882 | , originalIntigs(originalIntigs) |
| 883 | , originalOutigs(originalOutigs) |
| 884 | {} |
| 885 | |
| 886 | bool inOriginalIntigs(const ContigNode& node) const |
| 887 | { |
| 888 | return std::find(originalIntigs.begin(), originalIntigs.end(), node) != |
| 889 | originalIntigs.end(); |
| 890 | } |
| 891 | |
| 892 | bool inOriginalOutigs(const ContigNode& node) const |
| 893 | { |
| 894 | return std::find(originalOutigs.begin(), originalOutigs.end(), node) != |
| 895 | originalOutigs.end(); |
| 896 | } |
| 897 | |
| 898 | RepeatInstance getReverse() const |
| 899 | { |
| 900 | std::vector<ContigNode> originalIntigsReverse; |
| 901 | for (auto originalOutig : originalOutigs) { |
| 902 | originalIntigsReverse.push_back(originalOutig ^ true); |
| 903 | } |
| 904 | |
| 905 | std::vector<ContigNode> originalOutigsReverse; |
| 906 | for (auto originalIntig : originalIntigs) { |
| 907 | originalOutigsReverse.push_back(originalIntig ^ true); |
| 908 | } |
| 909 | |
| 910 | return RepeatInstance( |
| 911 | instance ^ true, original ^ true, originalIntigsReverse, originalOutigsReverse); |
| 912 | } |
| 913 | |
| 914 | const ContigNode instance; |
| 915 | const ContigNode original; |
| 916 | std::vector<ContigNode> originalIntigs; |
| 917 | std::vector<ContigNode> originalOutigs; |
| 918 | std::vector<std::reference_wrapper<const RepeatInstance>> intigsInstances; |
| 919 | std::vector<std::reference_wrapper<const RepeatInstance>> outigsInstances; |
| 920 | }; |
| 921 | |
| 922 | static void |
| 923 | processGraph( |
no outgoing calls
no test coverage detected