Rev | Line | |
---|
[3032] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[14751] | 3 | * Copyright (C) 2002-2017 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[3032] | 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 |
|
---|
[14475] | 22 | namespace HeuristicLab.Encodings.LinearLinkageEncoding.Tests {
|
---|
[3032] | 23 | public static class Auxiliary {
|
---|
[14475] | 24 | public static bool LinearLinkageIsEqualByPosition(LinearLinkage p1, LinearLinkage p2) {
|
---|
[3032] | 25 | bool equal = (p1.Length == p2.Length);
|
---|
| 26 | if (equal) {
|
---|
| 27 | for (int i = 0; i < p1.Length; i++) {
|
---|
| 28 | if (!p1[i].Equals(p2[i])) {
|
---|
| 29 | equal = false;
|
---|
| 30 | break;
|
---|
| 31 | }
|
---|
| 32 | }
|
---|
| 33 | }
|
---|
| 34 | return equal;
|
---|
| 35 | }
|
---|
| 36 | }
|
---|
| 37 | }
|
---|
Note: See
TracBrowser
for help on using the repository browser.