square(inline,매크로함수)
※main.c파일 #include #include "square.h" #define SQUARE(num) (num)*(num) int main(void) { //int result = square(5); // 5*5; //int result = SQUARE(5); // 5*5; int i = 5; int result = square(i++); // 5*5 //int result = SQUARE(i++); // result = (i++) * (i++) = 5 * 6 = 30; printf("result : %d\n",result); return 0; } ※square.h파일 #ifndef SQUARE_H #define SQUARE_H extern inline int square(int num) { retu..
본문
main.c(generic list)
※main.c파일 #include #include #include "list.h" void printInt(const void *pData) { printf("%d",*(int *)pData); } void printDouble(const void *pData) { printf("%f",*(double *)pData); } int main(void) { List list1,list2; initList(&list1,sizeof(int)); initList(&list2,sizeof(double)); int i; i = 4;insertFirstNode(&list1,&i); //[4] i = 3; insertFirstNode(&list1,&i); //[3,4] i = 1; insertFirstNode(&list..
main.c(리스트 createNode)
※main.c파일 #include #include #include "list.h" int main(void) { List list; initList(&list); insertFirstNode(&list,4); //[4] printList(&list); insertFirstNode(&list,3); //[3,4] printList(&list); insertFirstNode(&list,1); //[1,3,4] printList(&list); insertNode(&list, 1, 2); //[1,2,3,4] printList(&list); deleteNode(&list,3); //[1,2,4] printList(&list); cleanupList(&list); return 0; } ※list.h파일 #ifnd..
main.c(리스트)
※main.c파일 #include #include #include "list.h" int main(void) { List list; initList(&list); insertFirstNode(&list,4); //[4] printList(&list); insertFirstNode(&list,3); //[3,4] printList(&list); insertFirstNode(&list,1); //[1,3,4] printList(&list); insertNode(&list, 1, 2); //[1,2,3,4] printList(&list); deleteNode(&list,3); //[1,2,4] printList(&list); cleanupList(&list); return 0; } ※list.h파일 #ifnd..
main.c(queue memcpy)
※main.c파일 #include #include "queue.h" int main(void) { Queue s1, s2; initQueue(&s1,10,sizeof(int)); initQueue(&s2,100,sizeof(double)); int i; i = 100;push(&s1,&i); i = 200;push(&s1,&i); int re1; pop(&s1,&re1);printf("s1 1st pop() : %d\n", re1); i = 300; push(&s1,&i); pop(&s1,&re1);printf("s1 2nd pop() : %d\n", re1); pop(&s1,&re1);printf("s1 3rd pop() : %d\n", re1); double d; d = 1.1; push(&s2,&d..
main.c(queue malloc)
※main.c파일 #include #include "queue.h" int main(void) { Queue s1, s2; initQueue(&s1,10); initQueue(&s2,100); push(&s1,100); //구조체 자료는 인자를 전달할 때 오버헤드를 줄이기 위해 포인터를 쓴다. push(&s1,200); printf("s1 1st pop() : %d\n",pop(&s1)); push(&s1,300); printf("s1 2nd pop() : %d\n",pop(&s1)); printf("s1 3rd pop() : %d\n",pop(&s1)); push(&s2,900); push(&s2,800); printf("s2 1st pop() : %d\n",pop(&s2)); push(&s2,700)..