Method flattenVisitor

source/core/StarBTreeDatabase.cpp:1195–1238

}

bool BTreeDatabase::flattenVisitor(BTreeImpl::Index& index, BlockIndex& count) {
  auto pointerCount = index->pointerCount();
  count += pointerCount;
  bool canStore = !m_availableBlocks.empty();

  bool needsStore = false;
  if (m_impl.indexLevel(index) == 0) {
    for (size_t i = 0; i != pointerCount; ++i) {
      auto indexPointer = index->pointer(i);
      auto tailBlocks = leafTailBlocks(indexPointer);
      if (canStore) {
        bool leafNeedsStore = m_availableBlocks.first() < indexPointer;

        if (!leafNeedsStore)
          for (size_t i = 0; !leafNeedsStore && i != tailBlocks.size(); ++i)
            if (m_availableBlocks.first() < tailBlocks[i])
              leafNeedsStore = true;

        if (leafNeedsStore) {
          auto leaf = m_impl.loadLeaf(indexPointer);
          m_impl.deleteLeaf(leaf);
          leaf->self = InvalidBlockIndex;
          index->updatePointer(i, m_impl.storeLeaf(leaf));
          tailBlocks = leafTailBlocks(leaf->self);
          needsStore = true;
        }
        canStore = !m_availableBlocks.empty();
      }
      count += tailBlocks.size();
    }
  } else {
    for (size_t i = 0; i != pointerCount; ++i) {
      auto childIndex = m_impl.loadIndex(index->pointer(i));
      if (canStore && flattenVisitor(childIndex, count)) {
        m_impl.deleteIndex(childIndex);
        childIndex->self = InvalidBlockIndex;
        index->updatePointer(i, m_impl.storeIndex(childIndex));
        canStore = !m_availableBlocks.empty();
        needsStore = true;
      }
    }
  }
  return needsStore || (canStore && m_availableBlocks.first() < index->self);
}

void BTreeDatabase::checkIfOpen(char const* methodName, bool shouldBeOpen) const {
  if (shouldBeOpen && !m_open)