public void Normalize()
        {
            this.intervals.Sort();
            int i = 0;

            while (i < this.intervals.Count - 1)
            {
                Interval interval = (Interval)this.intervals[i];
                Interval i2       = (Interval)this.intervals[i + 1];
                if (!interval.IsDisjoint(i2) || interval.IsAdjacent(i2))
                {
                    interval.Merge(i2);
                    this.intervals[i] = interval;
                    this.intervals.RemoveAt(i + 1);
                }
                else
                {
                    i++;
                }
            }
        }
Exemple #2
0
        public void Normalize()
        {
            intervals.Sort();
            int num = 0;

            while (num < intervals.Count - 1)
            {
                Interval interval = (Interval)intervals[num];
                Interval i        = (Interval)intervals[num + 1];
                if (!interval.IsDisjoint(i) || interval.IsAdjacent(i))
                {
                    interval.Merge(i);
                    intervals[num] = interval;
                    intervals.RemoveAt(num + 1);
                }
                else
                {
                    num++;
                }
            }
        }
Exemple #3
0
        public void Normalize()
        {
            intervals.Sort();

            int j = 0;

            while (j < intervals.Count - 1)
            {
                Interval a = (Interval)intervals[j];
                Interval b = (Interval)intervals[j + 1];

                if (!a.IsDisjoint(b) || a.IsAdjacent(b))
                {
                    a.Merge(b);
                    intervals[j] = a;
                    intervals.RemoveAt(j + 1);
                }
                else
                {
                    ++j;
                }
            }
        }