[2424] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[2790] | 3 | * Copyright (C) 2002-2010 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[2424] | 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 | using System;
|
---|
| 22 | using System.Collections.Generic;
|
---|
| 23 | using System.Linq;
|
---|
| 24 | using System.Text;
|
---|
| 25 | using System.Collections.Specialized;
|
---|
| 26 |
|
---|
| 27 | namespace HeuristicLab.Common {
|
---|
[2656] | 28 | [Obsolete("Use collections of the HeuristicLab.Collections plugin instead", false)]
|
---|
[2424] | 29 | public class ObservableList<T> : ObservableCollection<T>, IList<T> {
|
---|
| 30 |
|
---|
| 31 | public ObservableList()
|
---|
| 32 | : base() {
|
---|
| 33 | }
|
---|
| 34 |
|
---|
| 35 | #region IList<T> Members
|
---|
| 36 | public int IndexOf(T item) {
|
---|
| 37 | return list.IndexOf(item);
|
---|
| 38 | }
|
---|
| 39 |
|
---|
| 40 | public void Insert(int index, T item) {
|
---|
| 41 | list.Insert(index, item);
|
---|
| 42 | FireItemsInserted(new List<T>() { item }, index);
|
---|
| 43 | }
|
---|
| 44 |
|
---|
| 45 | public void RemoveAt(int index) {
|
---|
| 46 | T itemRemoved = list[index];
|
---|
| 47 | list.RemoveAt(index);
|
---|
| 48 | FireItemsRemoved(new List<T>() { itemRemoved });
|
---|
| 49 | }
|
---|
| 50 |
|
---|
| 51 | public T this[int index] {
|
---|
| 52 | get {
|
---|
| 53 | return list[index];
|
---|
| 54 | }
|
---|
| 55 | set {
|
---|
| 56 | T oldItem = list[index];
|
---|
| 57 | list[index] = value;
|
---|
| 58 | FireItemsReplaced(value, oldItem, index);
|
---|
| 59 | }
|
---|
| 60 | }
|
---|
| 61 | #endregion
|
---|
| 62 |
|
---|
| 63 | #region events
|
---|
| 64 | protected virtual void FireItemsInserted(IEnumerable<T> insertedItems, int index) {
|
---|
| 65 | NotifyCollectionChangedEventArgs e = new NotifyCollectionChangedEventArgs(NotifyCollectionChangedAction.Add, insertedItems.ToList(), index);
|
---|
| 66 | FireCollectionChanged(e);
|
---|
| 67 | }
|
---|
| 68 |
|
---|
| 69 | protected virtual void FireItemsReplaced(T newItem, T oldItem, int index) {
|
---|
| 70 | NotifyCollectionChangedEventArgs e = new NotifyCollectionChangedEventArgs(NotifyCollectionChangedAction.Replace, newItem, oldItem);
|
---|
| 71 | FireCollectionChanged(e);
|
---|
| 72 | }
|
---|
| 73 | #endregion
|
---|
| 74 | }
|
---|
| 75 | }
|
---|