1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2013 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.Collections.Generic;
|
---|
23 | using System.Linq;
|
---|
24 | using HeuristicLab.Common;
|
---|
25 | using HeuristicLab.Core;
|
---|
26 | using HeuristicLab.Optimization;
|
---|
27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
28 |
|
---|
29 | namespace HeuristicLab.Analysis.SolutionCaching {
|
---|
30 | //TODO: should implement a collection interface
|
---|
31 | [Item("SolutionCache", "Stores solutions generated by an algorithm.")]
|
---|
32 | [StorableClass]
|
---|
33 | public abstract class SolutionCache<TKey, TValue> : Problem, ISolutionCache
|
---|
34 | where TKey : Item
|
---|
35 | where TValue : SolutionInformation<TKey> {
|
---|
36 |
|
---|
37 | #region IStorableContent Members
|
---|
38 | public string Filename { get; set; }
|
---|
39 | #endregion
|
---|
40 |
|
---|
41 | [Storable]
|
---|
42 | protected Dictionary<TKey, List<TValue>> solutionDictionary;
|
---|
43 |
|
---|
44 | public Dictionary<TKey, List<TValue>> SolutionDictionary {
|
---|
45 | get { return solutionDictionary; }
|
---|
46 | }
|
---|
47 |
|
---|
48 | public SolutionCache() {
|
---|
49 | InitializeSolutionDictionary();
|
---|
50 | }
|
---|
51 |
|
---|
52 | [StorableConstructor]
|
---|
53 | protected SolutionCache(bool deserializing) : base(deserializing) { }
|
---|
54 | protected SolutionCache(SolutionCache<TKey, TValue> original, Cloner cloner)
|
---|
55 | : base(original, cloner) {
|
---|
56 | InitializeSolutionDictionary();
|
---|
57 |
|
---|
58 | foreach (KeyValuePair<TKey, List<TValue>> keyValuePair in original.solutionDictionary) {
|
---|
59 | List<TValue> lst = new List<TValue>();
|
---|
60 | foreach (TValue value in keyValuePair.Value) {
|
---|
61 | lst.Add((TValue)value.Clone(new Cloner()));
|
---|
62 | }
|
---|
63 | this.solutionDictionary.Add((TKey)keyValuePair.Key.Clone(new Cloner()), lst);
|
---|
64 | }
|
---|
65 | }
|
---|
66 |
|
---|
67 | protected virtual void InitializeSolutionDictionary() {
|
---|
68 | solutionDictionary = new Dictionary<TKey, List<TValue>>();
|
---|
69 | }
|
---|
70 |
|
---|
71 | public virtual void Add(TKey key, TValue value) {
|
---|
72 | if (ContainsKey(key)) {
|
---|
73 | if (!solutionDictionary[key].Contains(value)) {
|
---|
74 | solutionDictionary[key].Add(value);
|
---|
75 | }
|
---|
76 | } else {
|
---|
77 | List<TValue> lst = new List<TValue>();
|
---|
78 | lst.Add(value);
|
---|
79 | solutionDictionary.Add(key, lst);
|
---|
80 | }
|
---|
81 | }
|
---|
82 |
|
---|
83 | public virtual bool ContainsKey(TKey key) {
|
---|
84 | return solutionDictionary.ContainsKey(key);
|
---|
85 | }
|
---|
86 |
|
---|
87 | public virtual int Size() {
|
---|
88 | return solutionDictionary.Count;
|
---|
89 | }
|
---|
90 |
|
---|
91 | public virtual IEnumerable<TKey> Keys() {
|
---|
92 | return solutionDictionary.Keys;
|
---|
93 | }
|
---|
94 |
|
---|
95 | public virtual IEnumerable<List<TValue>> Values() {
|
---|
96 | return solutionDictionary.Values;
|
---|
97 | }
|
---|
98 |
|
---|
99 | public virtual List<TKey> GetSolutionsFromGeneration(int generation) {
|
---|
100 | return solutionDictionary.Where(x => x.Value.Count(y => y.Iteration == generation) != 0).Select(x => x.Key).ToList<TKey>();
|
---|
101 | }
|
---|
102 | }
|
---|
103 | }
|
---|