gdsl
1.8
|
00001 /* 00002 * This file is part of the Generic Data Structures Library (GDSL). 00003 * Copyright (C) 1998-2017 Nicolas Darnis <ndarnis@free.fr>. 00004 * 00005 * GDSL is free software: you can redistribute it and/or modify 00006 * it under the terms of the GNU General Public License as published by 00007 * the Free Software Foundation, either version 3 of the License, or 00008 * (at your option) any later version. 00009 * 00010 * GDSL is distributed in the hope that it will be useful, 00011 * but WITHOUT ANY WARRANTY; without even the implied warranty of 00012 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 00013 * GNU General Public License for more details. 00014 * 00015 * You should have received a copy of the GNU General Public License 00016 * along with GDSL. If not, see <http://www.gnu.org/licenses/>. 00017 * 00018 * $RCSfile: gdsl.h,v $ 00019 * $Revision: 1.28 $ 00020 * $Date: 2015/02/17 12:22:56 $ 00021 */ 00022 00023 #ifndef _GDSL_H_ 00024 #define _GDSL_H_ 00025 00026 /* 00027 * This is the GDSL main header file. 00028 * Include it in your source code to be able to use all GDSL modules. 00029 * Alternatively, you can include only the GDSL headers you needs in your 00030 * source files. 00031 */ 00032 00033 00034 #include "gdsl/gdsl_types.h" 00035 #include "gdsl/gdsl_macros.h" 00036 00037 00038 /* 00039 * High-level modules: use them to get the easier access to data structures and 00040 * GDSL's algorithms. 00041 */ 00042 #include "gdsl/gdsl_list.h" /* lists */ 00043 #include "gdsl/gdsl_stack.h" /* stacks */ 00044 #include "gdsl/gdsl_queue.h" /* queues */ 00045 #include "gdsl/gdsl_2darray.h" /* 2D arrays */ 00046 #include "gdsl/gdsl_bstree.h" /* binary search trees */ 00047 #include "gdsl/gdsl_perm.h" /* permutations */ 00048 #include "gdsl/gdsl_rbtree.h" /* red-black trees */ 00049 #include "gdsl/gdsl_hash.h" /* hashtables */ 00050 #include "gdsl/gdsl_sort.h" /* general-sorting functions */ 00051 #include "gdsl/gdsl_heap.h" /* heaps */ 00052 #include "gdsl/gdsl_interval_heap.h" /* interval heaps */ 00053 00054 00055 /* 00056 * Low-level modules: use them to get a low-level access to data structures. 00057 */ 00058 #include "gdsl/_gdsl_list.h" /* low-level lists */ 00059 #include "gdsl/_gdsl_bintree.h" /* low-level binary trees */ 00060 #include "gdsl/_gdsl_bstree.h" /* low-level binary search trees */ 00061 00062 00063 #if defined (__cplusplus) 00064 extern "C" 00065 { 00066 #endif /* __cplusplus */ 00067 00099 extern const char* 00100 gdsl_get_version (void); 00101 00102 00108 #ifdef __cplusplus 00109 } 00110 #endif/* __cplusplus */ 00111 00112 00113 #endif /* _GDSL_H_ */ 00114 00115