Moduletomland-1.3.3.3Haskell2010
Toml.Parser.Validate
SPDX-License-Identifier : MPL-2.0 Maintainer : Kowainik xrom.xkov@gmail.com Stability : Stable Portability : Portable
This module contains functions that aggregate the result of tomlP parser into TOML. This approach allows to keep parser fast and simple and delegate the process of creating tree structure to a separate function.
- 1 type
- 4 values
- Packagetomland-1.3.3.3
- Exports5
- LanguageHaskell2010
- LicenceMPL-2.0
- SourceValidate.hs
Decoding
2 declarationsError that happens during validating TOML which is already syntactically correct. For the list of all possible validation errors and their explanation, see the following issue on GitHub:
Constructors
Instances2Eq, Show
Eq ValidationErrorDefined in tomland-1.3.3.3 · Toml.Parser.ValidateShow ValidationErrorDefined in tomland-1.3.3.3 · Toml.Parser.Validate
Internal helpers
3 declarationsThis function takes flat list of TomlItems and groups it into list of Trees by putting all corresponding items inside tables and table arrays. It doesn't perform any validation, just groups items according to prefixes of their keys. So, for example, if you have the following keys as flat list:
aaa # ordinary key
aaa.bbb # ordinary key
[foo] # table nam
foo.bar
foo.baz
[xxx] # table name
[xxx.yyy] # table name
zzz
the following tree structure will be created:
aaa
aaa.bbb
[foo]
├──── foo.bar
└──── foo.baz
[xxx]
└──── [yyy]
└──── zzz
groupWithParent