From 4b63e18f4e100d3506ed170d4798539b08d19bc0 Mon Sep 17 00:00:00 2001 From: Michael Andreen Date: Sat, 30 Jun 2007 11:18:47 +0000 Subject: [PATCH] a little performance tuning --- src/genealgorithms.cpp | 25 ++++++++++++++----------- 1 file changed, 14 insertions(+), 11 deletions(-) diff --git a/src/genealgorithms.cpp b/src/genealgorithms.cpp index ed68b67..f1e66aa 100644 --- a/src/genealgorithms.cpp +++ b/src/genealgorithms.cpp @@ -182,26 +182,29 @@ int sign2(Gene g){ * */ std::vector findIntervals(const GeneOrder& go){ - size_t max = go.size(); + const size_t max = go.size(); vector intervals(go.size()-1,Interval(max,max,false)); size_t n = 0; - for (GeneOrder::iterator g = go.begin(); g != go.end(); ++g, ++n){ + const GeneOrder::iterator end = go.end(); + for (GeneOrder::iterator g = go.begin(); g != end; ++g, ++n){ size_t i = abs(*g); - if (i < go.size() - 1){ - intervals[i].first = n + (*g >= 0 ? 1 : 0); + if (i < max - 1){ + Interval& curr = intervals[i]; + curr.first = n + (*g >= 0 ? 1 : 0); - if (intervals[i].second == max) - intervals[i].oriented = *g < 0; + if (curr.second == max) + curr.oriented = *g < 0; else - intervals[i].oriented ^= *g < 0; + curr.oriented ^= *g < 0; } if (i > 0){ - intervals[i-1].second = n + (*g < 0 ? 1 : 0); + Interval& prev = intervals[i-1]; + prev.second = n + (*g < 0 ? 1 : 0); - if (intervals[i-1].first == max) - intervals[i-1].oriented = *g < 0; + if (prev.first == max) + prev.oriented = *g < 0; else - intervals[i-1].oriented ^= *g < 0; + prev.oriented ^= *g < 0; } } -- 2.39.2