Problem compiling a program

[dionisis]

Hello everyone.Happy new year.
I have a problem compiling this program.
This program offers the user options such as
to create an account delete an account etc.
The accounts are stored in sinlge linked list.

Compile errors:

Error 1 error C2679: binary '<<' : no operator found which takes a right-hand operand of type 'std::string' (or there is no acceptable conversion)

Error 2 error C2679: binary '>>' : no operator found which takes a right-hand operand of type 'std::string' (or there is no acceptable conversion)

I really don't understand.Any help would be appreciated
The code is below!

#include "stdafx.h"
#include <iostream>
#include <cstring>
using namespace std;



class account
{
    private:
        long account_num;
        string name;
        double money;
    public:
        account ();
        account (long accNum, string ClName, double AmMoney);
        void deposit(double AmMoney);
        void draft (double AmMoney);
        void display_account();
// operator overloading
	bool operator == (const account &Acc);
};

struct node
{
    account balance;
    struct node *next;
};

//---------------------------
account :: account()
{
    account_num = 0;
    name = "no name";
    money = 0;
}

account :: account(long accNum, string ClName, double AmMoney)
{
    account_num = accNum;
    name = ClName;
    money = AmMoney;
} 

bool account :: operator == (const account &Acc)
{
	if (this -> account_num == Acc.account_num
            && this -> money == Acc.money)
	{
		return true;
	}
	else
		return false;
}

void account :: deposit(double AmMoney)
{
    money += AmMoney;
}

void account :: draft(double AmMoney)
{
    if (AmMoney > money)
    {
        cout << "Your account does not have so many money\n";
        return ;
    }
    money -= AmMoney;
}

void account :: display_account()
{
    cout << "\tID : " << this -> account_num << endl;
    cout << "\tName : " << this -> name << endl;
    cout << "\tBalance : " << this -> money << endl;
}
 

//-----functions prototype-----
int menu();
void printList (struct node *start);
struct node *insert (struct node *start, account bal);// bal = balance to be inserted
struct node *erase (struct node *start, account bal);  // bal = balance to be deleted
struct node *search (struct node *start, account bal); // bal = balance to be found
struct node *FindPrev (struct node *start, account bal); // bal = balance whom previous is to be found

int _tmain(int argc, _TCHAR* argv[])
{
	struct node *head = NULL;
	string name;
	long Id = 1;
	double amount;
	int sel;

	do
	{
		sel = menu();
		switch (sel)
		{
		case 1:
		{
			cout << "Enter a name:";
			getline(cin, name);
			cout << "Enter amount of money:";
			cin >> amount;
			account newAcc(Id, name, amount);
			head = insert(head, newAcc);
			Id++;
			break;
		}
		case 2:
			break;
		case 3:
			printList(head);
			break;
		case 4:
			break;
		case 5:
			break;
		case 6:
			break;
		}
		system("pause");
	}while (sel != 6);
// delete the entire list
	while (head)
	{
		struct node *tmp = new struct node;
		tmp -> next = head -> next;
		delete head;
		head = tmp -> next;
		delete tmp;
	}
	return 0;
}


//-----------------function implementation----------------------
int menu()
{
    int choice;
    
    do
    {
        cout << "1.Create account\n";
        cout << "2.Delete account\n";
		cout << "3.Watch accounts\n";
        cout << "4.Make a deposit\n";
        cout << "5.Make a draft\n";
        cout << "6.Exit\n";
        cin >> choice;
	if (cin.fail() && !cin.bad())
	{
            cout << "Bad input!Enter an integer between 1-5\n";
	    cin.clear();
	    while (cin.get() != '\n') continue;
	}
    }while (choice < 1 || choice > 5);

	return choice;
}

// find the node in the list whose balance is equal to bal
struct node *search(struct node *start, account bal)
{
    int found = 0;
    if (start == NULL)
        return NULL; // there is no list
    
    struct node *tmp = start;
    while (tmp -> next != NULL && !found)
	{
		if (tmp -> balance == bal)
			found = 1;
		else
			tmp = tmp -> next;
	}

	if (found)
		return tmp;
	else
		return NULL; // balance not found
}

// find the previous node which balance is equal to bal
struct node *FinPrev (struct node *start, account bal)
{
	int found = 0;
	struct node *tmp = start;
	struct node *prev = NULL;
	while (tmp -> next != NULL && !found)
	{
		if (tmp -> balance == bal)
			found = 1;
		else
		{
			prev = tmp;
			tmp = tmp -> next;
		}
	}

	if (found)
		return prev;
	else
		return NULL;
}


// inserts a node to the list
struct node *insert (struct node *start, account bal)
{
    struct node *tmp = new struct node;

	if (!tmp)
	{
		cout << "Unable to allocate memory\n";
		cout << "Program will exit\n";
		exit(0);
	}
	if (start == NULL)
	{
		start -> balance = tmp -> balance;
		tmp -> next = start;
		start = tmp;
	}
	else
	{
		struct node *cur = start;
		while (cur -> next != NULL)
			cur = cur -> next;
		cur -> balance = tmp -> balance;
		cur -> next = tmp;
		tmp -> next = NULL;
	}

	return start;
}




// deletes an element from the list
struct node *erase (struct node *start, account bal)
{
	struct node *NodeToBeDel = search (start, bal);
	if (NodeToBeDel == NULL)
	{
		cout << "Account doesn't exist\n";
		return NULL;
	}
	struct node *prev = FindPrev(start, NodeToBeDel -> balance); // previous of NodeToBeDel
// delete the first element of the list
	if (prev == NULL)
	{
		struct node *tmp = new struct node;
		//tmp -> balance = start -> balance;
		tmp -> next = start -> next;
		delete start;
		start = tmp -> next;
		delete tmp;
		return start;
	}
// delete the last element of the list
	if (NodeToBeDel -> next == NULL)
	{
		delete NodeToBeDel;
		prev -> next = NULL;
		return start;
	}
// delete a node of the list
	struct node *tmp = new struct node;
	tmp -> balance= NodeToBeDel -> balance;
	tmp -> next = NodeToBeDel -> next;
	delete NodeToBeDel;
	prev -> next = tmp -> next;
	delete tmp;
	return start;
}


void printList(struct node *start)
{
	int i = 0;
	struct node *cur = start;
	while (cur)
	{
		cout << "Account " << i+1 << endl;
		cur -> balance.display_account();
		cur = cur -> next;
		i++;
		cout << "\n\n";
	}
	return ;
}

[Bazzy]

#include <string>

[dionisis]

thanks Bazzy but now it has another compile error

Error 1 error LNK2019: unresolved external symbol "struct node * __cdecl FindPrev(struct node *,class account)" (?FindPrev@@YAPAUnode@@PAU1@Vaccount@@@Z) referenced in function "struct node * __cdecl erase(struct node *,class account)" (?erase@@YAPAUnode@@PAU1@Vaccount@@@Z) second.obj second

[Bazzy]

You have a typo on line 186, you forgot the 'd' in FindPrev

[dionisis]

thanks a lot Bazzy.Problem solved