00001 /*@HEADER 00002 // *********************************************************************** 00003 // 00004 // Ifpack: Object-Oriented Algebraic Preconditioner Package 00005 // Copyright (2002) Sandia Corporation 00006 // 00007 // Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive 00008 // license for use of this work by or on behalf of the U.S. Government. 00009 // 00010 // Redistribution and use in source and binary forms, with or without 00011 // modification, are permitted provided that the following conditions are 00012 // met: 00013 // 00014 // 1. Redistributions of source code must retain the above copyright 00015 // notice, this list of conditions and the following disclaimer. 00016 // 00017 // 2. Redistributions in binary form must reproduce the above copyright 00018 // notice, this list of conditions and the following disclaimer in the 00019 // documentation and/or other materials provided with the distribution. 00020 // 00021 // 3. Neither the name of the Corporation nor the names of the 00022 // contributors may be used to endorse or promote products derived from 00023 // this software without specific prior written permission. 00024 // 00025 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY 00026 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00027 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 00028 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE 00029 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, 00030 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 00031 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 00032 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF 00033 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 00034 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 00035 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00036 // 00037 // Questions? Contact Michael A. Heroux (maherou@sandia.gov) 00038 // 00039 // *********************************************************************** 00040 //@HEADER 00041 */ 00042 00043 /* This is similar to the Hash_i_dh class (woe, for a lack 00044 of templates); this this class is for hashing data 00045 consisting of single, non-negative integers. 00046 */ 00047 00048 00049 #ifndef HASH_I_DH 00050 #define HASH_I_DH 00051 00052 #include "euclid_common.h" 00053 00054 00055 #ifdef __cplusplus 00056 extern "C" 00057 { 00058 #endif 00059 00060 /* 00061 class methods 00062 note: all parameters are inputs; the only output 00063 is the "int" returned by Hash_i_dhLookup. 00064 */ 00065 extern void Hash_i_dhCreate (Hash_i_dh * h, int size); 00066 /* For proper operation, "size," which is the minimal 00067 size of the hash table, must be a power of 2. 00068 Or, pass "-1" to use the default. 00069 */ 00070 00071 00072 extern void Hash_i_dhDestroy (Hash_i_dh h); 00073 extern void Hash_i_dhReset (Hash_i_dh h); 00074 00075 extern void Hash_i_dhInsert (Hash_i_dh h, int key, int data); 00076 /* throws error if <data, data> is already inserted; 00077 grows hash table if out of space. 00078 */ 00079 00080 extern int Hash_i_dhLookup (Hash_i_dh h, int key); 00081 /* returns "data" associated with "key," 00082 or -1 if "key" is not found. 00083 */ 00084 00085 #ifdef __cplusplus 00086 } 00087 #endif 00088 #endif
1.7.6.1