Free cookie consent management tool by TermsFeed Policy Generator

source: branches/2913_MatlabScriptProblemInstanceProvider/HeuristicLab.Encodings.BinaryVectorEncoding/3.3/BinaryVectorEqualityComparer.cs @ 15888

Last change on this file since 15888 was 15583, checked in by swagner, 7 years ago

#2640: Updated year of copyrights in license headers

File size: 1.8 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2018 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;
23using System.Collections.Generic;
24using HeuristicLab.PluginInfrastructure;
25
26namespace HeuristicLab.Encodings.BinaryVectorEncoding {
27  [NonDiscoverableType]
28  public class BinaryVectorEqualityComparer : EqualityComparer<BinaryVector> {
29    public override bool Equals(BinaryVector x, BinaryVector y) {
30      if (ReferenceEquals(x, y)) return true;
31      if (x == null || y == null) return false;
32      if (x.Length != y.Length) return false;
33      for (var i = 0; i < x.Length; i++)
34        if (x[i] != y[i]) return false;
35      return true;
36    }
37
38    public override int GetHashCode(BinaryVector obj) {
39      if (obj == null) throw new ArgumentNullException("obj", "BinaryVectorEqualityComparer: Cannot compute hash value of null.");
40      unchecked {
41        int hash = 17;
42        foreach (var bit in obj)
43          hash = hash * 29 + (bit ? 1231 : 1237);
44        return hash;
45      }
46    }
47  }
48}
Note: See TracBrowser for help on using the repository browser.