55 template<
class T>
class List;
67 mutable regex_t* preg_;
74 template<
class StringType>
93 inline static bool meta(
char c)
98 || (c ==
'*' || c ==
'+' || c ==
'?')
99 || (c ==
'(' || c ==
')' || c ==
'|')
100 || (c ==
'[' || c ==
']')
111 regExp(
const char*,
const bool ignoreCase=
false);
114 regExp(
const std::string&,
const bool ignoreCase=
false);
129 inline bool empty()
const 135 inline bool exists()
const 137 return preg_ ? true :
false;
143 return int(preg_ ? preg_->re_nsub : 0);
151 void set(
const char*,
const bool ignoreCase=
false)
const;
155 void set(
const std::string&,
const bool ignoreCase=
false)
const;
170 bool match(
const std::string&)
const;
181 bool search(
const std::string& str)
const 183 return std::string::npos !=
find(str);
bool clear() const
Release precompiled expression.
void operator=(const regExp &)=delete
Disallow default bitwise assignment.
bool match(const std::string &) const
Return true if it matches the entire string.
Wrapper around POSIX extended regular expressions.
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
static bool meta(char c)
Is character a regular expression meta-character?
const dimensionedScalar & c
Speed of light in a vacuum.
bool exists() const
Does a precompiled expression exist?
bool search(const std::string &str) const
Return true if the regex was found within string.
graph_traits< Graph >::vertices_size_type size_type
int ngroups() const
Return the number of (groups)
std::string::size_type find(const std::string &str) const
Find position within string.
bool empty() const
Return true if a precompiled expression does not exist.