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
|
/*
** SWISH++
** string_set.h
**
** Copyright (C) 1998 Paul J. Lucas
**
** 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., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#ifndef string_set_H
#define string_set_H
// standard
#include <set>
// local
#include "fake_ansi.h"
#include "less.h"
//*****************************************************************************
//
// SYNOPSIS
//
class string_set
//
// DESCRIPTION
//
// A string_set is used to contain a set of strings that can be
// searched. Note that C-style strings are used and that no string data
// is actually copied.
//
// SEE ALSO
//
// less.h
//
//*****************************************************************************
{
public:
typedef char const* key_type;
void insert( key_type s ) { set_.insert( s ); }
bool find( key_type s ) const { return set_.find( s ) != set_.end(); }
private:
typedef std::set< key_type > set_type;
set_type set_;
};
#endif /* string_set_H */
|
