gdsl
1.7
|
00001 /* 00002 * This file is part of the Generic Data Structures Library (GDSL). 00003 * Copyright (C) 1998-2006 Nicolas Darnis <ndarnis@free.fr>. 00004 * 00005 * The GDSL library is free software; you can redistribute it and/or 00006 * modify it under the terms of the GNU General Public License as 00007 * published by the Free Software Foundation; either version 2 of 00008 * the License, or (at your option) any later version. 00009 * 00010 * The GDSL library 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 the GDSL library; see the file COPYING. 00017 * If not, write to the Free Software Foundation, Inc., 00018 * 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA. 00019 * 00020 * $RCSfile: gdsl.h,v $ 00021 * $Revision: 1.26 $ 00022 * $Date: 2006/07/07 08:26:24 $ 00023 */ 00024 00025 00026 #ifndef _GDSL_H_ 00027 #define _GDSL_H_ 00028 00029 /* 00030 * This is the GDSL main header file. 00031 * Include it in your source code to be able to use all GDSL modules. 00032 * Alternatively, you can include only the GDSL headers you needs in your 00033 * source files. 00034 */ 00035 00036 00037 #include "gdsl/gdsl_types.h" 00038 #include "gdsl/gdsl_macros.h" 00039 00040 00041 /* 00042 * High-level modules: use them to get the easier access to data structures and 00043 * GDSL's algorithms. 00044 */ 00045 #include "gdsl/gdsl_list.h" /* lists */ 00046 #include "gdsl/gdsl_stack.h" /* stacks */ 00047 #include "gdsl/gdsl_queue.h" /* queues */ 00048 #include "gdsl/gdsl_2darray.h" /* 2D arrays */ 00049 #include "gdsl/gdsl_bstree.h" /* binary search trees */ 00050 #include "gdsl/gdsl_perm.h" /* permutations */ 00051 #include "gdsl/gdsl_rbtree.h" /* red-black trees */ 00052 #include "gdsl/gdsl_hash.h" /* hashtables */ 00053 #include "gdsl/gdsl_sort.h" /* general-sorting functions */ 00054 #include "gdsl/gdsl_heap.h" /* heaps */ 00055 #include "gdsl/gdsl_interval_heap.h" /* interval heaps */ 00056 00057 00058 /* 00059 * Low-level modules: use them to get a low-level access to data structures. 00060 */ 00061 #include "gdsl/_gdsl_list.h" /* low-level lists */ 00062 #include "gdsl/_gdsl_bintree.h" /* low-level binary trees */ 00063 #include "gdsl/_gdsl_bstree.h" /* low-level binary search trees */ 00064 00065 00066 #if defined (__cplusplus) 00067 extern "C" 00068 { 00069 #endif /* __cplusplus */ 00070 00071 00084 extern const char* 00085 gdsl_get_version (void); 00086 00087 00088 /* 00089 * @} 00090 */ 00091 00092 00093 #ifdef __cplusplus 00094 } 00095 #endif/* __cplusplus */ 00096 00097 00098 #endif /* _GDSL_H_ */ 00099 00100