[3054] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
| 3 | * Copyright (C) 2002-2010 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 |
|
---|
[3376] | 22 | using HeuristicLab.Common;
|
---|
[3054] | 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Data;
|
---|
| 25 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 26 |
|
---|
| 27 | namespace HeuristicLab.Encodings.IntegerVectorEncoding {
|
---|
| 28 | [StorableClass]
|
---|
| 29 | [Item("IntegerVector", "Represents a vector of integer values.")]
|
---|
| 30 | public class IntegerVector : IntArray {
|
---|
| 31 | public IntegerVector() : base() { }
|
---|
| 32 | public IntegerVector(int length) : base(length) { }
|
---|
| 33 | public IntegerVector(int length, IRandom random, int min, int max)
|
---|
| 34 | : this(length) {
|
---|
| 35 | Randomize(random, min, max);
|
---|
| 36 | }
|
---|
| 37 | public IntegerVector(int[] elements) : base(elements) { }
|
---|
| 38 | public IntegerVector(IntArray elements)
|
---|
| 39 | : this(elements.Length) {
|
---|
| 40 | for (int i = 0; i < array.Length; i++)
|
---|
| 41 | array[i] = elements[i];
|
---|
| 42 | }
|
---|
| 43 |
|
---|
| 44 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 45 | IntegerVector clone = new IntegerVector(array);
|
---|
| 46 | cloner.RegisterClonedObject(this, clone);
|
---|
[3430] | 47 | clone.readOnly = readOnly;
|
---|
[3054] | 48 | return clone;
|
---|
| 49 | }
|
---|
| 50 |
|
---|
| 51 | public virtual void Randomize(IRandom random, int startIndex, int length, int min, int max) {
|
---|
| 52 | if (length > 0) {
|
---|
| 53 | for (int i = 0; i < length; i++)
|
---|
| 54 | array[startIndex + i] = random.Next(min, max);
|
---|
| 55 | OnReset();
|
---|
| 56 | }
|
---|
| 57 | }
|
---|
| 58 | public void Randomize(IRandom random, int min, int max) {
|
---|
| 59 | Randomize(random, 0, Length, min, max);
|
---|
| 60 | }
|
---|
| 61 | }
|
---|
| 62 | }
|
---|