|
|
@ -1,5 +1,7 @@
|
|
|
|
#include "Msae.h"
|
|
|
|
#include "Msae.h"
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//################ fonction commune ###################################
|
|
|
|
|
|
|
|
|
|
|
|
void clearpage(void)
|
|
|
|
void clearpage(void)
|
|
|
|
{
|
|
|
|
{
|
|
|
|
char entre;
|
|
|
|
char entre;
|
|
|
@ -8,6 +10,7 @@ void clearpage(void)
|
|
|
|
system("clear");
|
|
|
|
system("clear");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int login(void)
|
|
|
|
int login(void)
|
|
|
|
{
|
|
|
|
{
|
|
|
|
int i=3;
|
|
|
|
int i=3;
|
|
|
@ -50,3 +53,52 @@ int login(void)
|
|
|
|
else return 0;
|
|
|
|
else return 0;
|
|
|
|
system("clear");
|
|
|
|
system("clear");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//################# fonctions affichage ###########################
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void afficherPlace(MaillonDept m)
|
|
|
|
|
|
|
|
{
|
|
|
|
|
|
|
|
printf("\nPour ce département il y a %d places en 1ère année \n\n",m.nbP);
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//################## fonctions insertion #########################
|
|
|
|
|
|
|
|
int insererDept(VilleIUT v, MaillonDept m)
|
|
|
|
|
|
|
|
{
|
|
|
|
|
|
|
|
int trouve;
|
|
|
|
|
|
|
|
MaillonDept *pos;
|
|
|
|
|
|
|
|
pos=rechercheDept(v.lDept,&trouve,m.dept);
|
|
|
|
|
|
|
|
if(trouve==0)
|
|
|
|
|
|
|
|
{
|
|
|
|
|
|
|
|
printf("\nDépartement déjà présent dans cet IUT\n")
|
|
|
|
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
m->suiv=pos;
|
|
|
|
|
|
|
|
pos=&m;
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//################# fonctions recherche #########################
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
MaillonDept* rechercheDept(ListeDept lDept, int *trouve, char nom[])
|
|
|
|
|
|
|
|
{
|
|
|
|
|
|
|
|
while(lDept->suiv!=NULL)
|
|
|
|
|
|
|
|
{
|
|
|
|
|
|
|
|
if(strcmp(nom,lDept->dept)==0)
|
|
|
|
|
|
|
|
{
|
|
|
|
|
|
|
|
*trouve=1;
|
|
|
|
|
|
|
|
return lDept;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
if(strcmp(nom,lDept->dept)<0)
|
|
|
|
|
|
|
|
{
|
|
|
|
|
|
|
|
*trouve=0;
|
|
|
|
|
|
|
|
return lDept;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
lDept=lDept->suiv;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
*trouve=0;
|
|
|
|
|
|
|
|
return lDept;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|