本文整理汇总了C++中XmlTree::getChildren方法的典型用法代码示例。如果您正苦于以下问题：C++ XmlTree::getChildren方法的具体用法？C++ XmlTree::getChildren怎么用？C++ XmlTree::getChildren使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类XmlTree的用法示例。
在下文中一共展示了XmlTree::getChildren方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: mCaseSensitive
XmlTree::ConstIter::ConstIter( const XmlTree &root, const string &filterPath, bool caseSensitive, char separator )
: mCaseSensitive( caseSensitive )
{
mFilter = split( filterPath, separator );
// we ignore a leading separator so that "/one/two" is equivalent to "one/two"
if( ( ! filterPath.empty() ) && ( filterPath[0] == separator ) && ( ! mFilter.empty() ) )
mFilter.erase( mFilter.begin() );
if( mFilter.empty() ) { // empty filter means nothing matches
setToEnd( &root.getChildren() );
return;
}
for( vector<string>::const_iterator filterComp = mFilter.begin(); filterComp != mFilter.end(); ++filterComp ) {
if( mIterStack.empty() ) // first item
mSequenceStack.push_back( &root.getChildren() );
else
mSequenceStack.push_back( &(*mIterStack.back())->getChildren() );
Container::const_iterator child = findNextChildNamed( *mSequenceStack.back(), mSequenceStack.back()->begin(), *filterComp, mCaseSensitive );
if( child != (mSequenceStack.back())->end() )
mIterStack.push_back( child );
else { // failed to find an item that matches this part of the filter; mark as finished and return
setToEnd( &root.getChildren() );
return;
}
}
}示例2: getNodePtr
XmlTree* XmlTree::getNodePtr( const string &relativePath, bool caseSensitive, char separator ) const
{
XmlTree *curNode = const_cast<XmlTree*>( this );
vector<string> pathComponents = split( relativePath, separator );
for( vector<string>::const_iterator pathIt = pathComponents.begin(); pathIt != pathComponents.end(); ++pathIt ) {
if( pathIt->empty() )
continue;
Container::const_iterator node = XmlTree::findNextChildNamed( curNode->getChildren(), curNode->getChildren().begin(), *pathIt, caseSensitive ) ;
if( node != curNode->getChildren().end() )
curNode = const_cast<XmlTree*>( node->get() );
else
return 0;
}
return curNode;
}