blob: b922adfa51777490947d4a6eed082284407811fe (
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
66
67
68
69
70
71
|
/* -*- 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 "ace/OS.h"
#include "Options.h"
#if defined (ACE_HAS_GPERF)
class Bool_Array
{
// = TITLE
// Efficient lookup table abstraction implemented as a "Generation
// Number" Array.
//
// = DESCRIPTION
// Uses a "Generation Numbering" implementation to minimize
// initialization time.
public:
// = Initialization and termination methods.
Bool_Array (void);
// Constructor
int open (u_long);
// Initialize the array (requires O(n) time).
~Bool_Array (void);
// Destructor.
int find (u_long value);
// Locate the <value> in the array (requires O(1) time).
void reset (void);
// Reinitializes the array (requires O(1) time).
private:
u_long *storage_array_;
// Initialization of the index space.
u_long generation_number_;
// Keep track of the current Generation.
u_long size_;
// Keep track of array size.
};
#endif /* ACE_HAS_GPERF */
#endif /* BOOL_ARRAY_H */
|
