Convert List Data Classess/Structures in c++ and c# to Queue Data Classes/Structures 61

Shows how to define and use #queue #data #classes/#structures in c plus plus and c sharp #programs. Shows how to #convert list data classes/structures into queue data structures/classes.

c++ code:
#include ＜iostream＞ //for cout
#include ＜fstream＞ // for ofstream/ifstream
#include ＜string＞ //for ＜＜ and getline
//#include ＜list＞ //for lists
#include ＜queue＞ //for queue

//class List
//{
//public:
// std::string data;
// List *next;
//};

//struct List
//{
// std::string data;
// List *next;
//};

int main()
{
std::ifstream input_file("test.txt");
std::ofstream output_file("test.txt.out");

//List *iter, *elements, *node;
//elements = iter = node = NULL;

//std::list＜std::string＞ elements;
std::queue＜std::string＞ elements;

std::string line;

for (; std::getline(input_file, line);)
{
//iter = new List;
//iter-＞data = line;
//iter-＞next = NULL;

//if (elements == NULL)
//{
// node = elements = iter;
//}
//else
//{
// node = node-＞next = iter;
//}

//elements.push_back(line);//for list
elements.push(line);// for queue
}

//std::cout ＜＜ "Shows elements of Queue:" ＜＜ std::endl;
//for (;elements != NULL;)
//{
// iter = elements;
// std::cout＜＜ iter-＞data＜＜std::endl;
// output_file＜＜ iter-＞data＜＜std::endl;
// elements = elements-＞next;
// delete iter;
//}

//std::cout＜＜"Shows elements of list:"＜＜std::endl;
//for (iter = elements; iter != NULL; iter = iter-＞next)
//{
// std::cout ＜＜ iter-＞data ＜＜ std::endl;
// output_file ＜＜ iter-＞data ＜＜ std::endl;
//}

std::cout ＜＜ "Shows elements of queue:" ＜＜ std::endl;
for (; !elements.empty();)
{
std::cout ＜＜ elements.front() ＜＜ std::endl;// for list and queue
output_file ＜＜ elements.front() ＜＜ std::endl;// for list an queue
//elements.pop_front();//for list
elements.pop();//for queue
}

//std::cout＜＜"Shows elements of list:"＜＜std::endl;
//std::list＜std::string＞::iterator iter = elements.begin();
//for (; iter != elements.end(); ++iter)
//{
// std::cout ＜＜ (*iter) ＜＜ std::endl;
// output_file ＜＜ (*iter) ＜＜ std::endl;
//}

//delete iter;

if (input_file)
{
input_file.close();
output_file.close();
}
std::cin.get();
return 0;
}

c# code:



#cplusplus #csharp #tutorial

C# Queue Data Structure
Tutorial Introduction Stacks and Queues in C#
Linked List implementation of Queue Data Structure C++