|
@@ -88,33 +88,25 @@ int encode(){
|
|
|
return 0;
|
|
|
}
|
|
|
|
|
|
+int func(char* arg){
|
|
|
+ printf("Func : %s\n", arg);
|
|
|
+ return EXIT_SUCCESS;
|
|
|
+}
|
|
|
+
|
|
|
+int tion(char* arg){
|
|
|
+ printf("Tion : %s\n", arg);
|
|
|
+ return EXIT_SUCCESS;
|
|
|
+}
|
|
|
+
|
|
|
int array_list(){
|
|
|
arraylist al;
|
|
|
arraylist_ini(&al);
|
|
|
- arraylist_add(&al, "clef1", "val1");
|
|
|
- arraylist_add(&al, "clef2", "val2");
|
|
|
- arraylist_add(&al, "clef3", "val3");
|
|
|
- arraylist_add(&al, "clef3", "val4");
|
|
|
- for(al_node* aln = al.first; aln != NULL; aln = aln->next){
|
|
|
- printf("%s: %s\n", aln->key, aln->val);
|
|
|
- }
|
|
|
- al_node* aln = arraylist_search(&al, "clef2");
|
|
|
- printf("Search clef2 : %d\n", aln != NULL);
|
|
|
- aln = arraylist_search(&al, "clef22");
|
|
|
- printf("Search clef22 : %d\n-----\n", aln != NULL);
|
|
|
- arraylist_remove(&al, "clef1");
|
|
|
- arraylist_add(&al, "clef4", "val4");
|
|
|
- for(al_node* aln = al.first; aln != NULL; aln = aln->next){
|
|
|
- printf("%s: %s\n", aln->key, aln->val);
|
|
|
- }
|
|
|
- printf("Size : %d\n-----\n", al.size);
|
|
|
- arraylist_remove(&al, "clef3");
|
|
|
- for(al_node* aln = al.first; aln != NULL; aln = aln->next){
|
|
|
- printf("%s: %s\n", aln->key, aln->val);
|
|
|
- }
|
|
|
- printf("Size : %d\n-----\n", al.size);
|
|
|
- arraylist_clean(&al);
|
|
|
- printf("Size : %d\n", al.size);
|
|
|
+ arraylist_add(&al, "func1", func);
|
|
|
+ arraylist_add(&al, "func2", tion);
|
|
|
+
|
|
|
+ printf("%d\n", arraylist_call(&al, "func2", "Pouet"));
|
|
|
+ printf("%d\n", arraylist_call(&al, "func1", "Loul"));
|
|
|
+ printf("%d\n", arraylist_call(&al, "func3", "Nop"));
|
|
|
|
|
|
return 0;
|
|
|
}
|