ptreefilter.hpp

Go to the documentation of this file.

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

 Copyright (C) 2011 - 2014 Project Wolframe.
 All rights reserved.

 This file is part of Project Wolframe.

 Commercial Usage
    Licensees holding valid Project Wolframe Commercial licenses may
    use this file in accordance with the Project Wolframe
    Commercial License Agreement provided with the Software or,
    alternatively, in accordance with the terms contained
    in a written agreement between the licensee and Project Wolframe.

 GNU General Public License Usage
    Alternatively, you can redistribute this file 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.

    Wolframe 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 Wolframe.  If not, see <http://www.gnu.org/licenses/>.

 If you have questions regarding the use of this file, please contact
 Project Wolframe.

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

#ifndef _Wolframe_FILTER_PTREE_FILTER_HPP_INCLUDED
#define _Wolframe_FILTER_PTREE_FILTER_HPP_INCLUDED
#include "filter/typedfilter.hpp"
#include "types/propertyTree.hpp"
#include <vector>
#include <string>

namespace _Wolframe {
namespace langbind {

class PropertyTreeInputFilter :public TypedInputFilter
{
public:
        PropertyTreeInputFilter( const types::PropertyTree::Node& pt)
                :TypedInputFilter("ptree")
                ,m_state(0)
        {
                State st;
                st.itr = pt.begin();
                st.end = pt.end();
                m_stk.push_back(st);
        }

        PropertyTreeInputFilter( const PropertyTreeInputFilter& o)
                :TypedInputFilter(o)
                ,m_stk(o.m_stk)
                ,m_state(o.m_state){}

        virtual ~PropertyTreeInputFilter(){}

        virtual TypedInputFilter* copy() const          {return new PropertyTreeInputFilter(*this);}

        virtual bool getNext( ElementType& type, types::VariantConst& element);

        virtual bool setFlags( Flags f);

        virtual bool checkSetFlags( Flags f) const;

        std::string posLogText() const
        {
                return m_position.logtext();
        }

private:
        struct State
        {
                types::PropertyTree::Node::const_iterator itr;
                types::PropertyTree::Node::const_iterator end;
        };

private:
        std::vector<State> m_stk;                       //< stack of iterator states
        int m_state;                                    //< fetching state of current element
        types::PropertyTree::Position m_position;       //< position of current element
};

class PropertyTreeOutputFilter :public TypedOutputFilter
{
public:
        PropertyTreeOutputFilter();

        virtual ~PropertyTreeOutputFilter(){}

        virtual TypedOutputFilter* copy() const                 {return new PropertyTreeOutputFilter(*this);}

        virtual bool print( ElementType type, const types::VariantConst& element);

        const types::PropertyTree::Node& content() const        {return m_stk.back().m_node;}

private:
        struct State
        {
                State(){}
                State( const std::string& name_)
                        :m_name(name_){}
                State( const State& o)
                        :m_name(o.m_name), m_node(o.m_node){}

                std::string m_name;
                types::PropertyTree::Node m_node;
        };
        std::vector<State> m_stk;               //< build property tree stack
        std::string m_attribute;                //< parsed attribute name
};

}}//namespace
#endif