Backspaces in string

[Pretors000]

In my Template listNode code doesn`t take a backspaces while using string. How can I fix it?
Example I input "Saudi Arabia". But in output I get only "Saudi"

There is function: create node

  ...
   Node<T> *newNode; 		
    newNode = new Node<T>;	
    cout<<"\nAdd: ";
    cin>>newNode->data;       
  ////////////////  getline(cin,newNode->data); // I try this but didn`t help
    newNode->link=NULL;	
    cout<<newNode->data;
  
	return newNode;
...

There is function: print

Node<T> *cur;
    cout<<"List:\n";
    cur=head;		
    while (cur!=NULL)
        {
        cout<<cur->data<<" \n";	
        cur=cur->link;        
        }

I hope somebody can help with this.

[Chervil]

I try this but didn`t help

getline() should be what you need to take in a name containing spaces, such as your example "Saudi Arabia".
Just a plain cin >> definitely won't do the job.

However, there's a bigger picture. Whatever is entered via cin is first stored in a buffer. If there is anything remaining in the buffer from any previous input, then results may not be what you want.
Example:

#include <iostream>
#include <string>

using namespace std;

int main()
{
    int age;
    string name;
    
    cout << "enter age: ";
    cin >> age;
       
    cout << "enter name: ";
    getline(cin, name);
    
    cout << "Name: " << name << " Age: " << age << endl;
}

Above, it is not possible to enter the name as requested. That's because there is a trailing newline character remaining in the input buffer from the previous cin >> operation.

The solution is to clear the buffer after that input.

#include <limits> 

    cout << "enter age: ";
    cin >> age;
    cin.ignore( std::numeric_limits<std::streamsize>::max(), '\n' );

It's hard to say how to apply this to your problem, without seeing the rest of the code and what other input there may be.

[Pretors000]

Ok, there will be rest of code.

#include<iostream>
#include<cstdlib>
#include<cstdio>
#include <string>

using namespace std;


template< class T >
class Node{
      
    public:
 
    T data;  
    Node<T> *link; 
    };
    
     

template< class T >
class List
{  private:Node<T>*head;
    public:
 List() 
        {
            head = NULL; 
        } 
        Node<T>* CreateNode(T); 
        void AddFirst();
        void PrintList();
        void DeleteNode();
        void DeleteAll();
        
                 int counts();   
             
};


template< class T >
Node<T>* List<T>::CreateNode(T value) 
{
    Node<T> *newNode; 		
    newNode = new Node<T>;	
    cout<<"\nAdd: ";
    
    cin>>newNode->data;
  // getline(cin,newNode->data);
     
    newNode->link=NULL;	
    cout<<newNode->data;
  
	return newNode;
    	

}

//-----------------------------------------------------
template< class T >

void List<T>::AddFirst() //(Node *head, Node *newNode)
{ 
   
   T value;
    Node<T> *newNode, *cur;

    newNode = CreateNode(value);
    if (head == NULL)
    {
        head = newNode;
        head->link = NULL;          
    }
    else
    {
        cur = head;
        head = newNode;
        head->link = cur;
    }
   
   
   
}
//----------------------------------------------------
template< class T >

void List<T>::PrintList() 
{ 
    Node<T> *cur;
    cout<<"List:\n";
    cur=head;		
    while (cur!=NULL)
        {
        cout<<cur->data<<" \n";	
        cur=cur->link;        
        }
}



template< class T >

void List<T>::DeleteNode() 
{  int pos, i, counter = 0;
    if (head == NULL)
    {
        cout<<"What delete?"<<endl;
        return;
    }
    cout<<"Enter position to delete: ";cin>>pos;
    
    
    
    Node<T> *cur, *oldNode;
    cur = head;
    if (pos == 1)
    {
        head = cur->link;
    }
    else
    {
        while (cur != NULL)
        {
            cur = cur->link;
            counter++;  
        }
        if (pos > 0 && pos <= counter)
        {
            cur = head;
            for (i = 1;i < pos;i++)
            {
                oldNode = cur;
                cur = cur->link;
            }
            oldNode->link = cur->link;
        }
      
        delete cur;
      
    }

}


template< class T >

void List<T>::DeleteAll() 
{Node<T> *cur1, *cur;
    if(head==0)
   {cout << "List is empthy!";}
    cur=head;
        while(cur)
        {
        cur1=cur;
        cur=cur->link;
        delete cur1;
        }
        head=NULL;
        
       // return 0;
    
}

//------------------------------------------
template< class T >

int List<T>::counts() 
{Node<T> *cur; *head;
    int count=0;
    cur=head;
    while(cur)
    {
        count++;
        cur=cur->link;
    }
    return count;
}

int main()
{

int newNode, cur, oldNode, cur1;

List<string> cl;

int izv;

do
{
cout << "1. Add\n";
cout << "2. Delete\n";
cout << "3. Print\n";
cout << "4. Count\n";
cout << "5. Delete All\n";

cout<<"0. Exit\n";
cin >> izv;

if(!cin)
{
    
    system("Pause>null");
}

switch(izv)
	{	
        case 1:        
    	cl.AddFirst();
        	break;
		case 2:		
			cl.DeleteNode();
			break;
		case 3:
			cl.PrintList();
			break;				
		case 4:  
			cl.counts();
			break;
		case 5:
			cl.DeleteAll();
			break;
		case 0: exit(0); break;
		
       
	}
} while(izv!=0);

system("PAUSE>nul");
return 0;
}

[Chervil]

Thanks for posting the rest of the code.

I can see two places where there is a cin >> which need looking at.
The change I suggest is to add the ignore() code which will read and discard characters from the input buffer until it finds a newline character.

The most important one is ther menu selection in main().

    cin >> izv;
    cin.ignore( std::numeric_limits<std::streamsize>::max(), '\n' );

and the other is in the delete node code.

    cout<<"Enter position to delete: ";cin>>pos;
    cin.ignore( std::numeric_limits<std::streamsize>::max(), '\n' );

Now you should be able to use getline as in the original question at line 46:

    // cin>>newNode->data;  // replaced by getline
    getline(cin,newNode->data);

I've not tested this, but it should be pretty much what you need.

* remember to add the #include <limits>

[Pretors000]

Thanks, it`s works