Free cookie consent management tool by TermsFeed Policy Generator

source: branches/2839_HiveProjectManagement/HeuristicLab.Encodings.BinaryVectorEncoding/3.3/BinaryVectorEqualityComparer.cs @ 16713

Last change on this file since 16713 was 16057, checked in by jkarder, 6 years ago

#2839:

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