[10539] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[14185] | 3 | * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[10539] | 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.Drawing;
|
---|
| 23 | using HeuristicLab.Common;
|
---|
[10245] | 24 | using HeuristicLab.Core;
|
---|
[10813] | 25 | using HeuristicLab.DataPreprocessing.Filter;
|
---|
[10242] | 26 |
|
---|
[10539] | 27 | namespace HeuristicLab.DataPreprocessing {
|
---|
[10313] | 28 | [Item("Filter", "Represents the filter grid.")]
|
---|
[10614] | 29 | public class FilterContent : Item, IViewShortcut {
|
---|
[10245] | 30 |
|
---|
[10313] | 31 | public static new Image StaticItemImage {
|
---|
| 32 | get { return HeuristicLab.Common.Resources.VSImageLibrary.Filter; }
|
---|
| 33 | }
|
---|
| 34 |
|
---|
[10999] | 35 | private ICheckedItemCollection<IFilter> filters = new CheckedItemCollection<IFilter>();
|
---|
[10842] | 36 |
|
---|
[13508] | 37 | public FilterLogic FilterLogic { get; private set; }
|
---|
[10842] | 38 |
|
---|
[10964] | 39 | public ICheckedItemCollection<IFilter> Filters {
|
---|
| 40 | get {
|
---|
[10813] | 41 | return this.filters;
|
---|
| 42 | }
|
---|
[10964] | 43 | set {
|
---|
[10813] | 44 | this.filters = value;
|
---|
| 45 | }
|
---|
| 46 | }
|
---|
| 47 |
|
---|
[10999] | 48 | private bool isAndCombination = true;
|
---|
[10964] | 49 | public bool IsAndCombination {
|
---|
| 50 | get {
|
---|
[10842] | 51 | return this.isAndCombination;
|
---|
| 52 | }
|
---|
[10964] | 53 | set {
|
---|
[10842] | 54 | this.isAndCombination = value;
|
---|
| 55 | }
|
---|
| 56 | }
|
---|
| 57 |
|
---|
[13508] | 58 | public FilterContent(FilterLogic filterLogic) {
|
---|
[10999] | 59 | FilterLogic = filterLogic;
|
---|
[10964] | 60 | }
|
---|
| 61 |
|
---|
| 62 | protected FilterContent(FilterContent content, Cloner cloner)
|
---|
[10539] | 63 | : base(content, cloner) {
|
---|
[10245] | 64 | }
|
---|
| 65 |
|
---|
[10539] | 66 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
[10245] | 67 | return new FilterContent(this, cloner);
|
---|
| 68 | }
|
---|
[10242] | 69 | }
|
---|
| 70 | }
|
---|