C++

Template, code simple qui ne marche pas

Recherche :

Mot : Pseudo : Filtrer
Bas de page
Auteur	Sujet : Template, code simple qui ne marche pas

xiluoc

un pc pour les unirs ....

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 :

#ifndef TEST_H
#define TEST_H
using namespace std;
template <class T>
class test
{
public :
void output(T item);
};
#endif

test.cpp

Code :

#include "test.h"
#include <iostream>
using namespace std;
template <class T>
void test<T>::output(T item)
{
cout << item ;
}

main.cpp

Code :

#include <iostream>
#include <cstdlib>
#include "test.h"
using namespace std;
int main()
{
test<int> mytest;
mytest.output(6);
system("PAUSE" );
return 0;
}

[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 :

#ifndef TEAM_QUEUE_H
#define TEAM_QUEUE_H
#include <vector>
using namespace std;
class team_queue
{
public :
struct teamq_struct
{
vector <int> vect_item;
int item_team;
};
team_queue();
//default constructor
~team_queue();
//default destructor
void push (int item,int team);
///adds the supplied item belonging to the given team number
// to the team_queue in the apporpriate fashion
void pop();
//removes the front from the team_queue
void team_pop(int team);
//removes the front item of the supplied team from the team_queue
void team_remove(int team);
//removes all items belonging to a suppliedteam from the team_queue
int front();
//returns the item at the front of the team_queue
int team_front(int team);
//returns the item at the front of the supplied team from the team_queue
bool pure();
//returns true iff the team_queue contains no more than 1 member of each team.
int size();
//returns the number of items in the team_queue.
int team_size(int team);
//returns the number of elements of a given team in the team_queue
int team_number();
//returns the number of different teams in the team_queue
void order_asc();
//sorts the items in each team in the team_queue into nondescending
//numeric order (from front to rear).
void order_desc();
//sorts the items in each team in the team_queue into nondascending
//numeric order (from rear to front).
void display();
//display all the elements of the team queue
bool isempty();
//return true if the tq is empty
private:
vector <teamq_struct> struct_vect;
vector <teamq_struct>::iterator cursor;
void error(int errorcode);
};
#endif

team_queue.cpp

Code :

#include "team_queue.h"
#include <iostream>
#include <vector>
#include <algorithm>
/*
|¯¯¯¯¯¯¯¯¯¯¯¯|
constructor
|____________|
*/
team_queue::team_queue()
{
}
/*
|¯¯¯¯¯¯¯¯¯¯¯¯|
destructor
|____________|
*/
team_queue::~team_queue()
{
struct_vect.clear();
}
/*
|¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
PUSH : adds the supplied item belonging to the given team number
to the team_queue in the apporpriate fashion.
|________________________________________________________________|
*/
void team_queue::push(int item, int team)
{
team_queue::teamq_struct var;
var.item_team = team;
var.vect_item.push_back(item);
if (isempty()) struct_vect.push_back(var);
else
{
bool inserted = false;
for (cursor = struct_vect.begin(); cursor != struct_vect.end(); cursor++)
{
if (cursor->item_team == team)
{
cursor->vect_item.push_back(item);
inserted = true;
break;
}
}
//if no team member found enqueue at the end
if (inserted == false) struct_vect.push_back(var);;
}
}
/*
|¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
POP : removes the front from the team_queue
|_______________________________________________|
*/
void team_queue::pop()
{
if (isempty()) error(0);
else
{
cursor = struct_vect.begin();
if (cursor->vect_item.size() == 1) //only one element ?
{
struct_vect.erase(cursor); //destroy the full team (1elmt)
}
else cursor->vect_item.erase(cursor->vect_item.begin());
}
}
/*
|¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
TEAM_POP : removes the front item of the supplied team from the team_queue
|_____________________________________________________________________________|
*/
void team_queue::team_pop(int team)
{
if (isempty()) error(0);
else
{
for (cursor = struct_vect.begin(); cursor != struct_vect.end(); cursor++)
{
if (cursor->item_team == team)
{
if (cursor->vect_item.size() == 1) struct_vect.erase(cursor);
else cursor->vect_item.erase(cursor->vect_item.begin());
break;
}
}
}
}
/*
|¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
TEAM_REMOVE :removes all items belonging to a suppliedteam from the team_queue
|______________________________________________________________________________|
*/
void team_queue::team_remove(int team)
{
if (isempty()) error(0);
else
{
for (cursor = struct_vect.begin(); cursor != struct_vect.end(); cursor++)
{
if (cursor->item_team == team)
{
struct_vect.erase(cursor);
cursor --;
}
}
}
}
/*
|¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
FRONT :returns the item at the front of the team_queue
|_________________________________________________________|
*/
int team_queue::front()
{
if (isempty())
{
error(1);
return 0;
}
else return struct_vect[0].vect_item.front();
}
/*
|¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
TEAM _FRONT :returns the item at the front of the supplied team
from the team_queue
|_________________________________________________________________|
*/
int team_queue::team_front(int team)
{
if (isempty()) error(1);
else
{
for (cursor = struct_vect.begin(); cursor != struct_vect.end(); cursor++)
{
if (cursor->item_team == team)
{
return cursor->vect_item.at(0);
break;
}
}
error(3);
return 0; //??
}
}
/*
|¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
PURE : returns true iff the team_queue contains no more
than 1 member of each team.
|_________________________________________________________|
*/
bool team_queue::pure()
{
if (isempty()) return false;
else
{
for (cursor = struct_vect.begin(); cursor != struct_vect.end(); cursor++)
if (cursor->vect_item.size() != 1) return false;
return true;
}
}
/*
|¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
SIZE : returns the number of items in the team_queue.
|_____________________________________________________|
*/
int team_queue::size()
{
if (isempty()) return 0;
else
{
int count = 0;
for (cursor = struct_vect.begin(); cursor != struct_vect.end(); cursor++)
count = count + (cursor->vect_item.size());
return count;
}
}
/*
|¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
TEAM_SIZE : returns the number of elements of a given team in the team_queue.
|_____________________________________________________________________________|
*/
int team_queue::team_size(int team)
{
if (isempty()) return 0; //if tq is empty return 0
else
{
for (cursor = struct_vect.begin(); cursor != struct_vect.end(); cursor++)
if (cursor->item_team == team) return cursor->vect_item.size();
}
}
/*
|¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
TEAM_NUMBER : returns the number of different teams in the team_queue.
|_______________________________________________________________________|
*/
int team_queue::team_number() { return struct_vect.size(); }
/*
|¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
ORDER_ASC : sorts the items in each team in the team_queue into nondescending
numeric order (from rear to front).
|_____________________________________________________________________________|
*/
void team_queue::order_asc()
{
if (isempty()) { return; }
else
{
for (cursor = struct_vect.begin(); cursor != struct_vect.end(); cursor++)
{
int length = cursor->vect_item.size();
sort (cursor->vect_item.begin(), cursor->vect_item.end());
}
}//end else
}
/*
|¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
ORDER_DESC : sorts the items in each team in the team_queue into nonascending
numeric order (from front to rear).
|_____________________________________________________________________________|
*/
void team_queue::order_desc()
{
if (isempty()) { return; }
else
{
for (cursor = struct_vect.begin(); cursor != struct_vect.end(); cursor++)
{
int length = cursor->vect_item.size();
sort (cursor->vect_item.rbegin(), cursor->vect_item.rend());
}
}//end else
}
/*
|¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
DISPLAY : display all the elements of the team queue
|______________________________________________________|
*/
void team_queue::display()
{
if (isempty()) error(1);
else
{
for (cursor = struct_vect.begin(); cursor != struct_vect.end(); cursor++)
for (int i =0; i < cursor->vect_item.size();i++) cout << " (" << cursor->vect_item[i] << "," << cursor->item_team << " ) " << flush;
cout << endl;
}
}
/*
|¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
ERROR :
|______________________________________________________|
*/
void team_queue::error(int errorcode)
{
switch (errorcode)
{
case 0 : cout << "Error, you can't pop anymore items \a" << endl; break;
case 1 : cout << "Teamq queue is empty \a" << endl; break;
case 3 : cout << "No team found \a" << endl; break;
}
}
/*
|¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯|
ISEMPTY: return true id there is no element into the team_q
|____________________________________________________________|
*/
bool team_queue::isempty() { return (struct_vect.size() == 0); }

Publicité

chrisbk

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

Aaaaaammmeeeennnnnnn

xiluoc

un pc pour les unirs ....

chrisbk a écrit :

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

Aaaaaammmeeeennnnnnn

gni ?
exemple pleassse

chrisbk

xiluoc a écrit :

gni ?
exemple pleassse

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)

xiluoc

un pc pour les unirs ....

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:

LetoII

Le dormeur doit se réveiller

Grossièrement remagné:

test.h

Code :

#ifndef TEST_H
#define TEST_H
#include <iostream>
template <class T>
class test
{
public :
void output(T item)
{
using namespace std;
cout << item ;
}
};
#endif

---------------
Le Tyran

Joel F

Real men use unique_ptr

test.h

Code :

#ifndef TEST_H
#define TEST_H
#include <iostream>
template <class T>
class test
{
public :
void output(T item)
{
std::cout << item ;
}
};
#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.

LetoII

Le dormeur doit se réveiller

Joel F a écrit :

test.h

Code :

#ifndef TEST_H
#define TEST_H
#include <iostream>
template <class T>
class test
{
public :
void output(T item)
{
std::cout << item ;
}
};
#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

---------------
Le Tyran

xiluoc

un pc pour les unirs ....

Joel F a écrit :

test.h

Code :

#ifndef TEST_H
#define TEST_H
#include <iostream>
template <class T>
class test
{
public :
void output(T item)
{
std::cout << item ;
}
};
#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:

FORUM HardWare.fr

Programmation

C++

Template, code simple qui ne marche pas

Sujets relatifs
Instanciation d objets OLE ca ne marche que dans l unite principale ?	onmouseover qui marche pas tout le temps [RESOLU]
fonction membres et template .template	bbcode ca marche pas
Votre bout de code le mieux fait	Mon code..
Ce site ne marche sous Camino 0.7	déclaration d'un template
cacher code html ?
Plus de sujets relatifs à : Template, code simple qui ne marche pas

Page générée en 0.134 secondes