source: branches/2520_PersistenceReintegration/HeuristicLab.Problems.NK/3.3/BinaryVectorComparers/LexicographicBinaryVectorComparer.cs @ 16453

Last change on this file since 16453 was 16453, checked in by jkarder, 2 years ago

#2520: updated year of copyrights

File size: 2.1 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 HeuristicLab.Common;
24using HeuristicLab.Core;
25using HeuristicLab.Encodings.BinaryVectorEncoding;
26using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
27
28namespace HeuristicLab.Problems.NK {
29  [Item("Lexicographic Binary Vector Comparer", "Compares two binary vectors lexicographically")]
30  [StorableClass]
31  public sealed class LexicographicBinaryVectorComparer : Item, IBinaryVectorComparer {
32    [StorableConstructor]
33    private LexicographicBinaryVectorComparer(bool deserializing) : base(deserializing) { }
34    private LexicographicBinaryVectorComparer(LexicographicBinaryVectorComparer original, Cloner cloner)
35      : base(original, cloner) { }
36    public LexicographicBinaryVectorComparer() { }
37    public override IDeepCloneable Clone(Cloner cloner) {
38      return new LexicographicBinaryVectorComparer(this, cloner);
39    }
40
41    public int Compare(BinaryVector x, BinaryVector y) {
42      for (int i = 0; i < Math.Min(x.Length, y.Length); i++) {
43        if (!x[i] && y[i])
44          return -1;
45        if (x[i] && !y[i])
46          return 1;
47      }
48      if (x.Length > y.Length)
49        return 1;
50      if (x.Length < y.Length)
51        return -1;
52      return 0;
53    }
54  }
55}
Note: See TracBrowser for help on using the repository browser.