#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 System.Xml; using HeuristicLab.Core; using HeuristicLab.Data; namespace HeuristicLab.Constraints { /// /// Constraint where at least one sub-constraint must be true. /// public class OrConstraint : ConstraintBase, IViewable { private ItemList clauses; /// /// Gets or sets the sub-constraints. /// /// Calls of base class /// in the setter. public ItemList Clauses { get { return clauses; } set { clauses = value; OnChanged(); } } /// public override string Description { get { return "To return true, at least one subconstraint has to be true"; } } /// /// Initializes a new instance of . /// public OrConstraint() { clauses = new ItemList(); } /// /// Checks whether the given element fulfills the current constraint. /// /// The item to check. /// true if the constraint could be fulfilled, false otherwise. public override bool Check(IItem data) { bool result = false; for (int i = 0 ; i < clauses.Count ; i++) { result = clauses[i].Check(data); if (result) return true; } return result; } /// /// Creates a new instance of to represent the current /// instance visually. /// /// The created view as . public override IView CreateView() { return new OrConstraintView(this); } /// /// Clones the current instance (deep clone). /// /// Deep clone through method of helper class /// . /// Dictionary of all already clone objects. (Needed to avoid cycles.) /// The cloned object as . public override object Clone(IDictionary clonedObjects) { OrConstraint clone = new OrConstraint(); clonedObjects.Add(Guid, clone); clone.Clauses = (ItemList)Auxiliary.Clone(Clauses, clonedObjects); return clone; } #region persistence /// /// Saves the current instance as in the specified . /// /// The sub-constraints are saved as a child node with tag name /// Clauses. /// The (tag)name of the . /// The where the data is saved. /// The dictionary of all already persisted objects. /// (Needed to avoid cycles.) /// The saved . public override XmlNode GetXmlNode(string name, XmlDocument document, IDictionary persistedObjects) { XmlNode node = base.GetXmlNode(name, document, persistedObjects); XmlNode clausesNode = PersistenceManager.Persist("Clauses", Clauses, document, persistedObjects); node.AppendChild(clausesNode); return node; } /// /// Loads the persisted constraint from the specified . /// /// The constraint must be saved in a specific way, see for /// more information. /// The where the instance is saved. /// The dictionary of all already restored objects. /// (Needed to avoid cycles.) public override void Populate(XmlNode node, IDictionary restoredObjects) { base.Populate(node, restoredObjects); clauses = (ItemList)PersistenceManager.Restore(node.SelectSingleNode("Clauses"), restoredObjects); } #endregion persistence } }