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 | using HeuristicLab.Data;
|
---|
28 |
|
---|
29 | namespace HeuristicLab.Constraints {
|
---|
30 | public class AndConstraint : ConstraintBase, IViewable {
|
---|
31 | private ItemList<IConstraint> clauses;
|
---|
32 | public ItemList<IConstraint> Clauses {
|
---|
33 | get { return clauses; }
|
---|
34 | set {
|
---|
35 | clauses = value;
|
---|
36 | OnChanged();
|
---|
37 | }
|
---|
38 | }
|
---|
39 |
|
---|
40 | public override string Description {
|
---|
41 | get {
|
---|
42 | return "To return true, all subconstraints have to be true";
|
---|
43 | }
|
---|
44 | }
|
---|
45 |
|
---|
46 | public AndConstraint() {
|
---|
47 | clauses = new ItemList<IConstraint>();
|
---|
48 | }
|
---|
49 |
|
---|
50 | public override bool Check(IItem data) {
|
---|
51 | bool result = true;
|
---|
52 | for (int i = 0 ; i < clauses.Count ; i++) {
|
---|
53 | result = clauses[i].Check(data);
|
---|
54 | if (!result) return false;
|
---|
55 | }
|
---|
56 | return result;
|
---|
57 | }
|
---|
58 |
|
---|
59 | public override IView CreateView() {
|
---|
60 | return new AndConstraintView(this);
|
---|
61 | }
|
---|
62 |
|
---|
63 | public override object Clone(IDictionary<Guid, object> clonedObjects) {
|
---|
64 | AndConstraint clone = new AndConstraint();
|
---|
65 | clonedObjects.Add(Guid, clone);
|
---|
66 | clone.Clauses = (ItemList<IConstraint>)Auxiliary.Clone(Clauses, clonedObjects);
|
---|
67 | return clone;
|
---|
68 | }
|
---|
69 |
|
---|
70 | public override void Accept(IConstraintVisitor visitor) {
|
---|
71 | visitor.Visit(this);
|
---|
72 | }
|
---|
73 |
|
---|
74 | #region persistence
|
---|
75 | public override XmlNode GetXmlNode(string name, XmlDocument document, IDictionary<Guid,IStorable> persistedObjects) {
|
---|
76 | XmlNode node = base.GetXmlNode(name, document, persistedObjects);
|
---|
77 | XmlNode clausesNode = PersistenceManager.Persist("Clauses", Clauses, document, persistedObjects);
|
---|
78 | node.AppendChild(clausesNode);
|
---|
79 |
|
---|
80 | return node;
|
---|
81 | }
|
---|
82 |
|
---|
83 | public override void Populate(XmlNode node, IDictionary<Guid,IStorable> restoredObjects) {
|
---|
84 | base.Populate(node, restoredObjects);
|
---|
85 | clauses = (ItemList<IConstraint>)PersistenceManager.Restore(node.SelectSingleNode("Clauses"), restoredObjects);
|
---|
86 | }
|
---|
87 | #endregion persistence
|
---|
88 | }
|
---|
89 | }
|
---|