source: branches/MemPRAlgorithm/HeuristicLab.Encodings.LinearLinkageEncoding/3.4/LinearLinkageEqualityComparer.cs @ 14544

Last change on this file since 14544 was 14544, checked in by abeham, 3 years ago

#2701:

  • LLE: Added equality comparer
  • MemPR:
    • Added GPR to learn about heuristic performance
    • Changed Breeding to do more exhaustive search on crossover
    • Added Delinking separately to Relinking
    • Rewrote d/relinking for LLE
    • Reduce usage of local search
    • Renamed TabuWalk to AdaptiveWalk
    • Rewrote adaptive walk for binary problems
    • Renamed LLE namespace to Grouping to avoid namespace clashes
File size: 1.5 KB
Line 
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
22using System.Collections.Generic;
23
24namespace HeuristicLab.Encodings.LinearLinkageEncoding {
25  public class LinearLinkageEqualityComparer : EqualityComparer<LinearLinkage> {
26    public override bool Equals(LinearLinkage x, LinearLinkage y) {
27      if (x == null && y == null) return true;
28      if (x == null || y == null) return false;
29      if (x.Length != y.Length) return false;
30      for (var i = 0; i < x.Length; i++)
31        if (x[i] != y[i]) return false;
32      return true;
33    }
34
35    public override int GetHashCode(LinearLinkage obj) {
36      unchecked {
37        int hash = 17;
38        foreach (var o in obj)
39          hash = hash * 31 + o.GetHashCode();
40        return hash;
41      }
42    }
43  }
44}
Note: See TracBrowser for help on using the repository browser.