Thread portable class Gate portable class Timer class Pool class Terimber 2.0 About C++

Downloads Products & Services Support Clients Open Source About Home / Open source / Terimber 2.0 xmlmodel.h Go to the documentation of this file. /* * The Software License * ================================================================================= * Copyright (c) 2003-.The Terimber Corporation. All rights reserved. * ================================================================================= * Redistributions of source code must retain the above copyright notice, * this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, * this list of conditions and the following disclaimer in the documentation * and/or other materials provided with the distribution. * The end-user documentation included with the redistribution, if any, * must include the following acknowledgment: * "This product includes software developed by the Terimber Corporation." * ================================================================================= * THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESSED OR IMPLIED WARRANTIES, * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY * AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * IN NO EVENT SHALL THE TERIMBER CORPORATION OR ITS CONTRIBUTORS BE LIABLE FOR * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * ================================================================================ */ #ifndef _terimber_xmlmodel_h_ #define _terimber_xmlmodel_h_ #include "xml/sxml.h" #include "base/bitset.h" BEGIN_TERIMBER_NAMESPACE #pragma pack(4) class content_node { public: virtual ~content_node() {} content_node( dfaRule rule ); inline void init( byte_allocator& allocator_, size_t sizeBit ); inline dfaRule get_rule() const; inline const _bitset& get_firstPos() const; inline const _bitset& get_lastPos() const; virtual bool is_nullable() const = 0; protected: virtual void calc_pos( _bitset& state, bool first ) const = 0; protected: dfaRule _rule; size_t _max_states; _bitset _firstPos; _bitset _lastPos; }; class content_any : public content_node { public: virtual ~content_any() {} content_any( dfaRule rule, size_t pos ); inline size_t get_pos() const; virtual bool is_nullable() const; protected: virtual void calc_pos( _bitset& state, bool ) const; private: size_t _pos; }; class content_leaf : public content_node { public: virtual ~content_leaf() {} content_leaf( const elementDecl* decl, size_t pos ); inline const elementDecl* get_decl() const; inline size_t get_pos() const; inline void set_pos( size_t pos ); virtual bool is_nullable() const; protected: virtual void calc_pos( _bitset& state, bool ) const; protected: const elementDecl* _decl; size_t _pos; }; class content_unary : public content_node { public: virtual ~content_unary() {} content_unary( dfaRule rule, content_node* child ); inline content_node* get_child() const; virtual bool is_nullable() const; protected: virtual void calc_pos( _bitset& state, bool first ) const; private: content_node* _child; }; class content_binary : public content_node { public: virtual ~content_binary() {} content_binary( dfaRule rule, content_node* left, content_node* right ); inline content_node* get_left() const; inline content_node* get_right() const; virtual bool is_nullable() const; protected: virtual void calc_pos( _bitset& state, bool first ) const; private: content_node* _left; content_node* _right; }; class content_interface { public: virtual ~content_interface(); virtual void validate( const xml_element& _el ) = 0; }; class content_mixed : public content_interface { public: content_mixed( const dfa_token* parent, byte_allocator& tmp_allocator ); void validate( const xml_element& _el ); private: void build_mixed_list(const dfa_token* parent ); private: byte_allocator& _tmp_allocator; _list< const dfa_token* > _listToken; }; class leaf_type { public: leaf_type(); public: const elementDecl* _decl; dfaRule _rule; }; class content_children : public content_interface { public: content_children(const dfa_token* parent, byte_allocator& tmp_allocator ); virtual void validate( const xml_element& el ); private: content_node* build_children_tree(const dfa_token* parent ); size_t post_tree_build_init(content_node* nodeCur, size_t curIndex ); void calc_follow_list(content_node* curNode ); void build_dfa( const dfa_token* parent ); inline void make_def_state_list(_vector< size_t >& x ) const; private: byte_allocator& _tmp_allocator; _vector< content_leaf* > _leafList; _vector< dfaRule > _leafListType; _vector< _bitset > _followList; size_t _leafCount; size_t _EOCPos; bool _emptyOk; _vector< const elementDecl* > _elemMap; _vector< dfaRule > _elemMapType; size_t _elemMapSize; _vector< leaf_type > _leafNameTypeVector; _vector< _vector< size_t > > _transTable; size_t _transTableSize; _vector< bool > _finalStateFlags; }; #pragma pack() END_TERIMBER_NAMESPACE #endif // _terimber_xmlmodel_h_

© Copyright Terimber 2003-.