nombre de fichiers contenant le même terme dans un répertoire

#include <dirent.h>
#include <stdio.h>
#include <iostream>
#include <fstream>
#include <iomanip>

bool exists(const std::string& filename, const std::string& pattern)
{
  // entree se referme tout seul, lors de la desuction
  // de l'objet ifstream
  std::ifstream entree(filename.c_str());
  std::string s;
  while (entree >> s)
    if (s == pattern)
      return true;

  return false;
}

bool isValid(const std::string& path)
{
  return !path.empty() && path != "." && path != "..";
}

int main()
{
  static const std::string folder = "in";

  DIR* rep = opendir(folder.c_str());
  if (rep)
  {
    struct dirent* lecture;
    int nbFile = 0;
    int totalFile = 0;

    while ((lecture = readdir(rep)))
    {
      if (!isValid(lecture->d_name))
	continue;

      std::cout << std::left << std::setw(25) << lecture->d_name;
      ++totalFile;
      if (exists(folder + "/" + lecture->d_name, "118"))
      {
	std::cout << "existe" << std::endl;
	++nbFile;
      }
      else
	std::cout << "non" << std::endl;
    }

    if (nbFile > 0)
      std::cout << "Le nombre de fichier contenant le terme est "
		<< nbFile << std::endl;

    closedir(rep);
    std::cout << "Le nombre de fichiers est : " << totalFile << std::endl;
  }

  return 0;
}

#include <dirent.h>
#include <stdio.h>
#include <iostream>
#include <fstream>
#include <iomanip>
#include <map>

bool exists(const std::string& filename, const std::string& pattern)
{
  // entree se referme tout seul, lors de la desuction
  // de l'objet ifstream
  std::ifstream entree(filename.c_str());
  std::string s;
  while (entree >> s)
    if (s == pattern)
      return true;

  return false;
}

bool isValid(const std::string& path)
{
  return !path.empty() && path != "." && path != "..";
}

void fillMap(std::map<std::string, int>& map, const std::string& filename)
{
  std::ifstream entree(filename.c_str());
  std::string s;
  while (entree >> s)
    ++map[s];
}

void showTermFrequency(const std::string& filename)
{
  std::map<std::string, int> map;
  fillMap(map, filename);

  int som = 0;
  typedef std::map<std::string, int>::const_iterator iter;
  for (iter it = map.begin(); it != map.end(); ++it)
    som += it->second;

  std::cout << "\tLes tf du document " << filename << std::endl;
  for (iter it = map.begin(); it != map.end(); ++it)
    if (som !=0)
      std::cout << "\t\t* tf du mot " << it->first << " est " << (float)it->second / som << std::endl;
}

int main()
{
  static const std::string folder = "in";

  DIR* rep = opendir(folder.c_str());
  if (rep)
  {
    struct dirent* lecture;
    int nbFile = 0;
    int totalFile = 0;

    while ((lecture = readdir(rep)))
    {
      if (!isValid(lecture->d_name))
	continue;

      std::cout << std::left << std::setw(25) << lecture->d_name;
      ++totalFile;
      if (exists(folder + "/" + lecture->d_name, "118"))
      {
	std::cout << "existe" << std::endl;
	++nbFile;
      }
      else
	std::cout << "non" << std::endl;

      showTermFrequency(folder + "/" + lecture->d_name);
      std::cout << std::endl;
    }
    if (nbFile > 0)
      std::cout << "Le nombre de fichier contenant le terme est "
		<< nbFile << std::endl;
    closedir(rep);
    std::cout << "Le nombre de fichiers est : " << totalFile << std::endl;
  }

  return 0;
}