|
|
|
@ -1,13 +1,13 @@
|
|
|
|
|
#include "SAE.h"
|
|
|
|
|
|
|
|
|
|
FileAdmission filenouvListeDpt(void)
|
|
|
|
|
ListeAdmission listenouv(void)
|
|
|
|
|
{
|
|
|
|
|
FileAdmission f;
|
|
|
|
|
ListeAdmission f;
|
|
|
|
|
f = NULL;
|
|
|
|
|
return f;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
FileAdmission adjq(FileAdmission f, Admission candidat)
|
|
|
|
|
ListeAdmission adjq(ListeAdmission f, Admission candidat)
|
|
|
|
|
{
|
|
|
|
|
MaillonAdmission *p;
|
|
|
|
|
p = (MaillonAdmission *)malloc(sizeof(MaillonAdmission));
|
|
|
|
@ -27,7 +27,7 @@ FileAdmission adjq(FileAdmission f, Admission candidat)
|
|
|
|
|
return p;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
FileAdmission supt(FileAdmission f)
|
|
|
|
|
ListeAdmission supt(ListeAdmission f)
|
|
|
|
|
{
|
|
|
|
|
MaillonAdmission *aux;
|
|
|
|
|
if(vide(f))
|
|
|
|
@ -38,7 +38,7 @@ FileAdmission supt(FileAdmission f)
|
|
|
|
|
if(f->suiv == f)
|
|
|
|
|
{
|
|
|
|
|
free(f);
|
|
|
|
|
return filenouv();
|
|
|
|
|
return Listenouv();
|
|
|
|
|
}
|
|
|
|
|
aux = f->suiv;
|
|
|
|
|
f->suiv = aux->suiv;
|
|
|
|
@ -46,12 +46,12 @@ FileAdmission supt(FileAdmission f)
|
|
|
|
|
return f;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
bool vide(FileAdmission f)
|
|
|
|
|
bool vide(ListeAdmission f)
|
|
|
|
|
{
|
|
|
|
|
return f == NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
Admission tete(FileAdmission f)
|
|
|
|
|
Admission tete(ListeAdmission f)
|
|
|
|
|
{
|
|
|
|
|
if(vide(f))
|
|
|
|
|
{
|
|
|
|
@ -61,7 +61,7 @@ Admission tete(FileAdmission f)
|
|
|
|
|
return f->suiv->v;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int longueur(FileAdmission f)
|
|
|
|
|
int longueur(ListeAdmission f)
|
|
|
|
|
{
|
|
|
|
|
int cpt = 1;
|
|
|
|
|
MaillonAdmission *aux;
|
|
|
|
@ -78,7 +78,7 @@ int longueur(FileAdmission f)
|
|
|
|
|
return cpt;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void afficher(FileAdmission f)
|
|
|
|
|
void afficher(ListeAdmission f)
|
|
|
|
|
{
|
|
|
|
|
MaillonAdmission *p=f;
|
|
|
|
|
if(vide(f))
|
|
|
|
|