ibm2ascii.cc

DCI 算法 源代码 DCI: A hybrid Algorithm for Frequent Set Counting

// Copyright (C) 2003 salvatore orlando <[e-mail]>
//  
// 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.
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
#include <stdio.h>

#include "transaction.hh"
#include "database.hh"



int main(int argc, char ** argv){

  if(argc != 3) {
    cerr << "Usage: " << argv[0] << " bin_input_file ascii_output_file" << endl;
    return 1;
  }
  
  ibmFSin ii(argv[1]);
  if(!ii.isOpen()) {
    cerr << argv[1] << " could not be opened!" << endl;
    exit(1);
  }


  asciiFSout oo(argv[2]);
  if(!oo.isOpen()) {
    cerr << argv[2] << " could not be opened!" << endl;
    exit(1);
  }

  vector<int> t;
  while(ii.getNextTransaction(t)) {
    oo.writeTransaction(t);
  }
  

}