Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/HeuristicLab.Encodings.RealVectorEncoding/3.3/RealVector.cs @ 17330

Last change on this file since 17330 was 17180, checked in by swagner, 5 years ago

#2875: Removed years in copyrights

File size: 3.2 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 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 HeuristicLab.Common;
24using HeuristicLab.Core;
25using HeuristicLab.Data;
26using HEAL.Attic;
27
28namespace HeuristicLab.Encodings.RealVectorEncoding {
29  [StorableType("C4213FB3-77C3-4814-A7A3-0151B0FF5270")]
30  [Item("RealVector", "Represents a vector of real values.")]
31  public class RealVector : DoubleArray {
32    [StorableConstructor]
33    protected RealVector(StorableConstructorFlag _) : base(_) { }
34    protected RealVector(RealVector original, Cloner cloner) : base(original, cloner) { }
35    public RealVector() : base() { }
36    public RealVector(int length) : base(length) { }
37    public RealVector(int length, IRandom random, double min, double max)
38      : this(length) {
39      Randomize(random, min, max);
40    }
41    public RealVector(double[] elements) : base(elements) { }
42    public RealVector(DoubleArray elements)
43      : this(elements.Length) {
44      for (int i = 0; i < array.Length; i++)
45        array[i] = elements[i];
46    }
47    public RealVector(RealVector other) : this(other.array) { }
48
49    public override IDeepCloneable Clone(Cloner cloner) {
50      return new RealVector(this, cloner);
51    }
52
53    public virtual void Randomize(IRandom random, int startIndex, int length, double min, double max) {
54      double delta = max - min;
55      if (length > 0) {
56        for (int i = 0; i < length; i++)
57          array[startIndex + i] = min + delta * random.NextDouble();
58        OnReset();
59      }
60    }
61
62    public virtual void Randomize(IRandom random, int startIndex, int length, DoubleMatrix bounds) {
63      if (length > 0) {
64        for (int i = startIndex; i < startIndex + length; i++) {
65          double min = bounds[i % bounds.Rows, 0];
66          double max = bounds[i % bounds.Rows, 1];
67          array[i] = min + (max - min) * random.NextDouble();
68        }
69        OnReset();
70      }
71    }
72
73    public void Randomize(IRandom random, double min, double max) {
74      Randomize(random, 0, Length, min, max);
75    }
76
77    public void Randomize(IRandom random, DoubleMatrix bounds) {
78      Randomize(random, 0, Length, bounds);
79    }
80
81    public double DotProduct(RealVector other) {
82      if (other.Length != Length) throw new ArgumentException("Vectors are of unequal length.");
83      var dotProd = 0.0;
84      for (var i = 0; i < Length; i++)
85        dotProd += this[i] * other[i];
86      return dotProd;
87    }
88  }
89}
Note: See TracBrowser for help on using the repository browser.