gdsl  1.8
gdsl.h
Go to the documentation of this file.
00001 /*
00002  * This file is part of the Generic Data Structures Library (GDSL).
00003  * Copyright (C) 1998-2018 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 
00019 /*
00020  * GDSL - Generic Data Structures Library
00021  * $RCSfile: gdsl.h,v $
00022  * $Revision: 1.28 $
00023  * $Date: 2015/02/17 12:22:56 $
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  */
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 
00081 extern const char*
00082 gdsl_get_version (void);
00083 
00084 
00089 #ifdef __cplusplus
00090 }
00091 #endif /* __cplusplus */
00092 
00093 
00094 #endif /* _GDSL_H_ */
00095 
00096