本文整理汇总了C++中MythGenericTree::reOrderAsSorted方法的典型用法代码示例。如果您正苦于以下问题：C++ MythGenericTree::reOrderAsSorted方法的具体用法？C++ MythGenericTree::reOrderAsSorted怎么用？C++ MythGenericTree::reOrderAsSorted使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类MythGenericTree的用法示例。
在下文中一共展示了MythGenericTree::reOrderAsSorted方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: reOrderAsSorted
void MythGenericTree::reOrderAsSorted()
{
//
// Arrange (recursively) my subnodes in the same order as my ordered
// subnodes
//
if (m_subnodes->count() != m_ordered_subnodes->count())
{
LOG(VB_GENERAL, LOG_ERR, "Can't reOrderAsSorted(), because the number "
"of subnodes is different than the number of ordered subnodes");
return;
}
m_subnodes->clear();
m_currentOrderingIndex = -1;
QList<MythGenericTree*>::iterator it;
it = m_ordered_subnodes->begin();
MythGenericTree *child;
while ((child = *it) != 0)
{
m_subnodes->append(child);
child->reOrderAsSorted();
++it;
}
}