Function BM_ExistsComprehensionWorstCase

eval/tests/modern_benchmark_test.cc:1117–1147

BENCHMARK(BM_ExistsComprehensionBestCase);

void BM_ExistsComprehensionWorstCase(benchmark::State& state) {
  ASSERT_OK_AND_ASSIGN(ParsedExpr parsed_expr,
                       Parse("my_int_list.exists(x, x == -1)"));

  RuntimeOptions options = GetOptions();
  auto runtime = StandardRuntimeOrDie(options);

  ASSERT_OK_AND_ASSIGN(auto cel_expr, ProtobufRuntimeAdapter::CreateProgram(
                                          *runtime, parsed_expr));

  google::protobuf::Arena arena;
  Activation activation;

  auto list_builder = cel::NewListValueBuilder(&arena);
  int len = state.range(0);
  list_builder->Reserve(len);

  for (int i = 0; i < len; i++) {
    ASSERT_THAT(list_builder->Add(IntValue(i)), IsOk());
  }

  activation.InsertOrAssignValue("my_int_list",
                                 std::move(*list_builder).Build());

  for (auto _ : state) {
    ASSERT_OK_AND_ASSIGN(cel::Value result,
                         cel_expr->Evaluate(&arena, activation));
    ASSERT_TRUE(result.IsBool());
    ASSERT_FALSE(result.GetBool().NativeValue());
  }
}

BENCHMARK(BM_ExistsComprehensionWorstCase)->Range(1, 1 << 10);