vchoi_fork

/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *

 * Copyright by The HDF Group.                                               *

 * Copyright by the Board of Trustees of the University of Illinois.         *

 * All rights reserved.                                                      *

 *                                                                           *

 * This file is part of HDF5.  The full HDF5 copyright notice, including     *

 * terms governing use, modification, and redistribution, is contained in    *

 * the files COPYING and Copyright.html.  COPYING can be found at the root   *

 * of the source code distribution tree; Copyright.html can be found at the  *

 * root level of an installed copy of the electronic HDF5 document set and   *

 * is linked from the top-level documents page.  It can also be found at     *

 * http://hdfgroup.org/HDF5/doc/Copyright.html.  If you do not have          *

 * access to either file, you may request a copy from help@hdfgroup.org.     *

 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */

​

/*

 * Purpose: Provides a skip list abstract data type.

 *

 *              (See "Skip Lists: A Probabilistic Alternative to Balanced Trees"

 *               by William Pugh for additional information)

 *

 *              (This implementation has the optimization for reducing key

 *               key comparisons mentioned in section 3.5 of "A Skip List

 *               Cookbook" by William Pugh)

 *

 *              (Also, this implementation has a couple of home-grown

 *               optimizations, including setting the "update" vector to the

 *               actual 'forward' pointer to update, instead of the node

 *               containing the forward pointer -QAK)

 *

 *              (Note: This implementation does not have the information for

 *               implementing the "Linear List Operations" (like insert/delete/

 *               search by position) in section 3.4 of "A Skip List Cookbook",

 *               but they shouldn't be that hard to add, if necessary)

 *

 *              (This implementation has an additional backward pointer, which

 *               allows the list to be iterated in reverse)

 *

 *              (We should also look into "Deterministic Skip Lists" (see

 *              paper by Munro, Papadakis & Sedgewick))

 *

 *              (There's also an article on "Alternating Skip Lists", which

 *              are similar to deterministic skip lists, in the August 2000

 *              issue of Dr. Dobb's Journal)

 *

 */

​

/* Interface initialization */

#define H5_INTERFACE_INIT_FUNC  H5SL_init_interface

​

​