Abstraction layer for the actual storage of the data structure.
The structure implementations provide the actual storage for TOML values, with a generic enough interface to make the definition of the TOML data structures independent of the actual algorithm used for storing the TOML values.
Every data structure defined here should strive to only use allocatable data types and limit the use of pointer attributes as they interfer with the automatic memory management of Fortran. A well defined data structure in allocatables allows deep-copying of TOML values by assignment, data structures requiring pointer attributes have to define an assignment(=) interface to allow deep-copying of TOML values.
Constructor for the ordered storage data structure
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| class(toml_list_structure), | intent(out), | allocatable | :: | self |
Instance of the structure |
Constructor for the storage data structure
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| class(toml_map_structure), | intent(out), | allocatable | :: | self |
Instance of the structure |