[2] | 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 |
|
---|
| 22 | using System;
|
---|
| 23 | using System.Collections.Generic;
|
---|
| 24 | using System.Text;
|
---|
| 25 | using System.Xml;
|
---|
| 26 | using HeuristicLab.Core;
|
---|
| 27 |
|
---|
| 28 | namespace HeuristicLab.Data {
|
---|
| 29 | public class ConstrainedObjectData : ConstrainedItemBase, IObjectData {
|
---|
| 30 | private object myData;
|
---|
| 31 | public virtual object Data {
|
---|
| 32 | get { return myData; }
|
---|
| 33 | set {
|
---|
| 34 | if (myData != value) {
|
---|
| 35 | myData = value;
|
---|
| 36 | OnChanged();
|
---|
| 37 | }
|
---|
| 38 | }
|
---|
| 39 | }
|
---|
| 40 |
|
---|
| 41 | public virtual bool TrySetData(object data) {
|
---|
| 42 | if (myData != data) {
|
---|
| 43 | object backup = myData;
|
---|
| 44 | myData = data;
|
---|
| 45 | if (IsValid()) {
|
---|
| 46 | OnChanged();
|
---|
| 47 | return true;
|
---|
| 48 | } else {
|
---|
| 49 | myData = backup;
|
---|
| 50 | return false;
|
---|
| 51 | }
|
---|
| 52 | }
|
---|
| 53 | return true;
|
---|
| 54 | }
|
---|
| 55 | public virtual bool TrySetData(object data, out ICollection<IConstraint> violatedConstraints) {
|
---|
| 56 | if (myData != data) {
|
---|
| 57 | object backup = myData;
|
---|
| 58 | myData = data;
|
---|
| 59 | if (IsValid(out violatedConstraints)) {
|
---|
| 60 | OnChanged();
|
---|
| 61 | return true;
|
---|
| 62 | } else {
|
---|
| 63 | myData = backup;
|
---|
| 64 | return false;
|
---|
| 65 | }
|
---|
| 66 | }
|
---|
| 67 | violatedConstraints = new List<IConstraint>();
|
---|
| 68 | return true;
|
---|
| 69 | }
|
---|
| 70 |
|
---|
| 71 | public override object Clone(IDictionary<Guid, object> clonedObjects) {
|
---|
| 72 | ConstrainedObjectData clone = (ConstrainedObjectData)base.Clone(clonedObjects);
|
---|
| 73 | if (Data is IStorable)
|
---|
| 74 | clone.myData = Auxiliary.Clone((IStorable)Data, clonedObjects);
|
---|
| 75 | else if (Data is ICloneable)
|
---|
| 76 | clone.myData = ((ICloneable)Data).Clone();
|
---|
| 77 | else
|
---|
| 78 | throw new InvalidOperationException("contained object is not cloneable");
|
---|
| 79 | return clone;
|
---|
| 80 | }
|
---|
| 81 |
|
---|
| 82 | public int CompareTo(object obj) {
|
---|
| 83 | IComparable comparable = Data as IComparable;
|
---|
| 84 | if (comparable != null) {
|
---|
| 85 | IObjectData other = obj as IObjectData;
|
---|
| 86 | if (other != null)
|
---|
| 87 | return comparable.CompareTo(other.Data);
|
---|
| 88 | else
|
---|
| 89 | return comparable.CompareTo(obj);
|
---|
| 90 | }
|
---|
| 91 | throw new InvalidOperationException("Cannot compare as contained object doesn't implement IComparable");
|
---|
| 92 | }
|
---|
| 93 |
|
---|
| 94 | public override string ToString() {
|
---|
| 95 | return Data.ToString();
|
---|
| 96 | }
|
---|
| 97 |
|
---|
| 98 | public virtual void Accept(IObjectDataVisitor visitor) {
|
---|
| 99 | visitor.Visit(this);
|
---|
| 100 | }
|
---|
| 101 | }
|
---|
| 102 | }
|
---|