gambas-source-code/gb.xml/node.h

99 lines
5 KiB
C
Raw Permalink Normal View History

/***************************************************************************
(c) 2012 Adrien Prokopowicz <prokopy@users.sourceforge.net>
This program 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 2, or (at your option)
any later version.
This program 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 this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
MA 02110-1301, USA.
***************************************************************************/
#ifndef NODE_H
#define NODE_H
#include "gb.xml.h"
#define SUPPORT_CHILDREN(__node) ((__node->type == Node::ElementNode) || (__node->type == Node::DocumentNode))
[GB.XML] OPT : A few compilation optimizations in headers inclusions. OPT : Use of separated internal classes of gambas objects. This might prevent from a lot of problems. OPT : Strings are not stored as wchar_t* anymore, but as simple char*, and are converted only when necessary (like UTF8 characters verification). OPT : Does not use STL classes anymore. They are too slow. Uses now handmade classes. OPT : Nodes are now internally linked to their brothers, so it makes find them really fasters, and allows no longer use of external linked list. OPT : When creating new nodes, linked Gambas objects are created only when necessary, so it makes internals instanciations very faster (such as the parser). OPT : Handmade string/memory classes and functions are now separated from the main.cpp component file. OPT : Use specialized memory management functions (like memcpy, memchr ...) into the parser. They are really faster than C loops, and speeds up the parser for documents that have a lot of plain text. OPT : Internally, the stream parser (XmlReader) takes only one char, not a unuseful wole string object. OPT : Does not updates debugging data when parsing a file. They will be generated only if an error is raised (not implemented yet). It will allow a speedier parser and more precise informations. BUG : When loading a document from a file, now correctly releases the file data. BUG : Solved a few XmlReader uninitialized variables, that could make the stream parser crash or returns strange results. git-svn-id: svn://localhost/gambas/trunk@4737 867c0c6c-44f3-4631-809d-bfa615b0a4ec
2012-05-17 22:49:54 +02:00
class Element;
class TextNode;
class Document;
[GB.XML] OPT : A few compilation optimizations in headers inclusions. OPT : Use of separated internal classes of gambas objects. This might prevent from a lot of problems. OPT : Strings are not stored as wchar_t* anymore, but as simple char*, and are converted only when necessary (like UTF8 characters verification). OPT : Does not use STL classes anymore. They are too slow. Uses now handmade classes. OPT : Nodes are now internally linked to their brothers, so it makes find them really fasters, and allows no longer use of external linked list. OPT : When creating new nodes, linked Gambas objects are created only when necessary, so it makes internals instanciations very faster (such as the parser). OPT : Handmade string/memory classes and functions are now separated from the main.cpp component file. OPT : Use specialized memory management functions (like memcpy, memchr ...) into the parser. They are really faster than C loops, and speeds up the parser for documents that have a lot of plain text. OPT : Internally, the stream parser (XmlReader) takes only one char, not a unuseful wole string object. OPT : Does not updates debugging data when parsing a file. They will be generated only if an error is raised (not implemented yet). It will allow a speedier parser and more precise informations. BUG : When loading a document from a file, now correctly releases the file data. BUG : Solved a few XmlReader uninitialized variables, that could make the stream parser crash or returns strange results. git-svn-id: svn://localhost/gambas/trunk@4737 867c0c6c-44f3-4631-809d-bfa615b0a4ec
2012-05-17 22:49:54 +02:00
struct CNode;
void XMLNode_Init(Node* node, Node::Type nodeType);
void XMLNode_Free(Node* &node);
void XMLNode_DestroyGBObject(Node* &node);
void XMLNode_DestroyParent(Node *node);
void XMLNode_NewGBObject(Node *node);
CNode* XMLNode_GetGBObject(Node *node);
//Node tree
void XMLNode_getGBChildren(Node *node, GB_ARRAY *array);
Document* XMLNode_GetOwnerDocument(Node *node);
void XMLNode_appendChild(Node *node, Node *newChild);
void XMLNode_prependChild(Node *node, Node *newChild);
void XMLNode_removeChild(Node *node, Node *child);
void XMLNode_removeKeepChild(Node *node, Node *child);
void XMLNode_replaceChild(Node *node, Node *oldChild, Node *newChild);
bool XMLNode_insertAfter(Node *node, Node *child, Node *newChild);
bool XMLNode_insertBefore(Node *node, Node *child, Node *newChild);
void XMLNode_appendText(Node *node, const char *data, const size_t lenData);
void XMLNode_clearChildren(Node *node);
void XMLNode_appendFromText(Node *node, const char *data, const size_t lenData);
//Searching elements
void XMLNode_getGBChildrenByNamespace(Node *node, const char *cnamespace, const size_t lenNamespace, GB_ARRAY *array, const int mode = GB_STRCOMP_BINARY, const int depth = -1);
void XMLNode_addGBChildrenByNamespace(Node *node, const char *cnamespace, const size_t lenNamespace, GB_ARRAY *array, const int mode = GB_STRCOMP_BINARY, const int depth = -1);
void XMLNode_getGBChildrenByTagName(Node *node, const char *ctagName, const size_t clenTagName, GB_ARRAY *array, const int mode = GB_STRCOMP_BINARY, const int depth = -1);
void XMLNode_addGBChildrenByTagName(Node *node, const char *compTagName, const size_t compLenTagName, GB_ARRAY *array, const int mode = GB_STRCOMP_BINARY, const int depth = -1);
void XMLNode_getGBChildrenByAttributeValue(Node *node, const char *attrName, const size_t lenAttrName,
const char *attrValue, const size_t lenAttrValue,
GB_ARRAY *array, const int mode = GB_STRCOMP_BINARY, const int depth = -1);
void XMLNode_addGBChildrenByAttributeValue(Node *node, const char *attrName, const size_t lenAttrName,
const char *attrValue, const size_t lenAttrValue,
GB_ARRAY *array, const int mode = GB_STRCOMP_BINARY, const int depth = -1);
Element* XMLNode_getFirstChildByAttributeValue(Node *node, const char *attrName, const size_t lenAttrName,
const char *attrValue, const size_t lenAttrValue, const int mode = GB_STRCOMP_BINARY, const int depth = -1);
Element** XMLNode_getChildrenByTagName(Node *node, const char *ctagName, const size_t clenTagName, size_t &lenArray, const int depth = -1);
Element* XMLNode_getFirstChildByTagName(const Node *node, const char *ctagName, const size_t clenTagName, const int depth = -1);
void XMLNode_addChildrenByTagName(Node *node, const char *compTagName, const size_t compLenTagName, Element** &array, size_t &lenArray, const int depth = -1);
void XMLNode_getGBAllChildren(Node *node, GB_ARRAY *array);
void XMLNode_addGBAllChildren(Node *node, GB_ARRAY *array);
void XMLNode_getGBChildElements(Node *node, GB_ARRAY *array);
Element* XMLNode_firstChildElement(Node *node);
Element* XMLNode_lastChildElement(Node *node);
Element* XMLNode_previousElement(const Node *node);
Element* XMLNode_nextElement(Node *node);
void XMLNode_setTextContent(Node *node, const char *content, const size_t lenContent);//Sets the plain text conent of a node
bool XMLNode_NoInstanciate();
void XML_ReturnNode(Node *node);
#endif // NODE_H
#if !defined(NODE_GBINTERFACE) && defined(GBINTERFACE_H)
#define NODE_GBINTERFACE
void XMLNode_substAppendFromText(Node *node, const char *data, const size_t lenData, GB_VALUE *args, int argsCount);
GB_VARIANT *XMLNode_getUserData(Node *node, const char *key, const size_t lenkey);
void XMLNode_addUserData(Node *node, const char *key, const size_t lenkey, GB_VARIANT *value);
#endif