[9970] | 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 | namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding {
|
---|
| 24 | public interface ILayoutNode<T> where T : class {
|
---|
| 25 | ILayoutNode<T> NextLeft { get; }
|
---|
| 26 | ILayoutNode<T> NextRight { get; }
|
---|
| 27 | ILayoutNode<T> LeftSibling { get; }
|
---|
| 28 | ILayoutNode<T> LeftmostSibling { get; }
|
---|
| 29 |
|
---|
| 30 | ILayoutNode<T> Thread { get; set; }
|
---|
| 31 | ILayoutNode<T> Ancestor { get; set; }
|
---|
| 32 | ILayoutNode<T> Parent { get; set; }
|
---|
| 33 | List<ILayoutNode<T>> Children { get; set; }
|
---|
| 34 |
|
---|
| 35 | float Mod { get; set; }
|
---|
| 36 | float Prelim { get; set; }
|
---|
| 37 | float Change { get; set; }
|
---|
| 38 | float Shift { get; set; }
|
---|
| 39 | int Number { get; set; }
|
---|
| 40 | int Level { get; set; }
|
---|
| 41 |
|
---|
| 42 | float X { get; set; }
|
---|
| 43 | float Y { get; set; }
|
---|
| 44 |
|
---|
| 45 | bool IsLeaf { get; }
|
---|
| 46 |
|
---|
| 47 | T Content { get; set; }
|
---|
| 48 | }
|
---|
| 49 | } |
---|