forked from apache/datafusion
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprost.rs
More file actions
2466 lines (2466 loc) · 101 KB
/
prost.rs
File metadata and controls
2466 lines (2466 loc) · 101 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// This file is @generated by prost-build.
/// logical plan
/// LogicalPlan is a nested type
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct LogicalPlanNode {
#[prost(
oneof = "logical_plan_node::LogicalPlanType",
tags = "1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33"
)]
pub logical_plan_type: ::core::option::Option<logical_plan_node::LogicalPlanType>,
}
/// Nested message and enum types in `LogicalPlanNode`.
pub mod logical_plan_node {
#[derive(Clone, PartialEq, ::prost::Oneof)]
pub enum LogicalPlanType {
#[prost(message, tag = "1")]
ListingScan(super::ListingTableScanNode),
#[prost(message, tag = "3")]
Projection(::prost::alloc::boxed::Box<super::ProjectionNode>),
#[prost(message, tag = "4")]
Selection(::prost::alloc::boxed::Box<super::SelectionNode>),
#[prost(message, tag = "5")]
Limit(::prost::alloc::boxed::Box<super::LimitNode>),
#[prost(message, tag = "6")]
Aggregate(::prost::alloc::boxed::Box<super::AggregateNode>),
#[prost(message, tag = "7")]
Join(::prost::alloc::boxed::Box<super::JoinNode>),
#[prost(message, tag = "8")]
Sort(::prost::alloc::boxed::Box<super::SortNode>),
#[prost(message, tag = "9")]
Repartition(::prost::alloc::boxed::Box<super::RepartitionNode>),
#[prost(message, tag = "10")]
EmptyRelation(super::EmptyRelationNode),
#[prost(message, tag = "11")]
CreateExternalTable(super::CreateExternalTableNode),
#[prost(message, tag = "12")]
Explain(::prost::alloc::boxed::Box<super::ExplainNode>),
#[prost(message, tag = "13")]
Window(::prost::alloc::boxed::Box<super::WindowNode>),
#[prost(message, tag = "14")]
Analyze(::prost::alloc::boxed::Box<super::AnalyzeNode>),
#[prost(message, tag = "15")]
CrossJoin(::prost::alloc::boxed::Box<super::CrossJoinNode>),
#[prost(message, tag = "16")]
Values(super::ValuesNode),
#[prost(message, tag = "17")]
Extension(super::LogicalExtensionNode),
#[prost(message, tag = "18")]
CreateCatalogSchema(super::CreateCatalogSchemaNode),
#[prost(message, tag = "19")]
Union(super::UnionNode),
#[prost(message, tag = "20")]
CreateCatalog(super::CreateCatalogNode),
#[prost(message, tag = "21")]
SubqueryAlias(::prost::alloc::boxed::Box<super::SubqueryAliasNode>),
#[prost(message, tag = "22")]
CreateView(::prost::alloc::boxed::Box<super::CreateViewNode>),
#[prost(message, tag = "23")]
Distinct(::prost::alloc::boxed::Box<super::DistinctNode>),
#[prost(message, tag = "24")]
ViewScan(::prost::alloc::boxed::Box<super::ViewTableScanNode>),
#[prost(message, tag = "25")]
CustomScan(super::CustomTableScanNode),
#[prost(message, tag = "26")]
Prepare(::prost::alloc::boxed::Box<super::PrepareNode>),
#[prost(message, tag = "27")]
DropView(super::DropViewNode),
#[prost(message, tag = "28")]
DistinctOn(::prost::alloc::boxed::Box<super::DistinctOnNode>),
#[prost(message, tag = "29")]
CopyTo(::prost::alloc::boxed::Box<super::CopyToNode>),
#[prost(message, tag = "30")]
Unnest(::prost::alloc::boxed::Box<super::UnnestNode>),
#[prost(message, tag = "31")]
RecursiveQuery(::prost::alloc::boxed::Box<super::RecursiveQueryNode>),
#[prost(message, tag = "32")]
CteWorkTableScan(super::CteWorkTableScanNode),
#[prost(message, tag = "33")]
Dml(::prost::alloc::boxed::Box<super::DmlNode>),
}
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct LogicalExtensionNode {
#[prost(bytes = "vec", tag = "1")]
pub node: ::prost::alloc::vec::Vec<u8>,
#[prost(message, repeated, tag = "2")]
pub inputs: ::prost::alloc::vec::Vec<LogicalPlanNode>,
}
#[derive(Clone, PartialEq, Eq, Hash, ::prost::Message)]
pub struct ProjectionColumns {
#[prost(string, repeated, tag = "1")]
pub columns: ::prost::alloc::vec::Vec<::prost::alloc::string::String>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct LogicalExprNodeCollection {
#[prost(message, repeated, tag = "1")]
pub logical_expr_nodes: ::prost::alloc::vec::Vec<LogicalExprNode>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct SortExprNodeCollection {
#[prost(message, repeated, tag = "1")]
pub sort_expr_nodes: ::prost::alloc::vec::Vec<SortExprNode>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct ListingTableScanNode {
#[prost(message, optional, tag = "14")]
pub table_name: ::core::option::Option<TableReference>,
#[prost(string, repeated, tag = "2")]
pub paths: ::prost::alloc::vec::Vec<::prost::alloc::string::String>,
#[prost(string, tag = "3")]
pub file_extension: ::prost::alloc::string::String,
#[prost(message, optional, tag = "4")]
pub projection: ::core::option::Option<ProjectionColumns>,
#[prost(message, optional, tag = "5")]
pub schema: ::core::option::Option<super::datafusion_common::Schema>,
#[prost(message, repeated, tag = "6")]
pub filters: ::prost::alloc::vec::Vec<LogicalExprNode>,
#[prost(message, repeated, tag = "7")]
pub table_partition_cols: ::prost::alloc::vec::Vec<PartitionColumn>,
#[prost(bool, tag = "8")]
pub collect_stat: bool,
#[prost(uint32, tag = "9")]
pub target_partitions: u32,
#[prost(message, repeated, tag = "13")]
pub file_sort_order: ::prost::alloc::vec::Vec<SortExprNodeCollection>,
#[prost(
oneof = "listing_table_scan_node::FileFormatType",
tags = "10, 11, 12, 15, 16"
)]
pub file_format_type: ::core::option::Option<
listing_table_scan_node::FileFormatType,
>,
}
/// Nested message and enum types in `ListingTableScanNode`.
pub mod listing_table_scan_node {
#[derive(Clone, PartialEq, ::prost::Oneof)]
pub enum FileFormatType {
#[prost(message, tag = "10")]
Csv(super::super::datafusion_common::CsvFormat),
#[prost(message, tag = "11")]
Parquet(super::super::datafusion_common::ParquetFormat),
#[prost(message, tag = "12")]
Avro(super::super::datafusion_common::AvroFormat),
#[prost(message, tag = "15")]
Json(super::super::datafusion_common::NdJsonFormat),
#[prost(message, tag = "16")]
Arrow(super::super::datafusion_common::ArrowFormat),
}
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct ViewTableScanNode {
#[prost(message, optional, tag = "6")]
pub table_name: ::core::option::Option<TableReference>,
#[prost(message, optional, boxed, tag = "2")]
pub input: ::core::option::Option<::prost::alloc::boxed::Box<LogicalPlanNode>>,
#[prost(message, optional, tag = "3")]
pub schema: ::core::option::Option<super::datafusion_common::Schema>,
#[prost(message, optional, tag = "4")]
pub projection: ::core::option::Option<ProjectionColumns>,
#[prost(string, tag = "5")]
pub definition: ::prost::alloc::string::String,
}
/// Logical Plan to Scan a CustomTableProvider registered at runtime
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct CustomTableScanNode {
#[prost(message, optional, tag = "6")]
pub table_name: ::core::option::Option<TableReference>,
#[prost(message, optional, tag = "2")]
pub projection: ::core::option::Option<ProjectionColumns>,
#[prost(message, optional, tag = "3")]
pub schema: ::core::option::Option<super::datafusion_common::Schema>,
#[prost(message, repeated, tag = "4")]
pub filters: ::prost::alloc::vec::Vec<LogicalExprNode>,
#[prost(bytes = "vec", tag = "5")]
pub custom_table_data: ::prost::alloc::vec::Vec<u8>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct ProjectionNode {
#[prost(message, optional, boxed, tag = "1")]
pub input: ::core::option::Option<::prost::alloc::boxed::Box<LogicalPlanNode>>,
#[prost(message, repeated, tag = "2")]
pub expr: ::prost::alloc::vec::Vec<LogicalExprNode>,
#[prost(oneof = "projection_node::OptionalAlias", tags = "3")]
pub optional_alias: ::core::option::Option<projection_node::OptionalAlias>,
}
/// Nested message and enum types in `ProjectionNode`.
pub mod projection_node {
#[derive(Clone, PartialEq, Eq, Hash, ::prost::Oneof)]
pub enum OptionalAlias {
#[prost(string, tag = "3")]
Alias(::prost::alloc::string::String),
}
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct SelectionNode {
#[prost(message, optional, boxed, tag = "1")]
pub input: ::core::option::Option<::prost::alloc::boxed::Box<LogicalPlanNode>>,
#[prost(message, optional, tag = "2")]
pub expr: ::core::option::Option<LogicalExprNode>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct SortNode {
#[prost(message, optional, boxed, tag = "1")]
pub input: ::core::option::Option<::prost::alloc::boxed::Box<LogicalPlanNode>>,
#[prost(message, repeated, tag = "2")]
pub expr: ::prost::alloc::vec::Vec<SortExprNode>,
/// Maximum number of highest/lowest rows to fetch; negative means no limit
#[prost(int64, tag = "3")]
pub fetch: i64,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct RepartitionNode {
#[prost(message, optional, boxed, tag = "1")]
pub input: ::core::option::Option<::prost::alloc::boxed::Box<LogicalPlanNode>>,
#[prost(oneof = "repartition_node::PartitionMethod", tags = "2, 3")]
pub partition_method: ::core::option::Option<repartition_node::PartitionMethod>,
}
/// Nested message and enum types in `RepartitionNode`.
pub mod repartition_node {
#[derive(Clone, PartialEq, ::prost::Oneof)]
pub enum PartitionMethod {
#[prost(uint64, tag = "2")]
RoundRobin(u64),
#[prost(message, tag = "3")]
Hash(super::HashRepartition),
}
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct HashRepartition {
#[prost(message, repeated, tag = "1")]
pub hash_expr: ::prost::alloc::vec::Vec<LogicalExprNode>,
#[prost(uint64, tag = "2")]
pub partition_count: u64,
}
#[derive(Clone, Copy, PartialEq, Eq, Hash, ::prost::Message)]
pub struct EmptyRelationNode {
#[prost(bool, tag = "1")]
pub produce_one_row: bool,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct CreateExternalTableNode {
#[prost(message, optional, tag = "9")]
pub name: ::core::option::Option<TableReference>,
#[prost(string, tag = "2")]
pub location: ::prost::alloc::string::String,
#[prost(string, tag = "3")]
pub file_type: ::prost::alloc::string::String,
#[prost(message, optional, tag = "4")]
pub schema: ::core::option::Option<super::datafusion_common::DfSchema>,
#[prost(string, repeated, tag = "5")]
pub table_partition_cols: ::prost::alloc::vec::Vec<::prost::alloc::string::String>,
#[prost(bool, tag = "6")]
pub if_not_exists: bool,
#[prost(bool, tag = "15")]
pub or_replace: bool,
#[prost(bool, tag = "14")]
pub temporary: bool,
#[prost(string, tag = "7")]
pub definition: ::prost::alloc::string::String,
#[prost(message, repeated, tag = "10")]
pub order_exprs: ::prost::alloc::vec::Vec<SortExprNodeCollection>,
#[prost(bool, tag = "11")]
pub unbounded: bool,
#[prost(map = "string, string", tag = "8")]
pub options: ::std::collections::HashMap<
::prost::alloc::string::String,
::prost::alloc::string::String,
>,
#[prost(message, optional, tag = "12")]
pub constraints: ::core::option::Option<super::datafusion_common::Constraints>,
#[prost(map = "string, message", tag = "13")]
pub column_defaults: ::std::collections::HashMap<
::prost::alloc::string::String,
LogicalExprNode,
>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct PrepareNode {
#[prost(string, tag = "1")]
pub name: ::prost::alloc::string::String,
/// We serialize both the data types and the fields for compatibility with
/// older versions (newer versions populate both).
#[prost(message, repeated, tag = "2")]
pub data_types: ::prost::alloc::vec::Vec<super::datafusion_common::ArrowType>,
#[prost(message, optional, boxed, tag = "3")]
pub input: ::core::option::Option<::prost::alloc::boxed::Box<LogicalPlanNode>>,
#[prost(message, repeated, tag = "4")]
pub fields: ::prost::alloc::vec::Vec<super::datafusion_common::Field>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct CreateCatalogSchemaNode {
#[prost(string, tag = "1")]
pub schema_name: ::prost::alloc::string::String,
#[prost(bool, tag = "2")]
pub if_not_exists: bool,
#[prost(message, optional, tag = "3")]
pub schema: ::core::option::Option<super::datafusion_common::DfSchema>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct CreateCatalogNode {
#[prost(string, tag = "1")]
pub catalog_name: ::prost::alloc::string::String,
#[prost(bool, tag = "2")]
pub if_not_exists: bool,
#[prost(message, optional, tag = "3")]
pub schema: ::core::option::Option<super::datafusion_common::DfSchema>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct DropViewNode {
#[prost(message, optional, tag = "1")]
pub name: ::core::option::Option<TableReference>,
#[prost(bool, tag = "2")]
pub if_exists: bool,
#[prost(message, optional, tag = "3")]
pub schema: ::core::option::Option<super::datafusion_common::DfSchema>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct CreateViewNode {
#[prost(message, optional, tag = "5")]
pub name: ::core::option::Option<TableReference>,
#[prost(message, optional, boxed, tag = "2")]
pub input: ::core::option::Option<::prost::alloc::boxed::Box<LogicalPlanNode>>,
#[prost(bool, tag = "3")]
pub or_replace: bool,
#[prost(bool, tag = "6")]
pub temporary: bool,
#[prost(string, tag = "4")]
pub definition: ::prost::alloc::string::String,
}
/// a node containing data for defining values list. unlike in SQL where it's two dimensional, here
/// the list is flattened, and with the field n_cols it can be parsed and partitioned into rows
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct ValuesNode {
#[prost(uint64, tag = "1")]
pub n_cols: u64,
#[prost(message, repeated, tag = "2")]
pub values_list: ::prost::alloc::vec::Vec<LogicalExprNode>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct AnalyzeNode {
#[prost(message, optional, boxed, tag = "1")]
pub input: ::core::option::Option<::prost::alloc::boxed::Box<LogicalPlanNode>>,
#[prost(bool, tag = "2")]
pub verbose: bool,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct ExplainNode {
#[prost(message, optional, boxed, tag = "1")]
pub input: ::core::option::Option<::prost::alloc::boxed::Box<LogicalPlanNode>>,
#[prost(bool, tag = "2")]
pub verbose: bool,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct AggregateNode {
#[prost(message, optional, boxed, tag = "1")]
pub input: ::core::option::Option<::prost::alloc::boxed::Box<LogicalPlanNode>>,
#[prost(message, repeated, tag = "2")]
pub group_expr: ::prost::alloc::vec::Vec<LogicalExprNode>,
#[prost(message, repeated, tag = "3")]
pub aggr_expr: ::prost::alloc::vec::Vec<LogicalExprNode>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct WindowNode {
#[prost(message, optional, boxed, tag = "1")]
pub input: ::core::option::Option<::prost::alloc::boxed::Box<LogicalPlanNode>>,
#[prost(message, repeated, tag = "2")]
pub window_expr: ::prost::alloc::vec::Vec<LogicalExprNode>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct JoinNode {
#[prost(message, optional, boxed, tag = "1")]
pub left: ::core::option::Option<::prost::alloc::boxed::Box<LogicalPlanNode>>,
#[prost(message, optional, boxed, tag = "2")]
pub right: ::core::option::Option<::prost::alloc::boxed::Box<LogicalPlanNode>>,
#[prost(enumeration = "super::datafusion_common::JoinType", tag = "3")]
pub join_type: i32,
#[prost(enumeration = "super::datafusion_common::JoinConstraint", tag = "4")]
pub join_constraint: i32,
#[prost(message, repeated, tag = "5")]
pub left_join_key: ::prost::alloc::vec::Vec<LogicalExprNode>,
#[prost(message, repeated, tag = "6")]
pub right_join_key: ::prost::alloc::vec::Vec<LogicalExprNode>,
#[prost(enumeration = "super::datafusion_common::NullEquality", tag = "7")]
pub null_equality: i32,
#[prost(message, optional, tag = "8")]
pub filter: ::core::option::Option<LogicalExprNode>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct DistinctNode {
#[prost(message, optional, boxed, tag = "1")]
pub input: ::core::option::Option<::prost::alloc::boxed::Box<LogicalPlanNode>>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct DistinctOnNode {
#[prost(message, repeated, tag = "1")]
pub on_expr: ::prost::alloc::vec::Vec<LogicalExprNode>,
#[prost(message, repeated, tag = "2")]
pub select_expr: ::prost::alloc::vec::Vec<LogicalExprNode>,
#[prost(message, repeated, tag = "3")]
pub sort_expr: ::prost::alloc::vec::Vec<SortExprNode>,
#[prost(message, optional, boxed, tag = "4")]
pub input: ::core::option::Option<::prost::alloc::boxed::Box<LogicalPlanNode>>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct CopyToNode {
#[prost(message, optional, boxed, tag = "1")]
pub input: ::core::option::Option<::prost::alloc::boxed::Box<LogicalPlanNode>>,
#[prost(string, tag = "2")]
pub output_url: ::prost::alloc::string::String,
#[prost(bytes = "vec", tag = "3")]
pub file_type: ::prost::alloc::vec::Vec<u8>,
#[prost(string, repeated, tag = "7")]
pub partition_by: ::prost::alloc::vec::Vec<::prost::alloc::string::String>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct DmlNode {
#[prost(enumeration = "dml_node::Type", tag = "1")]
pub dml_type: i32,
#[prost(message, optional, boxed, tag = "2")]
pub input: ::core::option::Option<::prost::alloc::boxed::Box<LogicalPlanNode>>,
#[prost(message, optional, tag = "3")]
pub table_name: ::core::option::Option<TableReference>,
#[prost(message, optional, boxed, tag = "5")]
pub target: ::core::option::Option<::prost::alloc::boxed::Box<LogicalPlanNode>>,
}
/// Nested message and enum types in `DmlNode`.
pub mod dml_node {
#[derive(
Clone,
Copy,
Debug,
PartialEq,
Eq,
Hash,
PartialOrd,
Ord,
::prost::Enumeration
)]
#[repr(i32)]
pub enum Type {
Update = 0,
Delete = 1,
Ctas = 2,
InsertAppend = 3,
InsertOverwrite = 4,
InsertReplace = 5,
Truncate = 6,
}
impl Type {
/// String value of the enum field names used in the ProtoBuf definition.
///
/// The values are not transformed in any way and thus are considered stable
/// (if the ProtoBuf definition does not change) and safe for programmatic use.
pub fn as_str_name(&self) -> &'static str {
match self {
Self::Update => "UPDATE",
Self::Delete => "DELETE",
Self::Ctas => "CTAS",
Self::InsertAppend => "INSERT_APPEND",
Self::InsertOverwrite => "INSERT_OVERWRITE",
Self::InsertReplace => "INSERT_REPLACE",
Self::Truncate => "TRUNCATE",
}
}
/// Creates an enum from field names used in the ProtoBuf definition.
pub fn from_str_name(value: &str) -> ::core::option::Option<Self> {
match value {
"UPDATE" => Some(Self::Update),
"DELETE" => Some(Self::Delete),
"CTAS" => Some(Self::Ctas),
"INSERT_APPEND" => Some(Self::InsertAppend),
"INSERT_OVERWRITE" => Some(Self::InsertOverwrite),
"INSERT_REPLACE" => Some(Self::InsertReplace),
"TRUNCATE" => Some(Self::Truncate),
_ => None,
}
}
}
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct UnnestNode {
#[prost(message, optional, boxed, tag = "1")]
pub input: ::core::option::Option<::prost::alloc::boxed::Box<LogicalPlanNode>>,
#[prost(message, repeated, tag = "2")]
pub exec_columns: ::prost::alloc::vec::Vec<super::datafusion_common::Column>,
#[prost(message, repeated, tag = "3")]
pub list_type_columns: ::prost::alloc::vec::Vec<ColumnUnnestListItem>,
#[prost(uint64, repeated, tag = "4")]
pub struct_type_columns: ::prost::alloc::vec::Vec<u64>,
#[prost(uint64, repeated, tag = "5")]
pub dependency_indices: ::prost::alloc::vec::Vec<u64>,
#[prost(message, optional, tag = "6")]
pub schema: ::core::option::Option<super::datafusion_common::DfSchema>,
#[prost(message, optional, tag = "7")]
pub options: ::core::option::Option<UnnestOptions>,
}
#[derive(Clone, PartialEq, Eq, Hash, ::prost::Message)]
pub struct ColumnUnnestListItem {
#[prost(uint32, tag = "1")]
pub input_index: u32,
#[prost(message, optional, tag = "2")]
pub recursion: ::core::option::Option<ColumnUnnestListRecursion>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct ColumnUnnestListRecursions {
#[prost(message, repeated, tag = "2")]
pub recursions: ::prost::alloc::vec::Vec<ColumnUnnestListRecursion>,
}
#[derive(Clone, PartialEq, Eq, Hash, ::prost::Message)]
pub struct ColumnUnnestListRecursion {
#[prost(message, optional, tag = "1")]
pub output_column: ::core::option::Option<super::datafusion_common::Column>,
#[prost(uint32, tag = "2")]
pub depth: u32,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct UnnestOptions {
#[prost(bool, tag = "1")]
pub preserve_nulls: bool,
#[prost(message, repeated, tag = "2")]
pub recursions: ::prost::alloc::vec::Vec<RecursionUnnestOption>,
}
#[derive(Clone, PartialEq, Eq, Hash, ::prost::Message)]
pub struct RecursionUnnestOption {
#[prost(message, optional, tag = "1")]
pub output_column: ::core::option::Option<super::datafusion_common::Column>,
#[prost(message, optional, tag = "2")]
pub input_column: ::core::option::Option<super::datafusion_common::Column>,
#[prost(uint32, tag = "3")]
pub depth: u32,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct UnionNode {
#[prost(message, repeated, tag = "1")]
pub inputs: ::prost::alloc::vec::Vec<LogicalPlanNode>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct CrossJoinNode {
#[prost(message, optional, boxed, tag = "1")]
pub left: ::core::option::Option<::prost::alloc::boxed::Box<LogicalPlanNode>>,
#[prost(message, optional, boxed, tag = "2")]
pub right: ::core::option::Option<::prost::alloc::boxed::Box<LogicalPlanNode>>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct LimitNode {
#[prost(message, optional, boxed, tag = "1")]
pub input: ::core::option::Option<::prost::alloc::boxed::Box<LogicalPlanNode>>,
/// The number of rows to skip before fetch; non-positive means don't skip any
#[prost(int64, tag = "2")]
pub skip: i64,
/// Maximum number of rows to fetch; negative means no limit
#[prost(int64, tag = "3")]
pub fetch: i64,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct SelectionExecNode {
#[prost(message, optional, tag = "1")]
pub expr: ::core::option::Option<LogicalExprNode>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct SubqueryAliasNode {
#[prost(message, optional, boxed, tag = "1")]
pub input: ::core::option::Option<::prost::alloc::boxed::Box<LogicalPlanNode>>,
#[prost(message, optional, tag = "3")]
pub alias: ::core::option::Option<TableReference>,
}
/// logical expressions
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct LogicalExprNode {
#[prost(
oneof = "logical_expr_node::ExprType",
tags = "1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 13, 14, 15, 17, 18, 19, 20, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35"
)]
pub expr_type: ::core::option::Option<logical_expr_node::ExprType>,
}
/// Nested message and enum types in `LogicalExprNode`.
pub mod logical_expr_node {
#[derive(Clone, PartialEq, ::prost::Oneof)]
pub enum ExprType {
/// column references
#[prost(message, tag = "1")]
Column(super::super::datafusion_common::Column),
/// alias
#[prost(message, tag = "2")]
Alias(::prost::alloc::boxed::Box<super::AliasNode>),
#[prost(message, tag = "3")]
Literal(super::super::datafusion_common::ScalarValue),
/// binary expressions
#[prost(message, tag = "4")]
BinaryExpr(super::BinaryExprNode),
/// null checks
#[prost(message, tag = "6")]
IsNullExpr(::prost::alloc::boxed::Box<super::IsNull>),
#[prost(message, tag = "7")]
IsNotNullExpr(::prost::alloc::boxed::Box<super::IsNotNull>),
#[prost(message, tag = "8")]
NotExpr(::prost::alloc::boxed::Box<super::Not>),
#[prost(message, tag = "9")]
Between(::prost::alloc::boxed::Box<super::BetweenNode>),
#[prost(message, tag = "10")]
Case(::prost::alloc::boxed::Box<super::CaseNode>),
#[prost(message, tag = "11")]
Cast(::prost::alloc::boxed::Box<super::CastNode>),
#[prost(message, tag = "13")]
Negative(::prost::alloc::boxed::Box<super::NegativeNode>),
#[prost(message, tag = "14")]
InList(::prost::alloc::boxed::Box<super::InListNode>),
#[prost(message, tag = "15")]
Wildcard(super::Wildcard),
/// was ScalarFunctionNode scalar_function = 16;
#[prost(message, tag = "17")]
TryCast(::prost::alloc::boxed::Box<super::TryCastNode>),
/// window expressions
#[prost(message, tag = "18")]
WindowExpr(::prost::alloc::boxed::Box<super::WindowExprNode>),
/// AggregateUDF expressions
#[prost(message, tag = "19")]
AggregateUdfExpr(::prost::alloc::boxed::Box<super::AggregateUdfExprNode>),
/// Scalar UDF expressions
#[prost(message, tag = "20")]
ScalarUdfExpr(super::ScalarUdfExprNode),
#[prost(message, tag = "22")]
GroupingSet(super::GroupingSetNode),
#[prost(message, tag = "23")]
Cube(super::CubeNode),
#[prost(message, tag = "24")]
Rollup(super::RollupNode),
#[prost(message, tag = "25")]
IsTrue(::prost::alloc::boxed::Box<super::IsTrue>),
#[prost(message, tag = "26")]
IsFalse(::prost::alloc::boxed::Box<super::IsFalse>),
#[prost(message, tag = "27")]
IsUnknown(::prost::alloc::boxed::Box<super::IsUnknown>),
#[prost(message, tag = "28")]
IsNotTrue(::prost::alloc::boxed::Box<super::IsNotTrue>),
#[prost(message, tag = "29")]
IsNotFalse(::prost::alloc::boxed::Box<super::IsNotFalse>),
#[prost(message, tag = "30")]
IsNotUnknown(::prost::alloc::boxed::Box<super::IsNotUnknown>),
#[prost(message, tag = "31")]
Like(::prost::alloc::boxed::Box<super::LikeNode>),
#[prost(message, tag = "32")]
Ilike(::prost::alloc::boxed::Box<super::ILikeNode>),
#[prost(message, tag = "33")]
SimilarTo(::prost::alloc::boxed::Box<super::SimilarToNode>),
#[prost(message, tag = "34")]
Placeholder(super::PlaceholderNode),
#[prost(message, tag = "35")]
Unnest(super::Unnest),
}
}
#[derive(Clone, PartialEq, Eq, Hash, ::prost::Message)]
pub struct Wildcard {
#[prost(message, optional, tag = "1")]
pub qualifier: ::core::option::Option<TableReference>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct PlaceholderNode {
#[prost(string, tag = "1")]
pub id: ::prost::alloc::string::String,
/// We serialize the data type, metadata, and nullability separately to maintain
/// compatibility with older versions
#[prost(message, optional, tag = "2")]
pub data_type: ::core::option::Option<super::datafusion_common::ArrowType>,
#[prost(bool, optional, tag = "3")]
pub nullable: ::core::option::Option<bool>,
#[prost(map = "string, string", tag = "4")]
pub metadata: ::std::collections::HashMap<
::prost::alloc::string::String,
::prost::alloc::string::String,
>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct LogicalExprList {
#[prost(message, repeated, tag = "1")]
pub expr: ::prost::alloc::vec::Vec<LogicalExprNode>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct GroupingSetNode {
#[prost(message, repeated, tag = "1")]
pub expr: ::prost::alloc::vec::Vec<LogicalExprList>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct CubeNode {
#[prost(message, repeated, tag = "1")]
pub expr: ::prost::alloc::vec::Vec<LogicalExprNode>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct RollupNode {
#[prost(message, repeated, tag = "1")]
pub expr: ::prost::alloc::vec::Vec<LogicalExprNode>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct NamedStructField {
#[prost(message, optional, tag = "1")]
pub name: ::core::option::Option<super::datafusion_common::ScalarValue>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct ListIndex {
#[prost(message, optional, tag = "1")]
pub key: ::core::option::Option<LogicalExprNode>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct ListRange {
#[prost(message, optional, tag = "1")]
pub start: ::core::option::Option<LogicalExprNode>,
#[prost(message, optional, tag = "2")]
pub stop: ::core::option::Option<LogicalExprNode>,
#[prost(message, optional, tag = "3")]
pub stride: ::core::option::Option<LogicalExprNode>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct IsNull {
#[prost(message, optional, boxed, tag = "1")]
pub expr: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct IsNotNull {
#[prost(message, optional, boxed, tag = "1")]
pub expr: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct IsTrue {
#[prost(message, optional, boxed, tag = "1")]
pub expr: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct IsFalse {
#[prost(message, optional, boxed, tag = "1")]
pub expr: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct IsUnknown {
#[prost(message, optional, boxed, tag = "1")]
pub expr: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct IsNotTrue {
#[prost(message, optional, boxed, tag = "1")]
pub expr: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct IsNotFalse {
#[prost(message, optional, boxed, tag = "1")]
pub expr: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct IsNotUnknown {
#[prost(message, optional, boxed, tag = "1")]
pub expr: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct Not {
#[prost(message, optional, boxed, tag = "1")]
pub expr: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct AliasNode {
#[prost(message, optional, boxed, tag = "1")]
pub expr: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
#[prost(string, tag = "2")]
pub alias: ::prost::alloc::string::String,
#[prost(message, repeated, tag = "3")]
pub relation: ::prost::alloc::vec::Vec<TableReference>,
#[prost(map = "string, string", tag = "4")]
pub metadata: ::std::collections::HashMap<
::prost::alloc::string::String,
::prost::alloc::string::String,
>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct BinaryExprNode {
/// Represents the operands from the left inner most expression
/// to the right outer most expression where each of them are chained
/// with the operator 'op'.
#[prost(message, repeated, tag = "1")]
pub operands: ::prost::alloc::vec::Vec<LogicalExprNode>,
#[prost(string, tag = "3")]
pub op: ::prost::alloc::string::String,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct NegativeNode {
#[prost(message, optional, boxed, tag = "1")]
pub expr: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct Unnest {
#[prost(message, repeated, tag = "1")]
pub exprs: ::prost::alloc::vec::Vec<LogicalExprNode>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct InListNode {
#[prost(message, optional, boxed, tag = "1")]
pub expr: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
#[prost(message, repeated, tag = "2")]
pub list: ::prost::alloc::vec::Vec<LogicalExprNode>,
#[prost(bool, tag = "3")]
pub negated: bool,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct AggregateUdfExprNode {
#[prost(string, tag = "1")]
pub fun_name: ::prost::alloc::string::String,
#[prost(message, repeated, tag = "2")]
pub args: ::prost::alloc::vec::Vec<LogicalExprNode>,
#[prost(bool, tag = "5")]
pub distinct: bool,
#[prost(message, optional, boxed, tag = "3")]
pub filter: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
#[prost(message, repeated, tag = "4")]
pub order_by: ::prost::alloc::vec::Vec<SortExprNode>,
#[prost(bytes = "vec", optional, tag = "6")]
pub fun_definition: ::core::option::Option<::prost::alloc::vec::Vec<u8>>,
#[prost(enumeration = "NullTreatment", optional, tag = "7")]
pub null_treatment: ::core::option::Option<i32>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct ScalarUdfExprNode {
#[prost(string, tag = "1")]
pub fun_name: ::prost::alloc::string::String,
#[prost(message, repeated, tag = "2")]
pub args: ::prost::alloc::vec::Vec<LogicalExprNode>,
#[prost(bytes = "vec", optional, tag = "3")]
pub fun_definition: ::core::option::Option<::prost::alloc::vec::Vec<u8>>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct WindowExprNode {
#[prost(message, repeated, tag = "4")]
pub exprs: ::prost::alloc::vec::Vec<LogicalExprNode>,
#[prost(message, repeated, tag = "5")]
pub partition_by: ::prost::alloc::vec::Vec<LogicalExprNode>,
#[prost(message, repeated, tag = "6")]
pub order_by: ::prost::alloc::vec::Vec<SortExprNode>,
/// repeated LogicalExprNode filter = 7;
#[prost(message, optional, tag = "8")]
pub window_frame: ::core::option::Option<WindowFrame>,
#[prost(bytes = "vec", optional, tag = "10")]
pub fun_definition: ::core::option::Option<::prost::alloc::vec::Vec<u8>>,
#[prost(enumeration = "NullTreatment", optional, tag = "11")]
pub null_treatment: ::core::option::Option<i32>,
#[prost(bool, tag = "12")]
pub distinct: bool,
#[prost(message, optional, boxed, tag = "13")]
pub filter: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
#[prost(oneof = "window_expr_node::WindowFunction", tags = "3, 9")]
pub window_function: ::core::option::Option<window_expr_node::WindowFunction>,
}
/// Nested message and enum types in `WindowExprNode`.
pub mod window_expr_node {
#[derive(Clone, PartialEq, Eq, Hash, ::prost::Oneof)]
pub enum WindowFunction {
/// BuiltInWindowFunction built_in_function = 2;
#[prost(string, tag = "3")]
Udaf(::prost::alloc::string::String),
#[prost(string, tag = "9")]
Udwf(::prost::alloc::string::String),
}
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct BetweenNode {
#[prost(message, optional, boxed, tag = "1")]
pub expr: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
#[prost(bool, tag = "2")]
pub negated: bool,
#[prost(message, optional, boxed, tag = "3")]
pub low: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
#[prost(message, optional, boxed, tag = "4")]
pub high: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct LikeNode {
#[prost(bool, tag = "1")]
pub negated: bool,
#[prost(message, optional, boxed, tag = "2")]
pub expr: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
#[prost(message, optional, boxed, tag = "3")]
pub pattern: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
#[prost(string, tag = "4")]
pub escape_char: ::prost::alloc::string::String,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct ILikeNode {
#[prost(bool, tag = "1")]
pub negated: bool,
#[prost(message, optional, boxed, tag = "2")]
pub expr: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
#[prost(message, optional, boxed, tag = "3")]
pub pattern: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
#[prost(string, tag = "4")]
pub escape_char: ::prost::alloc::string::String,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct SimilarToNode {
#[prost(bool, tag = "1")]
pub negated: bool,
#[prost(message, optional, boxed, tag = "2")]
pub expr: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
#[prost(message, optional, boxed, tag = "3")]
pub pattern: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
#[prost(string, tag = "4")]
pub escape_char: ::prost::alloc::string::String,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct CaseNode {
#[prost(message, optional, boxed, tag = "1")]
pub expr: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
#[prost(message, repeated, tag = "2")]
pub when_then_expr: ::prost::alloc::vec::Vec<WhenThen>,
#[prost(message, optional, boxed, tag = "3")]
pub else_expr: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct WhenThen {
#[prost(message, optional, tag = "1")]
pub when_expr: ::core::option::Option<LogicalExprNode>,
#[prost(message, optional, tag = "2")]
pub then_expr: ::core::option::Option<LogicalExprNode>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct CastNode {
#[prost(message, optional, boxed, tag = "1")]
pub expr: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
#[prost(message, optional, tag = "2")]
pub arrow_type: ::core::option::Option<super::datafusion_common::ArrowType>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct TryCastNode {
#[prost(message, optional, boxed, tag = "1")]
pub expr: ::core::option::Option<::prost::alloc::boxed::Box<LogicalExprNode>>,
#[prost(message, optional, tag = "2")]
pub arrow_type: ::core::option::Option<super::datafusion_common::ArrowType>,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct SortExprNode {
#[prost(message, optional, tag = "1")]
pub expr: ::core::option::Option<LogicalExprNode>,
#[prost(bool, tag = "2")]
pub asc: bool,
#[prost(bool, tag = "3")]
pub nulls_first: bool,
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct WindowFrame {
#[prost(enumeration = "WindowFrameUnits", tag = "1")]
pub window_frame_units: i32,
#[prost(message, optional, tag = "2")]
pub start_bound: ::core::option::Option<WindowFrameBound>,
/// "optional" keyword is stable in protoc 3.15 but prost is still on 3.14 (see <https://github.com/tokio-rs/prost/issues/430> and <https://github.com/tokio-rs/prost/pull/455>)
/// this syntax is ugly but is binary compatible with the "optional" keyword (see <https://stackoverflow.com/questions/42622015/how-to-define-an-optional-field-in-protobuf-3>)
#[prost(oneof = "window_frame::EndBound", tags = "3")]
pub end_bound: ::core::option::Option<window_frame::EndBound>,
}
/// Nested message and enum types in `WindowFrame`.
pub mod window_frame {
/// "optional" keyword is stable in protoc 3.15 but prost is still on 3.14 (see <https://github.com/tokio-rs/prost/issues/430> and <https://github.com/tokio-rs/prost/pull/455>)
/// this syntax is ugly but is binary compatible with the "optional" keyword (see <https://stackoverflow.com/questions/42622015/how-to-define-an-optional-field-in-protobuf-3>)
#[derive(Clone, PartialEq, ::prost::Oneof)]
pub enum EndBound {
#[prost(message, tag = "3")]
Bound(super::WindowFrameBound),
}
}
#[derive(Clone, PartialEq, ::prost::Message)]
pub struct WindowFrameBound {
#[prost(enumeration = "WindowFrameBoundType", tag = "1")]
pub window_frame_bound_type: i32,
#[prost(message, optional, tag = "2")]
pub bound_value: ::core::option::Option<super::datafusion_common::ScalarValue>,
}
#[derive(Clone, Copy, PartialEq, Eq, Hash, ::prost::Message)]
pub struct FixedSizeBinary {
#[prost(int32, tag = "1")]
pub length: i32,
}
#[derive(Clone, PartialEq, Eq, Hash, ::prost::Message)]
pub struct AnalyzedLogicalPlanType {
#[prost(string, tag = "1")]
pub analyzer_name: ::prost::alloc::string::String,
}
#[derive(Clone, PartialEq, Eq, Hash, ::prost::Message)]
pub struct OptimizedLogicalPlanType {
#[prost(string, tag = "1")]
pub optimizer_name: ::prost::alloc::string::String,
}
#[derive(Clone, PartialEq, Eq, Hash, ::prost::Message)]
pub struct OptimizedPhysicalPlanType {
#[prost(string, tag = "1")]
pub optimizer_name: ::prost::alloc::string::String,
}
#[derive(Clone, PartialEq, Eq, Hash, ::prost::Message)]
pub struct PlanType {
#[prost(
oneof = "plan_type::PlanTypeEnum",
tags = "1, 7, 8, 2, 3, 4, 9, 11, 5, 6, 10, 12, 13"
)]
pub plan_type_enum: ::core::option::Option<plan_type::PlanTypeEnum>,
}
/// Nested message and enum types in `PlanType`.
pub mod plan_type {
#[derive(Clone, PartialEq, Eq, Hash, ::prost::Oneof)]