Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
C
cours
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
algorithmique
cours
Commits
4380c0c7
Verified
Commit
4380c0c7
authored
3 years ago
by
orestis.malaspin
Browse files
Options
Downloads
Patches
Plain Diff
added enqueue. missing dequeue
parent
735c1d0c
No related branches found
Branches containing commit
No related tags found
No related merge requests found
Pipeline
#14967
passed
3 years ago
Stage: test
Changes
3
Pipelines
1
Hide whitespace changes
Inline
Side-by-side
Showing
3 changed files
slides/cours_9.md
+76
-0
76 additions, 0 deletions
slides/cours_9.md
slides/figs/fig_empty_queue_insert.png
+0
-0
0 additions, 0 deletions
slides/figs/fig_empty_queue_insert.png
slides/figs/fig_non_empty_queue_insert.png
+0
-0
0 additions, 0 deletions
slides/figs/fig_non_empty_queue_insert.png
with
76 additions
and
0 deletions
slides/cours_9.md
+
76
−
0
View file @
4380c0c7
...
...
@@ -691,3 +691,79 @@ void stack_destroy(stack *s) {

## Structure de données en C?
. . .
```
C
txpedef struct _element { // Elément de liste
int data;
struct _element* next;
} element;
typedef struct _queue { // File d'attente:
element* head; // tête de file d'attente
element* tail; // queue de file d'attente
} queue;
```
# Fonctionnalités d'une file d'attente (gitlab)
## Creation et consultations
. . .
```
C
void queue_init(queue *fa); // head = tail = NULL
bool queue_is_empty(queue fa); // checks if queue is empty
int queue_tail(queue fa); // returns the value of the tail
int queue_head(queue fa); // returns the value of the head
```
## Manipulations et destruction
. . .
```
C
void queue_enqueue(queue *fa, int val); // adds an element before the tail
int queue_dequeue(queue *fa); // removes the head and returns stored value
void queue_destroy(queue *fa); // dequeues everything into oblivion
```
# Enfilage
## Deux cas différents:
1.
La file est vide (faire un dessin):
. . .

{width=40%}
2.
La file n'est pas vide (faire un dessin):
. . .

{width=70%}
<!-- # Défilage -->
<!-- Voici l'entête de la procédure: `int queue_extraire(queue* fa);` -->
<!-- On commence par récupérer, la valeur en tête de file d'attente via l'appel `queue_tete(*fa);` -->
<!-- Puis on met un pointeur temporaire sur l'élément en tête, avant de déplacer le pointeur de tête sur l'élément suivant. -->
<!-- Finalement, on désalloue la mémoire -->
<!--  -->
<!-- Si la file d'attente n'avait qu'un seul élément, alors il faudrait mettre le pointeur `fa->
debut
` à `
NULL
`. -->
<!-- Dans ce cas, à la suite du point (3), le pointeur `
fa->tete
` se retrouve à `
NULL
`. On doit donc ajouter l'instruction : -->
<!-- ```C -->
<!-- if (NULL == fa>tete) { -->
<!-- fa>debut = NULL; -->
<!-- } -->
<!-- ``
`
-->
This diff is collapsed.
Click to expand it.
slides/figs/fig_empty_queue_insert.png
0 → 100644
+
0
−
0
View file @
4380c0c7
13.3 KiB
This diff is collapsed.
Click to expand it.
slides/figs/fig_non_empty_queue_insert.png
0 → 100644
+
0
−
0
View file @
4380c0c7
20.1 KiB
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment