A Single, lighter-weight representation than that of HsSyck. Note that the YMap is an actual Map from Data.Map, so behavior with respect to identical keys and ordering of entries will behave as Data.Map dictates. This behavior is also in compliance with the Yaml spec. If you currently rely on HsSyck's preservation of ordering, you can also consider representing such maps as sequences of single entry maps. See the examples of "Ordered Mappings" in the Yaml spec: http://www.yaml.org/spec/1.2/spec.html.

Parse a regular Haskell string

Given a file name, parse contents of file

Parse a ByteString buffer (this is faster)

Convert a Syck YamlNode to a YamlLight

Lookup the key's corresponding value in a Map. Returns Nothing if the YamlLight is not a map, or if the key is not found

General form of lookup. Will return the first element that satisfies predicate p, otherwise Nothing

Combine a sequence of maps into a list of (key,value) pairs. The ordering of the result preserves the ordering of the sequence, but the ordering of the individual maps is as Data.Map handles it.

Example:

     - key1: val1
       key2: val2
     - key3: val3

Would become:

     [(key1,val1),(key2,val2),(key3,val3)]

where key1 and key2 might be arranged differently as Data.Map would arrange them. This does not preserve uniqueness of keys across maps. Any items of the sequence that are not maps will be ignored. Returns Nothing if not called on a Sequence

Get the contents of a sequence

Get the contents of a map

Get the contents of a string