Defined in file: hzDocument.h

Constructors/Detructors

hzHtmElem*hzHtmElem(void)
NULL-BASIS~hzHtmElem(void)

Public Methods:

unsigned intAnti(void)
voidFindSubnodes(hzVect<hzHtmElem*>& result, const char* srchExp, bool bLog)
hzHtmElem*GetFirstChild(void)
const hzDocHtml*GetHostDoc(void)
hzDocHtml*GetTree(void)
unsigned intGetUid(void)
hzEcodeInit(hzDocHtml* pRoot, hzHtmElem* pParent, hzString& tagname, hzHtagtype type, unsigned int id, unsigned int line)
unsigned intLevel(void)
unsigned intLine(void)
hzStringName(void)
hzHtmElem*Parent(void)
hzHtmElem*Sibling(void)
hzHtagtypeType(void)
hzEcode_addnode(hzHtmElem* pNode)
void_setanti(unsigned int line)
unsigned int_testnode(hzVect<hzHtmElem*>& tmpResult, const char* srchExp, unsigned int& nLimit, unsigned int nLevel, bool bLog)** Now we have passed the first part of the search expression, we can add this node to the results if there is no furthur search expression. But ** if there is, we have to establish if the remainder of the search expression is satisfied. This will nessesitate a recursive call of ** this function for each and every child of this node with the search expression pointer advanced. Only if at least one of these calls ** succeeds (returns a positive integer for nodes added to the result), can this call succeed.

Member Variables:

unsigned intm_ChildrenNo description
hzStringm_NameNo description
unsigned intm_ParentNo description
unsigned intm_SiblingNo description
hzHtagtypem_TypeNo description
unsigned intm_UidNo description
hzStringm_fixContentNo description
unsigned intm_nAntiNo description
unsigned shortm_nAttrsNo description
unsigned shortm_nLevelNo description
unsigned intm_nLineNo description
unsigned intm_nSubnodesNo description
hzDocHtml*m_pHostDocNo description
hzChainm_tmpContentNo description