C++ to achieve the queue class chain storage and stack class chain storage code samples

Queue class chain storage

Code:
linkqueue.hpp  

//  The queue class  
 
#pragma once 
 
#include "linklist.hpp" 
 
template <typename T> 
class LinkQueue 
{ 
public: 
  LinkQueue(); 
  ~LinkQueue(); 
public: 
  int clear(); 
  int append(T &t); 
  int retieve(T &t); 
  int header(T &t); 
  int length(); 
protected: 
  LinkList<T> *m_list; 
}; 
 
template <typename T> 
LinkQueue<T>::LinkQueue() 
{ 
  m_list = new LinkList < T > ; 
} 
 
template <typename T> 
LinkQueue<T>::~LinkQueue() 
{ 
  clear(); 
  delete m_list; 
  m_list = NULL; 
} 
 
template <typename T> 
int LinkQueue<T>::clear() 
{ 
  T t; 
  while (m_list->getLen() > 0) { 
    m_list->del(0, t); 
  } 
  return 0; 
} 
 
template <typename T> 
int LinkQueue<T>::append(T &t) 
{ 
  return m_list->insert(t, m_list->getLen()); 
} 
 
template <typename T> 
int LinkQueue<T>::retieve(T &t) 
{ 
  return m_list->del(m_list->getLen() - 1, t); 
} 
 
template <typename T> 
int LinkQueue<T>::header(T &t) 
{ 
  return m_list->get(0, t); 
} 
 
template <typename T> 
int LinkQueue<T>::length() 
{ 
  return m_list->getLen(); 
} 

main.cpp  

//  Queue class test program  
 
#include <iostream> 
#include <cstdio> 
#include "linkqueue.hpp" 
 
using namespace std; 
 
struct Student 
{ 
  char name[32]; 
  int age; 
}; 
 
void play() 
{ 
  Student s1, s2, s3; 
  s1.age = 21; 
  s2.age = 22; 
  s3.age = 23; 
 
  LinkQueue<Student> lq; //  Create a queue  
  lq.append(s1); //  In the queue  
  lq.append(s2); 
  lq.append(s3); 
 
  Student tmp; 
  lq.header(tmp); 
  cout << "header of queue: " << tmp.age << endl; 
  cout << "length of queue: " << lq.length() << endl; 
 
  while (lq.length() > 0) { 
    lq.retieve(tmp); 
    cout << tmp.age << " "; 
  } 
  cout << endl; 
 
  lq.clear(); 
 
} 
 
int main() 
{ 
  play(); 
 
  return 0; 
} 

Stack class chain storage

linkstack.hpp  

//  The stack class  
 
#pragma once 
 
#include "linklist.hpp" 
 
template <typename T> 
class LinkStack 
{ 
public: 
  LinkStack(); 
  ~LinkStack(); 
public: 
  int clear(); 
  int push(T &t); 
  int pop(T &t); 
  int top(T &t); 
  int size(); 
protected: 
  LinkList<T> *m_list; 
}; 
 
template <typename T> 
LinkStack<T>::LinkStack() 
{ 
  m_list = new LinkList < T > ; 
} 
 
template <typename T> 
LinkStack<T>::~LinkStack() 
{ 
  clear(); 
  delete m_list; 
  m_list = NULL; 
} 
 
template <typename T> 
int LinkStack<T>::clear() 
{ 
  T t; 
  while (m_list->getLen() > 0) { 
    m_list->del(0, t); 
  } 
 
  return 0; 
} 
 
template <typename T> 
int LinkStack<T>::push(T &t) 
{ 
  return m_list->insert(t, 0); 
} 
 
template <typename T> 
int LinkStack<T>::pop(T &t) 
{ 
  return m_list->del(0, t); 
} 
 
template <typename T> 
int LinkStack<T>::top(T &t) 
{ 
  return m_list->get(0, t); 
} 
 
template <typename T> 
int LinkStack<T>::size() 
{ 
  return m_list->getLen(); 
} 

main.cpp  

//  Chain storage stack class test procedures  
 
#include <iostream> 
#include <cstdio> 
#include "linkstack.hpp" 
 
using namespace std; 
 
struct Student 
{ 
  char name[32]; 
  int age; 
}; 
 
void play() 
{ 
  Student s1, s2, s3; 
  s1.age = 21; 
  s2.age = 22; 
  s3.age = 23; 
 
  LinkStack<Student> ls; //  Create a stack  
 
  //  Into the stack  
  ls.push(s1); 
  ls.push(s2); 
  ls.push(s3); 
 
  //  Gets the top element of the stack  
  Student tmp; 
  ls.top(tmp); 
  cout << "top of stack: " << tmp.age << endl; 
  cout << "size of stack: " << ls.size() << endl; 
 
  //  Out of the stack  
  while (ls.size() > 0) { 
    ls.pop(tmp); 
  } 
 
  ls.clear(); 
 
} 
 
int main() 
{ 
  play(); 
 
  return 0; 
} 

linklist.h  

//  Linked list class  
 
#pragma once 
 
#include <iostream> 
#include <cstdio> 
using namespace std; 
 
template <typename T> 
struct Node 
{ 
  T t; 
  Node<T> *next; 
}; 
 
template <typename T> 
class LinkList 
{ 
public: 
  LinkList(); 
  ~LinkList(); 
 
public: 
  int clear(); 
  int insert(T &t, int pos); 
  int get(int pos, T &t); 
  int del(int pos, T &t); 
  int getLen(); 
 
protected: 
  Node<T> *header; 
  int length; 
}; 
 
template <typename T> 
LinkList<T>::LinkList() 
{ 
  header = new Node < T > ; 
  header->next = NULL; 
  length = 0; 
} 
 
template <typename T> 
LinkList<T>::~LinkList() 
{ 
  Node<T> *tmp = NULL; 
 
  while (header) { 
    tmp = header->next; 
    delete header; 
    header = tmp; 
  } 
} 
 
template <typename T> 
int LinkList<T>::clear() 
{ 
  ~LinkList(); 
  LinkList(); 
  return 0; 
} 
 
template <typename T> 
int LinkList<T>::insert(T &t, int pos) 
{ 
  Node<T> *cur = NULL; 
 
  //  right pos Fault tolerant handling  
  if (pos >= length) { 
    pos = length; 
  } 
 
  cur = header; 
  for (int i = 0; i < pos; ++i) { 
    cur = cur->next; 
  } 
 
  //  Apply the upper layer t Nodes are cached in the container  
  Node<T> *node = new Node < T > ; 
  node->next = NULL; 
  node->t = t; //  the t Cache into the container  
 
  node->next = cur->next; 
  cur->next = node; 
 
  ++length; 
 
  return 0; 
} 
 
template <typename T> 
int LinkList<T>::get(int pos, T &t) 
{ 
  Node<T> *cur = NULL; 
 
  if (pos >= length) { 
    return -1; 
  } 
 
  cur = header; 
  for (int i = 0; i < pos; ++i) { 
    cur = cur->next; 
  } 
 
  t = cur->next->t; //  the pos The node of the position is assigned to t 
 
  return 0; 
} 
 
template <typename T> 
int LinkList<T>::del(int pos, T &t) 
{ 
  Node<T> *cur = NULL; 
 
  if (pos >= length) { 
    return -1; 
  } 
 
  cur = header; 
  for (int i = 0; i < pos; ++i) { 
    cur = cur->next; 
  } 
  Node<T> *ret = NULL; 
  ret = cur->next; 
  t = ret->t; //  Apply the cached nodes to the upper level t 
 
  //  Delete operation  
  cur->next = ret->next; 
  --length; 
  delete ret; //  Remember to free the memory, because insert when new Node<T> 
 
  return 0; 
} 
 
template <typename T> 
int LinkList<T>::getLen() 
{ 
  return length; 
}