[10278] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
| 3 | * Copyright (C) 2002-2014 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 |
|
---|
[10267] | 22 | using HeuristicLab.Common;
|
---|
| 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 25 |
|
---|
[15771] | 26 | namespace HeuristicLab.Problems.ProgramSynthesis {
|
---|
[10267] | 27 | [StorableClass]
|
---|
| 28 | [Item("GenealogyGraphArc", "A graph arc connecting two GenealogyGraphNodes and holding some data.")]
|
---|
[11925] | 29 | public class GenealogyGraphArc : Arc<IDeepCloneable>, IGenealogyGraphArc {
|
---|
[10267] | 30 | [StorableConstructor]
|
---|
| 31 | protected GenealogyGraphArc(bool deserializing) : base(deserializing) { }
|
---|
[10285] | 32 | protected GenealogyGraphArc(GenealogyGraphArc original, Cloner cloner)
|
---|
[10903] | 33 | : base(original, cloner) { }
|
---|
[10285] | 34 |
|
---|
[11233] | 35 | public GenealogyGraphArc(IGenealogyGraphNode source, IGenealogyGraphNode target)
|
---|
| 36 | : base(source, target) {
|
---|
[10886] | 37 | }
|
---|
| 38 |
|
---|
[10285] | 39 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 40 | return new GenealogyGraphArc(this, cloner);
|
---|
| 41 | }
|
---|
| 42 |
|
---|
[10293] | 43 | public new IGenealogyGraphNode Source {
|
---|
| 44 | get { return (IGenealogyGraphNode)base.Source; }
|
---|
| 45 | }
|
---|
[10285] | 46 |
|
---|
[10293] | 47 | public new IGenealogyGraphNode Target {
|
---|
| 48 | get { return (IGenealogyGraphNode)base.Target; }
|
---|
| 49 | }
|
---|
[10285] | 50 | }
|
---|
| 51 |
|
---|
| 52 | [StorableClass]
|
---|
| 53 | [Item("GenealogyGraphArc", "")]
|
---|
| 54 | public class GenealogyGraphArc<T> : GenealogyGraphArc where T : class,IItem {
|
---|
| 55 | [StorableConstructor]
|
---|
| 56 | protected GenealogyGraphArc(bool deserializing) : base(deserializing) { }
|
---|
[11925] | 57 |
|
---|
[11502] | 58 | protected GenealogyGraphArc(GenealogyGraphArc original, Cloner cloner)
|
---|
[10267] | 59 | : base(original, cloner) {
|
---|
| 60 | }
|
---|
[10285] | 61 |
|
---|
[10267] | 62 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 63 | return new GenealogyGraphArc<T>(this, cloner);
|
---|
| 64 | }
|
---|
[11925] | 65 |
|
---|
[10285] | 66 | public new T Data {
|
---|
[10293] | 67 | get { return (T)base.Data; }
|
---|
| 68 | set { base.Data = value; }
|
---|
[10285] | 69 | }
|
---|
[10267] | 70 | }
|
---|
| 71 | }
|
---|