diff options
| author | Alex Auvolat--bernstein <auvolat@clipper.ens.fr> | 2013-12-04 16:49:31 +0100 |
|---|---|---|
| committer | Alex Auvolat--bernstein <auvolat@clipper.ens.fr> | 2013-12-04 16:49:31 +0100 |
| commit | cbec036a66960eea2ff1f1cda1f1e07f39461eb9 (patch) | |
| tree | 7f19c834dede1729c40eb861f78fd2d8d5f137f2 /set_linked_lists.c | |
| parent | 77db931b94870a8f28eef482091924471cd18d64 (diff) | |
| download | AlgoProg-Projet-cbec036a66960eea2ff1f1cda1f1e07f39461eb9.tar.gz AlgoProg-Projet-cbec036a66960eea2ff1f1cda1f1e07f39461eb9.zip | |
Added algorithm C (does not work)
Diffstat (limited to 'set_linked_lists.c')
| -rw-r--r-- | set_linked_lists.c | 3 |
1 files changed, 3 insertions, 0 deletions
diff --git a/set_linked_lists.c b/set_linked_lists.c index 8cc77c4..ee0a021 100644 --- a/set_linked_lists.c +++ b/set_linked_lists.c @@ -9,6 +9,8 @@ #include <stdlib.h> #include <stdio.h> +#include <assert.h> + #include "sets.h" /* Question théorique pertinente : @@ -92,6 +94,7 @@ set copy_set(const set s) { for (iter = s->first->next; iter != NULL; iter = iter->next) { element e = malloc(sizeof(struct set_elt)); + assert(e != NULL); e->value = iter->value; prev->next = e; prev = e; |