--- /dev/null
+/** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** **\r
+ * This file is part of clib library\r
+ * Copyright (C) 2011 Avinash Dongre ( dongre.avinash@gmail.com )\r
+ *\r
+ * Permission is hereby granted, free of charge, to any person obtaining a copy\r
+ * of this software and associated documentation files (the "Software"), to deal\r
+ * in the Software without restriction, including without limitation the rights\r
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r
+ * copies of the Software, and to permit persons to whom the Software is\r
+ * furnished to do so, subject to the following conditions:\r
+ * \r
+ * The above copyright notice and this permission notice shall be included in\r
+ * all copies or substantial portions of the Software.\r
+ * \r
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r
+ * THE SOFTWARE.\r
+ ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** **/\r
+\r
+#include "c_lib.h"\r
+#include <stdio.h>\r
+\r
+static int \r
+compare_int ( void *left, void *right ) {\r
+ int *l = (int*)left;\r
+ int *r = (int*)right;\r
+\r
+ if ( *l < *r ) \r
+ return -1;\r
+ else if ( *l > *r ) \r
+ return 1;\r
+ return 0;\r
+}\r
+static void\r
+print_element ( void *ptr ) {\r
+ printf ( "%d\n", *(int*)ptr);\r
+}\r
+void \r
+test_clib_heap_max() {\r
+ int test[] = {4,1,3,2,16,9,10,14,8,7};\r
+ int index = 0;\r
+ int size = sizeof (test) /sizeof(test[0]);\r
+ void *maxElem;\r
+ struct clib_heap* pHeap = new_clib_heap ( 8, compare_int, NULL);\r
+\r
+ for ( index = 0; index < size; index++ ) {\r
+ int v = test[index];\r
+ insert_clib_heap ( pHeap, &v, sizeof(int)); \r
+ }\r
+ build_max_clib_heap( pHeap);\r
+ printf ( "---------------------------------\n");\r
+ for_each_clib_heap ( pHeap, print_element);\r
+ printf ( "---------------------------------\n");\r
+ while ( empty_clib_heap(pHeap) != clib_true ) {\r
+ maxElem = extract_max_clib_heap ( pHeap );\r
+ printf ( "MAX ELEMENT = %d\n", *(int*)maxElem);\r
+ free ( maxElem );\r
+ }\r
+ delete_clib_heap ( pHeap );\r
+}\r
+\r
+void\r
+test_clib_heap_min() {\r
+ int test[] = {4,1,3,2,16,9,10,14,8,7};\r
+ int index = 0;\r
+ int size = sizeof (test) /sizeof(test[0]);\r
+ void *maxElem;\r
+ struct clib_heap* pHeap = new_clib_heap ( 8, compare_int, NULL);\r
+\r
+ for ( index = 0; index < size; index++ ) {\r
+ int v = test[index];\r
+ insert_clib_heap ( pHeap, &v, sizeof(int)); \r
+ }\r
+ build_min_clib_heap( pHeap);\r
+ printf ( "---------------------------------\n");\r
+ for_each_clib_heap ( pHeap, print_element);\r
+ printf ( "---------------------------------\n");\r
+ while ( empty_clib_heap(pHeap) != clib_true ) {\r
+ maxElem = extract_min_clib_heap ( pHeap );\r
+ printf ( "MIN ELEMENT = %d\n", *(int*)maxElem);\r
+ free ( maxElem );\r
+ }\r
+ delete_clib_heap ( pHeap );\r
+\r
+}\r
+\r
+void \r
+test_clib_heap() {\r
+ test_clib_heap_max();\r
+ test_clib_heap_min();\r
+}
\ No newline at end of file