source: branches/DataPreprocessing/HeuristicLab.DataPreprocessing/3.3/Implementations/FilterLogic.cs @ 10802

Last change on this file since 10802 was 10802, checked in by mleitner, 6 years ago

Refactoring

File size: 2.7 KB
Line 
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
22using HeuristicLab.DataPreprocessing.Filter;
23using System.Collections.Generic;
24using System;
25using System.Linq;
26using HeuristicLab.DataPreprocessing.Interfaces;
27namespace HeuristicLab.DataPreprocessing {
28  public class FilterLogic : IFilterLogic {
29
30    private IFilteredPreprocessingData preprocessingData;
31
32    public FilterLogic(IFilteredPreprocessingData preprocessingData)
33    {
34      this.preprocessingData = preprocessingData;
35    }
36
37    public bool[] Preview(IList<IFilter> filters, bool isAndCombination)
38    {
39       IList<IFilter> activeFilters = filters.Where(f => f.Active && f.ConstraintData != null).ToList<IFilter>();
40
41       if (activeFilters.Count == 0) {
42        return new bool[preprocessingData.Rows];
43       }
44
45       bool[] result = TrueBoolArray(preprocessingData.Rows);
46
47         foreach (IFilter filter in activeFilters)
48         {
49           bool[] filterResult = filter.Check();
50           for (int row = 0; row < result.Length; ++row)
51           {
52             result[row] = Result(result[row], filterResult[row], isAndCombination);
53           }
54         }
55
56        preprocessingData.SetFilter(result);
57       
58        return result;
59    }
60
61    public bool[] TrueBoolArray(int rows) {
62      return Enumerable.Repeat<bool>(true, rows).ToArray();
63    }
64
65    public bool Result(bool current, bool addition, bool isAndCombination) {
66      return isAndCombination ? current && addition : current || addition;
67    }
68
69    public void Apply(IList<IFilter> filters, bool isAndCombination)
70    {
71        preprocessingData.SetFilter(Preview(filters, isAndCombination));
72        preprocessingData.PersistFilter();
73    }
74
75    public void Reset() {
76      preprocessingData.ResetFilter();
77    }
78
79    public IPreprocessingData PreprocessingData
80    {
81      get { return preprocessingData; }
82    }
83  }
84}
Note: See TracBrowser for help on using the repository browser.