source: branches/3.0/sources/HeuristicLab.Functions/Not.cs @ 978

#region License Information
/* HeuristicLab
 * Copyright (C) 2002-2008 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
 *
 * This file is part of HeuristicLab.
 *
 * HeuristicLab is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * HeuristicLab is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
 */
#endregion

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using HeuristicLab.Constraints;
using HeuristicLab.DataAnalysis;

namespace HeuristicLab.Functions {
  public class Not : FunctionBase {
    public override string Description {
      get {
        return @"Logical NOT operation. Only defined for sub-operator-results 0.0 and 1.0.";
      }
    }

    public Not()
      : base() {
      AddConstraint(new NumberOfSubOperatorsConstraint(1, 1));
    }

    public Not(Not source, IDictionary<Guid, object> clonedObjects)
      : base(source, clonedObjects) {
    }


    public override double Evaluate(Dataset dataset, int sampleIndex) {
      double result = Math.Round(SubFunctions[0].Evaluate(dataset, sampleIndex));
      if(result == 0.0) return 1.0;
      else if(result == 1.0) return 0.0;
      else return double.NaN;
    }

    public override object Clone(IDictionary<Guid, object> clonedObjects) {
      Not clone = new Not(this, clonedObjects);
      clonedObjects.Add(clone.Guid, clone);
      return clone;
    }

    public override void Accept(IFunctionVisitor visitor) {
      visitor.Visit(this);
    }
  }
}