@@ -705,7 +705,7 @@ pub struct IncrementalDeliverySupport {
705
705
pub struct QueryPlannerDebugConfig {
706
706
/// If used and the supergraph is built from a single subgraph, then user queries do not go through the
707
707
/// normal query planning and instead a fetch to the one subgraph is built directly from the input query.
708
- bypass_planner_for_single_subgraph : Option < bool > ,
708
+ pub bypass_planner_for_single_subgraph : Option < bool > ,
709
709
710
710
/// Query planning is an exploratory process. Depending on the specificities and feature used by
711
711
/// subgraphs, there could exist may different theoretical valid (if not always efficient) plans
@@ -723,7 +723,7 @@ pub struct QueryPlannerDebugConfig {
723
723
/// debug a specific issue (with unexpectedly slow query planning for instance). Remember that
724
724
/// setting this value too low can negatively affect query runtime (due to the use of sub-optimal
725
725
/// query plans).
726
- max_evaluated_plans : Option < u32 > ,
726
+ pub max_evaluated_plans : Option < u32 > ,
727
727
728
728
/// Before creating query plans, for each path of fields in the query we compute all the
729
729
/// possible options to traverse that path via the subgraphs. Multiple options can arise because
@@ -737,7 +737,7 @@ pub struct QueryPlannerDebugConfig {
737
737
/// path's options exceeds this limit, query planning will abort and the operation will fail.
738
738
///
739
739
/// The default value is None, which specifies no limit.
740
- paths_limit : Option < u32 > ,
740
+ pub paths_limit : Option < u32 > ,
741
741
}
742
742
#[ cfg( test) ]
743
743
mod tests {
0 commit comments