blob: 3c3c49a6db928a76f9ef8f4ea89fabcf05f3cb9e (
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++ -*-
/**
* Copyright (C) 1989 Free Software Foundation, Inc.
* written by Douglas C. Schmidt (schmidt@cs.wustl.edu)
*
* This file is part of GNU GPERF.
*
* This program 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 2
* of the License, or (at your option) any later version.
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#ifndef BOOL_ARRAY_H
#define BOOL_ARRAY_H
#include "ace/config-all.h"
#if !defined (ACE_LACKS_PRAGMA_ONCE)
# pragma once
#endif /* ACE_LACKS_PRAGMA_ONCE */
#include "Options.h"
/**
* Efficient lookup table abstraction implemented as a "Generation
* Number" Array.
*
* Uses a "Generation Numbering" implementation to minimize
* initialization time.
*/
class Bool_Array
{
public:
/// Constructor
Bool_Array (void);
/// Initialize the array (requires O(n) time).
int open (u_long);
/// Destructor.
~Bool_Array (void);
/// Locate the @a value in the array (requires O(1) time).
int find (u_long value);
/// Reinitializes the array (requires O(1) time).
void reset (void);
private:
/// Initialization of the index space.
unsigned long *storage_array_;
/// Keep track of the current Generation.
unsigned long generation_number_;
/// Keep track of array size.
unsigned long size_;
};
#endif /* BOOL_ARRAY_H */
|
