+ const size_t max = go.size();
+ vector<Interval> intervals(go.size()-1,Interval(max,max,false));
+ size_t n = 0;
+ const GeneOrder::iterator end = go.end();
+ for (GeneOrder::iterator g = go.begin(); g != end; ++g, ++n){
+ size_t i = abs(*g);
+ 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;
+}
+
+/**
+ *
+ */
+std::vector<Interval> findIntervalsAtPoints(const vector<Interval>& intervals){
+ size_t max = intervals.size()+1;
+ 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){
+ points[i->first].first = n;
+ }else
+ points[i->first].second = n;
+
+ if (points[i->second].first == max){
+ points[i->second].first = n;
+ }else
+ points[i->second].second = n;
+ }
+ return points;
+