i did a butt load of tweaking to the paltest code and i did verious fixes here and...

[16.git] / src / palllist.c

diff --git a/src/palllist.c b/src/palllist.c
index 3e8bb2f7df57404aa6939feb49c131ca98ad9501..77f0abdc02ac4674a8ec649417863ac2bacd7509 100755 (executable)
--- a/src/palllist.c
+++ b/src/palllist.c
@@ -57,10 +57,126 @@
  * i am going to work on a really big area of code it will be on the refresh system, the walking/scrolling system, things that use showpage, adding disableing 8087 functions if no 8087 detected, and a bunch of other things i cannot remember off the top of my head because i am BURNT. I need a small break~ -- -- -- -- update! i am working on this i made ZC_WALK and i am going to move to VRL/VRS soon! .\r
  * ==== PRE SHOWPAGE TO SHOWMV CONVERSION ==== i am going to work on a really big area of code it will be on the refresh system, the walking/scrolling system, things that use showpage, adding disableing 8087 functions if no 8087 detected, and a bunch of other things i cannot remember off the top of my head because i am BURNT. I need a small break~ -- -- -- -- update! i am working on this i made ZC_WALK and i am going to move to VRL/VRS soon!\r
  */\r
-#include <stdio.h>\r
+#include "src/lib/ll.h"\r
+\r
+#if 0\r
+//def OTHERMERGELISTSTIFF\r
 \r
 void\r
 main(int argc, char *argv[])\r
 {\r
-//TOO TIREDWWWW\r
+       int i;\r
+       node_t * vga = NULL;                    node_t * imgpal = NULL;\r
+       vga = malloc(sizeof(node_t));   imgpal = malloc(sizeof(node_t));\r
+       vga->val = 24;                  imgpal->val = 9;\r
+       vga->next=NULL;                 imgpal->next=NULL;\r
+       vga->id=0;                              imgpal->id=0;\r
+\r
+       printf("        ");\r
+       for(i=1; i<=\r
+               //PAL_SIZE\r
+               6\r
+               ; i++)\r
+       {\r
+               if(!(i%3)) printf("\n   ");\r
+               printf("%d,", i);\r
+               pushe(vga, i);\r
+       }\r
+\r
+       printf("\n\n    ");\r
+\r
+       for(i=4; i>0; i--)\r
+       {\r
+               if(!(i%3)) printf("\n   ");\r
+               printf("%d,", i);\r
+               pushe(imgpal, i);\r
+       }\r
+       printf("\n");\r
+\r
+       printf("size of vga = %d\n", listLength(vga));\r
+//#if 0\r
+       printf("\n=======================\n");\r
+       printf("vga list printings\n=======================\n");\r
+       print_list(vga);\r
+       printf("\n=======================\n");\r
+       printf("imgpal list printings\n=======================\n");\r
+       print_list(imgpal);\r
+//     printf("\n=======================\n");\r
+//#endif\r
+       i=1;//skip overscan\r
+       while(i!=listLength(imgpal))\r
+       {\r
+               \r
+       }\r
+       free(vga);\r
+       free(imgpal);\r
+}\r
+#else\r
+#if 0\r
+/* C/C++ program to merge two sorted linked lists */\r
+//     from http://www.geeksforgeeks.org/merge-two-sorted-linked-lists/\r
+\r
+/* Drier program to test above functions*/\r
+void main()\r
+{\r
+       /* Start with the empty list */\r
+       struct node* res = NULL;\r
+       struct node* a = NULL;\r
+       struct node* b = NULL;\r
+\r
+       /* Let us create two sorted linked lists to test\r
+         the functions\r
+          Created lists, a: 5->10->15,  b: 2->3->20 */\r
+       pushll(&a, 15);\r
+       pushll(&a, 10);\r
+       pushll(&a, 4);\r
+       pushll(&a, 3);\r
+       pushll(&a, 2);\r
+       pushll(&a, 1);\r
+       pushll(&a, 0);\r
+\r
+       pushll(&b, 20);\r
+       pushll(&b, 3);\r
+       pushll(&b, 2);\r
+       pushll(&b, 4);\r
+\r
+       printf("\n");\r
+       printf("The 2 Linked List are: \n");\r
+       printList(a);   printf("\n");\r
+       printList(b);   printf("\n");\r
+\r
+       /* Remove duplicates from linked list */\r
+       res = SortedMerge(a, b);\r
+//     res = LL_merge(a, b);\r
+       \r
+       printf("Merged Linked List is: \n");\r
+       printList(res);\r
+}\r
+#endif\r
+/* C Program to remove duplicates from a sorted linked list */\r
+\r
+/* Drier program to test above functions*/\r
+void main()\r
+{\r
+       /* Start with the empty list */\r
+       struct node* head = NULL;\r
+   \r
+       /* Let us create a sorted linked list to test the functions\r
+        Created linked list will be 11->11->11->13->13->20 */\r
+       pushll(&head, 20);\r
+       pushll(&head, 13);\r
+       pushll(&head, 13);\r
+       pushll(&head, 11);\r
+       pushll(&head, 11);\r
+       pushll(&head, 11);\r
+\r
+       printf("\n Linked list before duplicate removal  ");\r
+       printList(head);\r
+\r
+       /* Remove duplicates from linked list */\r
+       removeDuplicates(head);\r
+\r
+       printf("\n Linked list after duplicate removal ");\r
+       printList(head);\r
 }\r
+#endif\r