#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 an integer value is limited by a one or two sided boundary. /// public class IntBoundedConstraint : ConstraintBase { private int lowerBound; /// /// Gets or sets the lower bound of the limit. /// /// Calls of base class /// in the setter. public int LowerBound { get { return lowerBound; } set { lowerBound = value; OnChanged(); } } private bool lowerBoundIncluded; /// /// Gets or sets the boolean flag whether the lower bound should be included. /// /// Calls of base class /// in the setter. public bool LowerBoundIncluded { get { return lowerBoundIncluded; } set { lowerBoundIncluded = value; OnChanged(); } } private bool lowerBoundEnabled; /// /// Gets or sets the boolean flag whether the lower bound should be enabled. /// /// Calls of base class /// in the setter. public bool LowerBoundEnabled { get { return lowerBoundEnabled; } set { lowerBoundEnabled = value; OnChanged(); } } private int upperBound; /// /// Gets or sets the upper bound of the limit. /// /// Calls of base class /// in the setter. public int UpperBound { get { return upperBound; } set { upperBound = value; OnChanged(); } } private bool upperBoundIncluded; /// /// Gets or sets the boolean flag whether the upper bound should be included. /// /// Calls of base class /// in the setter. public bool UpperBoundIncluded { get { return upperBoundIncluded; } set { upperBoundIncluded = value; OnChanged(); } } private bool upperBoundEnabled; /// /// Gets or sets the boolean flag whether the upper bound should be enabled. /// /// Calls of base class /// in the setter. public bool UpperBoundEnabled { get { return upperBoundEnabled; } set { upperBoundEnabled = value; OnChanged(); } } /// public override string Description { get { return "The integer is limited one or two sided by a lower and/or upper boundary"; } } /// /// Initializes a new instance of . /// public IntBoundedConstraint() : this(int.MinValue, int.MaxValue) { } /// /// Initializes a new instance of with the two given boundaries. /// /// The lower bound of the constraint. /// The upper bound of the constraint. public IntBoundedConstraint(int low, int high) : base() { lowerBound = low; lowerBoundIncluded = false; lowerBoundEnabled = true; upperBound = high; upperBoundIncluded = false; upperBoundEnabled = true; } /// /// 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) { ConstrainedIntData d = (data as ConstrainedIntData); if (d == null) return false; if (LowerBoundEnabled && ((LowerBoundIncluded && d.CompareTo(LowerBound) < 0) || (!LowerBoundIncluded && d.CompareTo(LowerBound) <= 0))) return false; if (UpperBoundEnabled && ((UpperBoundIncluded && d.CompareTo(UpperBound) > 0) || (!UpperBoundIncluded && d.CompareTo(UpperBound) >= 0))) return false; return true; } /// /// Creates a new instance of to represent the current /// instance visually. /// /// The created view as . public override IView CreateView() { return new IntBoundedConstraintView(this); } /// /// Clones the current instance (deep clone). /// /// Dictionary of all already clone objects. (Needed to avoid cycles.) /// The cloned object as . public override object Clone(IDictionary clonedObjects) { IntBoundedConstraint clone = new IntBoundedConstraint(); clonedObjects.Add(Guid, clone); clone.upperBound = UpperBound; clone.upperBoundIncluded = UpperBoundIncluded; clone.upperBoundEnabled = UpperBoundEnabled; clone.lowerBound = LowerBound; clone.lowerBoundIncluded = LowerBoundIncluded; clone.lowerBoundEnabled = LowerBoundEnabled; return clone; } #region persistence /// /// Saves the current instance as in the specified . /// /// The properties of the current instance are saved as attributes with special tag names. /// 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); XmlAttribute lb = document.CreateAttribute("LowerBound"); lb.Value = LowerBound + ""; XmlAttribute lbi = document.CreateAttribute("LowerBoundIncluded"); lbi.Value = lowerBoundIncluded + ""; XmlAttribute lbe = document.CreateAttribute("LowerBoundEnabled"); lbe.Value = lowerBoundEnabled + ""; XmlAttribute ub = document.CreateAttribute("UpperBound"); ub.Value = upperBound + ""; XmlAttribute ubi = document.CreateAttribute("UpperBoundIncluded"); ubi.Value = upperBoundIncluded + ""; XmlAttribute ube = document.CreateAttribute("UpperBoundEnabled"); ube.Value = upperBoundEnabled + ""; node.Attributes.Append(lb); if (!lowerBoundIncluded) node.Attributes.Append(lbi); if (!lowerBoundEnabled) node.Attributes.Append(lbe); node.Attributes.Append(ub); if (!upperBoundIncluded) node.Attributes.Append(ubi); if (!upperBoundEnabled) node.Attributes.Append(ube); 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); lowerBound = int.Parse(node.Attributes["LowerBound"].Value); if (node.Attributes["LowerBoundIncluded"] != null) { lowerBoundIncluded = bool.Parse(node.Attributes["LowerBoundIncluded"].Value); } else { lowerBoundIncluded = true; } if (node.Attributes["LowerBoundEnabled"] != null) { lowerBoundEnabled = bool.Parse(node.Attributes["LowerBoundEnabled"].Value); } else { lowerBoundEnabled = true; } upperBound = int.Parse(node.Attributes["UpperBound"].Value); if (node.Attributes["UpperBoundIncluded"] != null) { upperBoundIncluded = bool.Parse(node.Attributes["UpperBoundIncluded"].Value); } else { upperBoundIncluded = true; } if (node.Attributes["UpperBoundEnabled"] != null) { upperBoundEnabled = bool.Parse(node.Attributes["UpperBoundEnabled"].Value); } else { upperBoundEnabled = true; } } #endregion } }