Question

I am adding strings such as B1, P4, B4 B2, P6 .. etc to the list. I am trying to move items from the list to either a stack or a queue, until the list is empty. So if the items letter is P, i store it on a queue(back or front it doesn’t matter). If the letter is B then i store it on a stack. I tried implementing it like this but I get this error:

Boxes\main.cpp||In function 'int main()':|
Boxes\main.cpp|54|error: no matching function for call to 'std::queue<std::list<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > >, std::deque<std::list<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > >, std::allocator<std::list<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::|
c:\program files (x86)\codeblocks\mingw\bin\..\lib\gcc\mingw32\4.4.1\include\c++\bits\stl_queue.h|218|note: candidates are: void std::queue<_Tp, _Sequence>::push(const typename _Sequence::value_type&) [with _Tp = std::list<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > >, _Sequence = std::deque<std::list<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > >, std::allocator<std::list<std::b|
Boxes\main.cpp|56|error: no matching function for call to 'std::stack<std::list<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > >, std::deque<std::list<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > >, std::allocator<std::list<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::|
c:\program files (x86)\codeblocks\mingw\bin\..\lib\gcc\mingw32\4.4.1\include\c++\bits\stl_stack.h|182|note: candidates are: void std::stack<_Tp, _Sequence>::push(const typename _Sequence::value_type&) [with _Tp = std::list<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > >, _Sequence = std::deque<std::list<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > >, std::allocator<std::list<std::b|

Any suggestions will be appreciated.

Here is what I have:

#include <iostream>

using namespace std;

#include <list> 
#include <queue>
#include <stack>
template <typename T>                       // prototype for client function
void print(list<T> &);

int main()
{
    list<string> lst;
    queue< list<string> > package;
    stack< list<string> > box;
    string choice, str;
    string::size_type pos,  start_position=0;
    bool choice_flag = true;

    do{
        cin >> choice;
        if(choice == "QUIT"){
            choice_flag = false;
            break;
        }
        else{
            lst.push_back(choice);
        }
    }while(choice_flag);

    cout << "the size of the list is " << lst.size() << endl;

    if (lst.empty() == true)
        cout << "the list is empty" << endl << endl;
    else
        cout << "the list is not empty" << endl << endl;

    print(lst);

    // attempt to move from list lst and push onto queue or stack
    while(!lst.empty()){
        str = lst.front();
        if(str.find('P' ,0))
            package.push(str);
        else
            box.push(str);
    }

    return 0;
}

Answer 1

If you want a queue and stack of strings change:

queue< list<string> > package;
stack< list<string> > box;

to:

queue< string > package;
stack< string > box;