[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.Linq;
|
---|
| 25 | using System.Text;
|
---|
| 26 | using HeuristicLab.Constraints;
|
---|
| 27 | using HeuristicLab.DataAnalysis;
|
---|
| 28 |
|
---|
| 29 | namespace HeuristicLab.Functions {
|
---|
| 30 | public class Or : FunctionBase {
|
---|
| 31 | public override string Description {
|
---|
| 32 | get {
|
---|
[155] | 33 | return @"Logical OR operation. Only defined for sub-tree-results 0.0 and 1.0.
|
---|
| 34 | Special form, evaluation stops at first sub-tree that evaluates to 1.0 (true).";
|
---|
[2] | 35 | }
|
---|
| 36 | }
|
---|
| 37 |
|
---|
| 38 | public Or()
|
---|
| 39 | : base() {
|
---|
| 40 | AddConstraint(new NumberOfSubOperatorsConstraint(2, 3));
|
---|
| 41 | }
|
---|
| 42 |
|
---|
[155] | 43 | public override double Evaluate(Dataset dataset, int sampleIndex, IFunctionTree tree) {
|
---|
| 44 | foreach(IFunctionTree subTree in tree.SubTrees) {
|
---|
| 45 | double result = Math.Round(subTree.Evaluate(dataset, sampleIndex));
|
---|
| 46 | if(result == 1.0) return 1.0; // sub-tree evaluates to 1.0 (true) return 1.0
|
---|
[2] | 47 | else if(result != 0.0) return double.NaN;
|
---|
| 48 | }
|
---|
[155] | 49 | // all sub-trees evaluated to 0.0 (false) return false
|
---|
[2] | 50 | return 0.0;
|
---|
| 51 | }
|
---|
| 52 |
|
---|
[155] | 53 | public override double Apply(Dataset dataset, int sampleIndex, double[] args) {
|
---|
| 54 | throw new NotImplementedException();
|
---|
[2] | 55 | }
|
---|
| 56 | public override void Accept(IFunctionVisitor visitor) {
|
---|
| 57 | visitor.Visit(this);
|
---|
| 58 | }
|
---|
| 59 | }
|
---|
| 60 | }
|
---|