Inheritance diagram for Gaudi::Parsers::EdgeGrammar< Iterator, Skipper >:

Collaboration diagram for Gaudi::Parsers::EdgeGrammar< Iterator, Skipper >:

Public Types
typedef Edges	ResultT

Public Member Functions
	EdgeGrammar ()

Public Attributes
VectorGrammar< Iterator, std::vector< double >, Skipper >	edges

RealGrammar< Iterator, double, Skipper >	low

RealGrammar< Iterator, double, Skipper >	high

IntGrammar< Iterator, unsigned int, Skipper >	nbins

qi::rule< Iterator, Edges(), qi::locals< char >, Skipper >	result

qi::rule< Iterator, Edges(), Skipper >	inner

qi::rule< Iterator, Edges(), Skipper >	inner_pairs

qi::rule< Iterator, char()>	begin

qi::rule< Iterator, void(char)>	end

Detailed Description

template<typename Iterator, typename Skipper>
class Gaudi::Parsers::EdgeGrammar< Iterator, Skipper >

Author: Vanya BELYAEV Ivan..nosp@m.Bely.nosp@m.aev@n.nosp@m.ikhe.nosp@m.f.nl

Date: 2009-09-26

Definition at line 54 of file HistoParsers.cpp.

Member Typedef Documentation

template<typename Iterator , typename Skipper >

typedef Edges Gaudi::Parsers::EdgeGrammar< Iterator, Skipper >::ResultT

Definition at line 60 of file HistoParsers.cpp.

Constructor & Destructor Documentation

template<typename Iterator , typename Skipper >

Gaudi::Parsers::EdgeGrammar< Iterator, Skipper >::EdgeGrammar ( )

inline

Definition at line 64 of file HistoParsers.cpp.

                   : EdgeGrammar::base_type(result)  {
          inner =
                    ( ( qi::lit("edges") | "'edges'" | "\"edges\"" )
                      >> ":" >> edges[qi::_val *= qi::_1] )
                    | inner_pairs[qi::_val = qi::_1];
          inner_pairs =
               ((( qi::lit("nbins")  | "'nbins'"  | "\"nbins\"")
               >> ":" >> nbins [ qi::_val /= qi::_1 ])
               |
               (( qi::lit("low")    | "'low'"    | "\"low\""    )
               >> ":" >> low [qi::_val -= qi::_1])
               |
              (( qi::lit("high")   | "'high'"   | "\"high\""   )
               >> ":" >> high  [qi::_val += qi::_1])) % ',';
          begin = enc::char_('[')[qi::_val=']']
                | enc::char_('{')[qi::_val='}']
                | enc::char_('(')[qi::_val=')'];
          end = enc::char_(qi::_r1);
          result =  begin[qi::_a = qi::_1]
            >> inner[qi::_val = qi::_1]
            >> end(qi::_a) ;
        }