Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HL-3.2-MonoMigration/HeuristicLab.Operators.Metaprogramming/PermutationInjector.cs @ 2168

Last change on this file since 2168 was 486, checked in by gkronber, 16 years ago

implemented #236 (Operator to create a list of n-m out of k possible items)

File size: 3.8 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2008 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.Text;
25using HeuristicLab.Core;
26using HeuristicLab.Data;
27using HeuristicLab.Operators;
28
29namespace HeuristicLab.Operators.Metaprogramming {
30  public class PermutationInjector : OperatorBase {
31    public override string Description {
32      get { return "TASK."; }
33    }
34
35    public PermutationInjector()
36      : base() {
37      AddVariableInfo(new VariableInfo("VariableInjector", "The combined operator that should hold the generated variable injector", typeof(CombinedOperator), VariableKind.New));
38      AddVariableInfo(new VariableInfo("VariableName", "Name of the variable that should be injected", typeof(StringData), VariableKind.In));
39      AddVariableInfo(new VariableInfo("Items", "Set of items that can be part of the permutation", typeof(ItemList), VariableKind.In));
40      AddVariableInfo(new VariableInfo("Min", "Minimal number of items to inject", typeof(IntData), VariableKind.In));
41      AddVariableInfo(new VariableInfo("Max", "Maximal number of items to inject", typeof(IntData), VariableKind.In));
42    }
43
44    public override IOperation Apply(IScope scope) {
45      int min = GetVariableValue<IntData>("Min", scope, true).Data;
46      int max = GetVariableValue<IntData>("Max", scope, true).Data;
47      string variableName = GetVariableValue<StringData>("VariableName", scope, true).Data;
48      ItemList allItems = GetVariableValue<ItemList>("Items", scope, true);
49      List<IItem> xs = new List<IItem>(allItems);
50      List<List<IItem>> permutations = CalcPermutations(xs, new List<IItem>(), min, max);
51
52      for(int i = 0; i < permutations.Count; i++) {
53        string scopeName = "";
54        foreach(IItem x in permutations[i]) scopeName += x.ToString() + ";";
55        Scope subScope = new Scope(scopeName.TrimEnd(';'));
56        CombinedOperator combOp = new CombinedOperator();
57        VariableInjector varInjector = new VariableInjector();
58        ItemList permutation = new ItemList();
59        foreach(IItem item in permutations[i]) permutation.Add(item);
60        varInjector.AddVariable(new Variable(variableName, permutation));
61
62        combOp.OperatorGraph.AddOperator(varInjector);
63        combOp.OperatorGraph.InitialOperator = varInjector;
64
65        subScope.AddVariable(new Variable(scope.TranslateName("VariableInjector"), combOp));
66        scope.AddSubScope(subScope);
67      }
68      return null;
69    }
70
71    private List<List<IItem>> CalcPermutations(List<IItem> allItems, List<IItem> prefix, int min, int max) {
72      List<List<IItem>> result = new List<List<IItem>>();
73      if(prefix.Count >= max) return result;
74      if(prefix.Count >= min) result.Add(new List<IItem>(prefix));
75      int count = allItems.Count;
76      for(int i = 0; i < count; i++) {
77        IItem x = allItems[0];
78        allItems.RemoveAt(0);
79        prefix.Add(x);
80        result.AddRange(CalcPermutations(new List<IItem>(allItems), prefix, min, max));
81        prefix.RemoveAt(prefix.Count-1);
82      }
83
84      return result;
85    }
86  }
87}
Note: See TracBrowser for help on using the repository browser.