[13326] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[13347] | 3 | * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[13326] | 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 HeuristicLab.PluginInfrastructure;
|
---|
| 26 |
|
---|
| 27 | namespace HeuristicLab.Persistence {
|
---|
| 28 | [NonDiscoverableType]
|
---|
| 29 | internal sealed class Index<T> where T : class {
|
---|
| 30 | private Dictionary<T, uint> indexes;
|
---|
| 31 | private Dictionary<uint, T> values;
|
---|
| 32 | private uint nextIndex;
|
---|
| 33 |
|
---|
| 34 | public Index() {
|
---|
[13347] | 35 | this.indexes = new Dictionary<T, uint>();
|
---|
| 36 | this.values = new Dictionary<uint, T>();
|
---|
| 37 | nextIndex = 0;
|
---|
[13326] | 38 | }
|
---|
[13347] | 39 | public Index(IEnumerable<T> values)
|
---|
[13326] | 40 | : this() {
|
---|
| 41 | foreach (var value in values) {
|
---|
[13347] | 42 | this.indexes.Add(value, nextIndex);
|
---|
| 43 | this.values.Add(nextIndex, value);
|
---|
[13326] | 44 | nextIndex++;
|
---|
| 45 | }
|
---|
| 46 | }
|
---|
| 47 |
|
---|
| 48 | public uint GetIndex(T value) {
|
---|
[13347] | 49 | uint index;
|
---|
| 50 | if (!indexes.TryGetValue(value, out index)) {
|
---|
[13326] | 51 | index = nextIndex;
|
---|
| 52 | nextIndex++;
|
---|
| 53 | indexes.Add(value, index);
|
---|
| 54 | values.Add(index, value);
|
---|
| 55 | }
|
---|
| 56 | return index;
|
---|
| 57 | }
|
---|
| 58 | public T GetValue(uint index) {
|
---|
| 59 | return values[index];
|
---|
| 60 | }
|
---|
[13347] | 61 | public IEnumerable<T> GetValues() {
|
---|
| 62 | return values.Values;
|
---|
[13326] | 63 | }
|
---|
| 64 | }
|
---|
| 65 | }
|
---|