Template, code simple qui ne marche pas

Template, code simple qui ne marche pas - C++ - Programmation

Marsh Posté le 08-09-2003 à 10:18:51    

Mon but est de convertir ma class team queue en un template.
 
mais avant, j ai commence avec un bout de code  :
 
 
 
test.h

Code :
  1. #ifndef TEST_H
  2. #define TEST_H
  3. using namespace std;
  4. template <class T>
  6. class test
  7. {
  8.     public :
  9.    
  10.         void output(T item);
  11. };
  13. #endif


 
test.cpp

Code :
  1. #include "test.h"
  2. #include <iostream>
  3. using namespace std;
  5. template <class T>
  6. void test<T>::output(T item)
  7. {
  8.     cout << item ;
  9. }


 
main.cpp

Code :
  1. #include <iostream>
  2. #include <cstdlib>
  3. #include "test.h"
  5. using namespace std;
  7. int main()
  8. {
  9.   test<int> mytest;
  10.   mytest.output(6);
  11.   system("PAUSE" );
  12.   return 0;
  13. }


 
 
[Linker error] undefined reference to `test<int>::output(int)'
 :cry:  
 
 
pour la class team queue les commentaires sont bienvenu
(je le sens mal sur ce coup  :whistle: )
 
team_queue.h

Code :
  1. #ifndef TEAM_QUEUE_H
  2. #define TEAM_QUEUE_H
  3. #include <vector>
  5. using namespace std;
  7. class team_queue
  8. {
  9.     public :
  10.        
  11.         struct teamq_struct
  12.         {
  13.                 vector <int> vect_item;
  14.                 int item_team;
  15.         };
  16.        
  17.         team_queue();
  18.         //default constructor
  19.        
  20.         ~team_queue();
  21.         //default destructor
  22.        
  23.         void push (int item,int team);
  24.         ///adds the supplied item belonging to the given team number
  25.         // to the team_queue in the apporpriate fashion
  26.      
  27.         void pop();
  28.         //removes the front from the team_queue
  29.    
  30.         void team_pop(int team);
  31.         //removes the front item of the supplied team from the team_queue
  32.  
  33.         void team_remove(int team);
  34.         //removes all items belonging to a suppliedteam from the team_queue
  35.  
  36.         int front();
  37.         //returns the item at the front of the team_queue
  38.      
  39.         int team_front(int team);
  40.         //returns the item at the front of the supplied team from the team_queue
  41.    
  42.         bool pure();
  43.         //returns true iff the team_queue contains no more than 1 member of each team.
  44.  
  45.         int size();
  46.         //returns the number of items in the team_queue.  
  47.    
  48.         int team_size(int team);
  49.         //returns the number of elements of a given team in the team_queue
  50.        
  51.         int team_number();
  52.         //returns the number of different teams in the team_queue
  53.        
  54.         void order_asc();
  55.         //sorts the items in each team in the team_queue into nondescending
  56.         //numeric order (from front to rear).
  57.        
  58.         void order_desc();
  59.         //sorts the items in each team in the team_queue into nondascending
  60.         //numeric order (from rear to front).
  61.        
  62.         void display();
  63.         //display all the elements of the team queue
  64.      
  65.         bool isempty();
  66.         //return true if the tq is empty
  67.          
  69.      private:
  70.    
  71.         vector <teamq_struct> struct_vect;
  72.         vector <teamq_struct>::iterator  cursor;
  73.         void error(int errorcode);
  74.    
  75. };
  77. #endif


 
 
team_queue.cpp

Code :
  1. #include "team_queue.h"
  2. #include <iostream>
  3. #include <vector>
  4. #include <algorithm>
  6. /*
  7. |¯¯¯¯¯¯¯¯¯¯¯¯|
  8. constructor
  9. |____________|
  10. */
  11. team_queue::team_queue()
  12. { 
  13. }
  15. /*
  16. |¯¯¯¯¯¯¯¯¯¯¯¯|
  17. destructor
  18. |____________|
  19. */
  21. team_queue::~team_queue()
  22. {
  23.     struct_vect.clear();
  24. }
  26. /*
  27. |¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
  28. PUSH : adds the supplied item belonging to the given team number
  29. to the team_queue in the apporpriate fashion.
  30. |________________________________________________________________|
  31. */
  33. void team_queue::push(int item, int team)
  34. {   
  35.      team_queue::teamq_struct var;
  36.      var.item_team = team;
  37.      var.vect_item.push_back(item);
  38.        
  39.      if (isempty()) struct_vect.push_back(var);
  40.      else
  41.      {
  42.    
  43.      bool inserted = false;
  44.                            
  45.      for (cursor = struct_vect.begin(); cursor != struct_vect.end(); cursor++)
  46.      {
  47.           if (cursor->item_team == team) 
  48.           {
  49.                     cursor->vect_item.push_back(item); 
  50.                     inserted = true;
  51.                     break;   
  52.           }
  53.      }
  54.      //if no team member found enqueue at the end
  55.      if (inserted == false) struct_vect.push_back(var);; 
  56.      }
  57. }
  59. /*
  60. |¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
  61.   POP : removes the front from the team_queue
  62. |_______________________________________________|
  63. */
  65. void team_queue::pop()
  66. {
  67.      if (isempty()) error(0);
  68.      else
  69.      {
  70.           cursor = struct_vect.begin();   
  71.           if (cursor->vect_item.size() == 1) //only one element ?
  72.           {
  73.                    struct_vect.erase(cursor);  //destroy the full team (1elmt)
  74.           }       
  75.           else cursor->vect_item.erase(cursor->vect_item.begin());
  76.      }
  77. }
  79. /*
  80. |¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
  81.   TEAM_POP : removes the front item of the supplied team from the team_queue
  82. |_____________________________________________________________________________|
  83. */
  85. void team_queue::team_pop(int team)
  86. {
  87. if (isempty()) error(0);
  88. else
  89. {
  90.     for (cursor = struct_vect.begin(); cursor != struct_vect.end(); cursor++)
  91.     {
  92.         if (cursor->item_team == team)
  93.         {
  94.                 if (cursor->vect_item.size() == 1) struct_vect.erase(cursor);
  95.                 else cursor->vect_item.erase(cursor->vect_item.begin()); 
  96.                 break;
  97.         }
  98.     }
  99. }
  100. }
  102. /*
  103. |¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
  104. TEAM_REMOVE :removes all items belonging to a suppliedteam from the team_queue
  105. |______________________________________________________________________________|
  106. */
  108. void team_queue::team_remove(int team)
  109. {
  110. if (isempty()) error(0);
  111. else
  112. {
  113.     for (cursor = struct_vect.begin(); cursor != struct_vect.end(); cursor++)
  114.     {
  115.         if (cursor->item_team == team) 
  116.         {
  117.               struct_vect.erase(cursor); 
  118.               cursor --;         
  119.         }   
  120.     }
  121. }
  122. }
  124. /*
  125. |¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
  126. FRONT :returns the item at the front of the team_queue
  127. |_________________________________________________________|
  128. */
  130. int team_queue::front()
  131. {
  132.     if (isempty())
  133.     {
  134.          error(1);
  135.          return 0;
  136.     }
  137.     else return struct_vect[0].vect_item.front();
  138. }
  140. /*
  141. |¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
  142. TEAM _FRONT :returns the item at the front of the supplied team  
  143. from the team_queue
  144. |_________________________________________________________________|
  145. */
  147. int team_queue::team_front(int team)
  148. {
  149.      if (isempty()) error(1);
  150.      else
  151.      {
  152.           for (cursor = struct_vect.begin(); cursor != struct_vect.end(); cursor++)
  153.           {
  154.                     if (cursor->item_team == team)
  155.                     {
  156.                                         return cursor->vect_item.at(0);
  157.                                         break;
  158.                     }         
  159.           }
  160.           error(3);
  161.           return 0; //??  
  162.      }
  163. }
  165. /*
  166. |¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
  167. PURE : returns true iff the team_queue contains no more  
  168. than 1 member of each team.
  169. |_________________________________________________________|
  170. */
  172. bool team_queue::pure()
  173. {
  174.     if (isempty()) return false;
  175.     else
  176.     {
  177.         for (cursor = struct_vect.begin(); cursor != struct_vect.end(); cursor++)
  178.         if (cursor->vect_item.size() != 1) return false;
  179.         return true;
  180.     }
  181. }
  183. /*
  184. |¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
  185. SIZE : returns the number of items in the team_queue.  
  186. |_____________________________________________________|
  187. */
  189. int team_queue::size()
  190. {
  191.     if (isempty())  return 0;
  192.     else
  193.     {
  194.         int count = 0;
  195.         for (cursor = struct_vect.begin(); cursor != struct_vect.end(); cursor++)
  196.         count = count + (cursor->vect_item.size());   
  197.         return count;
  198.     }
  199. }
  201. /*
  202. |¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
  203. TEAM_SIZE : returns the number of elements of a given team in the team_queue.  
  204. |_____________________________________________________________________________|
  205. */
  206. int team_queue::team_size(int team)
  207. {
  208.     if (isempty())  return 0; //if tq is empty return 0
  209.     else
  210.     {
  211.           for (cursor = struct_vect.begin(); cursor != struct_vect.end(); cursor++)
  212.           if (cursor->item_team == team)   return cursor->vect_item.size();
  213.      }
  214. }
  216. /*
  217. |¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
  218. TEAM_NUMBER : returns the number of different teams in the team_queue.  
  219. |_______________________________________________________________________|
  220. */
  221. int team_queue::team_number() { return struct_vect.size(); }
  223. /*
  224. |¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
  225. ORDER_ASC : sorts the items in each team in the team_queue into nondescending
  226. numeric order (from rear to front).  
  227. |_____________________________________________________________________________|
  228. */
  229. void  team_queue::order_asc()
  230. {
  231. if (isempty())  { return; }
  232. else
  233. {
  234.     for (cursor = struct_vect.begin(); cursor != struct_vect.end(); cursor++)
  235.     {
  236.         int length = cursor->vect_item.size();
  237.         sort (cursor->vect_item.begin(), cursor->vect_item.end());     
  238.     }     
  239. }//end else
  240. }
  241. /*
  242. |¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
  243. ORDER_DESC : sorts the items in each team in the team_queue into nonascending
  244. numeric order (from front to rear).  
  245. |_____________________________________________________________________________|
  246. */
  247. void  team_queue::order_desc()
  248. {
  249. if (isempty())  { return; }
  250. else
  251. {
  252.     for (cursor = struct_vect.begin(); cursor != struct_vect.end(); cursor++)
  253.     {
  254.         int length = cursor->vect_item.size();
  255.         sort (cursor->vect_item.rbegin(), cursor->vect_item.rend());
  256.     }     
  257. }//end else
  258. }
  259. /*
  260. |¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
  261. DISPLAY : display all the elements of the team queue
  262. |______________________________________________________|
  263. */
  264. void team_queue::display()
  265. {
  266.      if (isempty()) error(1);
  267.      else
  268.      {
  269.           for (cursor = struct_vect.begin(); cursor != struct_vect.end(); cursor++)
  270.           for (int i =0; i < cursor->vect_item.size();i++)  cout << " (" <<  cursor->vect_item[i] << "," <<  cursor->item_team << " ) " << flush;
  271.           cout << endl;
  272.      }
  273. } 
  275. /*
  276. |¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
  277. ERROR :  
  278. |______________________________________________________|
  279. */
  280. void team_queue::error(int errorcode)
  281. {
  282. switch (errorcode)
  283. {
  284.     case 0 : cout << "Error, you can't pop anymore items \a" << endl; break;
  285.     case 1 : cout << "Teamq queue is empty \a" << endl; break;
  286.     case 3 : cout << "No team found \a" << endl; break;
  287. }
  288. }
  290. /*
  291. |¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
  292. ISEMPTY: return true id there is no element into the team_q
  293. |____________________________________________________________|
  294. */
  295. bool team_queue::isempty() { return (struct_vect.size() == 0); }

Reply

Marsh Posté le 08-09-2003 à 10:18:51   

Reply

Marsh Posté le 08-09-2003 à 10:33:31    

il faut que tout tes classes templlaaaaaatteeeee soiennnt dans la meeeemmmeee uniteeeeee de compilaaaatiooooooon
 
 
Aaaaaammmeeeennnnnnn

Reply

Marsh Posté le 08-09-2003 à 10:41:47    

chrisbk a écrit :

il faut que tout tes classes templlaaaaaatteeeee soiennnt dans la meeeemmmeee uniteeeeee de compilaaaatiooooooon
 
 
Aaaaaammmeeeennnnnnn


gni ?
exemple pleassse
 :(  :D

Reply

Marsh Posté le 08-09-2003 à 10:43:40    

xiluoc a écrit :


gni ?
exemple pleassse
 :(  :D  


 
le bouton rechercher du forum est la pour repondre a toutes vos question. Elegant, sobre, fiable, c'est le compagnon ideal et fidele qui sera toujours a vos coté en cas d'ennui. (editions del prado)

Reply

Marsh Posté le 08-09-2003 à 10:45:00    

chrisbk a écrit :


 
le bouton rechercher du forum est la pour repondre a toutes vos question. Elegant, sobre, fiable, c'est le compagnon ideal et fidele qui sera toujours a vos coté en cas d'ennui. (editions del prado)
 


 :kaola:

Reply

Marsh Posté le 08-09-2003 à 10:45:10    

Grossièrement remagné:
 
test.h
 

Code :
  1. #ifndef TEST_H
  2. #define TEST_H
  3.   #include <iostream>
  4.   template <class T>
  5.  
  6.   class test
  7.   {
  8.         public :
  9.        
  10.             void output(T item)
  11.              {
  12.                  using namespace std;
  13.                  cout << item ;
  14.              }
  16.   };
  17.        
  18.   #endif


 


---------------
Le Tyran
Reply

Marsh Posté le 08-09-2003 à 10:49:15    

test.h
 

Code :
  1. #ifndef TEST_H
  2. #define TEST_H
  3.   #include <iostream>
  4.   template <class T>
  5.  
  6.   class test
  7.   {
  8.         public :
  9.        
  10.             void output(T item)
  11.              {
  12.                  std::cout << item ;
  13.              }
  15.   };
  16.        
  17.   #endif


 
c mieux qd meme  :whistle:  
 
le truc c que ton code des fonctions/methodes tempaltes doivent etre dans le .h non pas dans un .cc a part.

Reply

Marsh Posté le 08-09-2003 à 10:52:52    

Joel F a écrit :

test.h
 

Code :
  1. #ifndef TEST_H
  2. #define TEST_H
  3.   #include <iostream>
  4.   template <class T>
  5.  
  6.   class test
  7.   {
  8.         public :
  9.        
  10.             void output(T item)
  11.              {
  12.                  std::cout << item ;
  13.              }
  15.   };
  16.        
  17.   #endif


 
c mieux qd meme  :whistle:  
 
le truc c que ton code des fonctions/methodes tempaltes doivent etre dans le .h non pas dans un .cc a part.


 
 :sarcastic: J'ai eu la flemme :D


---------------
Le Tyran
Reply

Marsh Posté le 08-09-2003 à 11:33:06    

Joel F a écrit :

test.h
 

Code :
  1. #ifndef TEST_H
  2. #define TEST_H
  3.   #include <iostream>
  4.   template <class T>
  5.  
  6.   class test
  7.   {
  8.         public :
  9.        
  10.             void output(T item)
  11.              {
  12.                  std::cout << item ;
  13.              }
  15.   };
  16.        
  17.   #endif


 
c mieux qd meme  :whistle:  
 
le truc c que ton code des fonctions/methodes tempaltes doivent etre dans le .h non pas dans un .cc a part.


 
haaaaaaa
ok thks  :hello:

Reply

Sujets relatifs:

Leave a Replay

Make sure you enter the(*)required information where indicate.HTML code is not allowed