Thomas Pelletier
91 lines
2.4 KiB
Go
91 lines
2.4 KiB
Go
// TOML markup language parser.
|
|
//
|
|
// This version supports the specification as described in
|
|
// https://github.com/mojombo/toml/tree/e3656ad493400895f4460f1244a25f8f8e31a32a
|
|
package toml
|
|
|
|
import (
|
|
"runtime"
|
|
"strings"
|
|
)
|
|
|
|
// Definition of a TomlTree.
|
|
// This is the result of the parsing of a TOML file.
|
|
type TomlTree map[string]interface{}
|
|
|
|
// Keys returns the keys of the toplevel tree.
|
|
// Warning: this is a costly operation.
|
|
func (t *TomlTree) Keys() []string {
|
|
keys := make([]string, 0)
|
|
mp := (map[string]interface{})(*t)
|
|
for k, _ := range mp {
|
|
keys = append(keys, k)
|
|
}
|
|
return keys
|
|
}
|
|
|
|
// Get the value at key in the TomlTree.
|
|
// Key is a dot-separated path (e.g. a.b.c).
|
|
// Returns nil if the path does not exist in the tree.
|
|
func (t *TomlTree) Get(key string) interface{} {
|
|
subtree := t
|
|
keys := strings.Split(key, ".")
|
|
for _, intermediate_key := range keys[:len(keys)-1] {
|
|
_, exists := (*subtree)[intermediate_key]
|
|
if !exists {
|
|
return nil
|
|
}
|
|
subtree = (*subtree)[intermediate_key].(*TomlTree)
|
|
}
|
|
return (*subtree)[keys[len(keys)-1]]
|
|
}
|
|
|
|
// Set an element in the tree.
|
|
// Key is a dot-separated path (e.g. a.b.c).
|
|
// Creates all necessary intermediates trees, if needed.
|
|
func (t *TomlTree) Set(key string, value interface{}) {
|
|
subtree := t
|
|
keys := strings.Split(key, ".")
|
|
for _, intermediate_key := range keys[:len(keys)-1] {
|
|
_, exists := (*subtree)[intermediate_key]
|
|
if !exists {
|
|
var new_tree TomlTree = make(TomlTree)
|
|
(*subtree)[intermediate_key] = &new_tree
|
|
}
|
|
subtree = (*subtree)[intermediate_key].(*TomlTree)
|
|
}
|
|
(*subtree)[keys[len(keys)-1]] = value
|
|
}
|
|
|
|
// createSubTree takes a tree and a key and create the necessary intermediate
|
|
// subtrees to create a subtree at that point. In-place.
|
|
//
|
|
// e.g. passing a.b.c will create (assuming tree is empty) tree[a], tree[a][b]
|
|
// and tree[a][b][c]
|
|
func (t *TomlTree) createSubTree(key string) {
|
|
subtree := t
|
|
for _, intermediate_key := range strings.Split(key, ".") {
|
|
_, exists := (*subtree)[intermediate_key]
|
|
if !exists {
|
|
var new_tree TomlTree = make(TomlTree)
|
|
(*subtree)[intermediate_key] = &new_tree
|
|
}
|
|
subtree = ((*subtree)[intermediate_key]).(*TomlTree)
|
|
}
|
|
}
|
|
|
|
// Create a TomlTree from a string.
|
|
func Load(content string) (tree *TomlTree, err error) {
|
|
defer func() {
|
|
if r := recover(); r != nil {
|
|
if _, ok := r.(runtime.Error); ok {
|
|
panic(r)
|
|
}
|
|
err = r.(error)
|
|
}
|
|
}()
|
|
_, flow := lex(content)
|
|
tree = parse(flow)
|
|
return
|
|
}
|