Free cookie consent management tool by TermsFeed Policy Generator

source: branches/GpPluginsRefactoringBranch/HeuristicLab.Functions/Exponential.cs @ 644

Last change on this file since 644 was 434, checked in by gkronber, 16 years ago

added creation of empty SubOperatorTypeConstraints for each input of each function (#163)

File size: 1.6 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.Core;
26using System.Diagnostics;
27using HeuristicLab.Constraints;
28using HeuristicLab.DataAnalysis;
29
30namespace HeuristicLab.Functions {
31  public sealed class Exponential : FunctionBase {
32    public override string Description {
33      get { return "Returns returns exponential of the first sub-tree (power(e, x))."; }
34    }
35
36    public Exponential()
37      : base() {
38      // must have exactly one sub-operator
39      AddConstraint(new NumberOfSubOperatorsConstraint(1, 1));
40      AddConstraint(new SubOperatorTypeConstraint(0));
41    }
42
43    public override void Accept(IFunctionVisitor visitor) {
44      visitor.Visit(this);
45    }
46  }
47}
Note: See TracBrowser for help on using the repository browser.