/*

Copyright (c) 2005-2008, Simon Howard

Permission to use, copy, modify, and/or distribute this software 
for any purpose with or without fee is hereby granted, provided 
that the above copyright notice and this permission notice appear 
in all copies. 

THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL 
WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED 
WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE 
AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR 
CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM 
LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, 
NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN      
CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. 

 */

#ifndef LIBCALG_H
#define LIBCALG_H

#include <libcalg/compare-int.h>
#include <libcalg/compare-pointer.h>
#include <libcalg/compare-string.h>

#include <libcalg/hash-int.h>
#include <libcalg/hash-pointer.h>
#include <libcalg/hash-string.h>

#include <libcalg/arraylist.h>
#include <libcalg/avl-tree.h>
#include <libcalg/binary-heap.h>
#include <libcalg/binomial-heap.h>
#include <libcalg/bloom-filter.h>
#include <libcalg/hash-table.h>
#include <libcalg/list.h>
#include <libcalg/queue.h>
#include <libcalg/set.h>
#include <libcalg/slist.h>
#include <libcalg/trie.h>

#endif /* #ifndef LIBCALG_H */


