[5686] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[11170] | 3 | * Copyright (C) 2002-2014 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[5686] | 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.Common;
|
---|
| 26 | using HeuristicLab.Core;
|
---|
| 27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 28 |
|
---|
| 29 | namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding {
|
---|
| 30 | /// <summary>
|
---|
| 31 | /// The default symbolic expression grammar stores symbols and syntactic constraints for symbols.
|
---|
| 32 | /// Symbols are treated as equvivalent if they have the same name.
|
---|
| 33 | /// Syntactic constraints limit the number of allowed sub trees for a node with a symbol and which symbols are allowed
|
---|
| 34 | /// in the sub-trees of a symbol (can be specified for each sub-tree index separately).
|
---|
| 35 | /// </summary>
|
---|
| 36 | [StorableClass]
|
---|
| 37 | public abstract class SymbolicExpressionGrammarBase : NamedItem, ISymbolicExpressionGrammarBase {
|
---|
[6803] | 38 |
|
---|
[5686] | 39 | #region properties for separation between implementation and persistence
|
---|
[5695] | 40 | [Storable(Name = "Symbols")]
|
---|
| 41 | private IEnumerable<ISymbol> StorableSymbols {
|
---|
| 42 | get { return symbols.Values.ToArray(); }
|
---|
| 43 | set { symbols = value.ToDictionary(sym => sym.Name); }
|
---|
| 44 | }
|
---|
[5686] | 45 |
|
---|
[5695] | 46 | [Storable(Name = "SymbolSubtreeCount")]
|
---|
| 47 | private IEnumerable<KeyValuePair<ISymbol, Tuple<int, int>>> StorableSymbolSubtreeCount {
|
---|
| 48 | get { return symbolSubtreeCount.Select(x => new KeyValuePair<ISymbol, Tuple<int, int>>(GetSymbol(x.Key), x.Value)).ToArray(); }
|
---|
| 49 | set { symbolSubtreeCount = value.ToDictionary(x => x.Key.Name, x => x.Value); }
|
---|
| 50 | }
|
---|
[5686] | 51 |
|
---|
[5695] | 52 | [Storable(Name = "AllowedChildSymbols")]
|
---|
| 53 | private IEnumerable<KeyValuePair<ISymbol, IEnumerable<ISymbol>>> StorableAllowedChildSymbols {
|
---|
[6814] | 54 | get { return allowedChildSymbols.Select(x => new KeyValuePair<ISymbol, IEnumerable<ISymbol>>(GetSymbol(x.Key), x.Value.Select(GetSymbol).ToArray())).ToArray(); }
|
---|
[5695] | 55 | set { allowedChildSymbols = value.ToDictionary(x => x.Key.Name, x => x.Value.Select(y => y.Name).ToList()); }
|
---|
| 56 | }
|
---|
| 57 |
|
---|
| 58 | [Storable(Name = "AllowedChildSymbolsPerIndex")]
|
---|
| 59 | private IEnumerable<KeyValuePair<Tuple<ISymbol, int>, IEnumerable<ISymbol>>> StorableAllowedChildSymbolsPerIndex {
|
---|
[5712] | 60 | get { return allowedChildSymbolsPerIndex.Select(x => new KeyValuePair<Tuple<ISymbol, int>, IEnumerable<ISymbol>>(Tuple.Create<ISymbol, int>(GetSymbol(x.Key.Item1), x.Key.Item2), x.Value.Select(y => GetSymbol(y)).ToArray())).ToArray(); }
|
---|
[5695] | 61 | set { allowedChildSymbolsPerIndex = value.ToDictionary(x => Tuple.Create(x.Key.Item1.Name, x.Key.Item2), x => x.Value.Select(y => y.Name).ToList()); }
|
---|
| 62 | }
|
---|
[5686] | 63 | #endregion
|
---|
| 64 |
|
---|
[6803] | 65 | private bool suppressEvents;
|
---|
[5686] | 66 | protected Dictionary<string, ISymbol> symbols;
|
---|
[5695] | 67 | protected Dictionary<string, Tuple<int, int>> symbolSubtreeCount;
|
---|
[5686] | 68 | protected Dictionary<string, List<string>> allowedChildSymbols;
|
---|
| 69 | protected Dictionary<Tuple<string, int>, List<string>> allowedChildSymbolsPerIndex;
|
---|
| 70 |
|
---|
[5688] | 71 | public override bool CanChangeName {
|
---|
| 72 | get { return false; }
|
---|
| 73 | }
|
---|
| 74 | public override bool CanChangeDescription {
|
---|
| 75 | get { return false; }
|
---|
| 76 | }
|
---|
| 77 |
|
---|
[5686] | 78 | [StorableConstructor]
|
---|
| 79 | protected SymbolicExpressionGrammarBase(bool deserializing)
|
---|
| 80 | : base(deserializing) {
|
---|
| 81 | cachedMinExpressionLength = new Dictionary<string, int>();
|
---|
[6911] | 82 | cachedMaxExpressionLength = new Dictionary<Tuple<string, int>, int>();
|
---|
[5686] | 83 | cachedMinExpressionDepth = new Dictionary<string, int>();
|
---|
[7076] | 84 | cachedMaxExpressionDepth = new Dictionary<string, int>();
|
---|
[6803] | 85 |
|
---|
[6814] | 86 | cachedIsAllowedChildSymbol = new Dictionary<Tuple<string, string>, bool>();
|
---|
| 87 | cachedIsAllowedChildSymbolIndex = new Dictionary<Tuple<string, string, int>, bool>();
|
---|
| 88 |
|
---|
[6803] | 89 | suppressEvents = false;
|
---|
[5686] | 90 | }
|
---|
[6233] | 91 |
|
---|
[5686] | 92 | protected SymbolicExpressionGrammarBase(SymbolicExpressionGrammarBase original, Cloner cloner)
|
---|
| 93 | : base(original, cloner) {
|
---|
| 94 | cachedMinExpressionLength = new Dictionary<string, int>();
|
---|
[6911] | 95 | cachedMaxExpressionLength = new Dictionary<Tuple<string, int>, int>();
|
---|
[5686] | 96 | cachedMinExpressionDepth = new Dictionary<string, int>();
|
---|
[7076] | 97 | cachedMaxExpressionDepth = new Dictionary<string, int>();
|
---|
[5686] | 98 |
|
---|
[6814] | 99 | cachedIsAllowedChildSymbol = new Dictionary<Tuple<string, string>, bool>();
|
---|
| 100 | cachedIsAllowedChildSymbolIndex = new Dictionary<Tuple<string, string, int>, bool>();
|
---|
| 101 |
|
---|
| 102 | symbols = original.symbols.ToDictionary(x => x.Key, y => cloner.Clone(y.Value));
|
---|
[5695] | 103 | symbolSubtreeCount = new Dictionary<string, Tuple<int, int>>(original.symbolSubtreeCount);
|
---|
[5686] | 104 |
|
---|
| 105 | allowedChildSymbols = new Dictionary<string, List<string>>();
|
---|
| 106 | foreach (var element in original.allowedChildSymbols)
|
---|
| 107 | allowedChildSymbols.Add(element.Key, new List<string>(element.Value));
|
---|
| 108 |
|
---|
| 109 | allowedChildSymbolsPerIndex = new Dictionary<Tuple<string, int>, List<string>>();
|
---|
| 110 | foreach (var element in original.allowedChildSymbolsPerIndex)
|
---|
| 111 | allowedChildSymbolsPerIndex.Add(element.Key, new List<string>(element.Value));
|
---|
[6803] | 112 |
|
---|
| 113 | suppressEvents = false;
|
---|
[5686] | 114 | }
|
---|
| 115 |
|
---|
[5688] | 116 | protected SymbolicExpressionGrammarBase(string name, string description)
|
---|
| 117 | : base(name, description) {
|
---|
[5686] | 118 | cachedMinExpressionLength = new Dictionary<string, int>();
|
---|
[6911] | 119 | cachedMaxExpressionLength = new Dictionary<Tuple<string, int>, int>();
|
---|
[5686] | 120 | cachedMinExpressionDepth = new Dictionary<string, int>();
|
---|
[7076] | 121 | cachedMaxExpressionDepth = new Dictionary<string, int>();
|
---|
[5686] | 122 |
|
---|
[6814] | 123 | cachedIsAllowedChildSymbol = new Dictionary<Tuple<string, string>, bool>();
|
---|
| 124 | cachedIsAllowedChildSymbolIndex = new Dictionary<Tuple<string, string, int>, bool>();
|
---|
| 125 |
|
---|
[5686] | 126 | symbols = new Dictionary<string, ISymbol>();
|
---|
[5695] | 127 | symbolSubtreeCount = new Dictionary<string, Tuple<int, int>>();
|
---|
[5686] | 128 | allowedChildSymbols = new Dictionary<string, List<string>>();
|
---|
| 129 | allowedChildSymbolsPerIndex = new Dictionary<Tuple<string, int>, List<string>>();
|
---|
[6803] | 130 |
|
---|
| 131 | suppressEvents = false;
|
---|
[5686] | 132 | }
|
---|
| 133 |
|
---|
| 134 | #region protected grammar manipulation methods
|
---|
[6443] | 135 | protected virtual void AddSymbol(ISymbol symbol) {
|
---|
[5686] | 136 | if (ContainsSymbol(symbol)) throw new ArgumentException("Symbol " + symbol + " is already defined.");
|
---|
[6803] | 137 | foreach (var s in symbol.Flatten()) {
|
---|
| 138 | symbols.Add(s.Name, s);
|
---|
[7001] | 139 | int maxSubTreeCount = Math.Min(s.MinimumArity + 1, s.MaximumArity);
|
---|
| 140 | symbolSubtreeCount.Add(s.Name, Tuple.Create(s.MinimumArity, maxSubTreeCount));
|
---|
[6803] | 141 | }
|
---|
[5686] | 142 | ClearCaches();
|
---|
| 143 | }
|
---|
| 144 |
|
---|
[6443] | 145 | protected virtual void RemoveSymbol(ISymbol symbol) {
|
---|
[6803] | 146 | foreach (var s in symbol.Flatten()) {
|
---|
| 147 | symbols.Remove(s.Name);
|
---|
| 148 | allowedChildSymbols.Remove(s.Name);
|
---|
| 149 | for (int i = 0; i < GetMaximumSubtreeCount(s); i++)
|
---|
| 150 | allowedChildSymbolsPerIndex.Remove(Tuple.Create(s.Name, i));
|
---|
| 151 | symbolSubtreeCount.Remove(s.Name);
|
---|
[5686] | 152 |
|
---|
[6803] | 153 | foreach (var parent in Symbols) {
|
---|
| 154 | List<string> allowedChilds;
|
---|
| 155 | if (allowedChildSymbols.TryGetValue(parent.Name, out allowedChilds))
|
---|
| 156 | allowedChilds.Remove(s.Name);
|
---|
[5686] | 157 |
|
---|
[6803] | 158 | for (int i = 0; i < GetMaximumSubtreeCount(parent); i++) {
|
---|
| 159 | if (allowedChildSymbolsPerIndex.TryGetValue(Tuple.Create(parent.Name, i), out allowedChilds))
|
---|
| 160 | allowedChilds.Remove(s.Name);
|
---|
| 161 | }
|
---|
[5686] | 162 | }
|
---|
[6803] | 163 | suppressEvents = true;
|
---|
| 164 | foreach (var groupSymbol in Symbols.OfType<GroupSymbol>())
|
---|
| 165 | groupSymbol.SymbolsCollection.Remove(symbol);
|
---|
| 166 | suppressEvents = false;
|
---|
[5686] | 167 | }
|
---|
| 168 | ClearCaches();
|
---|
| 169 | }
|
---|
| 170 |
|
---|
| 171 | public virtual ISymbol GetSymbol(string symbolName) {
|
---|
| 172 | ISymbol symbol;
|
---|
| 173 | if (symbols.TryGetValue(symbolName, out symbol)) return symbol;
|
---|
| 174 | return null;
|
---|
| 175 | }
|
---|
| 176 |
|
---|
| 177 | protected void AddAllowedChildSymbol(ISymbol parent, ISymbol child) {
|
---|
[6803] | 178 | bool changed = false;
|
---|
| 179 |
|
---|
| 180 | foreach (ISymbol p in parent.Flatten().Where(p => !(p is GroupSymbol)))
|
---|
| 181 | changed |= AddAllowedChildSymbolToDictionaries(p, child);
|
---|
| 182 |
|
---|
| 183 | if (changed) {
|
---|
| 184 | ClearCaches();
|
---|
| 185 | OnChanged();
|
---|
| 186 | }
|
---|
| 187 | }
|
---|
| 188 |
|
---|
| 189 | private bool AddAllowedChildSymbolToDictionaries(ISymbol parent, ISymbol child) {
|
---|
[5686] | 190 | List<string> childSymbols;
|
---|
| 191 | if (!allowedChildSymbols.TryGetValue(parent.Name, out childSymbols)) {
|
---|
| 192 | childSymbols = new List<string>();
|
---|
| 193 | allowedChildSymbols.Add(parent.Name, childSymbols);
|
---|
| 194 | }
|
---|
[6803] | 195 | if (childSymbols.Contains(child.Name)) return false;
|
---|
| 196 |
|
---|
| 197 | suppressEvents = true;
|
---|
| 198 | for (int argumentIndex = 0; argumentIndex < GetMaximumSubtreeCount(parent); argumentIndex++)
|
---|
| 199 | RemoveAllowedChildSymbol(parent, child, argumentIndex);
|
---|
| 200 | suppressEvents = false;
|
---|
| 201 |
|
---|
[5686] | 202 | childSymbols.Add(child.Name);
|
---|
[6803] | 203 | return true;
|
---|
[5686] | 204 | }
|
---|
| 205 |
|
---|
| 206 | protected void AddAllowedChildSymbol(ISymbol parent, ISymbol child, int argumentIndex) {
|
---|
[6803] | 207 | bool changed = false;
|
---|
| 208 |
|
---|
| 209 | foreach (ISymbol p in parent.Flatten().Where(p => !(p is GroupSymbol)))
|
---|
| 210 | changed |= AddAllowedChildSymbolToDictionaries(p, child, argumentIndex);
|
---|
| 211 |
|
---|
| 212 | if (changed) {
|
---|
| 213 | ClearCaches();
|
---|
| 214 | OnChanged();
|
---|
| 215 | }
|
---|
| 216 | }
|
---|
| 217 |
|
---|
| 218 |
|
---|
| 219 | private bool AddAllowedChildSymbolToDictionaries(ISymbol parent, ISymbol child, int argumentIndex) {
|
---|
| 220 | List<string> childSymbols;
|
---|
| 221 | if (!allowedChildSymbols.TryGetValue(parent.Name, out childSymbols)) {
|
---|
| 222 | childSymbols = new List<string>();
|
---|
| 223 | allowedChildSymbols.Add(parent.Name, childSymbols);
|
---|
| 224 | }
|
---|
| 225 | if (childSymbols.Contains(child.Name)) return false;
|
---|
| 226 |
|
---|
| 227 |
|
---|
[5686] | 228 | var key = Tuple.Create(parent.Name, argumentIndex);
|
---|
| 229 | if (!allowedChildSymbolsPerIndex.TryGetValue(key, out childSymbols)) {
|
---|
| 230 | childSymbols = new List<string>();
|
---|
| 231 | allowedChildSymbolsPerIndex.Add(key, childSymbols);
|
---|
| 232 | }
|
---|
| 233 |
|
---|
[6803] | 234 | if (childSymbols.Contains(child.Name)) return false;
|
---|
| 235 |
|
---|
[5686] | 236 | childSymbols.Add(child.Name);
|
---|
[6803] | 237 | return true;
|
---|
[5686] | 238 | }
|
---|
| 239 |
|
---|
| 240 | protected void RemoveAllowedChildSymbol(ISymbol parent, ISymbol child) {
|
---|
[6803] | 241 | bool changed = false;
|
---|
[5792] | 242 | List<string> childSymbols;
|
---|
| 243 | if (allowedChildSymbols.TryGetValue(child.Name, out childSymbols)) {
|
---|
[6803] | 244 | changed |= childSymbols.Remove(child.Name);
|
---|
[5792] | 245 | }
|
---|
[6803] | 246 |
|
---|
| 247 | for (int argumentIndex = 0; argumentIndex < GetMaximumSubtreeCount(parent); argumentIndex++) {
|
---|
| 248 | var key = Tuple.Create(parent.Name, argumentIndex);
|
---|
| 249 | if (allowedChildSymbolsPerIndex.TryGetValue(key, out childSymbols))
|
---|
| 250 | changed |= childSymbols.Remove(child.Name);
|
---|
| 251 | }
|
---|
| 252 |
|
---|
| 253 | if (changed) {
|
---|
| 254 | ClearCaches();
|
---|
| 255 | OnChanged();
|
---|
| 256 | }
|
---|
[5686] | 257 | }
|
---|
| 258 |
|
---|
| 259 | protected void RemoveAllowedChildSymbol(ISymbol parent, ISymbol child, int argumentIndex) {
|
---|
[6803] | 260 | bool changed = false;
|
---|
| 261 |
|
---|
| 262 | suppressEvents = true;
|
---|
[5792] | 263 | List<string> childSymbols;
|
---|
[6803] | 264 | if (allowedChildSymbols.TryGetValue(parent.Name, out childSymbols)) {
|
---|
| 265 | if (childSymbols.Remove(child.Name)) {
|
---|
| 266 | for (int i = 0; i < GetMaximumSubtreeCount(parent); i++) {
|
---|
| 267 | if (i != argumentIndex) AddAllowedChildSymbol(parent, child, i);
|
---|
| 268 | }
|
---|
| 269 | changed = true;
|
---|
| 270 | }
|
---|
[5792] | 271 | }
|
---|
[6803] | 272 | suppressEvents = false;
|
---|
| 273 |
|
---|
| 274 | var key = Tuple.Create(parent.Name, argumentIndex);
|
---|
| 275 | if (allowedChildSymbolsPerIndex.TryGetValue(key, out childSymbols))
|
---|
| 276 | changed |= childSymbols.Remove(child.Name);
|
---|
| 277 |
|
---|
| 278 | if (changed) {
|
---|
| 279 | ClearCaches();
|
---|
| 280 | OnChanged();
|
---|
| 281 | }
|
---|
[5686] | 282 | }
|
---|
| 283 |
|
---|
| 284 | protected void SetSubtreeCount(ISymbol symbol, int minimumSubtreeCount, int maximumSubtreeCount) {
|
---|
[6803] | 285 | var symbols = symbol.Flatten().Where(s => !(s is GroupSymbol));
|
---|
| 286 | if (symbols.Any(s => s.MinimumArity > minimumSubtreeCount)) throw new ArgumentException("Invalid minimum subtree count " + minimumSubtreeCount + " for " + symbol);
|
---|
| 287 | if (symbols.Any(s => s.MaximumArity < maximumSubtreeCount)) throw new ArgumentException("Invalid maximum subtree count " + maximumSubtreeCount + " for " + symbol);
|
---|
| 288 |
|
---|
| 289 | foreach (ISymbol s in symbols)
|
---|
| 290 | SetSubTreeCountInDictionaries(s, minimumSubtreeCount, maximumSubtreeCount);
|
---|
| 291 |
|
---|
| 292 | ClearCaches();
|
---|
| 293 | OnChanged();
|
---|
| 294 | }
|
---|
| 295 |
|
---|
| 296 | private void SetSubTreeCountInDictionaries(ISymbol symbol, int minimumSubtreeCount, int maximumSubtreeCount) {
|
---|
| 297 | for (int i = maximumSubtreeCount; i < GetMaximumSubtreeCount(symbol); i++) {
|
---|
[5686] | 298 | var key = Tuple.Create(symbol.Name, i);
|
---|
| 299 | allowedChildSymbolsPerIndex.Remove(key);
|
---|
| 300 | }
|
---|
| 301 |
|
---|
[5695] | 302 | symbolSubtreeCount[symbol.Name] = Tuple.Create(minimumSubtreeCount, maximumSubtreeCount);
|
---|
[5686] | 303 | }
|
---|
| 304 | #endregion
|
---|
| 305 |
|
---|
| 306 | public virtual IEnumerable<ISymbol> Symbols {
|
---|
| 307 | get { return symbols.Values; }
|
---|
| 308 | }
|
---|
| 309 | public virtual IEnumerable<ISymbol> AllowedSymbols {
|
---|
[7656] | 310 | get { foreach (var s in Symbols) if (s.Enabled) yield return s; }
|
---|
[5686] | 311 | }
|
---|
| 312 | public virtual bool ContainsSymbol(ISymbol symbol) {
|
---|
| 313 | return symbols.ContainsKey(symbol.Name);
|
---|
| 314 | }
|
---|
| 315 |
|
---|
[6814] | 316 | private readonly Dictionary<Tuple<string, string>, bool> cachedIsAllowedChildSymbol;
|
---|
[5686] | 317 | public virtual bool IsAllowedChildSymbol(ISymbol parent, ISymbol child) {
|
---|
[7656] | 318 | if (allowedChildSymbols.Count == 0) return false;
|
---|
[6803] | 319 | if (!child.Enabled) return false;
|
---|
| 320 |
|
---|
[6814] | 321 | bool result;
|
---|
[7656] | 322 | var key = Tuple.Create(parent.Name, child.Name);
|
---|
| 323 | if (cachedIsAllowedChildSymbol.TryGetValue(key, out result)) return result;
|
---|
| 324 |
|
---|
[11018] | 325 | // value has to be calculated and cached make sure this is done in only one thread
|
---|
| 326 | lock (cachedIsAllowedChildSymbol) {
|
---|
| 327 | // in case the value has been calculated on another thread in the meanwhile
|
---|
| 328 | if (cachedIsAllowedChildSymbol.TryGetValue(key, out result)) return result;
|
---|
| 329 |
|
---|
| 330 | List<string> temp;
|
---|
| 331 | if (allowedChildSymbols.TryGetValue(parent.Name, out temp)) {
|
---|
| 332 | if (temp.SelectMany(s => GetSymbol(s).Flatten()).Any(s => s.Name == child.Name)) {
|
---|
| 333 | cachedIsAllowedChildSymbol.Add(key, true);
|
---|
| 334 | return true;
|
---|
| 335 | }
|
---|
[6814] | 336 | }
|
---|
[11018] | 337 | cachedIsAllowedChildSymbol.Add(key, false);
|
---|
| 338 | return false;
|
---|
[6803] | 339 | }
|
---|
[5686] | 340 | }
|
---|
| 341 |
|
---|
[6814] | 342 | private readonly Dictionary<Tuple<string, string, int>, bool> cachedIsAllowedChildSymbolIndex;
|
---|
[5686] | 343 | public virtual bool IsAllowedChildSymbol(ISymbol parent, ISymbol child, int argumentIndex) {
|
---|
[6803] | 344 | if (!child.Enabled) return false;
|
---|
[7660] | 345 | if (IsAllowedChildSymbol(parent, child)) return true;
|
---|
[7656] | 346 | if (allowedChildSymbolsPerIndex.Count == 0) return false;
|
---|
[6803] | 347 |
|
---|
[6814] | 348 | bool result;
|
---|
[7656] | 349 | var key = Tuple.Create(parent.Name, child.Name, argumentIndex);
|
---|
| 350 | if (cachedIsAllowedChildSymbolIndex.TryGetValue(key, out result)) return result;
|
---|
| 351 |
|
---|
[11018] | 352 | // value has to be calculated and cached make sure this is done in only one thread
|
---|
| 353 | lock (cachedIsAllowedChildSymbolIndex) {
|
---|
| 354 | // in case the value has been calculated on another thread in the meanwhile
|
---|
| 355 | if (cachedIsAllowedChildSymbolIndex.TryGetValue(key, out result)) return result;
|
---|
| 356 |
|
---|
| 357 | List<string> temp;
|
---|
| 358 | if (allowedChildSymbolsPerIndex.TryGetValue(Tuple.Create(parent.Name, argumentIndex), out temp)) {
|
---|
| 359 | if (temp.SelectMany(s => GetSymbol(s).Flatten()).Any(s => s.Name == child.Name)) {
|
---|
| 360 | cachedIsAllowedChildSymbolIndex.Add(key, true);
|
---|
| 361 | return true;
|
---|
| 362 | }
|
---|
[6814] | 363 | }
|
---|
[11018] | 364 | cachedIsAllowedChildSymbolIndex.Add(key, false);
|
---|
| 365 | return false;
|
---|
[6803] | 366 | }
|
---|
[5686] | 367 | }
|
---|
| 368 |
|
---|
[6911] | 369 | public IEnumerable<ISymbol> GetAllowedChildSymbols(ISymbol parent) {
|
---|
[7656] | 370 | foreach (ISymbol child in AllowedSymbols) {
|
---|
| 371 | if (IsAllowedChildSymbol(parent, child)) yield return child;
|
---|
| 372 | }
|
---|
[5686] | 373 | }
|
---|
| 374 |
|
---|
[6911] | 375 | public IEnumerable<ISymbol> GetAllowedChildSymbols(ISymbol parent, int argumentIndex) {
|
---|
[7656] | 376 | foreach (ISymbol child in AllowedSymbols) {
|
---|
| 377 | if (IsAllowedChildSymbol(parent, child, argumentIndex)) yield return child;
|
---|
| 378 | }
|
---|
[5686] | 379 | }
|
---|
| 380 |
|
---|
| 381 | public virtual int GetMinimumSubtreeCount(ISymbol symbol) {
|
---|
[5695] | 382 | return symbolSubtreeCount[symbol.Name].Item1;
|
---|
[5686] | 383 | }
|
---|
| 384 | public virtual int GetMaximumSubtreeCount(ISymbol symbol) {
|
---|
[5695] | 385 | return symbolSubtreeCount[symbol.Name].Item2;
|
---|
[5686] | 386 | }
|
---|
| 387 |
|
---|
[6443] | 388 | protected void ClearCaches() {
|
---|
[5686] | 389 | cachedMinExpressionLength.Clear();
|
---|
| 390 | cachedMaxExpressionLength.Clear();
|
---|
| 391 | cachedMinExpressionDepth.Clear();
|
---|
[7076] | 392 | cachedMaxExpressionDepth.Clear();
|
---|
[6814] | 393 |
|
---|
| 394 | cachedIsAllowedChildSymbol.Clear();
|
---|
| 395 | cachedIsAllowedChildSymbolIndex.Clear();
|
---|
[5686] | 396 | }
|
---|
| 397 |
|
---|
[6814] | 398 | private readonly Dictionary<string, int> cachedMinExpressionLength;
|
---|
[5686] | 399 | public int GetMinimumExpressionLength(ISymbol symbol) {
|
---|
[9402] | 400 | int res;
|
---|
| 401 | if (cachedMinExpressionLength.TryGetValue(symbol.Name, out res))
|
---|
| 402 | return res;
|
---|
| 403 |
|
---|
[11018] | 404 | // value has to be calculated and cached make sure this is done in only one thread
|
---|
| 405 | lock (cachedMinExpressionLength) {
|
---|
| 406 | // in case the value has been calculated on another thread in the meanwhile
|
---|
| 407 | if (cachedMinExpressionLength.TryGetValue(symbol.Name, out res)) return res;
|
---|
| 408 |
|
---|
| 409 | res = GetMinimumExpressionLengthRec(symbol);
|
---|
| 410 | foreach (var entry in cachedMinExpressionLength.Where(e => e.Value >= int.MaxValue).ToList()) {
|
---|
| 411 | if (entry.Key != symbol.Name) cachedMinExpressionLength.Remove(entry.Key);
|
---|
| 412 | }
|
---|
| 413 | return res;
|
---|
[9402] | 414 | }
|
---|
| 415 | }
|
---|
| 416 |
|
---|
[9403] | 417 | private int GetMinimumExpressionLengthRec(ISymbol symbol) {
|
---|
[5686] | 418 | int temp;
|
---|
| 419 | if (!cachedMinExpressionLength.TryGetValue(symbol.Name, out temp)) {
|
---|
| 420 | cachedMinExpressionLength[symbol.Name] = int.MaxValue; // prevent infinite recursion
|
---|
| 421 | long sumOfMinExpressionLengths = 1 + (from argIndex in Enumerable.Range(0, GetMinimumSubtreeCount(symbol))
|
---|
[6803] | 422 | let minForSlot = (long)(from s in GetAllowedChildSymbols(symbol, argIndex)
|
---|
[6911] | 423 | where s.InitialFrequency > 0.0
|
---|
[9402] | 424 | select GetMinimumExpressionLengthRec(s)).DefaultIfEmpty(0).Min()
|
---|
[5686] | 425 | select minForSlot).DefaultIfEmpty(0).Sum();
|
---|
| 426 |
|
---|
| 427 | cachedMinExpressionLength[symbol.Name] = (int)Math.Min(sumOfMinExpressionLengths, int.MaxValue);
|
---|
| 428 | return cachedMinExpressionLength[symbol.Name];
|
---|
| 429 | }
|
---|
| 430 | return temp;
|
---|
| 431 | }
|
---|
| 432 |
|
---|
[6911] | 433 | private readonly Dictionary<Tuple<string, int>, int> cachedMaxExpressionLength;
|
---|
| 434 | public int GetMaximumExpressionLength(ISymbol symbol, int maxDepth) {
|
---|
[5686] | 435 | int temp;
|
---|
[6911] | 436 | var key = Tuple.Create(symbol.Name, maxDepth);
|
---|
[11018] | 437 | if (cachedMaxExpressionLength.TryGetValue(key, out temp)) return temp;
|
---|
| 438 | // value has to be calculated and cached make sure this is done in only one thread
|
---|
| 439 | lock (cachedMaxExpressionLength) {
|
---|
| 440 | // in case the value has been calculated on another thread in the meanwhile
|
---|
| 441 | if (cachedMaxExpressionLength.TryGetValue(key, out temp)) return temp;
|
---|
| 442 |
|
---|
[6911] | 443 | cachedMaxExpressionLength[key] = int.MaxValue; // prevent infinite recursion
|
---|
[5686] | 444 | long sumOfMaxTrees = 1 + (from argIndex in Enumerable.Range(0, GetMaximumSubtreeCount(symbol))
|
---|
[6803] | 445 | let maxForSlot = (long)(from s in GetAllowedChildSymbols(symbol, argIndex)
|
---|
[6911] | 446 | where s.InitialFrequency > 0.0
|
---|
| 447 | where GetMinimumExpressionDepth(s) < maxDepth
|
---|
| 448 | select GetMaximumExpressionLength(s, maxDepth - 1)).DefaultIfEmpty(0).Max()
|
---|
[5686] | 449 | select maxForSlot).DefaultIfEmpty(0).Sum();
|
---|
[6911] | 450 | cachedMaxExpressionLength[key] = (int)Math.Min(sumOfMaxTrees, int.MaxValue);
|
---|
| 451 | return cachedMaxExpressionLength[key];
|
---|
[5686] | 452 | }
|
---|
| 453 | }
|
---|
| 454 |
|
---|
[6814] | 455 | private readonly Dictionary<string, int> cachedMinExpressionDepth;
|
---|
[5686] | 456 | public int GetMinimumExpressionDepth(ISymbol symbol) {
|
---|
[9402] | 457 | int res;
|
---|
| 458 | if (cachedMinExpressionDepth.TryGetValue(symbol.Name, out res))
|
---|
| 459 | return res;
|
---|
| 460 |
|
---|
[11018] | 461 | // value has to be calculated and cached make sure this is done in only one thread
|
---|
| 462 | lock (cachedMinExpressionDepth) {
|
---|
| 463 | // in case the value has been calculated on another thread in the meanwhile
|
---|
| 464 | if (cachedMinExpressionDepth.TryGetValue(symbol.Name, out res)) return res;
|
---|
| 465 |
|
---|
| 466 | res = GetMinimumExpressionDepthRec(symbol);
|
---|
| 467 | foreach (var entry in cachedMinExpressionDepth.Where(e => e.Value >= int.MaxValue).ToList()) {
|
---|
| 468 | if (entry.Key != symbol.Name) cachedMinExpressionDepth.Remove(entry.Key);
|
---|
| 469 | }
|
---|
| 470 | return res;
|
---|
[9402] | 471 | }
|
---|
| 472 | }
|
---|
| 473 | private int GetMinimumExpressionDepthRec(ISymbol symbol) {
|
---|
[5686] | 474 | int temp;
|
---|
| 475 | if (!cachedMinExpressionDepth.TryGetValue(symbol.Name, out temp)) {
|
---|
| 476 | cachedMinExpressionDepth[symbol.Name] = int.MaxValue; // prevent infinite recursion
|
---|
[6009] | 477 | long minDepth = 1 + (from argIndex in Enumerable.Range(0, GetMinimumSubtreeCount(symbol))
|
---|
[6803] | 478 | let minForSlot = (long)(from s in GetAllowedChildSymbols(symbol, argIndex)
|
---|
[6911] | 479 | where s.InitialFrequency > 0.0
|
---|
[9402] | 480 | select GetMinimumExpressionDepthRec(s)).DefaultIfEmpty(0).Min()
|
---|
[6009] | 481 | select minForSlot).DefaultIfEmpty(0).Max();
|
---|
| 482 | cachedMinExpressionDepth[symbol.Name] = (int)Math.Min(minDepth, int.MaxValue);
|
---|
[5686] | 483 | return cachedMinExpressionDepth[symbol.Name];
|
---|
| 484 | }
|
---|
| 485 | return temp;
|
---|
| 486 | }
|
---|
[6803] | 487 |
|
---|
[7076] | 488 | private readonly Dictionary<string, int> cachedMaxExpressionDepth;
|
---|
| 489 | public int GetMaximumExpressionDepth(ISymbol symbol) {
|
---|
| 490 | int temp;
|
---|
[11018] | 491 | if (cachedMaxExpressionDepth.TryGetValue(symbol.Name, out temp)) return temp;
|
---|
| 492 | // value has to be calculated and cached make sure this is done in only one thread
|
---|
| 493 | lock (cachedMaxExpressionDepth) {
|
---|
| 494 | // in case the value has been calculated on another thread in the meanwhile
|
---|
| 495 | if (cachedMaxExpressionDepth.TryGetValue(symbol.Name, out temp)) return temp;
|
---|
| 496 |
|
---|
[7076] | 497 | cachedMaxExpressionDepth[symbol.Name] = int.MaxValue;
|
---|
| 498 | long maxDepth = 1 + (from argIndex in Enumerable.Range(0, GetMaximumSubtreeCount(symbol))
|
---|
| 499 | let maxForSlot = (long)(from s in GetAllowedChildSymbols(symbol, argIndex)
|
---|
| 500 | where s.InitialFrequency > 0.0
|
---|
| 501 | select GetMaximumExpressionDepth(s)).DefaultIfEmpty(0).Max()
|
---|
| 502 | select maxForSlot).DefaultIfEmpty(0).Max();
|
---|
| 503 | cachedMaxExpressionDepth[symbol.Name] = (int)Math.Min(maxDepth, int.MaxValue);
|
---|
| 504 | return cachedMaxExpressionDepth[symbol.Name];
|
---|
| 505 | }
|
---|
| 506 | }
|
---|
| 507 |
|
---|
[6803] | 508 | public event EventHandler Changed;
|
---|
| 509 | protected virtual void OnChanged() {
|
---|
| 510 | if (suppressEvents) return;
|
---|
| 511 | var handler = Changed;
|
---|
| 512 | if (handler != null) Changed(this, EventArgs.Empty);
|
---|
| 513 | }
|
---|
[5686] | 514 | }
|
---|
| 515 | }
|
---|