Function intersect

include/stringzilla/stringzilla.hpp:4810–4826

 */
template <typename first_type_, typename second_type_, typename first_extractor_, typename second_extractor_>
intersect_result_t intersect(first_type_ const &first, second_type_ const &second,
                             first_extractor_ const &first_extractor, second_extractor_ const &second_extractor,
                             std::uint64_t seed = 0) noexcept(false) {

    std::size_t const max_count = (std::min)(first.size(), second.size());
    std::vector<sorted_idx_t> first_positions(max_count);
    std::vector<sorted_idx_t> second_positions(max_count);
    std::size_t count = 0;
    status_t status = try_intersect( //
        first, first_extractor,      //
        second, second_extractor,    //
        seed, &count, first_positions.data(), second_positions.data());
    raise(status);
    first_positions.resize(count);
    second_positions.resize(count);
    return {std::move(first_positions), std::move(second_positions)};
}

/**
 *  @brief Locates identical elements in two arrays.