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;
|
---|
23 | using System.Collections.Generic;
|
---|
24 | using System.Linq;
|
---|
25 | using HeuristicLab.PluginInfrastructure;
|
---|
26 |
|
---|
27 | namespace HeuristicLab.Persistence {
|
---|
28 | [NonDiscoverableType]
|
---|
29 | internal sealed class ShortIndex<T> where T : class {
|
---|
30 | private Dictionary<T, ushort> indexes;
|
---|
31 | private Dictionary<ushort, T> values;
|
---|
32 | private ushort nextIndex;
|
---|
33 |
|
---|
34 | public ShortIndex() {
|
---|
35 | indexes = new Dictionary<T, ushort>();
|
---|
36 | values = new Dictionary<ushort, T>();
|
---|
37 | nextIndex = 1;
|
---|
38 | }
|
---|
39 | public ShortIndex(IEnumerable<Tuple<ushort, T>> values)
|
---|
40 | : this() {
|
---|
41 | foreach (var value in values) {
|
---|
42 | this.indexes.Add(value.Item2, value.Item1);
|
---|
43 | this.values.Add(value.Item1, value.Item2);
|
---|
44 | nextIndex++;
|
---|
45 | }
|
---|
46 | }
|
---|
47 |
|
---|
48 | public ushort GetIndex(T value) {
|
---|
49 | ushort index = 0;
|
---|
50 | indexes.TryGetValue(value, out index);
|
---|
51 | if (index == 0) {
|
---|
52 | index = nextIndex;
|
---|
53 | nextIndex++;
|
---|
54 | indexes.Add(value, index);
|
---|
55 | values.Add(index, value);
|
---|
56 | }
|
---|
57 | return index;
|
---|
58 | }
|
---|
59 | public T GetValue(ushort index) {
|
---|
60 | return values[index];
|
---|
61 | }
|
---|
62 | public IEnumerable<Tuple<ushort, T>> GetValues() {
|
---|
63 | return values.Select(x => new Tuple<ushort, T>(x.Key, x.Value));
|
---|
64 | }
|
---|
65 | }
|
---|
66 | }
|
---|