[720] | 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 |
|
---|
| 22 | using System;
|
---|
| 23 | using System.Collections.Generic;
|
---|
| 24 | using System.Text;
|
---|
| 25 | using System.Xml;
|
---|
| 26 | using HeuristicLab.Core;
|
---|
| 27 | using HeuristicLab.Data;
|
---|
| 28 | using HeuristicLab.DataAnalysis;
|
---|
| 29 | using HeuristicLab.Constraints;
|
---|
| 30 |
|
---|
| 31 | namespace HeuristicLab.GP.Boolean {
|
---|
| 32 | public class FunctionLibraryInjector : OperatorBase {
|
---|
[722] | 33 | private const string TARGETVARIABLE = "TargetVariable";
|
---|
| 34 | private const string ALLOWEDFEATURES = "AllowedFeatures";
|
---|
[720] | 35 | private const string OPERATORLIBRARY = "FunctionLibrary";
|
---|
| 36 |
|
---|
| 37 | private GPOperatorLibrary operatorLibrary;
|
---|
[722] | 38 | private Variable variable;
|
---|
[720] | 39 |
|
---|
| 40 | public override string Description {
|
---|
| 41 | get { return @"Injects a function library for boolean logic."; }
|
---|
| 42 | }
|
---|
| 43 |
|
---|
| 44 | public FunctionLibraryInjector()
|
---|
| 45 | : base() {
|
---|
[722] | 46 | AddVariableInfo(new VariableInfo(TARGETVARIABLE, "The target variable", typeof(IntData), VariableKind.In));
|
---|
| 47 | AddVariableInfo(new VariableInfo(ALLOWEDFEATURES, "List of indexes of allowed features", typeof(ItemList<IntData>), VariableKind.In));
|
---|
[720] | 48 | AddVariableInfo(new VariableInfo(OPERATORLIBRARY, "Preconfigured default operator library", typeof(GPOperatorLibrary), VariableKind.New));
|
---|
| 49 | }
|
---|
| 50 |
|
---|
| 51 | public override IOperation Apply(IScope scope) {
|
---|
[722] | 52 | ItemList<IntData> allowedFeatures = GetVariableValue<ItemList<IntData>>(ALLOWEDFEATURES, scope, true);
|
---|
| 53 | int targetVariable = GetVariableValue<IntData>(TARGETVARIABLE, scope, true).Data;
|
---|
| 54 |
|
---|
| 55 | // remove the target-variable in case it occures in allowed features
|
---|
| 56 | List<IntData> ts = allowedFeatures.FindAll(d => d.Data == targetVariable);
|
---|
| 57 | foreach (IntData t in ts) allowedFeatures.Remove(t);
|
---|
| 58 |
|
---|
[720] | 59 | InitDefaultOperatorLibrary();
|
---|
[722] | 60 |
|
---|
| 61 | int[] allowedIndexes = new int[allowedFeatures.Count];
|
---|
| 62 | for (int i = 0; i < allowedIndexes.Length; i++) {
|
---|
| 63 | allowedIndexes[i] = allowedFeatures[i].Data;
|
---|
| 64 | }
|
---|
| 65 |
|
---|
| 66 | variable.SetConstraints(allowedIndexes);
|
---|
| 67 |
|
---|
[720] | 68 | scope.AddVariable(new HeuristicLab.Core.Variable(scope.TranslateName(OPERATORLIBRARY), operatorLibrary));
|
---|
| 69 | return null;
|
---|
| 70 | }
|
---|
| 71 |
|
---|
| 72 | private void InitDefaultOperatorLibrary() {
|
---|
| 73 | And and = new And();
|
---|
| 74 | Or or = new Or();
|
---|
[763] | 75 | //Not not = new Not();
|
---|
[720] | 76 | Nand nand = new Nand();
|
---|
| 77 | Nor nor = new Nor();
|
---|
[763] | 78 | //Xor xor = new Xor();
|
---|
[722] | 79 | variable = new HeuristicLab.GP.Boolean.Variable();
|
---|
[720] | 80 |
|
---|
| 81 | IFunction[] allFunctions = new IFunction[] {
|
---|
| 82 | and,
|
---|
| 83 | or,
|
---|
[763] | 84 | //not,
|
---|
[720] | 85 | nand,
|
---|
| 86 | nor,
|
---|
[763] | 87 | //xor,
|
---|
[720] | 88 | variable
|
---|
| 89 | };
|
---|
| 90 |
|
---|
| 91 | SetAllowedSubOperators(and, allFunctions);
|
---|
| 92 | SetAllowedSubOperators(or, allFunctions);
|
---|
[763] | 93 | //SetAllowedSubOperators(not, allFunctions);
|
---|
[720] | 94 | SetAllowedSubOperators(nand, allFunctions);
|
---|
| 95 | SetAllowedSubOperators(nor, allFunctions);
|
---|
[763] | 96 | //SetAllowedSubOperators(xor, allFunctions);
|
---|
[720] | 97 |
|
---|
| 98 | operatorLibrary = new GPOperatorLibrary();
|
---|
| 99 | operatorLibrary.GPOperatorGroup.AddOperator(and);
|
---|
| 100 | operatorLibrary.GPOperatorGroup.AddOperator(or);
|
---|
[763] | 101 | //operatorLibrary.GPOperatorGroup.AddOperator(not);
|
---|
[720] | 102 | operatorLibrary.GPOperatorGroup.AddOperator(nand);
|
---|
| 103 | operatorLibrary.GPOperatorGroup.AddOperator(nor);
|
---|
[763] | 104 | //operatorLibrary.GPOperatorGroup.AddOperator(xor);
|
---|
[720] | 105 | operatorLibrary.GPOperatorGroup.AddOperator(variable);
|
---|
| 106 | }
|
---|
| 107 |
|
---|
| 108 | private void SetAllowedSubOperators(IFunction f, IFunction[] gs) {
|
---|
[722] | 109 | foreach (IConstraint c in f.Constraints) {
|
---|
| 110 | if (c is SubOperatorTypeConstraint) {
|
---|
[720] | 111 | SubOperatorTypeConstraint typeConstraint = c as SubOperatorTypeConstraint;
|
---|
| 112 | typeConstraint.Clear();
|
---|
[722] | 113 | foreach (IFunction g in gs) {
|
---|
[720] | 114 | typeConstraint.AddOperator(g);
|
---|
| 115 | }
|
---|
[722] | 116 | } else if (c is AllSubOperatorsTypeConstraint) {
|
---|
[720] | 117 | AllSubOperatorsTypeConstraint typeConstraint = c as AllSubOperatorsTypeConstraint;
|
---|
| 118 | typeConstraint.Clear();
|
---|
[722] | 119 | foreach (IFunction g in gs) {
|
---|
[720] | 120 | typeConstraint.AddOperator(g);
|
---|
| 121 | }
|
---|
| 122 | }
|
---|
| 123 | }
|
---|
| 124 | }
|
---|
| 125 | }
|
---|
| 126 | }
|
---|