Method initializeLevelData

ibtk/src/lagrangian/LDataManager.cpp:2024–2337

} // updateNodeCountData

void
LDataManager::initializeLevelData(const Pointer<BasePatchHierarchy<NDIM>> hierarchy,
                                  const int level_number,
                                  const double init_data_time,
                                  const bool can_be_refined,
                                  const bool initial_time,
                                  const Pointer<BasePatchLevel<NDIM>> old_level,
                                  const bool allocate_data)
{
    IBTK_TIMER_START(t_initialize_level_data);

#if !defined(NDEBUG)
    TBOX_ASSERT(hierarchy);
    TBOX_ASSERT((level_number >= 0) && (level_number <= hierarchy->getFinestLevelNumber()));
    if (old_level)
    {
        TBOX_ASSERT(level_number == old_level->getLevelNumber());
    }
    TBOX_ASSERT(hierarchy->getPatchLevel(level_number));
#endif

    Pointer<PatchLevel<NDIM>> level = hierarchy->getPatchLevel(level_number);

#if !defined(NDEBUG)
    // Check for overlapping boxes on this level.
    //
    // (This is potentially fairly expensive and hence is only done when
    // assertion checking is active.)
    BoxList<NDIM> boxes(level->getBoxes());

    std::vector<bool> patch_overlaps(boxes.getNumberOfItems());
    std::vector<bool>::size_type j, k;

    for (k = 0; k < patch_overlaps.size(); ++k)
    {
        patch_overlaps[k] = false;
    }
    k = 0;
    while (!boxes.isEmpty())
    {
        j = k + 1;
        Box<NDIM> tryme = boxes.getFirstItem();
        boxes.removeFirstItem();

        for (BoxList<NDIM>::Iterator ib(boxes); ib; ib++)
        {
            if (tryme.intersects(ib()))
            {
                patch_overlaps[k] = true;
                patch_overlaps[j] = true;
            }
            ++j;
        }
        ++k;
    }

    for (k = 0; k < patch_overlaps.size(); ++k)
    {