blob: b7955dc79c74702ae990941565ff5bef0ef1883b (
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
|
// Scintilla source code edit control
/** @file RESearch.h
** Interface to the regular expression search library.
**/
// Written by Neil Hodgson <neilh@scintilla.org>
// Based on the work of Ozan S. Yigit.
// This file is in the public domain.
#ifndef RESEARCH_H
#define RESEARCH_H
namespace Scintilla::Internal {
class CharacterIndexer {
public:
virtual char CharAt(Sci::Position index) const=0;
};
class RESearch {
public:
explicit RESearch(CharClassify *charClassTable);
// No dynamic allocation so default copy constructor and assignment operator are OK.
void Clear();
const char *Compile(const char *pattern, Sci::Position length, bool caseSensitive, bool posix);
int Execute(const CharacterIndexer &ci, Sci::Position lp, Sci::Position endp);
static constexpr int MAXTAG = 10;
static constexpr int NOTFOUND = -1;
using MatchPositions = std::array<Sci::Position, MAXTAG>;
MatchPositions bopat;
MatchPositions eopat;
private:
static constexpr int MAXNFA = 4096;
// The following constants are not meant to be changeable.
// They are for readability only.
static constexpr int MAXCHR = 256;
static constexpr int CHRBIT = 8;
static constexpr int BITBLK = MAXCHR / CHRBIT;
void ChSet(unsigned char c) noexcept;
void ChSetWithCase(unsigned char c, bool caseSensitive) noexcept;
int GetBackslashExpression(const char *pattern, int &incr) noexcept;
Sci::Position PMatch(const CharacterIndexer &ci, Sci::Position lp, Sci::Position endp, const char *ap);
Sci::Position bol;
char nfa[MAXNFA]; /* automaton */
int sta;
int failure;
std::array<unsigned char, BITBLK> bittab {}; /* bit table for CCL pre-set bits */
CharClassify *charClass;
bool iswordc(unsigned char x) const noexcept {
return charClass->IsWord(x);
}
};
}
#endif
|
