Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Functions/And.cs @ 168

Last change on this file since 168 was 155, checked in by gkronber, 17 years ago

merged FunctionsAndStructIdRefactoring-branch (r142, r143, r144, r145, r146, r147, r148, r149, r152, r153) back into the trunk (ticket #112)

File size: 2.2 KB
Line 
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
22using System;
23using System.Collections.Generic;
24using System.Linq;
25using System.Text;
26using HeuristicLab.Constraints;
27using HeuristicLab.DataAnalysis;
28
29namespace HeuristicLab.Functions {
30  public class And : FunctionBase {
31    public override string Description {
32      get {
33        return @"Logical AND operation. Only defined for sub-tree-results 0.0 and 1.0.
34AND is a special form, sub-trees are evaluated from the first to the last. Evaluation is
35stopped as soon as one of the sub-trees evaluates to 0.0 (false).";
36      }
37    }
38
39    public And()
40      : base() {
41      AddConstraint(new NumberOfSubOperatorsConstraint(2, 3));
42    }
43
44    // special form
45    public override double Evaluate(Dataset dataset, int sampleIndex, IFunctionTree tree) {
46      foreach(IFunctionTree subTree in tree.SubTrees) {
47        double result = Math.Round(subTree.Evaluate(dataset, sampleIndex));
48        if(result == 0.0) return 0.0; // one sub-tree is 0.0 (false) => return false
49        else if(result != 1.0) return double.NaN;
50      }
51      // all sub-trees evaluated to 1.0 (true) => return 1.0 (true)
52      return 1.0;
53    }
54
55    public override double Apply(Dataset dataset, int sampleIndex, double[] args) {
56      throw new NotImplementedException();
57    }
58
59    public override void Accept(IFunctionVisitor visitor) {
60      visitor.Visit(this);
61    }
62  }
63}
Note: See TracBrowser for help on using the repository browser.