mset_vat.h

/*
 *  Copyright (C) 2005 M.J. Zaki <zaki@cs.rpi.edu> Rensselaer Polytechnic Institute
 *  Written by parimi@cs.rpi.edu
 *  Updated by chaojv@cs.rpi.edu, alhasan@cs.rpi.edu, salems@cs.rpi.edu
 *
 *  This program 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 2
 *  of the License, or (at your option) any later version.
 *
 *  This program 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 this program; if not, write to the Free Software Foundation, Inc.,
 *  59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.
 */
#ifndef _MSET_VAT_H_
#define _MSET_VAT_H_

#include <iterator>
#include "pattern.h"
#include "pat_support.h"
#include "generic_classes.h"
#include "typedefs.h"

template<class PP, class MP, template <typename> class ALLOC, template <typename P, typename> class ST >
ostream& operator<< (ostream& , const vat<PP, MP, ALLOC, ST >&);
 
template<class PP, class MP, template <typename> class ALLOC, template <typename P, typename> class ST >
istream& operator>> (istream& , vat<PP, MP, ALLOC, ST >&);


template<class PP, class MP, template <typename> class ALLOC, template <typename, typename> class ST >
class vat<MSET_PROP, V_Fkk_MINE_PROP, ALLOC, ST >
{
 public:
  typedef pattern_support<V_Fkk_MINE_PROP> PAT_SUP;
  typedef vat<MSET_PROP, V_Fkk_MINE_PROP, ALLOC, ST > VAT;
  
  typedef ST<pair<int, int>, ALLOC<pair<int, int> > > IDLIST_T; // Definition of a itemset VAT.
  typedef typename IDLIST_T::const_iterator CONST_IT;
  typedef typename IDLIST_T::iterator IT;
 

  void* operator new(size_t size) {
    ALLOC<VAT> a;
    return a.allocate(size);
  }

  void  operator delete(void *p, size_t size) {
    if (p) {
      ALLOC<VAT> a;
      a.deallocate(static_cast<VAT*> (p), size);
    }
  }
 
  vat() {}
  
  IT begin() {
    return _idlist.begin();
  }

  CONST_IT begin() const {
    return _idlist.begin();
  }

  IT end() {
    return _idlist.end();
  }

  CONST_IT end() const {
    return _idlist.end();
  }

  bool empty() const {
    return _idlist.empty;
  }

  int size() {
    return _idlist.size();
  }
  
  void make_empty() { 
    _idlist.clear();
  }        

  void push_back(const pair<int, int>& val) {
    _idlist.push_back(val);
  }
    
  pair<int, int>& operator[](int n) {
    return *(begin()+n);
  } 

  void resize(int x) {
    _idlist.resize(x);
  }

  //clear the vector
  void clear() {
    _idlist.clear();
  }
  
  
  template<class PAT>
    static VAT** intersection(const VAT* const& vat_i, const VAT* const& vat_j, PAT_SUP** cand_sups, PAT**, bool& is_l2) {
    
    VAT** cand_vats = new VAT*[1]; // This memory is reclaimed in count() routine of count_support.h file
    cand_vats[0] = new VAT();      // This memory is reclaimed in count() routine of count_support.h file, only if the 
    // corresponding pattern is NOT frequent, otherwise, Storage Manager get a hold of this
    // VAT.
    
    if(cand_sups[0] == 0) { // No pattern_support class associated to return support value, ERROR
      delete cand_vats[0];
      delete[] cand_vats;
      
      cerr << "mset_vat: No candidates VATs to be generated." << endl;
      return NULL;
    }
    
    CONST_IT it_i=vat_i->begin(), it_j=vat_j->begin();
    
    while(it_i!=vat_i->end() && it_j!=vat_j->end()) {
      if((*it_i).first < (*it_j).first) {
        it_i++;
        continue;
      }
      
      if((*it_j).first < (*it_i).first) {
        it_j++;
        continue;
      }
     
      if(vat_i == vat_j) {  // Intersecting the same pattern.
        if((*it_i).second > 1)
          cand_vats[0]->push_back(make_pair((*it_i).first, (*it_i).second-1));
      } else {
        cand_vats[0]->push_back(make_pair((*it_i).first, (*it_j).second));
      }

      it_i++;
      it_j++;
    }//end while
    
    // setting the support value that will be checked in the count method of count_support class.
    cand_sups[0]->set_sup(make_pair(cand_vats[0]->size(), cand_vats[0]->size()));
    
    return cand_vats;
  }
  
  unsigned long size() const {
    return _idlist.size();
  }

  vat(const VAT &orig) {
    *this= orig;
  }

  ~vat(){
    _idlist.clear();
  }
  
  const VAT &operator=(const VAT &right) {
    if ( &right != this ) {         // avoid self assignment
      _idlist=right._idlist;
    }
    else
      cout << "Attempted assignment of a Vat to itself\n";
    
    return *this;   // enables cascaded assignments
  }
  
  // Return Vat length
  unsigned long int byte_size() const {
    
    return _idlist.size()* sizeof(int);
  }
 
  friend ostream& operator<< <>(ostream& , const VAT&);
  
  friend istream& operator>> <>(istream& , VAT&);
  
 private:
  IDLIST_T _idlist;
  
};


template<class T, class MP, template <typename> class ALLOC, template <typename P, typename> class ST >
ostream& operator<<(ostream& output, vat<T, MP, ALLOC, ST> const& orig) {
  std::ostream_iterator<int> out(output, " ");
  std::copy(orig.begin(), orig.end(), out);
  output <<'\n';
  return output;   // enables cascading
}

template<class T, class MP, template <typename> class ALLOC, template <typename P, typename> class ST >
istream& operator>>(istream& input,  vat<T, MP, ALLOC, ST >& orig) {
  const unsigned int MAXLINE=20000;
  char line[MAXLINE];
  input.getline(line,MAXLINE);
  stringstream s(line);
  std::istream_iterator<int> in(s);
  std::istream_iterator<int> eof;
  
  orig._idlist.clear();
  std::copy (in,eof, std::back_inserter(orig._idlist));
  return input;   // enables cascading
}

#endif

---