source: branches/2520_PersistenceReintegration/HeuristicLab.Encodings.BinaryVectorEncoding/3.3/BinaryVectorEqualityComparer.cs @ 16474

Last change on this file since 16474 was 16474, checked in by gkronber, 9 months ago

#2520: checked and added StorableType attribute in projects up to HeuristicLab.MainForm

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