Free cookie consent management tool by TermsFeed Policy Generator

source: stable/HeuristicLab.Algorithms.ParameterlessPopulationPyramid/3.3/EnumerableBoolEqualityComparer.cs @ 12312

Last change on this file since 12312 was 12009, checked in by ascheibe, 10 years ago

#2212 updated copyright year

File size: 1.7 KB
RevLine 
[11667]1#region License Information
2/* HeuristicLab
[12009]3 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
[11667]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 System.Linq;
25
26namespace HeuristicLab.Algorithms.ParameterlessPopulationPyramid {
27  public class EnumerableBoolEqualityComparer : IEqualityComparer<IEnumerable<bool>> {
28    public bool Equals(IEnumerable<bool> first, IEnumerable<bool> second) {
29      return first.SequenceEqual(second);
30    }
31    public int GetHashCode(IEnumerable<bool> obj) {
32      int hash = 0;
33      int word = 1;
34      foreach (bool bit in obj) {
35        // load bits into an integer
36        word <<= 1;
37        word |= Convert.ToInt32(bit);
38        // only happens when the leading 1 reaches the sign bit
39        if (word < 0) {
40          // combine word into the hash
41          hash ^= word;
42          word = 1;
43        }
44      }
[11669]45      // combine in any remaining content
46      if (word > 1) {
47        hash ^= word;
48      }
[11667]49      return hash;
50    }
51  }
52}
Note: See TracBrowser for help on using the repository browser.