#include <regexp_ast.h>
Definition at line 61 of file regexp_ast.h.
◆ RegExpDisjunction()
Definition at line 277 of file regexp_ast.cc.
282 min_match_ = first_alternative->min_match();
283 max_match_ = first_alternative->max_match();
286 min_match_ =
Utils::Minimum(min_match_, alternative->min_match());
287 max_match_ =
Utils::Maximum(max_match_, alternative->max_match());
288 }
289}
ZoneGrowableArray< RegExpTree * > * alternatives() const
static constexpr T Maximum(T x, T y)
static T Minimum(T x, T y)
◆ Accept()
virtual void * dart::RegExpDisjunction::Accept |
( |
RegExpVisitor * |
visitor, |
|
|
void * |
data |
|
) |
| |
|
virtual |
◆ alternatives()
Definition at line 73 of file regexp_ast.h.
73{ return alternatives_; }
◆ AsDisjunction()
◆ CaptureRegisters()
Interval dart::RegExpDisjunction::CaptureRegisters |
( |
| ) |
const |
|
virtual |
Reimplemented from dart::RegExpTree.
Definition at line 50 of file regexp_ast.cc.
50 {
52}
static Interval ListCaptureRegisters(ZoneGrowableArray< RegExpTree * > *children)
◆ IsAnchoredAtEnd()
bool dart::RegExpDisjunction::IsAnchoredAtEnd |
( |
| ) |
const |
|
virtual |
◆ IsAnchoredAtStart()
bool dart::RegExpDisjunction::IsAnchoredAtStart |
( |
| ) |
const |
|
virtual |
◆ IsDisjunction()
virtual bool dart::RegExpDisjunction::IsDisjunction |
( |
| ) |
const |
|
virtual |
◆ max_match()
virtual intptr_t dart::RegExpDisjunction::max_match |
( |
| ) |
const |
|
inlinevirtual |
◆ min_match()
virtual intptr_t dart::RegExpDisjunction::min_match |
( |
| ) |
const |
|
inlinevirtual |
◆ ToNode()
The documentation for this class was generated from the following files: