LatticeFilter.h

/**************************************************************************
 * Copyright (c) 2007 Clifford Conley Owens III                           *
 *                                                                        *
 * This file is part of Biorithm.                                         *
 *                                                                        *
 * Biorithm 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.                                    *
 *                                                                        *
 * Biorithm 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 Biorithm.  If not, see <http://www.gnu.org/licenses/>.      *
 *                                                                        *
 **************************************************************************/

#ifndef LATTICEFILTER_H
#define LATTICEFILTER_H

// ---------------------------- Internal Headers ---------------------------- //

#include "Filter.h"

// ---------------------------- External Headers ---------------------------- //

#include "graph.h"
// conley, you will have to check out src/c++/apriori from svn for this file.
#include "dag.h"

struct DummyClass
{
  string id;
  DummyClass(string i)
      : id(i)
    {}
  virtual ~DummyClass()
    {}
  
  string getId()
    {
      return(id);
    }
  
};

  
typedef DAGNode< DummyClass > LatticeNode;
typedef DAG< LatticeNode > ItemsetLattice;


class LatticeFilter: public Filter
{
    protected:
  // The graph representing a subset of the lattice.
  MyGraph graph;
  // all the itemsets i have seen so far, mapped from the name.
//  map< string,  ItemSet > itemsets;
  // sets representing columns in the itemsets seen so far, also mapped from the name.
  map< string, set< string > > columnSets;

  unsigned int numNonMaximalItemsets;


public:
        LatticeFilter();
        LatticeFilter(const LatticeFilter& src);
        virtual ~LatticeFilter();
        virtual LatticeFilter& operator =(const LatticeFilter& rhs);
        virtual bool filter(const ItemSet& is, TruthMatrix& tm, string& msg);
};

#endif