Method ComputeBreadthFirstOrderDescriptor

Common/DataModel/vtkHyperTree.cxx:152–192

---------------------------------------------------------------------------

//---------------------------------------------------------------------------
void vtkHyperTree::ComputeBreadthFirstOrderDescriptor(const unsigned int depthLimiter,
  vtkBitArray* inputMask, vtkTypeInt64Array* numberOfVerticesPerDepth, vtkBitArray* descriptor,
  vtkIdList* breadthFirstIdMap)
{
  int maxDepth = this->GetNumberOfLevels();

  std::vector<std::vector<bool>> descriptorPerDepth(maxDepth);
  std::vector<std::vector<vtkIdType>> breadthFirstOrderIdMapPerDepth(maxDepth);

  this->ComputeBreadthFirstOrderDescriptorImpl(
    depthLimiter, inputMask, 0, 0, descriptorPerDepth, breadthFirstOrderIdMapPerDepth);

  // Reducing maxDepth to squeeze out depths in which all subtrees are
  // entirely masked.
  // NOLINTNEXTLINE(bugprone-inc-dec-in-conditions)
  while (maxDepth && breadthFirstOrderIdMapPerDepth[--maxDepth].empty())
    ;
  ++maxDepth;

  for (int idepth = 0; idepth < maxDepth; ++idepth)
  {
    numberOfVerticesPerDepth->InsertNextValue(
      static_cast<vtkTypeInt64>(breadthFirstOrderIdMapPerDepth[idepth].size()));
    for (const vtkIdType& idg : breadthFirstOrderIdMapPerDepth[idepth])
    {
      breadthFirstIdMap->InsertNextId(idg);
    }
  }

  // We ignore last depth for the descriptor, as we already know that no
  // vertices have children.
  // However, we are careful not treating trees with only one depth. There
  // is no need to describe such trivial trees.
  for (int idepth = 0; idepth < maxDepth - 1; ++idepth)
  {
    for (const bool state : descriptorPerDepth[idepth])
    {
      descriptor->InsertNextValue(state);
    }
  }
}

//---------------------------------------------------------------------------
void vtkHyperTree::BuildFromBreadthFirstOrderDescriptor(