TODO overload to accept a set of specific runIDs only
| 40 | |
| 41 | //TODO overload to accept a set of specific runIDs only |
| 42 | void IDMergerAlgorithm::insertRuns( |
| 43 | std::vector<ProteinIdentification>&& prots, |
| 44 | std::vector<PeptideIdentification>&& peps |
| 45 | ) |
| 46 | { |
| 47 | if (prots.empty() || peps.empty()) return; //error? |
| 48 | |
| 49 | //TODO instead of only checking consistency, merge if possible (especially for SILAC mods) |
| 50 | if (!filled_) |
| 51 | { |
| 52 | if (prots.size() > 1) |
| 53 | { |
| 54 | //Without any exp. design we assume label-free for checking mods |
| 55 | checkOldRunConsistency_(prots, "label-free"); |
| 56 | } |
| 57 | copySearchParams_(prots[0], prot_result_); |
| 58 | filled_ = true; |
| 59 | } |
| 60 | else |
| 61 | { |
| 62 | //Without any exp. design we assume label-free for checking mods |
| 63 | checkOldRunConsistency_(prots, this->prot_result_, "label-free"); |
| 64 | } |
| 65 | // move proteins and move peps |
| 66 | movePepIDsAndRefProteinsToResultFaster_(std::move(peps), std::move(prots)); |
| 67 | } |
| 68 | |
| 69 | void IDMergerAlgorithm::insertRuns( |
| 70 | const std::vector<ProteinIdentification>& prots, |