| 1 | #region License Information
|
|---|
| 2 | /* HeuristicLab
|
|---|
| 3 | * Copyright (C) 2002-2012 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 |
|
|---|
| 22 | using System.Collections.Generic;
|
|---|
| 23 | using System.Linq;
|
|---|
| 24 | using HeuristicLab.Collections;
|
|---|
| 25 | using Microsoft.VisualStudio.TestTools.UnitTesting;
|
|---|
| 26 |
|
|---|
| 27 | namespace HeuristicLab.Collections_33.Tests {
|
|---|
| 28 | [TestClass]
|
|---|
| 29 | public class BidirectionalLookupTest {
|
|---|
| 30 | private class ComplexType {
|
|---|
| 31 | public readonly int Field;
|
|---|
| 32 | public ComplexType(int field) {
|
|---|
| 33 | Field = field;
|
|---|
| 34 | }
|
|---|
| 35 | }
|
|---|
| 36 |
|
|---|
| 37 | private class ComplexTypeEqualityComparer : EqualityComparer<ComplexType> {
|
|---|
| 38 | public override bool Equals(ComplexType x, ComplexType y) {
|
|---|
| 39 | return x.Field == y.Field;
|
|---|
| 40 | }
|
|---|
| 41 | public override int GetHashCode(ComplexType obj) {
|
|---|
| 42 | return obj.Field.GetHashCode();
|
|---|
| 43 | }
|
|---|
| 44 | }
|
|---|
| 45 |
|
|---|
| 46 | [TestMethod]
|
|---|
| 47 | public void TestBidirectionalLookup() {
|
|---|
| 48 | var lookup1 = new BidirectionalLookup<int, double>();
|
|---|
| 49 | lookup1.Add(4, 2);
|
|---|
| 50 | Assert.IsTrue(lookup1.ContainsFirst(4) && lookup1.ContainsSecond(2));
|
|---|
| 51 | lookup1.Add(4, 3);
|
|---|
| 52 | Assert.IsTrue(lookup1.GetByFirst(4).Count() == 2);
|
|---|
| 53 | Assert.IsTrue(lookup1.GetBySecond(2).Contains(4));
|
|---|
| 54 | Assert.IsTrue(lookup1.CountFirst == 1);
|
|---|
| 55 | Assert.IsTrue(lookup1.CountSecond == 2);
|
|---|
| 56 | lookup1.Add(3, 2);
|
|---|
| 57 | lookup1.Add(2, 2);
|
|---|
| 58 | lookup1.Add(1, 2);
|
|---|
| 59 | Assert.IsTrue(lookup1.GetByFirst(1).Single() == 2);
|
|---|
| 60 | Assert.IsTrue(lookup1.GetBySecond(2).Count() == 4);
|
|---|
| 61 | lookup1.RemovePair(2, 2);
|
|---|
| 62 | Assert.IsTrue(!lookup1.ContainsFirst(2));
|
|---|
| 63 | Assert.IsTrue(lookup1.GetBySecond(2).Count() == 3);
|
|---|
| 64 | lookup1.RemoveByFirst(4);
|
|---|
| 65 | Assert.IsTrue(lookup1.CountFirst == 2);
|
|---|
| 66 | Assert.IsTrue(lookup1.CountSecond == 1);
|
|---|
| 67 | lookup1.RemoveBySecond(2);
|
|---|
| 68 | Assert.IsTrue(lookup1.CountFirst == 0);
|
|---|
| 69 | Assert.IsTrue(lookup1.CountSecond == 0);
|
|---|
| 70 | lookup1.Clear();
|
|---|
| 71 | Assert.IsTrue(lookup1.CountFirst == 0);
|
|---|
| 72 | Assert.IsTrue(lookup1.CountSecond == 0);
|
|---|
| 73 |
|
|---|
| 74 | var dict2 = new BidirectionalLookup<ComplexType, int>(new ComplexTypeEqualityComparer());
|
|---|
| 75 | Assert.IsTrue(!dict2.FirstEnumerable.Any());
|
|---|
| 76 | dict2.Add(new ComplexType(1), 2);
|
|---|
| 77 | Assert.IsTrue(dict2.SecondEnumerable.Any());
|
|---|
| 78 | dict2.Add(new ComplexType(2), 1);
|
|---|
| 79 | Assert.IsTrue(dict2.ContainsFirst(new ComplexType(2)));
|
|---|
| 80 | Assert.IsTrue(dict2.ContainsSecond(2));
|
|---|
| 81 | dict2.Add(new ComplexType(2), 3);
|
|---|
| 82 | Assert.IsTrue(dict2.GetByFirst(new ComplexType(2)).Count() == 2);
|
|---|
| 83 | Assert.IsTrue(dict2.GetByFirst(new ComplexType(2)).Contains(1));
|
|---|
| 84 | Assert.IsTrue(dict2.GetByFirst(new ComplexType(2)).Contains(3));
|
|---|
| 85 | dict2.Add(new ComplexType(3), 1);
|
|---|
| 86 | Assert.IsTrue(dict2.GetBySecond(1).Count() == 2);
|
|---|
| 87 | Assert.IsTrue(dict2.GetBySecond(1).Any(x => x.Field == 2));
|
|---|
| 88 | Assert.IsTrue(dict2.GetBySecond(1).Any(x => x.Field == 3));
|
|---|
| 89 | Assert.IsTrue(dict2.CountFirst == 3);
|
|---|
| 90 | Assert.IsTrue(dict2.CountSecond == 3);
|
|---|
| 91 | dict2.Add(new ComplexType(2), 2);
|
|---|
| 92 | Assert.IsTrue(dict2.CountFirst == 3);
|
|---|
| 93 | Assert.IsTrue(dict2.CountSecond == 3);
|
|---|
| 94 | dict2.Add(new ComplexType(2), 4);
|
|---|
| 95 | Assert.IsTrue(dict2.CountFirst == 3);
|
|---|
| 96 | Assert.IsTrue(dict2.CountSecond == 4);
|
|---|
| 97 | dict2.RemoveByFirst(new ComplexType(2));
|
|---|
| 98 | Assert.IsTrue(dict2.CountFirst == 2);
|
|---|
| 99 | Assert.IsTrue(dict2.CountSecond == 2);
|
|---|
| 100 | dict2.RemovePair(new ComplexType(1), 1);
|
|---|
| 101 | Assert.IsTrue(dict2.CountFirst == 2);
|
|---|
| 102 | Assert.IsTrue(dict2.CountSecond == 2);
|
|---|
| 103 | dict2.RemovePair(new ComplexType(1), 2);
|
|---|
| 104 | Assert.IsTrue(dict2.CountFirst == 1);
|
|---|
| 105 | Assert.IsTrue(dict2.CountSecond == 1);
|
|---|
| 106 | dict2.Clear();
|
|---|
| 107 | Assert.IsTrue(!dict2.SecondEnumerable.Any());
|
|---|
| 108 | }
|
|---|
| 109 | }
|
|---|
| 110 | }
|
|---|
