X-Git-Url: https://ruin.nu/git/?a=blobdiff_plain;f=src%2Fgenealgorithms.cpp;h=f1e66aaa1cce5a2b9a1c3cf7b62c4c75351f4ee1;hb=d7c119fefaf9cce07974afbefb4b6a017689a961;hp=67c504e77b3f9bdfad9589236e8f65f8e2b2cd5d;hpb=e44303f027e957d05c9e9418fbd68171f3707599;p=germs.git

diff --git a/src/genealgorithms.cpp b/src/genealgorithms.cpp
index 67c504e..f1e66aa 100644
--- a/src/genealgorithms.cpp
+++ b/src/genealgorithms.cpp
@@ -173,18 +173,40 @@ std::vector<Component> findComponents(const GeneOrder& go){
 	return components;
 }
 
+int sign2(Gene g){
+	if (g < 0)
+		return -1;
+	return 1;
+}
 /**
  * 
  */
 std::vector<Interval> findIntervals(const GeneOrder& go){
-	vector<Interval> intervals(go.size()-1,Interval(go.size(),go.size()));
+	const size_t max = go.size();
+	vector<Interval> 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 > 0)
-				intervals[i-1].second = n + (*g < 0 ? 1 : 0);
+			if (i < max - 1){
+				Interval& curr = intervals[i];
+				curr.first = n + (*g >= 0 ? 1 : 0);
+
+				if (curr.second == max)
+					curr.oriented = *g < 0;
+				else
+					curr.oriented ^=  *g < 0;
+			}
+			if (i > 0){
+				Interval& prev = intervals[i-1];
+				prev.second = n + (*g < 0 ? 1 : 0);
+
+				if (prev.first == max)
+					prev.oriented = *g < 0;
+				else
+					prev.oriented ^=  *g < 0;
+			}
+
 	}
 	return intervals;
 }
@@ -194,7 +216,7 @@ std::vector<Interval> findIntervals(const GeneOrder& go){
  */
 std::vector<Interval> findIntervalsAtPoints(const vector<Interval>& intervals){
 	size_t max = intervals.size()+1;
-	vector<Interval> points(max,Interval(max,max));
+	vector<Interval> points(max,Interval(max,max,false));
 	size_t n = 0;
 	for (vector<Interval>::const_iterator i = intervals.begin(); i != intervals.end(); ++i, ++n){
 		if (points[i->first].first == max){