Overview
Comment: | static_hash_maps: new code generation package to build static hash maps
A static hash map means here a hash maps completely known before compile time. It uses GNAT.Perfect_Hash_Generator to turn string keys into indexes for an array of elements. |
---|---|
Timelines: | family | ancestors | descendants | both | trunk |
Files: | files | file ages | folders |
SHA1: |
582f564b615f223ce9e03b0e3da5e1f8 |
User & Date: | nat on 2014-05-18 20:20:13 |
Other Links: | manifest | tags |
Context
2014-05-19
| ||
18:37 | static_hash_maps-s_expressions: new package to run static hash map generator using a S-expression description check-in: ad65c67a84 user: nat tags: trunk | |
2014-05-18
| ||
20:20 |
static_hash_maps: new code generation package to build static hash maps
A static hash map means here a hash maps completely known before compile time. It uses GNAT.Perfect_Hash_Generator to turn string keys into indexes for an array of elements. check-in: 582f564b61 user: nat tags: trunk | |
2014-05-17
| ||
14:09 | s_expressions-interpreter_tests: use building functions in a test, to reach full coverage check-in: 17fe0bb70a user: nat tags: trunk | |
Changes
Added src/natools-static_hash_maps.adb version [2d303fae46].
> > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > | 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 | ------------------------------------------------------------------------------ -- Copyright (c) 2014, Natacha Porté -- -- -- -- Permission to use, copy, modify, and distribute this software for any -- -- purpose with or without fee is hereby granted, provided that the above -- -- copyright notice and this permission notice appear in all copies. -- -- -- -- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES -- -- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF -- -- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR -- -- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES -- -- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN -- -- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF -- -- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. -- ------------------------------------------------------------------------------ with Ada.Calendar.Formatting; with Ada.Calendar.Time_Zones; with Ada.Characters.Handling; with Ada.Directories; with Ada.Text_IO; with GNAT.Perfect_Hash_Generators; package body Natools.Static_Hash_Maps is function File_Name (Package_Name : in String) return String; -- Convert a package name into a file name, the GNAT way function Image (Pos : Natural) return String; -- Trimmed image, for suffix construction function Image (Offset : Ada.Calendar.Time_Zones.Time_Offset) return String; procedure Write_Map_Body (Map : in Map_Description; Prefix : in String; File : in Ada.Text_IO.File_Type); procedure Write_Map_Hash_Package (Map : in Map_Description); procedure Write_Map_Private_Spec (Map : in Map_Description; Prefix : in String; File : in Ada.Text_IO.File_Type); procedure Write_Map_Public_Spec (Map : in Map_Description; File : in Ada.Text_IO.File_Type); procedure Write_Map_With (Map : in Map_Description; File : in Ada.Text_IO.File_Type); -- Output fragments relevant for the given map procedure Write_Package (Pkg : in Map_Package; Spec_File, Body_File : in Ada.Text_IO.File_Type); -- Output a complete map package ------------------------ -- Package Generators -- ------------------------ function File_Name (Package_Name : in String) return String is Result : String := Ada.Characters.Handling.To_Lower (Package_Name); begin for I in Result'Range loop if Result (I) = '.' then Result (I) := '-'; end if; end loop; return Result; end File_Name; function Image (Pos : Natural) return String is Result : constant String := Natural'Image (Pos); begin pragma Assert (Result (Result'First) = ' '); return Result (Result'First + 1 .. Result'Last); end Image; function Image (Offset : Ada.Calendar.Time_Zones.Time_Offset) return String is use type Ada.Calendar.Time_Zones.Time_Offset; H : constant Natural := Natural (abs Offset) / 60; M : constant Natural := Natural (abs Offset) mod 60; Sign : Character := '+'; begin if Offset < 0 then Sign := '-'; end if; return String'(1 => Sign, 2 => Character'Val (48 + H / 10), 3 => Character'Val (48 + H mod 10), 4 => Character'Val (48 + M / 10), 5 => Character'Val (48 + M mod 10)); end Image; procedure Write_Map_Body (Map : in Map_Description; Prefix : in String; File : in Ada.Text_IO.File_Type) is begin Ada.Text_IO.Put_Line (File, " function " & To_String (Map.Function_Name) & " (Key : String) return " & To_String (Map.Element_Type) & " is"); Ada.Text_IO.Put_Line (File, " N : constant Natural"); Ada.Text_IO.Put_Line (File, " := " & To_String (Map.Hash_Package_Name) & ".Hash (Key);"); Ada.Text_IO.Put_Line (File, " begin"); Ada.Text_IO.Put_Line (File, " if " & Prefix & "_Keys (N).all = Key then"); Ada.Text_IO.Put_Line (File, " return " & Prefix & "_Elements (N);"); Ada.Text_IO.Put_Line (File, " else"); if To_String (Map.Not_Found) /= "" then Ada.Text_IO.Put_Line (File, " return " & To_String (Map.Not_Found) & ';'); else Ada.Text_IO.Put_Line (File, " raise Constraint_Error " & "with ""Key """""" & Key & """""" not in map"";"); end if; Ada.Text_IO.Put_Line (File, " end if;"); Ada.Text_IO.Put_Line (File, " end " & To_String (Map.Function_Name) & ';'); end Write_Map_Body; procedure Write_Map_Hash_Package (Map : in Map_Description) is Seed : constant Natural := 2; Cursor : Node_Lists.Cursor := Map.Nodes.First; begin while Node_Lists.Has_Element (Cursor) loop GNAT.Perfect_Hash_Generators.Insert (To_String (Node_Lists.Element (Cursor).Key)); Node_Lists.Next (Cursor); end loop; GNAT.Perfect_Hash_Generators.Initialize (Seed); GNAT.Perfect_Hash_Generators.Compute; GNAT.Perfect_Hash_Generators.Produce (To_String (Map.Hash_Package_Name)); GNAT.Perfect_Hash_Generators.Finalize; exception when others => GNAT.Perfect_Hash_Generators.Finalize; raise; end Write_Map_Hash_Package; procedure Write_Map_Private_Spec (Map : in Map_Description; Prefix : in String; File : in Ada.Text_IO.File_Type) is Last : constant Natural := Positive (Map.Nodes.Length) - 1; Pos : Natural; Cursor : Node_Lists.Cursor; begin Pos := 0; Cursor := Map.Nodes.First; while Node_Lists.Has_Element (Cursor) loop Ada.Text_IO.Put_Line (File, " " & Prefix & "_Key_" & Image (Pos) & " : aliased constant String := """ & To_String (Node_Lists.Element (Cursor).Key) & """;"); Pos := Pos + 1; Node_Lists.Next (Cursor); end loop; Ada.Text_IO.Put_Line (File, " " & Prefix & "_Keys : constant array (0 .. " & Image (Last) & ") of access constant String"); Pos := 0; Cursor := Map.Nodes.First; while Node_Lists.Has_Element (Cursor) loop if Pos = 0 then Ada.Text_IO.Put (File, " := ("); else Ada.Text_IO.Put (File, " "); end if; Ada.Text_IO.Put (File, Prefix & "_Key_" & Image (Pos) & "'Access"); if Pos = Last then Ada.Text_IO.Put_Line (File, ");"); else Ada.Text_IO.Put_Line (File, ","); end if; Pos := Pos + 1; Node_Lists.Next (Cursor); end loop; Ada.Text_IO.Put_Line (File, " " & Prefix & "_Elements : constant array (0 .. " & Image (Last) & ") of " & To_String (Map.Element_Type)); Pos := 0; Cursor := Map.Nodes.First; while Node_Lists.Has_Element (Cursor) loop if Pos = 0 then Ada.Text_IO.Put (File, " := ("); else Ada.Text_IO.Put (File, " "); end if; Ada.Text_IO.Put (File, To_String (Node_Lists.Element (Cursor).Name)); if Pos = Last then Ada.Text_IO.Put_Line (File, ");"); else Ada.Text_IO.Put_Line (File, ","); end if; Pos := Pos + 1; Node_Lists.Next (Cursor); end loop; end Write_Map_Private_Spec; procedure Write_Map_Public_Spec (Map : in Map_Description; File : in Ada.Text_IO.File_Type) is begin Ada.Text_IO.Put_Line (File, " function " & To_String (Map.Function_Name) & " (Key : String) return " & To_String (Map.Element_Type) & ';'); end Write_Map_Public_Spec; procedure Write_Map_With (Map : in Map_Description; File : in Ada.Text_IO.File_Type) is begin Ada.Text_IO.Put_Line (File, "with " & To_String (Map.Hash_Package_Name) & ';'); end Write_Map_With; procedure Write_Package (Pkg : in Map_Package; Spec_File, Body_File : in Ada.Text_IO.File_Type) is type Stage is (Hash_Package, Public_Spec, Private_Spec, Body_With, Body_Contents); Current_Stage : Stage; Map_Pos : Natural := 0; procedure Process (Element : in Map_Description); procedure Query (Cursor : in Map_Lists.Cursor); procedure Process (Element : in Map_Description) is Prefix : constant String := "Map_" & Image (Map_Pos + 1); begin case Current_Stage is when Hash_Package => Write_Map_Hash_Package (Element); when Public_Spec => Write_Map_Public_Spec (Element, Spec_File); when Private_Spec => Ada.Text_IO.New_Line (Spec_File); Write_Map_Private_Spec (Element, Prefix, Spec_File); when Body_With => Write_Map_With (Element, Body_File); when Body_Contents => Ada.Text_IO.New_Line (Body_File); Write_Map_Body (Element, Prefix, Body_File); Ada.Text_IO.New_Line (Body_File); end case; Map_Pos := Map_Pos + 1; end Process; procedure Query (Cursor : in Map_Lists.Cursor) is begin Map_Lists.Query_Element (Cursor, Process'Access); end Query; begin Current_Stage := Hash_Package; Map_Pos := 0; Pkg.Maps.Iterate (Query'Access); Write_Headers : declare Now : constant Ada.Calendar.Time := Ada.Calendar.Clock; Offset : constant Ada.Calendar.Time_Zones.Time_Offset := Ada.Calendar.Time_Zones.UTC_Time_Offset (Now); Header : constant String := "-- Generated at " & Ada.Calendar.Formatting.Image (Now, False, Offset) & ' ' & Image (Offset) & " by Natools.Static_Hash_Maps"; Description : constant String := To_String (Pkg.Description); begin Ada.Text_IO.Put_Line (Spec_File, Header); Ada.Text_IO.Put_Line (Body_File, Header); if Description'Length > 0 then Ada.Text_IO.Put_Line (Spec_File, "-- " & Description); Ada.Text_IO.Put_Line (Body_File, "-- " & Description); end if; Ada.Text_IO.New_Line (Spec_File); Ada.Text_IO.New_Line (Body_File); end Write_Headers; if Pkg.Priv then Ada.Text_IO.Put (Spec_File, "private "); end if; Ada.Text_IO.Put_Line (Spec_File, "package " & To_String (Pkg.Name) & " is"); Ada.Text_IO.New_Line (Spec_File); Current_Stage := Public_Spec; Map_Pos := 0; Pkg.Maps.Iterate (Query'Access); Ada.Text_IO.New_Line (Spec_File); Ada.Text_IO.Put_Line (Spec_File, "private"); Current_Stage := Private_Spec; Map_Pos := 0; Pkg.Maps.Iterate (Query'Access); Ada.Text_IO.New_Line (Spec_File); Ada.Text_IO.Put_Line (Spec_File, "end " & To_String (Pkg.Name) & ';'); Current_Stage := Body_With; Map_Pos := 0; Pkg.Maps.Iterate (Query'Access); Ada.Text_IO.New_Line (Body_File); Ada.Text_IO.Put_Line (Body_File, "package body " & To_String (Pkg.Name) & " is"); Current_Stage := Body_Contents; Map_Pos := 0; Pkg.Maps.Iterate (Query'Access); Ada.Text_IO.Put_Line (Body_File, "end " & To_String (Pkg.Name) & ';'); end Write_Package; ------------------------------- -- Key-Name Pair Constructor -- ------------------------------- function Node (Key, Name : String) return Map_Node is begin return (Key => Hold (Key), Name => Hold (Name)); end Node; --------------------------------- -- Map Description Subprograms -- --------------------------------- procedure Reset (Self : out Map_Description) is begin Self := (Element_Type => Hold (""), Hash_Package_Name => Hold (""), Function_Name => Hold (""), Not_Found => Hold (""), Nodes => Node_Lists.Empty_List); end Reset; procedure Insert (Self : in out Map_Description; Key : in String; Element_Name : in String) is begin Self.Nodes.Append (Node (Key, Element_Name)); end Insert; procedure Set_Element_Type (Self : in out Map_Description; Name : in String) is begin Self.Element_Type := Hold (Name); end Set_Element_Type; procedure Set_Function_Name (Self : in out Map_Description; Name : in String) is begin Self.Function_Name := Hold (Name); end Set_Function_Name; procedure Set_Hash_Package_Name (Self : in out Map_Description; Name : in String) is begin Self.Hash_Package_Name := Hold (Name); end Set_Hash_Package_Name; procedure Set_Not_Found (Self : in out Map_Description; Name : in String) is begin Self.Not_Found := Hold (Name); end Set_Not_Found; function Map (Element_Type : String; Nodes : Node_Array; Hash_Package_Name : String := ""; Function_Name : String := "Element"; Not_Found : String := "") return Map_Description is Result : Map_Description := (Element_Type => Hold (Element_Type), Hash_Package_Name => Hold (Hash_Package_Name), Function_Name => Hold (Function_Name), Not_Found => Hold (Not_Found), Nodes => Node_Lists.Empty_List); begin for I in Nodes'Range loop Result.Nodes.Append (Nodes (I)); end loop; return Result; end Map; ---------------------------- -- Map Package Primitives -- ---------------------------- procedure Open (Self : in out Map_Package; Name : in String; Private_Child : in Boolean := False) is begin Self.Name := Hold (Name); Self.Description := Hold (""); Self.Priv := Private_Child; Self.Maps.Clear; end Open; procedure Close (Self : in out Map_Package) is begin Self.Name := Hold (""); Self.Maps.Clear; end Close; procedure Set_Description (Self : in out Map_Package; Description : in String) is begin Self.Description := Hold (Description); end Set_Description; procedure Set_Private_Child (Self : in out Map_Package; Private_Child : in Boolean := True) is begin Self.Priv := Private_Child; end Set_Private_Child; procedure Add_Map (Self : in out Map_Package; Map : in Map_Description) is begin if To_String (Self.Name) = "" then raise Constraint_Error with "Add_Map on non-opened static hash map package"; end if; Self.Maps.Append (Map); end Add_Map; procedure Commit (Self : in out Map_Package) is begin if To_String (Self.Name) = "" then raise Constraint_Error with "Commit on static hash map package without a name"; end if; if Self.Maps.Is_Empty then raise Constraint_Error with "Commit on static hash map package without any map"; end if; declare Package_Name : constant String := To_String (Self.Name); Base_Name : constant String := File_Name (Package_Name); Spec_File, Body_File : Ada.Text_IO.File_Type; begin Ada.Text_IO.Create (File => Spec_File, Name => Ada.Directories.Compose ("", Base_Name, "ads")); Ada.Text_IO.Create (File => Body_File, Name => Ada.Directories.Compose ("", Base_Name, "adb")); Write_Package (Self, Spec_File, Body_File); Ada.Text_IO.Close (Spec_File); Ada.Text_IO.Close (Body_File); end; end Commit; ------------------------- -- Combined Procedures -- ------------------------- procedure Generate_Package (Name : in String; Single_Map : in Map_Description; Private_Child : in Boolean := False) is Object : Map_Package; begin Open (Object, Name, Private_Child); Add_Map (Object, Single_Map); Commit (Object); end Generate_Package; procedure Generate_Package (Name : in String; Maps : in Map_Array; Private_Child : in Boolean := False) is Object : Map_Package; begin Open (Object, Name, Private_Child); for I in Maps'Range loop Add_Map (Object, Maps (I)); end loop; Commit (Object); end Generate_Package; end Natools.Static_Hash_Maps; |
Added src/natools-static_hash_maps.ads version [f00e24d0ba].
> > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > | 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 | ------------------------------------------------------------------------------ -- Copyright (c) 2014, Natacha Porté -- -- -- -- Permission to use, copy, modify, and distribute this software for any -- -- purpose with or without fee is hereby granted, provided that the above -- -- copyright notice and this permission notice appear in all copies. -- -- -- -- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES -- -- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF -- -- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR -- -- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES -- -- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN -- -- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF -- -- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. -- ------------------------------------------------------------------------------ ------------------------------------------------------------------------------ -- Natools.Static_Hash_Maps is a code generator that outputs hash map -- -- packages based on GNAT.Perfect_Hash_Generator. -- -- This is mostly a text manipulation package, and no sanity checks are -- -- performed on input strings, they are inserted as-is in the output files. -- ------------------------------------------------------------------------------ private with Ada.Strings.Unbounded; private with Ada.Containers.Doubly_Linked_Lists; package Natools.Static_Hash_Maps is type Map_Node is private; function Node (Key, Name : String) return Map_Node; type Node_Array is array (Positive range <>) of Map_Node; type Map_Description is private; type Map_Array is array (Positive range <>) of Map_Description; procedure Reset (Self : out Map_Description); procedure Insert (Self : in out Map_Description; Key : in String; Element_Name : in String); -- Add the pair Key and element designated by Name. procedure Set_Element_Type (Self : in out Map_Description; Name : in String); -- String used to desginate the returning type of the element function. -- This must be set. procedure Set_Function_Name (Self : in out Map_Description; Name : in String); -- Element function name, defaulting to "Element" procedure Set_Hash_Package_Name (Self : in out Map_Description; Name : in String); -- Set the package name where the perfect hash function will be write. -- Defaults to "<map package>.<element type>_Hash". procedure Set_Not_Found (Self : in out Map_Description; Name : in String); -- If non-empty, when element function is called with an unknown key, -- return the elemnet named Name instead of raising Constraint_Error. function Map (Element_Type : String; Nodes : Node_Array; Hash_Package_Name : String := ""; Function_Name : String := "Element"; Not_Found : String := "") return Map_Description; -- Create a map in a single call type Map_Package is private; procedure Open (Self : in out Map_Package; Name : in String; Private_Child : in Boolean := False); -- Reset Self and initialize it with the givan package Name procedure Set_Description (Self : in out Map_Package; Description : in String); procedure Set_Private_Child (Self : in out Map_Package; Private_Child : in Boolean := True); procedure Add_Map (Self : in out Map_Package; Map : in Map_Description); -- Append a new Map to Self procedure Commit (Self : in out Map_Package); -- Write accumulated package description to disk procedure Close (Self : in out Map_Package); -- Drop all internal state procedure Generate_Package (Name : in String; Single_Map : in Map_Description; Private_Child : in Boolean := False); procedure Generate_Package (Name : in String; Maps : in Map_Array; Private_Child : in Boolean := False); -- Build an internal Map_Package and commit it to disk -- in a single operation. private subtype String_Holder is Ada.Strings.Unbounded.Unbounded_String; function Hold (S : String) return String_Holder renames Ada.Strings.Unbounded.To_Unbounded_String; function To_String (H : String_Holder) return String renames Ada.Strings.Unbounded.To_String; type Map_Node is record Key, Name : String_Holder; end record; package Node_Lists is new Ada.Containers.Doubly_Linked_Lists (Map_Node); type Map_Description is record Element_Type : String_Holder; Hash_Package_Name : String_Holder; Function_Name : String_Holder; Not_Found : String_Holder; Nodes : Node_Lists.List; end record; package Map_Lists is new Ada.Containers.Doubly_Linked_Lists (Map_Description); type Map_Package is record Name : String_Holder; Description : String_Holder; Priv : Boolean; Maps : Map_Lists.List; end record; end Natools.Static_Hash_Maps; |