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
72
73
74
75
76
|
#ifndef LPC_MATCH_H1105564052_INCLUDE_GUARD_
#define LPC_MATCH_H1105564052_INCLUDE_GUARD_
/* This file is part of indexlib.
* Copyright (C) 2005 Luís Pedro Coelho <luis@luispedro.org>
*
* Indexlib is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License, version 2, as
* published by the Free Software Foundation and available as file
* GPL_V2 which is distributed along with indexlib.
*
* Indexlib 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., 51 Franklin Street, Fifth Floor, Boston,
* MA 02110-1301, USA
*
* In addition, as a special exception, the copyright holders give
* permission to link the code of this program with any edition of
* the TQt library by Trolltech AS, Norway (or with modified versions
* of TQt that use the same license as TQt), and distribute linked
* combinations including the two. You must obey the GNU General
* Public License in all respects for all of the code used other than
* TQt. If you modify this file, you may extend this exception to
* your version of the file, but you are not obligated to do so. If
* you do not wish to do so, delete this exception statement from
* your version.
*/
#include <string>
#include <vector>
#include <map>
namespace indexlib {
/**
* \brief A class for string matching
*
* This class represents a pattern in a pre-processed form so that searching for it in larger textes is
* very fast. This allows for a very fast way to ask "does this pattern appear in this text?"
*
* The implementation uses the shift-or algorithm which is very fast, but especially designed for
* patterns which are shorter than the number of bits in a word ( 32 bits on most architechtures ). For
* larger patterns, the first 32 characters are matched using shift-or and the next characters are strcmp()ed.
* Even for patterns larger than 32 characters, this should be a fast strategy.
*/
class Match {
public:
enum flags { caseinsensitive = 1 };
/** Construct an object to match string \param pattern
*/
Match( std::string pattern, unsigned flags = 0 );
~Match();
/**
* Returns true if the pattern appears in \param string
* It has no memory
*/
bool process( const char* string ) const;
bool process( std::string str ) const { return process( str.c_str() ); }
private:
typedef std::vector<unsigned> tqmasks_type;
tqmasks_type tqmasks_;
unsigned hot_bit_;
bool caseinsensitive_;
std::string pattern_rest_;
};
}
#endif /* LPC_MATCH_H1105564052_INCLUDE_GUARD_ */
|
