return ffi::wrap()

in glean/tools/diff/lib.cpp [25:64]

• 31 lines of code
• 3 McCabe index (conditional complexity)

  return ffi::wrap([=] {
  const auto first_starting = first->startingId();
  const auto first_boundary = first->firstFreeId();
  FactSet additional(first_boundary);
  Stacked<Define> ext(first, &additional);

  const auto second_starting = second->startingId();
  const auto second_size = distance(second_starting, second->firstFreeId());
  Substitution subst(second_starting, second_size);
  Substituter substituter(&subst);

  size_t kept = 0;
  size_t added = 0;

  // For each fact in second, subtitute it and define it in the Extension.
  // Accumulate new fact ids in the substitution.
  for (auto i = second->enumerate(); auto ref = i->get(); i->next()) {
    auto pred = inventory->lookupPredicate(ref.type);
    CHECK(pred != nullptr);
    binary::Output out;
    uint64_t key_size;
    pred->substitute(substituter, ref.clause, out, key_size);

    auto id = ext.define(ref.type, Fact::Clause::from(out.bytes(), key_size));

    if (id < first_boundary) {
      ++kept;
    } else {
      ++added;
    }

    subst.set(ref.id, id);
  }

  std::cout
    << "kept " << kept
    << ", added " << added
    << ", removed " << distance(first_starting, first_boundary) - kept
    << std::endl;
  });