当前位置: 首页>>代码示例>>C++>>正文


C++ TreeNode::begin方法代码示例

本文整理汇总了C++中TreeNode::begin方法的典型用法代码示例。如果您正苦于以下问题:C++ TreeNode::begin方法的具体用法?C++ TreeNode::begin怎么用?C++ TreeNode::begin使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在TreeNode的用法示例。


在下文中一共展示了TreeNode::begin方法的3个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的C++代码示例。

示例1: while

SCORE_LIB_STATE_EXPORT
bool operator==(
    const TreeNode<State::ExprData>& lhs,
    const TreeNode<State::ExprData>& rhs)
{
  const auto& ltd = static_cast<const State::ExprData&>(lhs);
  const auto& rtd = static_cast<const State::ExprData&>(rhs);

  bool b = (ltd == rtd) && (lhs.m_children.size() == rhs.m_children.size());
  if (!b)
    return false;

  auto l = lhs.begin();
  auto e = lhs.end();
  auto r = rhs.begin();
  while (l != e)
  {
    if (*l != *r)
      return false;
    ++l;
    ++r;
  }

  return true;
}
开发者ID:OSSIA,项目名称:Score,代码行数:25,代码来源:Expression.cpp

示例2: __run__

void PreRootVisitor::__run__ (const TreeNode &node)
{
	process(node);
	TreeNode::ChildrenIterator it = node.begin ();
	while(it != node.end())
	{
		__run__(*it);
		it ++;
	}
}
开发者ID:niu2x,项目名称:SNL,代码行数:10,代码来源:Tree.cpp

示例3: insert

 iterator insert(StoredObject&& toStore)
 {
     TreeNode* node = getNode(toStore.location);
     if (node->level() > 0)
     {
         // We store one element at time so there will be a moment before node overflow when its
         // count will be equal capacity. Then we'll relocate all its elements to the new child
         // nodes. At worst scenario, all elements will be relocated to the same node, so its
         // count() will be again equal to capacity. The loop ends when at least one element is
         // relocated to the another child node.
         while (node->count() == nodeCapacity && node->level() > 0)
         {
             typename TreeNode::iterator it;
             typename TreeNode::iterator itEnd = node->end();
             for (it = node->begin(); it != itEnd; ++it)
             {
                 node->child(it->location).insert(std::move(*it));
             }
             node->clear();
             node = &(node->child(toStore.location));
         }
     }
     return iterator(node, node->insert(std::move(toStore)));
 }
开发者ID:mgoral,项目名称:geocontainers,代码行数:24,代码来源:QuadTree.hpp


注:本文中的TreeNode::begin方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。