modules/up/src/gnug++/int.defs.h
/* [<][>][^][v][top][bottom][index][help] */
FUNCTIONS
This source file includes following functions.
- intEQ
- intLE
- intCMP
- intHASH
- HASHTABLE_TOO_CROWDED
1 // This may look like C code, but it is really -*- C++ -*-
2 /*
3 Copyright (C) 1988 Free Software Foundation
4 written by Doug Lea (dl@rocky.oswego.edu)
5
6 This file is part of the GNU C++ Library. This library is free
7 software; you can redistribute it and/or modify it under the terms of
8 the GNU Library General Public License as published by the Free
9 Software Foundation; either version 2 of the License, or (at your
10 option) any later version. This library is distributed in the hope
11 that it will be useful, but WITHOUT ANY WARRANTY; without even the
12 implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
13 PURPOSE. See the GNU Library General Public License for more details.
14 You should have received a copy of the GNU Library General Public
15 License along with this library; if not, write to the Free Software
16 Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
17 */
18
19
20 #ifndef _intdefs_h
21 #define _intdefs_h 1
22
23
24 // equality operator
25 #ifndef intEQ
26 #define intEQ(a, b) ((a) == (b))
/* [<][>][^][v][top][bottom][index][help] */
27 #endif
28
29 // less-than-or-equal
30 #ifndef intLE
31 #define intLE(a, b) ((a) <= (b))
/* [<][>][^][v][top][bottom][index][help] */
32 #endif
33
34 // comparison : less-than -> < 0; equal -> 0; greater-than -> > 0
35 #ifndef intCMP
36 #define intCMP(a, b) ( a - b )
/* [<][>][^][v][top][bottom][index][help] */
37 #endif
38
39 // hash function
40 #ifndef intHASH
41 //extern unsigned int hash(int );
42 #define intHASH(x) (x)
/* [<][>][^][v][top][bottom][index][help] */
43 #endif
44
45 // initial capacity for structures requiring one
46
47 #ifndef DEFAULT_INITIAL_CAPACITY
48 #define DEFAULT_INITIAL_CAPACITY 100
49 #endif
50
51 // HASHTABLE_TOO_CROWDED(COUNT, SIZE) is true iff a hash table with COUNT
52 // elements and SIZE slots is too full, and should be resized.
53 // This is so if available space is less than 1/8.
54
55 #define HASHTABLE_TOO_CROWDED(COUNT, SIZE) ((SIZE) - ((SIZE) >> 3) <= (COUNT))
/* [<][>][^][v][top][bottom][index][help] */
56
57 #endif