| 1 |
/*****************************************************************
|
| 2 |
|
| 3 |
m2d_ord_front.c Type:Func
|
| 4 |
|
| 5 |
Arrangement d un nouveau element dans le front
|
| 6 |
|
| 7 |
Date de creation : Wed Mar 6 15:07:24 1996
|
| 8 |
|
| 9 |
Derniere version : Thu May 8 18:21:24 1997
|
| 10 |
|
| 11 |
|
| 12 |
|
| 13 |
|
| 14 |
|
| 15 |
|
| 16 |
|
| 17 |
|
| 18 |
|
| 19 |
|
| 20 |
|
| 21 |
|
| 22 |
Vincent FRANCOIS
|
| 23 |
|
| 24 |
*****************************************************************/
|
| 25 |
|
| 26 |
|
| 27 |
|
| 28 |
|
| 29 |
|
| 30 |
/**************************/
|
| 31 |
/* include */
|
| 32 |
#include <stdio.h>
|
| 33 |
#include "const.h"
|
| 34 |
#include "memoire.h"
|
| 35 |
#include "struct.h"
|
| 36 |
#include "prototype.h"
|
| 37 |
|
| 38 |
/**************************/
|
| 39 |
/* variables globales */
|
| 40 |
extern struct environnement env;
|
| 41 |
extern struct s_mesh *mesh;
|
| 42 |
|
| 43 |
|
| 44 |
|
| 45 |
/**************************/
|
| 46 |
/* programme principal */
|
| 47 |
|
| 48 |
void m2d_ord_front(struct s_front *ele)
|
| 49 |
{
|
| 50 |
struct s_front *ac_ft,*ac_ftp;
|
| 51 |
int ok;
|
| 52 |
|
| 53 |
qu_ins_obj(FRONT,ele->num,mesh->root);
|
| 54 |
if (mesh->tete_front==NULL)
|
| 55 |
{
|
| 56 |
mesh->tete_front=ele;
|
| 57 |
return;
|
| 58 |
}
|
| 59 |
ac_ft=mesh->tete_front;
|
| 60 |
ac_ftp=NULL;
|
| 61 |
ok=0;
|
| 62 |
do
|
| 63 |
{
|
| 64 |
if (ele->seg->longueur<ac_ft->seg->longueur)
|
| 65 |
{
|
| 66 |
ele->suivant=ac_ft;
|
| 67 |
ele->precedent=ac_ft->precedent;
|
| 68 |
ac_ft->precedent=ele;
|
| 69 |
if (ac_ftp!=NULL) ac_ftp->suivant=ele;
|
| 70 |
else mesh->tete_front=ele;
|
| 71 |
ok=1;
|
| 72 |
}
|
| 73 |
ac_ftp=ac_ft;
|
| 74 |
ac_ft=ac_ft->suivant;
|
| 75 |
if ( (ac_ft==NULL) && (ok==0) )
|
| 76 |
{
|
| 77 |
ac_ftp->suivant=ele;
|
| 78 |
ele->precedent=ac_ftp;
|
| 79 |
ok=1;
|
| 80 |
}
|
| 81 |
}
|
| 82 |
while (ok==0);
|
| 83 |
|
| 84 |
}
|
