insertnodeaction.h

Go to the documentation of this file.

/****************************************************************************
**
** Author: Róbert Márki <gsmiko@gmail.com>
** Copyright (c) 2016 Róbert Márki
**
** This file is part of the jmespath.cpp project which is distributed under
** the MIT License (MIT).
**
** 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 INSERTBINARYEXPRESSIONNODEACTION_H
#define INSERTBINARYEXPRESSIONNODEACTION_H
#include "src/parser/noderank.h"
#include "src/parser/leftedgeiterator.h"
#include "src/ast/allnodes.h"
#include <algorithm>
#include <boost/variant/polymorphic_get.hpp>
#include <boost/optional.hpp>

namespace jmespath { namespace parser {

template <typename NodeInserterT,
          typename NodeInsertConditionT>
class InsertNodeAction
{
public:
    using result_type = void;
    template <typename T>
    void operator()(ast::ExpressionNode& targetNode, T& node) const
    {
        using std::placeholders::_1;
        LeftEdgeIterator begin(targetNode);
        LeftEdgeIterator end;
        auto predicate = std::bind(m_insertCondition, _1, std::ref(node));
        auto it = std::find_if(begin, end, predicate);
        if (it != end)
        {
            m_nodeInserter(*it, node);
        }
    }

private:
    NodeInserterT m_nodeInserter;
    NodeInsertConditionT m_insertCondition;
};
}} // namespace jmespath::parser
#endif // INSERTBINARYEXPRESSIONNODEACTION_H