mirror of
https://develop.openfoam.com/Development/openfoam.git
synced 2025-11-28 03:28:01 +00:00
- ensure that the string-related classes have consistently similar
matching methods. Use operator()(const std::string) as an entry
point for the match() method, which makes it easier to use for
filters and predicates. In some cases this will also permit using
a HashSet as a match predicate.
regExp
====
- the set method now returns a bool to signal that the requested
pattern was compiled.
wordRe
====
- have separate constructors with the compilation option (was previously
a default parameter). This leaves the single parameter constructor
explicit, but the two parameter version is now non-explicit, which
makes it easier to use when building lists.
- renamed compile-option from REGEX (to REGEXP) for consistency with
with the <regex.h>, <regex> header names etc.
wordRes
====
- renamed from wordReListMatcher -> wordRes. For reduced typing and
since it behaves as an entity only slightly related to its underlying
list nature.
- Provide old name as typedef and include for code transition.
- pass through some list methods into wordRes
hashedWordList
====
- hashedWordList[const word& name] now returns a -1 if the name is is
not found in the list of indices. That has been a pending change
ever since hashedWordList was generalized out of speciesTable
(Oct-2010).
- add operator()(const word& name) for easy use as a predicate
STYLE: adjust parameter names in stringListOps
- reflect if the parameter is being used as a primary matcher, or the
matcher will be derived from the parameter.
For example,
(const char* re), which first creates a regExp
versus (const regExp& matcher) which is used directly.
237 lines
5.5 KiB
C
237 lines
5.5 KiB
C
/*---------------------------------------------------------------------------*\
|
|
========= |
|
|
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
|
|
\\ / O peration |
|
|
\\ / A nd | Copyright (C) 2011-2016 OpenFOAM Foundation
|
|
\\/ M anipulation |
|
|
-------------------------------------------------------------------------------
|
|
License
|
|
This file is part of OpenFOAM.
|
|
|
|
OpenFOAM is free software: you can redistribute it and/or modify it
|
|
under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
OpenFOAM 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 OpenFOAM. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
\*---------------------------------------------------------------------------*/
|
|
|
|
#include "regExp.H"
|
|
#include "List.H"
|
|
|
|
// * * * * * * * * * * * * * Private Member Functions * * * * * * * * * * * //
|
|
|
|
bool Foam::regExp::matchGrouping
|
|
(
|
|
const std::string& text,
|
|
List<std::string>& groups
|
|
) const
|
|
{
|
|
if (preg_ && !text.empty())
|
|
{
|
|
size_t nmatch = ngroups() + 1;
|
|
regmatch_t pmatch[nmatch];
|
|
|
|
// Also verify that the entire string was matched.
|
|
// pmatch[0] is the entire match
|
|
// pmatch[1..] are the (...) sub-groups
|
|
if
|
|
(
|
|
regexec(preg_, text.c_str(), nmatch, pmatch, 0) == 0
|
|
&& (pmatch[0].rm_so == 0 && pmatch[0].rm_eo == label(text.size()))
|
|
)
|
|
{
|
|
groups.setSize(ngroups());
|
|
label groupI = 0;
|
|
|
|
for (size_t matchI = 1; matchI < nmatch; matchI++)
|
|
{
|
|
if (pmatch[matchI].rm_so != -1 && pmatch[matchI].rm_eo != -1)
|
|
{
|
|
groups[groupI] = text.substr
|
|
(
|
|
pmatch[matchI].rm_so,
|
|
pmatch[matchI].rm_eo - pmatch[matchI].rm_so
|
|
);
|
|
}
|
|
else
|
|
{
|
|
groups[groupI].clear();
|
|
}
|
|
groupI++;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
}
|
|
|
|
groups.clear();
|
|
return false;
|
|
}
|
|
|
|
|
|
// * * * * * * * * * * * * * * * * Constructors * * * * * * * * * * * * * * //
|
|
|
|
Foam::regExp::regExp()
|
|
:
|
|
preg_(nullptr)
|
|
{}
|
|
|
|
|
|
Foam::regExp::regExp(const char* pattern, bool ignoreCase)
|
|
:
|
|
preg_(nullptr)
|
|
{
|
|
set(pattern, ignoreCase);
|
|
}
|
|
|
|
|
|
Foam::regExp::regExp(const std::string& pattern, bool ignoreCase)
|
|
:
|
|
preg_(nullptr)
|
|
{
|
|
set(pattern.c_str(), ignoreCase);
|
|
}
|
|
|
|
|
|
// * * * * * * * * * * * * * * * * Destructor * * * * * * * * * * * * * * * //
|
|
|
|
Foam::regExp::~regExp()
|
|
{
|
|
clear();
|
|
}
|
|
|
|
|
|
// * * * * * * * * * * * * * * Member Functions * * * * * * * * * * * * * * //
|
|
|
|
bool Foam::regExp::set(const char* pattern, bool ignoreCase)
|
|
{
|
|
clear();
|
|
|
|
// Avoid nullptr and zero-length patterns
|
|
if (pattern && *pattern)
|
|
{
|
|
int cflags = REG_EXTENDED;
|
|
if (ignoreCase)
|
|
{
|
|
cflags |= REG_ICASE;
|
|
}
|
|
|
|
const char* pat = pattern;
|
|
|
|
// Check for embedded prefix for ignore-case
|
|
// this is the only embedded prefix we support
|
|
// - a simple check is sufficient
|
|
if (!strncmp(pattern, "(?i)", 4))
|
|
{
|
|
cflags |= REG_ICASE;
|
|
pat += 4;
|
|
|
|
// avoid zero-length patterns
|
|
if (!*pat)
|
|
{
|
|
return false;
|
|
}
|
|
}
|
|
|
|
preg_ = new regex_t;
|
|
int err = regcomp(preg_, pat, cflags);
|
|
|
|
if (err != 0)
|
|
{
|
|
char errbuf[200];
|
|
regerror(err, preg_, errbuf, sizeof(errbuf));
|
|
|
|
FatalErrorInFunction
|
|
<< "Failed to compile regular expression '" << pattern << "'"
|
|
<< nl << errbuf
|
|
<< exit(FatalError);
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
return false; // Was cleared and nothing was set
|
|
}
|
|
|
|
|
|
bool Foam::regExp::set(const std::string& pattern, bool ignoreCase)
|
|
{
|
|
return set(pattern.c_str(), ignoreCase);
|
|
}
|
|
|
|
|
|
bool Foam::regExp::clear()
|
|
{
|
|
if (preg_)
|
|
{
|
|
regfree(preg_);
|
|
delete preg_;
|
|
preg_ = nullptr;
|
|
|
|
return true;
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
|
|
std::string::size_type Foam::regExp::find(const std::string& text) const
|
|
{
|
|
if (preg_ && !text.empty())
|
|
{
|
|
size_t nmatch = 1;
|
|
regmatch_t pmatch[1];
|
|
|
|
if (regexec(preg_, text.c_str(), nmatch, pmatch, 0) == 0)
|
|
{
|
|
return pmatch[0].rm_so;
|
|
}
|
|
}
|
|
|
|
return std::string::npos;
|
|
}
|
|
|
|
|
|
bool Foam::regExp::match(const std::string& text) const
|
|
{
|
|
if (preg_ && !text.empty())
|
|
{
|
|
size_t nmatch = 1;
|
|
regmatch_t pmatch[1];
|
|
|
|
// Also verify that the entire string was matched
|
|
// pmatch[0] is the entire match
|
|
if
|
|
(
|
|
regexec(preg_, text.c_str(), nmatch, pmatch, 0) == 0
|
|
&& (pmatch[0].rm_so == 0 && pmatch[0].rm_eo == regoff_t(text.size()))
|
|
)
|
|
{
|
|
return true;
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
|
|
bool Foam::regExp::match
|
|
(
|
|
const std::string& text,
|
|
List<std::string>& groups
|
|
) const
|
|
{
|
|
return matchGrouping(text, groups);
|
|
}
|
|
|
|
|
|
// ************************************************************************* //
|