filedeuxp5tttggghhhjhhghhhhnhbhhgiles.pptx

C00LiMoUn1 3 views 6 slides Aug 05, 2024
Slide 1
Slide 1 of 6
Slide 1
1
Slide 2
2
Slide 3
3
Slide 4
4
Slide 5
5
Slide 6
6

About This Presentation

Ghhhb ghjh vhh


Slide Content

Séance 04/02/2022

La partie interface #include"pilech.h" struct file { struct element * tete ; struct element * queue; }; struct file * creer_file (); unsigned file_vide ( struct file* ); int premier( struct file*); void enfiler( int , struct file*); void defiler ( struct file*);

La partie implémentation #include<assert.h> #include<stdlib.h> #include"filedeuxpiles.h" struct file * creer_file () { struct file *f; f=( struct file*) malloc ( sizeof ( struct file)); f-> tete = creer_pile (); f->queue= creer_pile (); return f; } unsigned file_vide ( struct file *f) { return ( pile_vide (f-> tete )&& pile_vide (f->queue)); }

La partie implémentation int premier( struct file *f) { assert (! file_vide (f)); if( pile_vide (f-> tete )) while (! pile_vide (f->queue)) { empiler(dernier(f->queue), &f-> tete ); depiler (&f->queue); } return (dernier(f-> tete )); }

void enfiler ( int info, struct file* f) { empiler( info,&f ->queue); } La partie implémentation

void defiler ( struct file* f) { assert (! file_vide (f)); if(! pile_vide (f-> tete )) depiler (&f-> tete ); else { while (! pile_vide (f->queue)) { empiler(dernier(f->queue), &f-> tete ); depiler (&f->queue); } depiler (&f-> tete ); } } La partie implémentation
Tags