[9739] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[12009] | 3 | * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[9739] | 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 |
|
---|
| 24 | namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding {
|
---|
| 25 | public static class SymbolicExpressionTreeLinearCompiler {
|
---|
| 26 | public static LinearInstruction[] Compile(ISymbolicExpressionTree tree, Func<ISymbolicExpressionTreeNode, byte> opCodeMapper) {
|
---|
| 27 | var root = tree.Root.GetSubtree(0).GetSubtree(0);
|
---|
[9815] | 28 | var code = new LinearInstruction[root.GetLength()];
|
---|
| 29 | code[0] = new LinearInstruction { dynamicNode = root, nArguments = (byte)root.SubtreeCount, opCode = opCodeMapper(root) };
|
---|
| 30 | int c = 1, i = 0;
|
---|
| 31 | foreach (var node in root.IterateNodesBreadth()) {
|
---|
[9826] | 32 | for (int j = 0; j < node.SubtreeCount; ++j) {
|
---|
[9815] | 33 | var s = node.GetSubtree(j);
|
---|
| 34 | code[c + j] = new LinearInstruction { dynamicNode = s, nArguments = (byte)s.SubtreeCount, opCode = opCodeMapper(s) };
|
---|
| 35 | }
|
---|
[11164] | 36 | code[i].childIndex = c;
|
---|
[9815] | 37 | c += node.SubtreeCount;
|
---|
| 38 | ++i;
|
---|
[9739] | 39 | }
|
---|
[9815] | 40 | return code;
|
---|
[9739] | 41 | }
|
---|
| 42 | }
|
---|
| 43 | }
|
---|