[2653] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[12009] | 3 | * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[2653] | 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.Collections.Generic;
|
---|
[2757] | 23 | using System.Linq;
|
---|
[3376] | 24 | using HeuristicLab.Common;
|
---|
[2653] | 25 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 26 |
|
---|
| 27 | namespace HeuristicLab.Core {
|
---|
[3017] | 28 | [StorableClass]
|
---|
[3385] | 29 | public sealed class OperationCollection : DeepCloneable, IList<IOperation>, IOperation {
|
---|
[2653] | 30 | [Storable]
|
---|
[2834] | 31 | private IList<IOperation> operations;
|
---|
[2653] | 32 |
|
---|
| 33 | [Storable]
|
---|
| 34 | private bool parallel;
|
---|
| 35 | public bool Parallel {
|
---|
| 36 | get { return parallel; }
|
---|
| 37 | set { parallel = value; }
|
---|
| 38 | }
|
---|
| 39 |
|
---|
[4722] | 40 | [StorableConstructor]
|
---|
| 41 | private OperationCollection(bool deserializing) { }
|
---|
| 42 | private OperationCollection(OperationCollection original, Cloner cloner)
|
---|
| 43 | : base(original, cloner) {
|
---|
| 44 | operations = new List<IOperation>(original.Select(x => cloner.Clone(x)));
|
---|
| 45 | parallel = original.parallel;
|
---|
| 46 | }
|
---|
[2834] | 47 | public OperationCollection() {
|
---|
| 48 | operations = new List<IOperation>();
|
---|
[2653] | 49 | parallel = false;
|
---|
| 50 | }
|
---|
[2834] | 51 | public OperationCollection(IEnumerable<IOperation> collection) {
|
---|
| 52 | operations = new List<IOperation>(collection.Where(e => e != null));
|
---|
[2653] | 53 | parallel = false;
|
---|
| 54 | }
|
---|
[2834] | 55 | public OperationCollection(params IOperation[] list) {
|
---|
| 56 | operations = new List<IOperation>(list.Where(e => e != null));
|
---|
[2653] | 57 | parallel = false;
|
---|
| 58 | }
|
---|
| 59 |
|
---|
[3385] | 60 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
[4722] | 61 | return new OperationCollection(this, cloner);
|
---|
[2653] | 62 | }
|
---|
| 63 |
|
---|
[2834] | 64 | #region IList<IOperation> Members
|
---|
| 65 | public int IndexOf(IOperation item) {
|
---|
| 66 | return operations.IndexOf(item);
|
---|
[2653] | 67 | }
|
---|
[2834] | 68 | public void Insert(int index, IOperation item) {
|
---|
| 69 | if (item != null) operations.Insert(index, item);
|
---|
[2653] | 70 | }
|
---|
| 71 | public void RemoveAt(int index) {
|
---|
[2834] | 72 | operations.RemoveAt(index);
|
---|
[2653] | 73 | }
|
---|
[2834] | 74 | public IOperation this[int index] {
|
---|
| 75 | get { return operations[index]; }
|
---|
| 76 | set { if (value != null) operations[index] = value; }
|
---|
[2653] | 77 | }
|
---|
| 78 | #endregion
|
---|
| 79 |
|
---|
[2834] | 80 | #region ICollection<IOperation> Members
|
---|
| 81 | public void Add(IOperation item) {
|
---|
| 82 | if (item != null) operations.Add(item);
|
---|
[2653] | 83 | }
|
---|
| 84 | public void Clear() {
|
---|
[2834] | 85 | operations.Clear();
|
---|
[2653] | 86 | }
|
---|
[2834] | 87 | public bool Contains(IOperation item) {
|
---|
| 88 | return operations.Contains(item);
|
---|
[2653] | 89 | }
|
---|
[2834] | 90 | public void CopyTo(IOperation[] array, int arrayIndex) {
|
---|
| 91 | operations.CopyTo(array, arrayIndex);
|
---|
[2653] | 92 | }
|
---|
| 93 | public int Count {
|
---|
[2834] | 94 | get { return operations.Count; }
|
---|
[2653] | 95 | }
|
---|
| 96 | public bool IsReadOnly {
|
---|
[2834] | 97 | get { return operations.IsReadOnly; }
|
---|
[2653] | 98 | }
|
---|
[2834] | 99 | public bool Remove(IOperation item) {
|
---|
| 100 | return operations.Remove(item);
|
---|
[2653] | 101 | }
|
---|
| 102 | #endregion
|
---|
| 103 |
|
---|
[2834] | 104 | #region IEnumerable<IOperation> Members
|
---|
| 105 | public IEnumerator<IOperation> GetEnumerator() {
|
---|
| 106 | return operations.GetEnumerator();
|
---|
[2653] | 107 | }
|
---|
| 108 | #endregion
|
---|
| 109 |
|
---|
| 110 | #region IEnumerable Members
|
---|
| 111 | System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator() {
|
---|
[2834] | 112 | return operations.GetEnumerator();
|
---|
[2653] | 113 | }
|
---|
| 114 | #endregion
|
---|
| 115 | }
|
---|
| 116 | }
|
---|