Ifpack Package Browser (Single Doxygen Collection) Development
Loading...
Searching...
No Matches
Hash_dh.h
Go to the documentation of this file.
1/*@HEADER
2// ***********************************************************************
3//
4// Ifpack: Object-Oriented Algebraic Preconditioner Package
5// Copyright (2002) Sandia Corporation
6//
7// Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
8// license for use of this work by or on behalf of the U.S. Government.
9//
10// Redistribution and use in source and binary forms, with or without
11// modification, are permitted provided that the following conditions are
12// met:
13//
14// 1. Redistributions of source code must retain the above copyright
15// notice, this list of conditions and the following disclaimer.
16//
17// 2. Redistributions in binary form must reproduce the above copyright
18// notice, this list of conditions and the following disclaimer in the
19// documentation and/or other materials provided with the distribution.
20//
21// 3. Neither the name of the Corporation nor the names of the
22// contributors may be used to endorse or promote products derived from
23// this software without specific prior written permission.
24//
25// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
26// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
28// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
29// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
30// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
31// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
32// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
33// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
34// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
35// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
36//
37// Questions? Contact Michael A. Heroux (maherou@sandia.gov)
38//
39// ***********************************************************************
40//@HEADER
41*/
42
43#ifndef HASH_D_DH
44#define HASH_D_DH
45
46/* todo: rehash should be implemented in Hash_dhInsert();
47 as of now, an error is set if the table overflows.
48*/
49
50#include "euclid_common.h"
51
52/* This should be done with templates, if this were in C++;
53 for now, a record contains every type of entry we might
54 need; this is a waste of memory, when one is only intersted
55 in hashing <key, int> pairs!
56*/
57#ifdef __cplusplus
58extern "C"
59{
60#endif
61
62 typedef struct _hash_node
63 {
64 int iData; /* integer */
65 double fData; /* float */
66 int *iDataPtr; /* pointer to integer */
67 int *iDataPtr2; /* pointer to integer */
68 double *fDataPtr; /* pointer to float */
70
71
73
74/* data structure for the hash table; do not directly access */
75 struct _hash_dh
76 {
77 int size; /* total slots in table */
78 int count; /* number of insertions in table */
81 };
82
83
84 extern void Hash_dhCreate (Hash_dh * h, int size);
85 extern void Hash_dhDestroy (Hash_dh h);
86 extern void Hash_dhInsert (Hash_dh h, int key, HashData * data);
87 extern HashData *Hash_dhLookup (Hash_dh h, int key);
88 /* returns NULL if record isn't found. */
89
90 extern void Hash_dhReset (Hash_dh h);
91 extern void Hash_dhPrint (Hash_dh h, FILE * fp);
92
93
94#define HASH_1(k,size,idxOut) \
95 { *idxOut = k % size; }
96
97#define HASH_2(k,size,idxOut) \
98 { \
99 int r = k % (size-13); \
100 r = (r % 2) ? r : r+1; \
101 *idxOut = r; \
102 }
103
104#ifdef __cplusplus
105}
106#endif
107#endif
void Hash_dhDestroy(Hash_dh h)
Definition: Hash_dh.c:82
HashData * Hash_dhLookup(Hash_dh h, int key)
Definition: Hash_dh.c:139
void Hash_dhPrint(Hash_dh h, FILE *fp)
Definition: Hash_dh.c:206
struct _hash_node HashData
void Hash_dhCreate(Hash_dh *h, int size)
Definition: Hash_dh.c:63
void Hash_dhInsert(Hash_dh h, int key, HashData *data)
Definition: Hash_dh.c:174
void Hash_dhReset(Hash_dh h)
Definition: Hash_dh.c:96
int curMark
Definition: Hash_dh.h:79
int count
Definition: Hash_dh.h:78
int size
Definition: Hash_dh.h:77
HashRecord * data
Definition: Hash_dh.h:80
double * fDataPtr
Definition: Hash_dh.h:68
double fData
Definition: Hash_dh.h:65
int * iDataPtr
Definition: Hash_dh.h:66
int * iDataPtr2
Definition: Hash_dh.h:67
int iData
Definition: Hash_dh.h:64