Only second line of File Input will print

[cko221]

I am inputting 2 simple data files into a linked list.
FILE 1{
17 5.25 Adam Parker
18 6.75 John F. Jones
}
The first column represents Employee ID number
The second column represents hourly wage
The third column represents Employee name

FILE 2{
17 40
18 20
18 20
}
The first column represents Employee ID number
The second column represents number of hours worked

The output should be:
*********Payroll Information********
John F. Jones, $270
Adam Parker, $210
*********End payroll**************

However, my output is: (i.e. only shows first line)
*********Payroll Information********
John F. Jones, $270
*********End payroll**************

Does anyone know how to formulate a proper ranged for loop?

#include <iostream>
#include <fstream>
#include <string>
#include <cstdlib>
using namespace std;

void openInputFile(ifstream& inFile) {
	string filename;
	cout << "What filename? ";
	cin >> filename;
	inFile.open(filename);
	while (!inFile) {
		cout << "File failed to open!" << endl;
		cout << "What filename? ";
		cin >> filename;
		inFile.clear();
		inFile.open(filename);
	}
}
template <class T>
class LList; //just a pre-definition

template <class T>
class LListNode {
public:
	T data;
	LListNode<T>* next;
	LListNode(T newdata=T(), LListNode* newNext = nullptr)
		:data(newdata), next(newNext) {}
	friend class LList<T>; 
};

template <class T>
class LList {
	LListNode<T>* head;
	int numOfElements;
	LListNode<T>* recursiveCopy(LListNode<T>* ptr);
public:
	LList() { head = nullptr; numOfElements = 0; }
	LList(const LList<T>& rhs) : head(nullptr), numOfElements(0) { *this = rhs; }
	LList<T>& operator=(const LList<T>& rhs);
	~LList() { clear(); }
	bool isEmpty()const { return head == nullptr; }

	void insertAtHead(T newItem);
	T removeFromHead();
	int size()const;
	void clear();
	void insertAtTail(T newItem);
	void insertAfter(LListNode<T>* location, T newitem);
	T removeFromTail();
};
template <class T>
LListNode<T>* LList<T>::recursiveCopy(LListNode<T>* ptr) {
	if (ptr == nullptr)
		return nullptr;
	return new LListNode<T>(ptr->data, recursiveCopy(ptr->next));
}

template <class T>
LList<T>& LList<T>::operator=(const LList<T>& rhs) {
	if (this == &rhs)
		return *this;
	clear();
	head = recursiveCopy(rhs.head);  
	return *this;
}

template <class T>
T LList<T>::removeFromTail() {
	if (isEmpty())//test for stupid user
		return 0;
	else if (head->next == nullptr) //only one node
		return removeFromHead();
	LListNode* temp = head;
	for (; temp->next->next != nullptr; temp = temp->next);						

															//delete the node AFTER temp
	LListNode<T>* toDelete = temp->next;
	temp->next = nullptr;
	T toReturn = toDelete->data;
	delete toDelete;
	numOfElements--;
	return toReturn;
}
template <class T>
void LList<T>::insertAtTail(T newItem) {
	if (isEmpty())
		insertAtHead(newItem);
	else {
		LListNode<T>* temp = head;
		for (; temp->next != nullptr; temp = temp->next); //find the last node!
														 
		insertAfter(temp, newItem); //insertAfter the last node
	}
}
template <class T>
void LList<T>::insertAfter(LListNode<T>* location, T newItem) {
	location->next = new LListNode<T>(newItem, location->next);
	numOfElements++;
}
template <class T>
void LList<T>::clear() {
	while (!isEmpty())
		removeFromHead();
}
template <class T>
int LList<T>::size()const {
	return numOfElements; //Constant time

						
template <class T>
T LList<T>::removeFromHead() {
	if (isEmpty()) //Test for dumb user!
		return T();
	LListNode<T>* toDelete = head; 
	head = head->next; 

	T toReturn = toDelete->data;
	delete toDelete;
	numOfElements--;
	return toReturn;
}
template <class T>
void LList<T>::insertAtHead(T newItem) {
	head = new LListNode<T>(newItem, head);
	numOfElements++;
}

class Employee {
public:
	double wage(double hourlyRate, int hours_worked);
	/*
	Employee(int ID, double rate, string EmployeeName);
	Employee(int ID, int hours_worked);
	Employee();
	int getIDnum() const;
	int getnum_hours_worked()const;
	double gethourlyRate() const;
	string getname() const;
	void setIDnum(int ID);
	void setnum_hours_worked(int hours_worked);
	void sethourlyRate(double rate);
	void setname(string EmployeeName);
	*/
	string name;
	double hourlyRate;
	int IDnum, num_hours_worked;
};
double Employee::wage(double hourlyRate, int hours_worked) {
	return (hourlyRate*double(hours_worked));
}
/*
Employee::Employee(int ID, double rate, string EmployeeName) {
	setIDnum(ID);
	sethourlyRate(rate);
	setname(EmployeeName);
}
Employee::Employee(int ID, int hours_worked) {
	setIDnum(ID);
	setnum_hours_worked(hours_worked);
}
Employee::Employee(){
	setIDnum(0);
	setnum_hours_worked(0);
	sethourlyRate(0);
	setname(" ");
}
int Employee::getIDnum() const {
	return IDnum;
}
int Employee::getnum_hours_worked() const {
	return num_hours_worked;
}
double Employee::gethourlyRate() const {
	return hourlyRate;
}
string Employee::getname() const {
	return name;
}
void Employee::setIDnum(int ID) {
	IDnum = ID;
}
void Employee::setnum_hours_worked(int hours_worked) {
	num_hours_worked = hours_worked;
}
void Employee::sethourlyRate(double rate) {
	hourlyRate = rate;
}
void Employee::setname(string EmployeeName) {
	name = EmployeeName;
}
*/
int main() {
	ifstream inFile1;
	openInputFile(inFile1);

	LList<Employee> EmployeeList;
	Employee temp1;	

	while (inFile1 >> temp1.IDnum) {
		inFile1 >> temp1.hourlyRate;
		inFile1.ignore(1, ' ');
		getline(inFile1, temp1.name);
		EmployeeList.insertAtHead(temp1);
	}
		
	cout << temp1.IDnum << endl;
	cout << temp1.hourlyRate << endl;
	cout << temp1.name<< endl;

	ifstream inFile2;
	openInputFile(inFile2);
	
	LList<Employee> PayrollList;
	while (inFile2 >> temp1.IDnum>> temp1.num_hours_worked){
		if (temp1.IDnum == temp1.IDnum) {
			temp1.num_hours_worked += temp1.num_hours_worked;
		}
		PayrollList.insertAtHead(temp1);
	}

	
	cout << "*********Payroll Information********" << endl;
	cout << temp1.name << ", " << temp1.wage(temp1.hourlyRate, temp1.num_hours_worked) << endl;
	cout << "*********End payroll**************" << endl;
	

	return 0;
}

[48T7M4Gy]

http://www.cplusplus.com/doc/tutorial/files/

Read this, there are samples there that show you what to do.

[Naughty Albatross]

> Does anyone know how to formulate a proper ranged for loop?
Here (tutorial) :
http://www.cprogramming.com/c++11/c++11-ranged-for-loop.html