#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 . */ #endregion using System; using System.Collections.Generic; using System.Text; using HeuristicLab.Core; using HeuristicLab.Data; namespace HeuristicLab.Operators { public class ConditionalBranch : OperatorBase { public override string Description { get { return @"ConditionalBranch expects to have 1 or 2 sub-operators. It will return the 1st sub-operator if ""Condition"" is true and the 2nd sub-operator if ""Condition"" equals to false. In case a 2nd sub-operator does not exist and ""Condition"" would equal to false, Conditional Branch will not return a new operation."; } } public ConditionalBranch() : base() { AddVariableInfo(new VariableInfo("Condition", "A boolean variable that decides the branch", typeof(BoolData), VariableKind.In)); } public override IOperation Apply(IScope scope) { BoolData resultData = GetVariableValue("Condition", scope, true); bool result = resultData.Data; if ((result) && (SubOperators.Count > 0) && (SubOperators[0] != null)) return new AtomicOperation(SubOperators[0], scope); else if ((!result) && (SubOperators.Count > 1) && (SubOperators[1] != null)) return new AtomicOperation(SubOperators[1], scope); return null; } } }