Question

我有一个由其他作者在linux / unix环境中编写的c ++源代码。当我在windows vista环境中编译它时，它给了我错误。我正在使用Bloodshed Dev C ++ v 4.9。请帮忙。

#include <iostream.h>
#include <map>
#include <vector>
#include <string>
#include <string.h>
#include <strstream>
#include <unistd.h>
#include <stdlib.h>


using namespace std;

template <class T> class PrefixSpan {
private:
  vector < vector <T> >             transaction;
  vector < pair <T, unsigned int> > pattern;
  unsigned int minsup;
  unsigned int minpat;
  unsigned int maxpat;
  bool all;
  bool where;
  string delimiter;      
  bool verbose;
  ostream *os;

  void report (vector <pair <unsigned int, int> > &projected) 
  {
    if (minpat > pattern.size()) return;

    // print where & pattern
    if (where) { 
      *os << "<pattern>" << endl;

      // what:
      if (all) {
 *os << "<freq>" << pattern[pattern.size()-1].second << "</freq>" << endl;
 *os << "<what>";
 for (unsigned int i = 0; i < pattern.size(); i++) 
   *os << (i ? " " : "") << pattern[i].first;
      } else {
 *os << "<what>";
  for (unsigned int i = 0; i < pattern.size(); i++)
    *os << (i ? " " : "") << pattern[i].first 
        << delimiter << pattern[i].second;
      }

      *os << "</what>" << endl;

      // where
      *os << "<where>";
      for (unsigned int i = 0; i < projected.size(); i++) 
 *os << (i ? " " : "") << projected[i].first;
      *os << "</where>" << endl;

      *os << "</pattern>" << endl;

    } else {

      // print found pattern only
      if (all) {
  *os << pattern[pattern.size()-1].second;
  for (unsigned int i = 0; i < pattern.size(); i++)
    *os << " " << pattern[i].first;
      } else {
  for (unsigned int i = 0; i < pattern.size(); i++)
    *os << (i ? " " : "") << pattern[i].first
        << delimiter << pattern[i].second;
      }

      *os << endl;
    }
  }

  void project (vector <pair <unsigned int, int> > &projected)
  {
    if (all) report(projected);

    map <T, vector <pair <unsigned int, int> > > counter;

    for (unsigned int i = 0; i < projected.size(); i++) {
      int pos = projected[i].second;
      unsigned int id  = projected[i].first;
      unsigned int size = transaction[id].size();
      map <T, int> tmp;
      for (unsigned int j = pos + 1; j < size; j++) {
 T item = transaction[id][j];
 if (tmp.find (item) == tmp.end()) tmp[item] = j ;
      }

      for (map <T, int>::iterator k = tmp.begin(); k != tmp.end(); ++k) 
 counter[k->first].push_back (make_pair <unsigned int, int> (id, k->second));
    }

    for (map <T, vector <pair <unsigned int, int> > >::iterator l = counter.begin (); 
  l != counter.end (); ) {
      if (l->second.size() < minsup) {
 map <T, vector <pair <unsigned int, int> > >::iterator tmp = l;
 tmp = l;
 ++tmp;
 counter.erase (l);
 l = tmp;
      } else {
 ++l;
      }
    }

    if (! all && counter.size () == 0) {
      report (projected);
      return;
    }

    for (map <T, vector <pair <unsigned int, int> > >::iterator l = counter.begin (); 
  l != counter.end(); ++l) {
      if (pattern.size () < maxpat) {
  pattern.push_back (make_pair <T, unsigned int> (l->first, l->second.size()));
  project (l->second);
  pattern.erase (pattern.end());
      }
    }
  }

public:
  PrefixSpan (unsigned int _minsup = 1,
       unsigned int _minpat = 1,        
       unsigned int _maxpat = 0xffffffff,
       bool _all = false,
       bool _where = false,
       string _delimiter = "/",
       bool _verbose = false):
    minsup(_minsup), minpat (_minpat), maxpat (_maxpat), all(_all), 
    where(_where), delimiter (_delimiter),  verbose (_verbose) {};

  ~PrefixSpan () {};

  istream& read (istream &is) 
  {
    string line;
    vector <T> tmp;
    T item;
    while (getline (is, line)) {
       tmp.clear ();
       istrstream istrs ((char *)line.c_str());
       while (istrs >> item) tmp.push_back (item);
       transaction.push_back (tmp);
    }

    return is;
  }

  ostream& run (ostream &_os)
  {
    os = &_os;
    if (verbose) *os << transaction.size() << endl;
    vector <pair <unsigned int, int> > root;
    for (unsigned int i = 0; i < transaction.size(); i++) 
      root.push_back (make_pair (i, -1));
     project (root); 
    return *os;
  }

  void clear ()
  {
    transaction.clear ();
    pattern.clear ();
  }
};

int main (int argc, char **argv)
{
  extern char *optarg;
  unsigned int minsup = 1;
  unsigned int minpat = 1;
  unsigned int maxpat = 0xffffffff;
  bool all = false;
  bool where = false;
  string delimiter = "/";
  bool verbose = false;
  string type = "string"; 

  int opt;
  while ((opt = getopt(argc, argv, "awvt:M:m:L:d:")) != -1) {
    switch(opt) {
    case 'a':
      all = true;
      break;
    case 'w':
      where = true;
      break;
    case 'v':
      verbose = true;
      break;
    case 'm':
      minsup = atoi (optarg);
      break;
    case 'M':
      minpat = atoi (optarg);
      break;
    case 'L':
      maxpat = atoi (optarg);
      break;
    case 't':
      type = string (optarg); 
      break;
    case 'd':
      delimiter = string (optarg);
      break;
    default:
      cout << "Usage: " << argv[0] 
    << " [-m minsup] [-M minpat] [-L maxpat] [-a] [-w] [-v] [-t type] [-d delimiter] < data .." << endl;
      return -1;
    }
  }

  if (type == "int") { 
     PrefixSpan<unsigned int> prefixspan (minsup, minpat, maxpat, all, where, delimiter, verbose);
     prefixspan.read (cin);
     prefixspan.run  (cout);
  }else if (type == "short") {
     PrefixSpan<unsigned short> prefixspan (minsup, minpat, maxpat, all, where, delimiter, verbose);
     prefixspan.read (cin);
     prefixspan.run  (cout);
  } else if (type == "char") {
     PrefixSpan<unsigned char> prefixspan (minsup, minpat, maxpat, all, where, delimiter, verbose);
     prefixspan.read (cin);
     prefixspan.run  (cout);
  } else if (type == "string") {
     PrefixSpan<string> prefixspan (minsup, minpat, maxpat, all, where, delimiter, verbose);
     prefixspan.read (cin);
     prefixspan.run  (cout);
  } else { 
     cerr << "Unknown Item Type: " << type << " : choose from [string|int|short|char]" << endl;
     return -1;
  }

  return 0;
}

Answer 1

您可以通过删除＆lt; unistd.h＆gt;来使其在Windows上运行。包括并取消使用getopt()函数...您必须手动解析命令行或使用boost::program_options。

标题＆lt; unistd.h＆gt;并且getopt（）函数在兼容UNIX的操作系统上都可用，但在Windows上不可用（明显不兼容）。如果您希望能够在没有任何源代码更改的情况下进行编译，您也可以尝试下载并安装Cygwin，它试图在Windows内部提供符合UNIX标准的环境并取得一些成功（尽管它不是完美，无论如何）。或者，将来您可以使用Boost或Qt等跨平台库。

手动解析
根据您的用法消息，您可以使用以下代码替换while循环：

int idx=1;
while ( idx < argc ){
    std::string arg(argv[idx]);
    if (arg == "-m"){
        //minsup 
        idx++;
        if (idx>argc){ 
           std::cerr<<"Option \""<<arg<<"\" requires parameter."<<std::endl;
           usage(argv[0]); // move usage message into a function
           std::exit(1);
        }
        minsup=atoi(argv[idx++]);
    }else if (arg == "-M"){
        //minpat
        idx++;
        if (idx>argc){ 
           std::cerr<<"Option \""<<arg<<"\" requires parameter."<<std::endl;
           usage(argv[0]); // move usage message into a function
           std::exit(1);
        }
        minpat=atoi(argv[idx++]);
    }else if (arg == "-L"){
        //maxpat
        idx++;
        if (idx>argc){ 
           std::cerr<<"Option \""<<arg<<"\" requires parameter."<<std::endl;
           usage(argv[0]); // move usage message into a function
           std::exit(1);
        }
        maxpat=atoi(argv[idx++]);
    }else if (arg == "-a"){
        all=true;
        idx++;
    }else if (arg == "-w"){
        where=true;
        idx++;
    }else if (arg == "-v"){
        verbose=true;
        idx++;
    }else if (arg == "-t"){
        //type
        idx++;
        if (idx>argc){ 
           std::cerr<<"Option \""<<arg<<"\" requires parameter."<<std::endl;
           usage(argv[0]); // move usage message into a function
           std::exit(1);
        }
        type=argv[idx++];
    }else if (arg == "-d"){
        idx++;
        if (idx>argc){ 
           std::cerr<<"Option \""<<arg<<"\" requires parameter."<<std::endl;
           usage(argv[0]); // move usage message into a function
           std::exit(1);
        }
        delimiter=argv[idx++];
    }else {
        usage();
        std::exit(1);
    }
}

然后在主函数之前的某处添加以下代码：

void usage(const char* progname)
{
    std::cout << "Usage: " << progname << " [-m minsup] [-M minpat] [-L maxpat] [-a] [-w] [-v] [-t type] [-d delimiter]" < data .." << endl;
}

请注意，这与getopt的实际行为略有不同（getopt允许你将-awv组合在一起，而这种解析不会......但如果这不重要，那么这应该完成工作。

Answer 2

我们走了，你们得到了很好的编译器。 mingw32-gcc编译器（这是DevCpp内置编译器）只是给出了一些像这样的错误

error: dependent-name ` T::int' is parsed as a non-type, but instantiation yields a type

它不会将map <T, int>::iterator作为一种类型，因为那取决于模板，您需要使用typename关键字作为从属名称

因此，请使用typename map <T, int>::iterator

我已经完成了测试编译here。有源main.cpp文件和编译的.exe文件和一个数据文件。

看起来你从这里得到了这些代码

http://www.chasen.org/~taku/software/prefixspan/

它的GPL v2，您可能还需要将这些许可证添加到您的代码中。

修改：添加固定代码供以后参考

/*
 PrefixSpan: An efficient algorithm for sequential pattern mining

 $Id: prefixspan.cpp,v 1.8 2002/04/03 13:35:23 taku-ku Exp $;

 Copyright (C) 2002 Taku Kudo   All rights reserved.
 This is free software with ABSOLUTELY NO WARRANTY.

 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 <map>
#include <vector>
#include <string>
#include <string.h>
#include <strstream>
#include <unistd.h>
#include <stdlib.h>

using namespace std;

template <class T> class PrefixSpan {
private:
    vector < vector <T> >            transaction;
    vector < pair <T, unsigned int> > pattern;
    unsigned int minsup;
    unsigned int minpat;
    unsigned int maxpat;
    bool all;
    bool where;
    string delimiter;
    bool verbose;
    ostream *os;

void report (vector <pair <unsigned int, int> > &projected){
    if (minpat > pattern.size()) return;

    // print where & pattern
    if (where) {
        *os << "<pattern>" << endl;

        // what:
        if (all) {
            *os << "<freq>" << pattern[pattern.size()-1].second << "</freq>" << endl;
            *os << "<what>";
            for (unsigned int i = 0; i < pattern.size(); i++)
                *os << (i ? " " : "") << pattern[i].first;
            } else {
                *os << "<what>";
                 for (unsigned int i = 0; i < pattern.size(); i++)
                    *os << (i ? " " : "") << pattern[i].first << delimiter << pattern[i].second;
            }
            *os << "</what>" << endl;

        // where
        *os << "<where>";
        for (unsigned int i = 0; i < projected.size(); i++)
            *os << (i ? " " : "") << projected[i].first;
        *os << "</where>" << endl;
        *os << "</pattern>" << endl;
    } else {
        // print found pattern only
        if (all) {
             *os << pattern[pattern.size()-1].second;
             for (unsigned int i = 0; i < pattern.size(); i++)
                *os << " " << pattern[i].first;
            } else {
                 for (unsigned int i = 0; i < pattern.size(); i++)
                    *os << (i ? " " : "") << pattern[i].first << delimiter << pattern[i].second;
            }

        *os << endl;
    }
}

void project (vector <pair <unsigned int, int> > &projected){
    if (all) report(projected);

    map <T, vector <pair <unsigned int, int> > > counter;

    for (unsigned int i = 0; i < projected.size(); i++) {
        int pos = projected[i].second;
        unsigned int id = projected[i].first;
        unsigned int size = transaction[id].size();
        map <T, int> tmp;
        for (unsigned int j = pos + 1; j < size; j++) {
            T item = transaction[id][j];
            if (tmp.find (item) == tmp.end()) tmp[item] = j ;
        }

        for (typename map <T, int>::iterator k = tmp.begin(); k != tmp.end(); ++k)
            counter[k->first].push_back (make_pair <unsigned int, int> (id, k->second));
    }

    for (typename map <T, vector <pair <unsigned int, int> > >::iterator l = counter.begin ();
    l != counter.end (); ) {
        if (l->second.size() < minsup) {
            typename map <T, vector <pair <unsigned int, int> > >::iterator tmp = l;
            tmp = l;
            ++tmp;
            counter.erase (l);
            l = tmp;
        } else {
            ++l;
        }
    }

    if (! all && counter.size () == 0) {
        report (projected);
        return;
    }

    for (typename map <T, vector <pair <unsigned int, int> > >::iterator l = counter.begin ();
    l != counter.end(); ++l) {
        if (pattern.size () < maxpat) {
             pattern.push_back (make_pair <T, unsigned int> (l->first, l->second.size()));
             project (l->second);
             pattern.erase (pattern.end());
        }
    }
}

public:
    PrefixSpan (unsigned int _minsup = 1,
            unsigned int _minpat = 1,
            unsigned int _maxpat = 0xffffffff,
            bool _all = false,
            bool _where = false,
            string _delimiter = "/",
            bool _verbose = false):
    minsup(_minsup), minpat (_minpat), maxpat (_maxpat), all(_all),
    where(_where), delimiter (_delimiter),  verbose (_verbose) {};

    ~PrefixSpan () {};

    istream& read (istream &is){
        string line;
        vector <T> tmp;
        T item;
        while (getline (is, line)) {
            tmp.clear ();
            istrstream istrs ((char *)line.c_str());
            while (istrs >> item) tmp.push_back (item);
            transaction.push_back (tmp);
        }

        return is;
    }

    ostream& run (ostream &_os){
        os = &_os;
        if (verbose) *os << transaction.size() << endl;
        vector <pair <unsigned int, int> > root;
        for (unsigned int i = 0; i < transaction.size(); i++)
            root.push_back (make_pair (i, -1));
         project (root);
        return *os;
    }

    void clear (){
        transaction.clear ();
        pattern.clear ();
    }
};

int main (int argc, char **argv){
    extern char *optarg;
    unsigned int minsup = 1;
    unsigned int minpat = 1;
    unsigned int maxpat = 0xffffffff;
    bool all = false;
    bool where = false;
    string delimiter = "/";
    bool verbose = false;
    string type = "string";

    int opt;
    while ((opt = getopt(argc, argv, "awvt:M:m:L:d:")) != -1){
        switch(opt) {
        case 'a':
            all = true;
            break;
        case 'w':
            where = true;
            break;
        case 'v':
            verbose = true;
            break;
        case 'm':
            minsup = atoi (optarg);
            break;
        case 'M':
            minpat = atoi (optarg);
            break;
        case 'L':
            maxpat = atoi (optarg);
            break;
        case 't':
            type = string (optarg);
            break;
        case 'd':
            delimiter = string (optarg);
            break;
        default:
            cout << "Usage: " << argv[0]
            << " [-m minsup] [-M minpat] [-L maxpat] [-a] [-w] [-v] [-t type] [-d delimiter] < data .." << endl;
            return -1;
        }
    }

    if (type == "int") {
         PrefixSpan<unsigned int> prefixspan (minsup, minpat, maxpat, all, where, delimiter, verbose);
         prefixspan.read (cin);
         prefixspan.run (cout);
    }else if (type == "short") {
         PrefixSpan<unsigned short> prefixspan (minsup, minpat, maxpat, all, where, delimiter, verbose);
         prefixspan.read (cin);
         prefixspan.run (cout);
    } else if (type == "char") {
         PrefixSpan<unsigned char> prefixspan (minsup, minpat, maxpat, all, where, delimiter, verbose);
         prefixspan.read (cin);
         prefixspan.run (cout);
    } else if (type == "string") {
         PrefixSpan<string> prefixspan (minsup, minpat, maxpat, all, where, delimiter, verbose);
         prefixspan.read (cin);
         prefixspan.run (cout);
    } else {
        cerr << "Unknown Item Type: " << type << " : choose from [string|int|short|char]" << endl;
        return -1;
    }

    return 0;
}

Answer 3

如果我更换以下内容，代码将使用mingw 4.4.1编译（不需要cygwin）：

map <T,...

与

typename map <T, ...

正如其他人所建议的那样，并取代：

<iostream.h>

使用：

<iostream>

我是否还可以观察到DevC ++不再被开发出来，而且还有很多错误 - 您应该考虑切换到更好的替代方案，例如Code::Blocks。

如何在Windows Vista上编译为Linux / Unix编写的C ++源代码（给出代码）

3 个答案: