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