Method PostVisitList

eval/compiler/flat_expr_builder.cc:1496–1541

CreateList node handler. Invoked after child nodes are processed.

  // CreateList node handler.
  // Invoked after child nodes are processed.
  void PostVisitList(const cel::Expr& expr,
                     const cel::ListExpr& list_expr) override {
    if (!progress_status_.ok()) {
      return;
    }

    if (block_.has_value()) {
      BlockInfo& block = *block_;
      if (block.bindings == &expr) {
        // Do nothing, this is the cel.@block bindings list.
        return;
      }
    }

    if (!comprehension_stack_.empty()) {
      const ComprehensionStackRecord& comprehension =
          comprehension_stack_.back();
      if (comprehension.is_optimizable_list_append) {
        if (&(comprehension.comprehension->accu_init()) == &expr) {
          if (PlanRecursiveProgram()) {
            SetRecursiveStep(CreateDirectMutableListStep(expr.id()), 1);
            return;
          }
          AddStep(CreateMutableListStep(expr.id()));
          return;
        }
        if (GetOptimizableListAppendOperand(comprehension.comprehension) ==
            &expr) {
          return;
        }
      }
    }
    if (absl::optional<int> depth = RecursionEligible(); depth.has_value()) {
      auto deps = ExtractRecursiveDependencies();
      if (deps.size() != list_expr.elements().size()) {
        SetProgressStatusError(absl::InternalError(
            "Unexpected number of plan elements for CreateList expr"));
        return;
      }
      auto step = CreateDirectListStep(
          std::move(deps), MakeOptionalIndicesSet(list_expr), expr.id());
      SetRecursiveStep(std::move(step), *depth + 1);
      return;
    }
    AddStep(CreateCreateListStep(list_expr, expr.id()));
  }

  // CreateStruct node handler.
  // Invoked after child nodes are processed.