1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2008 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 |
|
---|
22 | using System;
|
---|
23 | using System.Collections.Generic;
|
---|
24 | using System.Text;
|
---|
25 | using HeuristicLab.Core;
|
---|
26 | using HeuristicLab.Data;
|
---|
27 |
|
---|
28 | namespace HeuristicLab.RealVector {
|
---|
29 | public class BoundsChecker : OperatorBase {
|
---|
30 | public override string Description {
|
---|
31 | get { return "Checks if all elements of a real vector are inside a given minimum and maximum value. If not, elements are corrected."; }
|
---|
32 | }
|
---|
33 |
|
---|
34 | public BoundsChecker()
|
---|
35 | : base() {
|
---|
36 | AddVariableInfo(new VariableInfo("RealVector", "Real vector to check", typeof(DoubleArrayData), VariableKind.In | VariableKind.Out));
|
---|
37 | AddVariableInfo(new VariableInfo("Minimum", "Minimum value of each vector element (included).", typeof(DoubleData), VariableKind.In));
|
---|
38 | AddVariableInfo(new VariableInfo("Maximum", "Maximum value of each vector element (included).", typeof(DoubleData), VariableKind.In));
|
---|
39 | }
|
---|
40 |
|
---|
41 | public static double[] Apply(double min, double max, double[] vector) {
|
---|
42 | int length = vector.Length;
|
---|
43 | double[] result = (double[])vector.Clone();
|
---|
44 |
|
---|
45 | for (int i = 0; i < length; i++) {
|
---|
46 | if (result[i] < min) result[i] = min;
|
---|
47 | if (result[i] > max) result[i] = max;
|
---|
48 | }
|
---|
49 | return result;
|
---|
50 | }
|
---|
51 |
|
---|
52 | public override IOperation Apply(IScope scope) {
|
---|
53 | DoubleArrayData vector = GetVariableValue<DoubleArrayData>("RealVector", scope, false);
|
---|
54 | double min = GetVariableValue<DoubleData>("Minimum", scope, true).Data;
|
---|
55 | double max = GetVariableValue<DoubleData>("Maximum", scope, true).Data;
|
---|
56 | vector.Data = Apply(min, max, vector.Data);
|
---|
57 | return null;
|
---|
58 | }
|
---|
59 | }
|
---|
60 | }
|
---|