blob: d39b0e81cc4584e651d9d483ac8b76f28cd2ef59 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
|
/* -*- C++ -*- */
// $Id$
/* Copyright (C) 1989 Free Software Foundation, Inc.
written by Douglas C. Schmidt (schmidt@ics.uci.edu)
This file is part of GNU GPERF.
GNU GPERF is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 1, or (at your option) any
later version.
GNU GPERF is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with GNU GPERF; see the file COPYING. If not, write to the Free
Software Foundation, 59 Temple Place - Suite 330, Boston, MA
02111-1307, USA.*/
#if !defined (BOOL_ARRAY_H)
#define BOOL_ARRAY_H
#include "Options.h"
#if defined (LO_CAL)
// If we are on a memory diet then we'll only make these use a limited
// amount of storage space.
typedef u_short STORAGE_TYPE;
#else
typedef int STORAGE_TYPE;
#endif /* LO_CAL */
class Bool_Array
{
// = TITLE
// Efficient lookup table abstraction implemented as an Generation
// Number Array.
//
// = DESCRIPTION
// Uses an Generation Numbering implementation to save on
// initialization time.
public:
Bool_Array (void);
~Bool_Array (void);
void init (STORAGE_TYPE *buffer, STORAGE_TYPE s);
int find (int hash_value);
void reset (void);
private:
STORAGE_TYPE *storage_array;
// Initialization of the index space.
STORAGE_TYPE generation_number;
// Keep track of the current Generation.
int size;
// Keep track of array size.
};
#endif /* BOOL_ARRAY_H */
|
