wordRes.H

Go to the documentation of this file.

/*---------------------------------------------------------------------------*\
  =========                 |
  \\      /  F ield         | OpenFOAM: The Open Source CFD Toolbox
   \\    /   O peration     |
    \\  /    A nd           | www.openfoam.com
     \\/     M anipulation  |
-------------------------------------------------------------------------------
    Copyright (C) 2016-2025 OpenCFD Ltd.
-------------------------------------------------------------------------------
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/>.

Class
    Foam::wordRes

Description
    A List of wordRe with additional matching capabilities.

SourceFiles
    wordResI.H
    wordRes.C

\*---------------------------------------------------------------------------*/

#ifndef Foam_wordRes_H
#define Foam_wordRes_H

#include "wordRe.H"
#include "List.H"

// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //

namespace Foam
{

// List types
typedef List<wordRe> wordReList;    
typedef UList<wordRe> wordReUList;  


/*---------------------------------------------------------------------------*\
                           Class wordRes Declaration
\*---------------------------------------------------------------------------*/

class wordRes
:
    public List<wordRe>
{
    // Private Methods

        //- Smart match as literal or regex, stopping on the first match.
        //  \return index of first match, -1 if not found
        inline static label first_match
        (
            const UList<wordRe>& selectors,
            const std::string& text,
            const bool literal = false
        );


public:

    // Static Methods

        //- Return a null wordRes (reference to a nullObject).
        //- Behaves like a empty wordRes.
        static const wordRes& null() noexcept
        {
            return NullObjectRef<wordRes>();
        }


    // Constructors

        //- Inherit constructors from List of wordRe
        using List<wordRe>::List;


    //- Destructor
    ~wordRes() = default;


    // Static Functions

        //- Return a wordRes with duplicate entries filtered out.
        //  No distinction made between literals and regular expressions.
        static wordRes uniq(const UList<wordRe>& input);

        //- Test for a match of any selectors against the text.
        //
        //  \return \c false if no selectors are specified
        //  \return \c true  if text matches \em any of the selectors
        inline static bool match
        (
            const UList<wordRe>& selectors,
            const std::string& text,
            bool literal = false
        );

        //- Smart match across entire list, returning the best match type.
        //  Stops on the first literal match, or continues to examine
        //  if a regex match occurs.
        //  \return wordRe::LITERAL, wordRe::REGEX on match and
        //      wordRe::UNKNOWN otherwise.
        inline static wordRe::compOption matched
        (
            const UList<wordRe>& selectors,
            const std::string& text
        );

        //- Determine the list indices for all matches.
        //
        //  \return indices of the matches in the input list
        template<class StringType>
        inline static labelList matching
        (
            const wordRe& select,
            const UList<StringType>& input,
            const bool invert = false
        );

        //- Determine the list indices for all matches.
        //
        //  \return indices of the matches in the input list
        template<class StringType>
        inline static labelList matching
        (
            const UList<wordRe>& selectors,
            const UList<StringType>& input,
            const bool invert = false
        );


    // Member Functions

        //- Filter out duplicate entries (inplace).
        //  No distinction made between literals and regular expressions.
        void uniq();

        //- Smart match as literal or regex, stopping on the first match.
        //
        //  \param literal Force literal match only.
        //  \return True if text matches ANY of the entries.
        inline bool match(const std::string& text, bool literal=false) const;

        //- Smart match in the list of matchers, returning the match type.
        //  It stops if there is a literal match, or continues to examine
        //  other regexs.
        //  \return LITERAL if a lteral match was found,
        //      REGEX if any regex match was found,
        //      UNKNOWN otherwise.
        inline wordRe::compOption matched(const std::string& text) const;

        //- Determine the list indices for all matches.
        //
        //  \return indices of the matches in the input list
        template<class StringType>
        inline labelList matching
        (
            const UList<StringType>& input,
            const bool invert = false
        ) const;


    // Member Operators

        //- Identical to match(), for use as a predicate.
        inline bool operator()(const std::string& text) const;


    // Functors

        //- Functor wrapper of a list of wordRe for matching
        struct matcher
        {
            //- Construct with \em select matcher(s)
            inline explicit matcher(const UList<wordRe>& selectors) noexcept;

            //- No selectors defined
            inline bool empty() const noexcept;

            //- Apply matcher predicate
            //
            //  \return \c false if no selectors are specified
            //  \return \c true  if text matches \em any of the selectors
            inline bool operator()(const std::string& text) const;

        private:
            const UList<wordRe>& select_;
        };


        //- Functor wrapper of allow/deny lists of wordRe for filtering
        //
        //  An empty filter accepts everything.
        //  An empty \em allow accepts everything not in \em deny.
        //  A literal \em allow match has higher priority than any \em deny.
        //  A regex \em allow match has lower priority than any \em deny.
        //
        //  Example (when applied to a list of words),
        //  \verbatim
        //     input:  ( abc apple test other val val1 val2 wall wall1 wall2 )
        //     allow:  ( abc def "t.*" other val val1 "wall.*" )
        //     deny:   ( "[ab].*" "t.*" other "val[0-9]" wall )
        //
        //     result:  (abc other val val1 wall1 wall2)
        //  \endverbatim
        struct filter
        {
            //- Construct with \em allow and \em deny matchers
            inline filter
            (
                const UList<wordRe>& allow,
                const UList<wordRe>& deny
            ) noexcept;

            //- No filtering defined
            inline bool empty() const noexcept;

            //- True if filtering is defined
            explicit operator bool() const noexcept { return !empty(); }

            //- Apply filter against specified text
            //
            //  \return \c true if no filtering has been defined
            //  \return \c true if matched but not blocked
            inline bool operator()(const std::string& text) const;

        private:
            const UList<wordRe>& allow_;
            const UList<wordRe>& deny_;
        };
};


// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //

} // End namespace Foam

// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //

#include "wordResI.H"

#endif

// ************************************************************************* //