Main Page | Modules | Data Structures | File List | Data Fields | Globals | Related Pages

skiplist.h

Go to the documentation of this file.
00001 #ifndef DEF_SKIPLIST 00002 #define DEF_SKIPLIST 00003 00004 /* ---------------------------------------------------------------------------- 00005 @COPYRIGHT : 00006 Copyright 1993,1994,1995 David MacDonald, 00007 McConnell Brain Imaging Centre, 00008 Montreal Neurological Institute, McGill University. 00009 Permission to use, copy, modify, and distribute this 00010 software and its documentation for any purpose and without 00011 fee is hereby granted, provided that the above copyright 00012 notice appear in all copies. The author and McGill University 00013 make no representations about the suitability of this 00014 software for any purpose. It is provided "as is" without 00015 express or implied warranty. 00016 ---------------------------------------------------------------------------- */ 00017 00018 /* ----------------------------- MNI Header ----------------------------------- 00019 @NAME : skiplist.h 00020 @INPUT : 00021 @OUTPUT : 00022 @RETURNS : 00023 @DESCRIPTION: Maintains a skiplist structure to handle ordered lists, searches. 00024 @METHOD : 00025 @GLOBALS : 00026 @CALLS : 00027 @CREATED : David MacDonald 00028 @MODIFIED : 00029 ---------------------------------------------------------------------------- */ 00030 00031 00032 #include <volume_io.h> 00033 00034 typedef struct skip_struct 00035 { 00036 float key; 00037 void *data_ptr; 00038 struct skip_struct *forward[1]; 00039 } skip_struct; 00040 00041 #define LESS_THAN -1 00042 #define EQUAL_TO 0 00043 #define GREATER_THAN 1 00044 00045 typedef struct 00046 { 00047 skip_struct *header; 00048 int level; 00049 } skiplist_struct; 00050 00051 #endif

Generated on Wed Jul 28 09:10:58 2004 for BICPL by doxygen 1.3.7