Free cookie consent management tool by TermsFeed Policy Generator

source: branches/FunctionsAndStructIdRefactoring/HeuristicLab.Functions/FunctionBase.cs @ 153

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

minor performance tuning #112

File size: 3.5 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.Text;
25using HeuristicLab.Data;
26using HeuristicLab.Core;
27using System.Xml;
28using HeuristicLab.DataAnalysis;
29
30namespace HeuristicLab.Functions {
31  /// <summary>
32  /// Functions are like operators except that they do not allow sub-operators and the normal form of evaluation
33  /// is to evaluate all children first.
34  /// </summary>
35  public abstract class FunctionBase : OperatorBase, IFunction {
36   
37    public virtual double Evaluate(Dataset dataset, int sampleIndex, IFunctionTree tree) {
38      if(tree.SubTrees.Count > 0) {
39        double[] evaluationResults = new double[tree.SubTrees.Count];
40        for(int i = 0; i < evaluationResults.Length; i++) {
41          evaluationResults[i] = tree.SubTrees[i].Evaluate(dataset, sampleIndex);
42        }
43        return Apply(dataset, sampleIndex, evaluationResults);
44      } else {
45        return Apply(dataset, sampleIndex, null);
46      }
47    }
48
49    public abstract double Apply(Dataset dataset, int sampleIndex, double[] args);
50
51    // operator-tree style evaluation is not supported for functions.
52    public override IOperation Apply(IScope scope) {
53      throw new NotSupportedException();
54    }
55    public virtual void Accept(IFunctionVisitor visitor) {
56      visitor.Visit(this);
57    }
58
59    private static readonly List<IOperator> emptySubOperatorList = new List<IOperator>();
60    public override IList<IOperator> SubOperators {
61      get { return emptySubOperatorList; }
62    }
63
64    public override void AddSubOperator(IOperator subOperator) {
65      throw new NotSupportedException();
66    }
67
68    public override bool TryAddSubOperator(IOperator subOperator) {
69      throw new NotSupportedException();
70    }
71
72    public override bool TryAddSubOperator(IOperator subOperator, int index) {
73      throw new NotSupportedException();
74    }
75
76    public override bool TryAddSubOperator(IOperator subOperator, int index, out ICollection<IConstraint> violatedConstraints) {
77      throw new NotSupportedException();
78    }
79
80    public override bool TryAddSubOperator(IOperator subOperator, out ICollection<IConstraint> violatedConstraints) {
81      throw new NotSupportedException();
82    }
83
84    public override void AddSubOperator(IOperator subOperator, int index) {
85      throw new NotSupportedException();
86    }
87
88    public override void RemoveSubOperator(int index) {
89      throw new NotSupportedException();
90    }
91
92    public override bool TryRemoveSubOperator(int index) {
93      throw new NotSupportedException();
94    }
95
96    public override bool TryRemoveSubOperator(int index, out ICollection<IConstraint> violatedConstraints) {
97      throw new NotSupportedException();
98    }
99  }
100}
Note: See TracBrowser for help on using the repository browser.