text stringlengths 0 234 |
|---|
Is_In => True, |
Is_Out => True))); |
Visit : constant Ada_Pretty.Node_Access := |
F.New_Subprogram_Declaration |
(Visit_Spec (F, Base_Name, False)); |
Base_List : constant Ada_Pretty.Node_Access := F.New_List |
(Get_Props |
(F, |
Base_Name, |
Only_Objects (Item.Properties) & Only_Booleans (Parent_Props), |
F.New_List ((Base, Base_Init, Visit)), |
Is_Abstr => False), |
Prop_Checks (All_Parents (Item, Vector))); |
Node_Name : constant Ada_Pretty.Node_Access := |
F.New_Name (To_Element_Name (Item.Name)); |
Node_Props : constant Ada_Pretty.Node_Access := |
Prop_Variables (Only_Tokens (Item.Properties)); |
Node : constant Ada_Pretty.Node_Access := |
F.New_Type |
(Name => Node_Name, |
Definition => F.New_Record |
(Parent => F.New_List |
(Base_Name, |
F.New_Infix (+"and", |
F.New_Selected_Name (Text_Name))), |
Components => Node_Props)); |
Public_Node : constant Ada_Pretty.Node_Access := |
F.New_Type |
(Name => Node_Name, |
Definition => F.New_Private_Record |
(Parents => F.New_List |
((F.New_Selected_Name (+"Program.Nodes.Node"), |
F.New_Infix |
(+"and", |
F.New_Selected_Name (Full_Record_Name (Item.Name))), |
F.New_Infix (+"and", |
F.New_Selected_Name (Text_Name)))))); |
Create_Node : constant Ada_Pretty.Node_Access := |
F.New_Subprogram_Declaration |
(Specification => F.New_Subprogram_Specification |
(Name => F.New_Name (+"Create"), |
Parameters => Prop_Parameters |
(Skip_Texts (Skip_Booleans (Item.Properties & Parent_Props)) |
& Only_Booleans (Parent_Props)), |
Result => Node_Name)); |
Node_To_Text : constant Ada_Pretty.Node_Access := |
F.New_Subprogram_Declaration |
(Specification => To_Text_Spec (F, Item, Node_Name)); |
Node_List : constant Ada_Pretty.Node_Access := |
Get_Props |
(F, |
Name => Node_Name, |
Props => Only_Tokens (Item.Properties) |
& Only_Booleans (Item.Properties) |
& Only_Texts (Item.Properties & Parent_Props), |
Prefix => F.New_List (Node, Node_To_Text), |
Is_Abstr => False); |
Implicit_Name : constant Ada_Pretty.Node_Access := |
F.New_Name ("Implicit_" & Item.Name); |
Implicit_Getters : constant Ada_Pretty.Node_Access := |
Get_Props |
(F, |
Name => Implicit_Name, |
Props => Bool_Props |
& Only_Texts (Item.Properties & Parent_Props), |
Prefix => null, |
Is_Abstr => False); |
Implicit : constant Ada_Pretty.Node_Access := |
F.New_Type |
(Name => Implicit_Name, |
Definition => F.New_Record |
(Parent => Base_Name, |
Components => Bool_Vars)); |
Implicit_To_Text : constant Ada_Pretty.Node_Access := |
F.New_Subprogram_Declaration |
(Specification => To_Text_Spec (F, Item, Implicit_Name)); |
Implicit_List : constant Ada_Pretty.Node_Access := |
F.New_List ((Implicit, Implicit_To_Text, Implicit_Getters)); |
Public_Implicit : constant Ada_Pretty.Node_Access := |
F.New_Type |
(Name => Implicit_Name, |
Definition => F.New_Private_Record |
(Parents => F.New_List |
(F.New_Selected_Name (+"Program.Nodes.Node"), |
F.New_Infix |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.