CDTDNode Class Reference
| class CDTDNode : public CBNFNode |
Document Type Definition (DTD) node that forms part of a DTD tree.
| Inherited Functions |
|---|
| | CBNFNode::CBNFNode(TInt) |
| | CBNFNode::KNMoreCount() |
| | CBNFNode::KNMoreMaximum() |
| | CBNFNode::KNMoreMinimum() |
| | CBNFNode::KPostRuleCallback() |
| | CBNFNode::KPreRuleCallback() |
| | CBNFNode::KRangeEnd() |
| | CBNFNode::KRangeStart() |
| | CBNFNode::KReference() |
| | CBNFNode::NewL(TInt) |
| | CBNFNode::~CBNFNode() |
| | CBase::CBase() |
| | CBase::Delete(CBase *) |
| | CBase::Extension_(TUint,TAny *&,TAny *) |
| | CBase::operator new(TUint) |
| | CBase::operator new(TUint,TAny *) |
| | CBase::operator new(TUint,TLeave) |
| | CBase::operator new(TUint,TLeave,TUint) |
| | CBase::operator new(TUint,TUint) |
| | CBase::~CBase() |
| | CNode::AddAttributeL(TAny *,CBase *) |
| | CNode::AddDataAndAttributeL(HBufC16 *,TAny *,CBase *) |
| | CNode::AdjustBasePointers() |
| | CNode::AppendNodeL(TAny *) |
| | CNode::Attribute(TAny *)const |
| | CNode::AttributeByIndex(TInt,TAny *&)const |
| | CNode::AttributeExists(TAny *)const |
| | CNode::CNode(TAny *,CNode *) |
| | CNode::DeleteAttribute(TAny *) |
| | CNode::FindChild(const CNode *)const |
| | CNode::NewL(TAny *,CNode *) |
| | CNode::RemoveAttributeNoDelete(TAny *) |
| | CNode::SetType(TAny *) |
| | CNode::SetupDeletableOrNonDeleteableDataLC() |
| | CNode::~CNode() |
| | CTypedNode< TInt, const TDesC * >::AddAttributeL(const TDesC *,CBase *) |
| | CTypedNode< TInt, const TDesC * >::AddDataAndAttributeL(HBufC16 *,const TDesC *,CBase *) |
| | CTypedNode< TInt, const TDesC * >::AppendNodeL(TIntaType) |
| | CTypedNode< TInt, const TDesC * >::AppendNodeToThisNodeL(CNode *) |
| | CTypedNode< TInt, const TDesC * >::Attribute(const TDesC *)const |
| | CTypedNode< TInt, const TDesC * >::AttributeByIndex(TInt)const |
| | CTypedNode< TInt, const TDesC * >::AttributeByIndex(TInt,const TDesC *&)const |
| | CTypedNode< TInt, const TDesC * >::AttributeCount()const |
| | CTypedNode< TInt, const TDesC * >::AttributeExists(const TDesC *)const |
| | CTypedNode< TInt, const TDesC * >::AttributeTypeByIndex(TInt)const |
| | CTypedNode< TInt, const TDesC * >::CTypedNode(TIntaType,CNode *) |
| | CTypedNode< TInt, const TDesC * >::Child(TInt)const |
| | CTypedNode< TInt, const TDesC * >::ClearSetDataNoDeleteL() |
| | CTypedNode< TInt, const TDesC * >::Data()const |
| | CTypedNode< TInt, const TDesC * >::DeleteAllAttributes() |
| | CTypedNode< TInt, const TDesC * >::DeleteAllChildNodes() |
| | CTypedNode< TInt, const TDesC * >::DeleteAttribute(const TDesC *) |
| | CTypedNode< TInt, const TDesC * >::DeleteChildNode(CNode *) |
| | CTypedNode< TInt, const TDesC * >::NewL(TIntaType,CNode *) |
| | CTypedNode< TInt, const TDesC * >::NextChild(const CNode *)const |
| | CTypedNode< TInt, const TDesC * >::NextSibling()const |
| | CTypedNode< TInt, const TDesC * >::NumberImmediateChildren()const |
| | CTypedNode< TInt, const TDesC * >::Parent()const |
| | CTypedNode< TInt, const TDesC * >::PrevChild(const CNode &)const |
| | CTypedNode< TInt, const TDesC * >::PrevSibling()const |
| | CTypedNode< TInt, const TDesC * >::RemoveAttributeNoDelete(const TDesC *) |
| | CTypedNode< TInt, const TDesC * >::ReparentL(CNode *) |
| | CTypedNode< TInt, const TDesC * >::ResetDataPointer(HBufC16 *) |
| | CTypedNode< TInt, const TDesC * >::Root()const |
| | CTypedNode< TInt, const TDesC * >::SetDataL(HBufC16 *) |
| | CTypedNode< TInt, const TDesC * >::SetDataNoDeleteL() |
| | CTypedNode< TInt, const TDesC * >::SetFileDataL(HBufC16 *) |
| | CTypedNode< TInt, const TDesC * >::SetType(TIntaType) |
| | CTypedNode< TInt, const TDesC * >::Type()const |
Constructor & Destructor Documentation
CDTDNode()
| CDTDNode | ( | ) | [private, inline] |
Member Functions Documentation
AddCompletedAttributeL()
| void | AddCompletedAttributeL | ( | ) | [inline] |
Adds the completed attribute to the node.
CompletedAttrID()
| const TDesC * | CompletedAttrID | ( | ) | |
NewL()
Allocates and constructs a new parentless node.
Member Enumerations Documentation
Copyright ©2010 Nokia Corporation and/or its subsidiary(-ies).
All rights
reserved. Unless otherwise stated, these materials are provided under the terms of the Eclipse Public License
v1.0.