[8611] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[9456] | 3 | * Copyright (C) 2002-2013 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[8611] | 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;
|
---|
| 23 | using System.Collections.Generic;
|
---|
| 24 | using System.Linq;
|
---|
| 25 | using Microsoft.VisualStudio.TestTools.UnitTesting;
|
---|
| 26 |
|
---|
[9764] | 27 | namespace HeuristicLab.Collections.Tests {
|
---|
[8611] | 28 | [TestClass]
|
---|
| 29 | public class ObservableKeyedListTest {
|
---|
| 30 | private class IntKeyedList : ObservableKeyedList<int, int> {
|
---|
| 31 | protected override int GetKeyForItem(int item) {
|
---|
| 32 | return item;
|
---|
| 33 | }
|
---|
| 34 |
|
---|
| 35 | public new Dictionary<int, int> Dictionary {
|
---|
| 36 | get { return base.Dictionary; }
|
---|
| 37 | }
|
---|
| 38 | }
|
---|
| 39 |
|
---|
| 40 | [TestMethod]
|
---|
[9783] | 41 | [TestCategory("General")]
|
---|
| 42 | [TestProperty("Time", "short")]
|
---|
[8611] | 43 | public void KeyedListAddDuplicateItemTest() {
|
---|
| 44 | var list = new IntKeyedList();
|
---|
| 45 | var numbers = new List<int>() { 1, 2, 3 };
|
---|
| 46 | list.AddRange(numbers);
|
---|
| 47 |
|
---|
| 48 | Assert.IsTrue(list.SequenceEqual(numbers));
|
---|
| 49 | Assert.AreEqual(list.Count, 3);
|
---|
| 50 |
|
---|
| 51 | try {
|
---|
| 52 | list.Add(1);
|
---|
| 53 | }
|
---|
| 54 | catch (ArgumentException e) {
|
---|
| 55 | Assert.AreEqual(e.Message, "An element with the same key already exists.");
|
---|
| 56 | Assert.IsTrue(list.SequenceEqual(numbers));
|
---|
| 57 | Assert.IsTrue(numbers.All(list.ContainsKey));
|
---|
| 58 | }
|
---|
| 59 |
|
---|
| 60 | try {
|
---|
| 61 | list.AddRange(numbers);
|
---|
| 62 | }
|
---|
| 63 | catch (ArgumentException e) {
|
---|
| 64 | Assert.AreEqual(e.Message, "An element with the same key already exists.");
|
---|
| 65 | Assert.IsTrue(list.SequenceEqual(numbers));
|
---|
| 66 | Assert.IsTrue(numbers.All(list.ContainsKey));
|
---|
| 67 | }
|
---|
| 68 | }
|
---|
| 69 | }
|
---|
| 70 | }
|
---|