[2] | 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 System.Diagnostics;
|
---|
| 27 | using HeuristicLab.Constraints;
|
---|
| 28 | using System.Linq;
|
---|
| 29 | using HeuristicLab.DataAnalysis;
|
---|
| 30 |
|
---|
| 31 | namespace HeuristicLab.Functions {
|
---|
| 32 | public class Division : FunctionBase {
|
---|
| 33 | private const double EPSILON = 10.0E-20; // if any divisor is < EPSILON return 0
|
---|
| 34 |
|
---|
| 35 | public override string Description {
|
---|
| 36 | get {
|
---|
| 37 | return @"Protected division
|
---|
| 38 | Divides the result of the first sub-operator by the results of the following sub-operators.
|
---|
| 39 | In case one of the divisors is 0 returns 0.
|
---|
| 40 | (/ 3) => 1/3
|
---|
| 41 | (/ 2 3) => 2/3
|
---|
| 42 | (/ 3 4 5) => 3/20
|
---|
| 43 | (/ 2 0 4) => 0
|
---|
| 44 | ";
|
---|
| 45 | }
|
---|
| 46 | }
|
---|
| 47 |
|
---|
| 48 | public Division()
|
---|
| 49 | : base() {
|
---|
| 50 |
|
---|
| 51 | // 2 - 3 seems like an reasonable defaut (used for +,-,*,/) (discussion with swinkler and maffenze)
|
---|
| 52 | AddConstraint(new NumberOfSubOperatorsConstraint(2, 3));
|
---|
| 53 | }
|
---|
| 54 |
|
---|
| 55 | public Division(Division source, IDictionary<Guid, object> clonedObjects)
|
---|
| 56 | : base(source, clonedObjects) {
|
---|
| 57 | }
|
---|
| 58 |
|
---|
| 59 | public override double Evaluate(Dataset dataset, int sampleIndex) {
|
---|
| 60 | // (/ 3) => 1/3
|
---|
| 61 | // (/ 2 3) => 2/3
|
---|
| 62 | // (/ 3 4 5) => 3/20
|
---|
| 63 |
|
---|
| 64 | if(SubFunctions.Count == 1) {
|
---|
| 65 | double divisor = SubFunctions[0].Evaluate(dataset, sampleIndex);
|
---|
| 66 | if(Math.Abs(divisor) < EPSILON) return 0;
|
---|
| 67 | else return 1.0 / divisor;
|
---|
| 68 | } else {
|
---|
| 69 | double result = SubFunctions[0].Evaluate(dataset, sampleIndex);
|
---|
| 70 | for(int i = 1; i < SubFunctions.Count; i++) {
|
---|
| 71 | double divisor = SubFunctions[i].Evaluate(dataset, sampleIndex);
|
---|
| 72 | if(Math.Abs(divisor) < EPSILON) return 0.0;
|
---|
| 73 | result /= divisor;
|
---|
| 74 | }
|
---|
| 75 | return result;
|
---|
| 76 | }
|
---|
| 77 | }
|
---|
| 78 |
|
---|
| 79 | public override object Clone(IDictionary<Guid, object> clonedObjects) {
|
---|
| 80 | Division clone = new Division(this, clonedObjects);
|
---|
| 81 | clonedObjects.Add(clone.Guid, clone);
|
---|
| 82 | return clone;
|
---|
| 83 | }
|
---|
| 84 |
|
---|
| 85 | public override void Accept(IFunctionVisitor visitor) {
|
---|
| 86 | visitor.Visit(this);
|
---|
| 87 | }
|
---|
| 88 | }
|
---|
| 89 | }
|
---|