99 lines
1.9 KiB
Go
99 lines
1.9 KiB
Go
package config
|
|
|
|
import (
|
|
"errors"
|
|
|
|
"gopkg.in/yaml.v3"
|
|
)
|
|
|
|
// This type implements a low-level get/set config that is backed by an in-memory tree of Yaml
|
|
// nodes. It allows us to interact with a yaml-based config programmatically, preserving any
|
|
// comments that were present when the yaml was parsed.
|
|
type ConfigMap struct {
|
|
Root *yaml.Node
|
|
}
|
|
|
|
type ConfigEntry struct {
|
|
KeyNode *yaml.Node
|
|
ValueNode *yaml.Node
|
|
Index int
|
|
}
|
|
|
|
type NotFoundError struct {
|
|
error
|
|
}
|
|
|
|
func (cm *ConfigMap) Empty() bool {
|
|
return cm.Root == nil || len(cm.Root.Content) == 0
|
|
}
|
|
|
|
func (cm *ConfigMap) GetStringValue(key string) (string, error) {
|
|
entry, err := cm.FindEntry(key)
|
|
if err != nil {
|
|
return "", err
|
|
}
|
|
return entry.ValueNode.Value, nil
|
|
}
|
|
|
|
func (cm *ConfigMap) SetStringValue(key, value string) error {
|
|
entry, err := cm.FindEntry(key)
|
|
|
|
var notFound *NotFoundError
|
|
|
|
valueNode := entry.ValueNode
|
|
|
|
if err != nil && errors.As(err, ¬Found) {
|
|
keyNode := &yaml.Node{
|
|
Kind: yaml.ScalarNode,
|
|
Value: key,
|
|
}
|
|
valueNode = &yaml.Node{
|
|
Kind: yaml.ScalarNode,
|
|
Tag: "!!str",
|
|
Value: "",
|
|
}
|
|
|
|
cm.Root.Content = append(cm.Root.Content, keyNode, valueNode)
|
|
} else if err != nil {
|
|
return err
|
|
}
|
|
|
|
valueNode.Value = value
|
|
|
|
return nil
|
|
}
|
|
|
|
func (cm *ConfigMap) FindEntry(key string) (ce *ConfigEntry, err error) {
|
|
err = nil
|
|
|
|
ce = &ConfigEntry{}
|
|
|
|
topLevelKeys := cm.Root.Content
|
|
for i, v := range topLevelKeys {
|
|
if v.Value == key {
|
|
ce.KeyNode = v
|
|
ce.Index = i
|
|
if i+1 < len(topLevelKeys) {
|
|
ce.ValueNode = topLevelKeys[i+1]
|
|
}
|
|
return
|
|
}
|
|
}
|
|
|
|
return ce, &NotFoundError{errors.New("not found")}
|
|
}
|
|
|
|
func (cm *ConfigMap) RemoveEntry(key string) {
|
|
newContent := []*yaml.Node{}
|
|
|
|
content := cm.Root.Content
|
|
for i := 0; i < len(content); i++ {
|
|
if content[i].Value == key {
|
|
i++ // skip the next node which is this key's value
|
|
} else {
|
|
newContent = append(newContent, content[i])
|
|
}
|
|
}
|
|
|
|
cm.Root.Content = newContent
|
|
}
|