X-Git-Url: https://ruin.nu/git/?p=germs.git;a=blobdiff_plain;f=src%2Fgenealgorithms.cpp;h=4315cb391e46bfad6c7d10073ee485f2962a4158;hp=24e7b43575ac30a04c46723283a3ee81390a8592;hb=778905d507474784ec6be37fe8f2e5d9c179ae59;hpb=500fc81f4ccf04414ebbd495d167eb2d6b2ac82d

diff --git a/src/genealgorithms.cpp b/src/genealgorithms.cpp
index 24e7b43..4315cb3 100644
--- a/src/genealgorithms.cpp
+++ b/src/genealgorithms.cpp
@@ -96,35 +96,17 @@ std::vector<Component> findComponents(const GeneOrder& go){
 }
 
 /**
- * TODO: Think of a better than O(n^2) implementation
- * Possibly move it to GeneOrder too
+ * 
  */
 std::vector<Interval> findIntervals(const GeneOrder& go){
-	vector<Interval> intervals;
-	for (size_t i = 0; i < go.size() - 1; ++i){
-		size_t f = 0;
-		size_t s = 0;
-		bool found = false;
-		size_t n = 0;
-		for (GeneOrder::iterator g = go.begin(); g != go.end(); ++g, ++n){
-			if (static_cast<size_t>(abs(*g)) == i){
-				f = n;
-				if (*g >= 0)
-					++f;
-				if (found)
-					break;
-				found = true;
-			}
-			if(static_cast<size_t>(abs(*g)) == i+1){
-				s = n;
-				if (*g < 0)
-					++s;
-				if (found)
-					break;
-				found = true;
-			}
-		}
-		intervals.push_back(Interval(f,s));
+	vector<Interval> intervals(go.size()-1,Interval(go.size(),go.size()));
+	size_t n = 0;
+	for (GeneOrder::iterator g = go.begin(); g != go.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);
 	}
 	return intervals;
 }