source: branches/PersistenceOverhaul/HeuristicLab.Persistence/4.0/Core/Index.cs @ 13326

Last change on this file since 13326 was 13326, checked in by swagner, 7 years ago

#2520: Created plugin for new persistence implementation

File size: 2.0 KB
Line 
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
22using System;
23using System.Collections.Generic;
24using System.Linq;
25using HeuristicLab.PluginInfrastructure;
26
27namespace 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() {
35      indexes = new Dictionary<T, uint>();
36      values = new Dictionary<uint, T>();
37      nextIndex = 1;
38    }
39    public Index(IEnumerable<Tuple<uint, 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 uint GetIndex(T value) {
49      uint 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(uint index) {
60      return values[index];
61    }
62    public IEnumerable<Tuple<uint, T>> GetValues() {
63      return values.Select(x => new Tuple<uint, T>(x.Key, x.Value));
64    }
65  }
66}
Note: See TracBrowser for help on using the repository browser.