Содержимое файла записать в queue и сосчитать количество гласных

#include "stdafx.h"
#include <iostream>
#include <queue>
#include <condition_variable>
#include <fstream> 
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <iterator>
#include<cstring>
 
 
std::queue<std::string> queue;
//1
void readAndWriteFile(const std::string& pathToFile)
{
    unsigned number = 5;
    std::ifstream stream(pathToFile);
    if (!stream)
    {
        std::cout << "Can not open file" << "\n";
    }
    else
    {
        for (int index = 0; index < number; ++index ) 
        {
            
            queue.push(stream);
        }
    }
}
//2
bool isVowel(char ch) 
{ 
    return std::strchr("aeiouAEIOU", ch) != NULL; 
}
void findVowels() 
{
    std::string::const_iterator p = std::partition(queue.front(), queue.back(), std::ptr_fun(isVowel));
 
    std::copy(queue.front(), queue.back(),
        std::ostream_iterator<char>(std::cout, " "));
 
}
 
    
int main()
{
    return 0;
}

for (auto str : queue) std::cout << std::count(str.begin(), str.end(), std::ptr_fun(isVowel)) ;

void ProduceData()
{
    const std::string& pathToFile = "D:\\text.txt";
    unsigned number = 5;
    std::string s;
    std::ifstream stream(pathToFile);
    if (!stream)
    {
        std::cout << "Can not open file" << "\n";
    }
    while (std::getline(stream, s))
    {
            queue.push(s);
    }
    std::cout << "queue: " << queue.front() << queue.back();
}

std::cout << "queue: " << queue.front() << queue.back();

#include <iostream>
#include <queue>
#include <fstream>
#include <algorithm>
 
void read_and_write_file(const ::std::string &pathToFile, ::std::queue<::std::string> &queue);
void find_vowels(::std::queue<::std::string> &queue);
 
int main()
{
    ::std::queue<::std::string> queue;
    ::read_and_write_file("1", queue);
    ::find_vowels(queue);
}
 
void read_and_write_file(const ::std::string &pathToFile, ::std::queue<::std::string> &queue)
{
    ::std::ifstream in(pathToFile);
    if (!in)
    {
        ::std::cout << "Can not open file" << ::std::endl;
        return;
    }
 
    const size_t number = 5;
    ::std::string value;
    for (size_t index = 0; index < number; ++index)
    {
        in >> value;
        queue.push(value);
    }
}
 
bool is_vowel(const char ch)
{
    switch (std::tolower(static_cast<unsigned char>(ch)))
    {
    case 'a':
    case 'e':
    case 'i':
    case 'o':
    case 'u':
        return true;
    default:
        return false;
    }
}
 
size_t count_vowels(const ::std::string &str)
{
    return std::count_if(str.begin(), str.end(), ::is_vowel);
}
 
void find_vowels(::std::queue<::std::string> &queue)
{
    while (!queue.empty())
    {
        ::std::cout << queue.front() << ": " << ::count_vowels(queue.front()) << ::std::endl;
        queue.pop();
    }
}

#include <iostream>
#include <fstream>
#include <algorithm>
#include <queue>
#include <cstring>
 
const char * FILE_NAME = "file.txt";
const int WORDS_TO_TEST = 5;
 
int main() {
    int i, vowels = 0;
    std::queue<std::string> words;
    std::string wrd;
    
    std::ifstream ifs(FILE_NAME);
    if ( ! ifs.is_open() ) {
        std::cerr << "Can't open file " << FILE_NAME << " for input!" << std::endl;
        return 1;
    }
    
    for ( i = 0; i < WORDS_TO_TEST; ++i ) {
        if ( ! ( ifs >> wrd ) ) {
            std::cerr << "Can't read needed (" << WORDS_TO_TEST << ") words." << std::cerr;
            ifs.close();
            return 1;
        }
        
        words.push(wrd);
    }
    
    ifs.close();
    
    std::cout << "Word\tVowels" << std::endl;
    while ( ! words.empty() ) {
        wrd = words.front();
        int vow = std::count_if(wrd.begin(), wrd.end(), [](const char& c) { return ( strchr("AEIOUaeiou", c) != NULL ); });
        vowels += vow;
        std::cout << wrd << "\t" << vow << std::endl;
        
        words.pop();
    }
    std::cout << "-----------------------------------------\nTotal: " << vowels << " vowels." << std::endl;
    
    return 0;
}

for (std::uint8_t count = 0; (count < 5) || (count < queue.back()); ++count)
            queue.push(word);