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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
|
/*
This is a Unix port of the Plan 9 regular expression library, by Rob Pike.
Please send comments about the packaging to Russ Cox <[email protected]>.
Copyright © 2021 Plan 9 Foundation
Copyright © 2022 Tyge Løvset, for additions made in 2022.
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
#ifndef CREGEX_H_
#define CREGEX_H_
/*
* cregex.h
*
* This is a extended version of regexp9, supporting UTF8 input, common
* shorthand character classes, ++.
*/
#include "forward.h" // csview
typedef enum {
cre_success = 1,
cre_nomatch = 0,
cre_matcherror = -1,
cre_outofmemory = -2,
cre_unmatchedleftparenthesis = -3,
cre_unmatchedrightparenthesis = -4,
cre_toomanysubexpressions = -5,
cre_toomanycharacterclasses = -6,
cre_malformedcharacterclass = -7,
cre_missingoperand = -8,
cre_unknownoperator = -9,
cre_operandstackoverflow = -10,
cre_operatorstackoverflow = -11,
cre_operatorstackunderflow = -12,
} cregex_error_t;
enum {
/* compile-flags */
cre_DOTALL = 1<<0,
cre_CASELESS = 1<<1,
/* match-flags */
cre_FULLMATCH = 1<<2,
cre_NEXT = 1<<3,
cre_STARTEND = 1<<4,
/* limits */
cre_MAXCLASSES = 16,
cre_MAXCAPTURES = 32,
};
typedef struct {
struct Reprog* prog;
} cregex;
typedef csview cregmatch;
static inline
cregex cregex_init(void) {
cregex rx = {0};
return rx;
}
/* return 1 on success, or negative error code on failure. */
int cregex_compile(cregex *self, const char* pattern, int cflags);
static inline
cregex cregex_from(const char* pattern, int cflags) {
cregex rx = {0};
cregex_compile(&rx, pattern, cflags);
return rx;
}
/* number of capture groups in a regex pattern, 0 if regex is invalid */
int cregex_captures(const cregex* self);
/* return 1 on match, 0 on nomatch, and -1 on failure. */
int cregex_match(const char* input, const cregex* re,
csview match[], int mflags);
/* match + compile RE pattern */
int cregex_match_p(const char* input, const char* pattern,
csview match[], int cmflags);
/* replace regular expression */
cstr cregex_replace(const char* input, const cregex* re, const char* replace,
bool (*mfun)(int i, csview match, cstr* mstr), unsigned count);
/* replace + compile RE pattern, and extra arguments */
cstr cregex_replace_pe(const char* input, const char* pattern, const char* replace,
bool (*mfun)(int i, csview match, cstr* mstr), unsigned count, int cflags);
static inline
cstr cregex_replace_p(const char* input, const char* pattern, const char* replace)
{ return cregex_replace_pe(input, pattern, replace, NULL, 0, 0); }
/* destroy regex */
void cregex_drop(cregex* self);
#endif
|
