Free cookie consent management tool by TermsFeed Policy Generator

source: branches/2971_named_intervals/HeuristicLab.Problems.DataAnalysis/3.4/Implementation/Interval/Interval.cs @ 16918

Last change on this file since 16918 was 16896, checked in by chaider, 6 years ago

#2971 Renaming and moving files:

Renamed:

NamedIntervals => IntervalCollection
ParsedConstraint => ProblemDataConstraint
NamedIntervalsView => IntervalCollectionView

Folder Parser => Interval

Moved:

IntervalCollectionView from Regression/IntervalCollectionView ==> ./IntervalCollectionView
Interval, IntervalCollection from /Implementation => /Implementation/Interval

File size: 10.8 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
4 *
5 * This file is part of HeuristicLab.
6 *
7 * HeuristicLab is free software: you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation, either version 3 of the License, or
10 * (at your option) any later version.
11 *
12 * HeuristicLab is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License
18 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
19 */
20#endregion
21
22using System;
23using System.Collections.Generic;
24using System.Linq;
25using HeuristicLab.Common;
26using HEAL.Attic;
27
28namespace HeuristicLab.Problems.DataAnalysis {
29  [StorableType("849e42d3-8934-419d-9aff-64ad81c06b67")]
30  public class Interval : IEquatable<Interval> {
31    [Storable]
32    public double LowerBound { get; private set; }
33    [Storable]
34    public double UpperBound { get; private set; }
35
36    [StorableConstructor]
37    protected Interval(StorableConstructorFlag _) { }
38
39    public Interval(double lowerBound, double upperBound) {
40      //TODO Handle floating point issues where lowerbound is bigger than upperbound in the nth decimal place
41      if (lowerBound > upperBound)
42        throw new ArgumentException("lowerBound must be smaller than or equal to upperBound.");
43
44      this.LowerBound = lowerBound;
45      this.UpperBound = upperBound;
46    }
47
48    public bool Contains(double value) {
49      return LowerBound <= value && value <= UpperBound;
50    }
51
52    public bool Contains(Interval other, bool lowerBoundInclusive = true, bool upperBoundInclusive = false) {
53      if (double.IsNegativeInfinity(this.LowerBound) && double.IsPositiveInfinity(this.UpperBound))
54        return true;
55      //Left-unbounded and right-bounded:
56      if (double.IsNegativeInfinity(this.LowerBound)) {
57        if (upperBoundInclusive)
58          return other.LowerBound <= this.UpperBound && other.UpperBound <= this.UpperBound;
59        return other.LowerBound < this.UpperBound && other.UpperBound < this.UpperBound;
60      }
61
62      //Left-bounded and right-unbounded:
63      if (double.IsPositiveInfinity(this.UpperBound)) {
64        if (lowerBoundInclusive)
65          return other.LowerBound >= this.LowerBound && other.UpperBound >= this.LowerBound;
66        return other.LowerBound > this.LowerBound && other.UpperBound > this.LowerBound;
67      }
68
69      //Proper and bounded:
70      //Closed:
71      if (lowerBoundInclusive && upperBoundInclusive) {
72        return this.LowerBound <= other.LowerBound && other.UpperBound <= this.UpperBound;
73      }
74
75      //Open:
76      if (!lowerBoundInclusive && !upperBoundInclusive) {
77        return this.LowerBound < other.LowerBound && other.UpperBound < this.UpperBound;
78      }
79
80      //Left-closed, right-open:
81      if (lowerBoundInclusive) {
82        return this.LowerBound <= other.LowerBound && other.UpperBound < this.UpperBound;
83      }
84
85      //Left-open, right-closed:
86      return this.LowerBound < other.LowerBound && other.UpperBound <= this.UpperBound;
87    }
88
89    public override string ToString() {
90      return "Interval: [" + LowerBound + ", " + UpperBound + "]";
91    }
92
93    public bool IsInfiniteOrUndefined {
94      get {
95        return double.IsInfinity(LowerBound) || double.IsInfinity(UpperBound) ||
96                double.IsNaN(LowerBound) || double.IsNaN(UpperBound);
97      }
98    }
99
100    public static Interval GetInterval(IEnumerable<double> values) {
101      if (values == null) throw new ArgumentNullException("values");
102      if (!values.Any()) throw new ArgumentException($"No values are present.");
103
104      var min = double.MaxValue;
105      var max = double.MinValue;
106
107      foreach (var value in values) {
108        //If an value is NaN return an interval [NaN, NaN]
109        if (double.IsNaN(value)) return new Interval(double.NaN, double.NaN);
110
111        if (value < min) min = value;
112        if (value > max) max = value;
113      }
114
115      return new Interval(min, max);
116    }
117
118    #region Equals, GetHashCode, == , !=
119    public bool Equals(Interval other) {
120      if (other == null)
121        return false;
122
123      return (UpperBound.IsAlmost(other.UpperBound) || (double.IsNaN(UpperBound) && double.IsNaN(other.UpperBound)))
124        && (LowerBound.IsAlmost(other.LowerBound) || (double.IsNaN(LowerBound) && double.IsNaN(other.LowerBound)));
125    }
126
127    public override bool Equals(object obj) {
128      return Equals(obj as Interval);
129    }
130
131    public override int GetHashCode() {
132      return LowerBound.GetHashCode() ^ UpperBound.GetHashCode();
133    }
134
135    public static bool operator ==(Interval interval1, Interval interval2) {
136      if (ReferenceEquals(interval1, null)) return ReferenceEquals(interval2, null);
137      return interval1.Equals(interval2);
138    }
139    public static bool operator !=(Interval interval1, Interval interval2) {
140      return !(interval1 == interval2);
141    }
142    #endregion
143
144    #region operations
145
146    // [x1,x2] + [y1,y2] = [x1 + y1,x2 + y2]
147    public static Interval Add(Interval a, Interval b) {
148      return new Interval(a.LowerBound + b.LowerBound, a.UpperBound + b.UpperBound);
149    }
150
151    // [x1,x2] − [y1,y2] = [x1 − y2,x2 − y1]
152    public static Interval Subtract(Interval a, Interval b) {
153      return new Interval(a.LowerBound - b.UpperBound, a.UpperBound - b.LowerBound);
154    }
155
156    // [x1,x2] * [y1,y2] = [min(x1*y1,x1*y2,x2*y1,x2*y2),max(x1*y1,x1*y2,x2*y1,x2*y2)]
157    public static Interval Multiply(Interval a, Interval b) {
158      double v1 = a.LowerBound * b.LowerBound;
159      double v2 = a.LowerBound * b.UpperBound;
160      double v3 = a.UpperBound * b.LowerBound;
161      double v4 = a.UpperBound * b.UpperBound;
162
163      double min = Math.Min(Math.Min(v1, v2), Math.Min(v3, v4));
164      double max = Math.Max(Math.Max(v1, v2), Math.Max(v3, v4));
165      return new Interval(min, max);
166    }
167
168    //mkommend: Division by intervals containing 0 is implemented as defined in
169    //http://en.wikipedia.org/wiki/Interval_arithmetic
170    public static Interval Divide(Interval a, Interval b) {
171      if (b.Contains(0.0)) {
172        if (b.LowerBound.IsAlmost(0.0)) return Interval.Multiply(a, new Interval(1.0 / b.UpperBound, double.PositiveInfinity));
173        else if (b.UpperBound.IsAlmost(0.0)) return Interval.Multiply(a, new Interval(double.NegativeInfinity, 1.0 / b.LowerBound));
174        else return new Interval(double.NegativeInfinity, double.PositiveInfinity);
175      }
176      return Interval.Multiply(a, new Interval(1.0 / b.UpperBound, 1.0 / b.LowerBound));
177    }
178
179    public static Interval Sine(Interval a) {
180      if (Math.Abs(a.UpperBound - a.LowerBound) >= Math.PI * 2) return new Interval(-1, 1);
181
182      //divide the interval by PI/2 so that the optima lie at x element of N (0,1,2,3,4,...)
183      double Pihalf = Math.PI / 2;
184      Interval scaled = Interval.Divide(a, new Interval(Pihalf, Pihalf));
185      //move to positive scale
186      if (scaled.LowerBound < 0) {
187        int periodsToMove = Math.Abs((int)scaled.LowerBound / 4) + 1;
188        scaled = Interval.Add(scaled, new Interval(periodsToMove * 4, periodsToMove * 4));
189      }
190
191      double scaledLowerBound = scaled.LowerBound % 4.0;
192      double scaledUpperBound = scaled.UpperBound % 4.0;
193      if (scaledUpperBound < scaledLowerBound) scaledUpperBound += 4.0;
194      List<double> sinValues = new List<double>();
195      sinValues.Add(Math.Sin(scaledLowerBound * Pihalf));
196      sinValues.Add(Math.Sin(scaledUpperBound * Pihalf));
197
198      int startValue = (int)Math.Ceiling(scaledLowerBound);
199      while (startValue < scaledUpperBound) {
200        sinValues.Add(Math.Sin(startValue * Pihalf));
201        startValue += 1;
202      }
203
204      return new Interval(sinValues.Min(), sinValues.Max());
205    }
206    public static Interval Cosine(Interval a) {
207      return Interval.Sine(Interval.Add(a, new Interval(Math.PI / 2, Math.PI / 2)));
208    }
209    public static Interval Tangens(Interval a) {
210      return Interval.Divide(Interval.Sine(a), Interval.Cosine(a));
211    } 
212    public static Interval HyperbolicTangent(Interval a) {
213      return new Interval(Math.Tanh(a.LowerBound), Math.Tanh(a.UpperBound));
214    }
215
216    public static Interval Logarithm(Interval a) {
217      return new Interval(Math.Log(a.LowerBound), Math.Log(a.UpperBound));
218    }
219    public static Interval Exponential(Interval a) {
220      return new Interval(Math.Exp(a.LowerBound), Math.Exp(a.UpperBound));
221    }
222
223    public static Interval Power(Interval a, Interval b) {
224      if (a.Contains(0.0) && b.LowerBound < 0) return new Interval(double.NaN, double.NaN);
225
226      int bLower = (int)Math.Round(b.LowerBound);
227      int bUpper = (int)Math.Round(b.UpperBound);
228
229      List<double> powerValues = new List<double>();
230      powerValues.Add(Math.Pow(a.UpperBound, bUpper));
231      powerValues.Add(Math.Pow(a.UpperBound, bUpper - 1));
232      powerValues.Add(Math.Pow(a.UpperBound, bLower));
233      powerValues.Add(Math.Pow(a.UpperBound, bLower + 1));
234
235      powerValues.Add(Math.Pow(a.LowerBound, bUpper));
236      powerValues.Add(Math.Pow(a.LowerBound, bUpper - 1));
237      powerValues.Add(Math.Pow(a.LowerBound, bLower));
238      powerValues.Add(Math.Pow(a.LowerBound, bLower + 1));
239
240      return new Interval(powerValues.Min(), powerValues.Max());
241    }
242
243    public static Interval Square(Interval a) {
244      if (a.UpperBound <= 0) return new Interval(a.UpperBound * a.UpperBound, a.LowerBound * a.LowerBound);     // interval is negative
245      else if (a.LowerBound >= 0) return new Interval(a.LowerBound * a.LowerBound, a.UpperBound * a.UpperBound); // interval is positive
246      else return new Interval(0, Math.Max(a.LowerBound*a.LowerBound, a.UpperBound*a.UpperBound)); // interval goes over zero
247    }
248
249    public static Interval Cube(Interval a) {
250      return new Interval(Math.Pow(a.LowerBound, 3), Math.Pow(a.UpperBound, 3));
251    }
252
253    public static Interval Root(Interval a, Interval b) {
254      int lower = (int)Math.Round(b.LowerBound);
255      int higher = (int)Math.Round(b.UpperBound);
256
257      return new Interval(Math.Pow(a.LowerBound, 1.0 / higher), Math.Pow(a.UpperBound, 1.0 / lower));
258    }
259
260    public static Interval SquareRoot(Interval a) {
261      if (a.LowerBound < 0) return new Interval(double.NaN, double.NaN);
262      return new Interval(Math.Sqrt(a.LowerBound), Math.Sqrt(a.UpperBound));
263    }
264
265    public static Interval CubicRoot(Interval a) {
266      if (a.LowerBound < 0) return new Interval(double.NaN, double.NaN);
267      return new Interval(Math.Pow(a.LowerBound, 1.0/3), Math.Pow(a.UpperBound, 1.0/3));
268    }
269    #endregion
270  }
271}
Note: See TracBrowser for help on using the repository browser.