source: stable/HeuristicLab.Algorithms.DataAnalysis.DecisionTrees/3.4/Pruning/NoPruning.cs @ 17591

#region License Information
/* HeuristicLab
 * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
 *
 * This file is part of HeuristicLab.
 *
 * HeuristicLab is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * HeuristicLab is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
 */
#endregion

using System.Collections.Generic;
using System.Threading;
using HeuristicLab.Common;
using HeuristicLab.Core;
using HeuristicLab.Problems.DataAnalysis;
using HEAL.Attic;

namespace HeuristicLab.Algorithms.DataAnalysis {
  [StorableType("D67152AA-3533-45D2-B77B-4A0742FB4B92")]
  [Item("NoPruning", "No pruning")]
  public sealed class NoPruning : ParameterizedNamedItem, IPruning {
    #region Constructors & Cloning
    [StorableConstructor]
    private NoPruning(StorableConstructorFlag _) : base(_) { }
    private NoPruning(NoPruning original, Cloner cloner) : base(original, cloner) { }
    public NoPruning() { }
    public override IDeepCloneable Clone(Cloner cloner) {
      return new NoPruning(this, cloner);
    }
    #endregion


    public int MinLeafSize(IRegressionProblemData pd, ILeafModel leafModel) {
      return 0;
    }
    public void Initialize(IScope states) { }

    public void Prune(RegressionNodeTreeModel treeModel, IReadOnlyList<int> trainingRows, IReadOnlyList<int> pruningRows, IScope scope, CancellationToken cancellationToken) { }
  }
}