You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
clair/vendor/github.com/kylelemons/go-gypsy/yaml/config.go

287 lines
6.3 KiB

// Copyright 2013 Google, Inc. All rights reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package yaml
import (
"bytes"
"fmt"
"os"
"strconv"
"strings"
)
// A File represents the top-level YAML node found in a file. It is intended
// for use as a configuration file.
type File struct {
Root Node
// TODO(kevlar): Add a cache?
}
// ReadFile reads a YAML configuration file from the given filename.
func ReadFile(filename string) (*File, error) {
fin, err := os.Open(filename)
if err != nil {
return nil, err
}
defer fin.Close()
f := new(File)
f.Root, err = Parse(fin)
if err != nil {
return nil, err
}
return f, nil
}
// Config reads a YAML configuration from a static string. If an error is
// found, it will panic. This is a utility function and is intended for use in
// initializers.
func Config(yamlconf string) *File {
var err error
buf := bytes.NewBufferString(yamlconf)
f := new(File)
f.Root, err = Parse(buf)
if err != nil {
panic(err)
}
return f
}
// ConfigFile reads a YAML configuration file from the given filename and
// panics if an error is found. This is a utility function and is intended for
// use in initializers.
func ConfigFile(filename string) *File {
f, err := ReadFile(filename)
if err != nil {
panic(err)
}
return f
}
// Get retrieves a scalar from the file specified by a string of the same
// format as that expected by Child. If the final node is not a Scalar, Get
// will return an error.
func (f *File) Get(spec string) (string, error) {
node, err := Child(f.Root, spec)
if err != nil {
return "", err
}
if node == nil {
return "", &NodeNotFound{
Full: spec,
Spec: spec,
}
}
scalar, ok := node.(Scalar)
if !ok {
return "", &NodeTypeMismatch{
Full: spec,
Spec: spec,
Token: "$",
Expected: "yaml.Scalar",
Node: node,
}
}
return scalar.String(), nil
}
func (f *File) GetInt(spec string) (int64, error) {
s, err := f.Get(spec)
if err != nil {
return 0, err
}
i, err := strconv.ParseInt(s, 10, 64)
if err != nil {
return 0, err
}
return i, nil
}
func (f *File) GetBool(spec string) (bool, error) {
s, err := f.Get(spec)
if err != nil {
return false, err
}
b, err := strconv.ParseBool(s)
if err != nil {
return false, err
}
return b, nil
}
// Count retrieves a the number of elements in the specified list from the file
// using the same format as that expected by Child. If the final node is not a
// List, Count will return an error.
func (f *File) Count(spec string) (int, error) {
node, err := Child(f.Root, spec)
if err != nil {
return -1, err
}
if node == nil {
return -1, &NodeNotFound{
Full: spec,
Spec: spec,
}
}
lst, ok := node.(List)
if !ok {
return -1, &NodeTypeMismatch{
Full: spec,
Spec: spec,
Token: "$",
Expected: "yaml.List",
Node: node,
}
}
return lst.Len(), nil
}
// Require retrieves a scalar from the file specified by a string of the same
// format as that expected by Child. If the final node is not a Scalar, String
// will panic. This is a convenience function for use in initializers.
func (f *File) Require(spec string) string {
str, err := f.Get(spec)
if err != nil {
panic(err)
}
return str
}
// Child retrieves a child node from the specified node as follows:
// .mapkey - Get the key 'mapkey' of the Node, which must be a Map
// [idx] - Choose the index from the current Node, which must be a List
//
// The above selectors may be applied recursively, and each successive selector
// applies to the result of the previous selector. For convenience, a "." is
// implied as the first character if the first character is not a "." or "[".
// The node tree is walked from the given node, considering each token of the
// above format. If a node along the evaluation path is not found, an error is
// returned. If a node is not the proper type, an error is returned. If the
// final node is not a Scalar, an error is returned.
func Child(root Node, spec string) (Node, error) {
if len(spec) == 0 {
return root, nil
}
if first := spec[0]; first != '.' && first != '[' {
spec = "." + spec
}
var recur func(Node, string, string) (Node, error)
recur = func(n Node, last, s string) (Node, error) {
if len(s) == 0 {
return n, nil
}
if n == nil {
return nil, &NodeNotFound{
Full: spec,
Spec: last,
}
}
// Extract the next token
delim := 1 + strings.IndexAny(s[1:], ".[")
if delim <= 0 {
delim = len(s)
}
tok := s[:delim]
remain := s[delim:]
switch s[0] {
case '[':
s, ok := n.(List)
if !ok {
return nil, &NodeTypeMismatch{
Node: n,
Expected: "yaml.List",
Full: spec,
Spec: last,
Token: tok,
}
}
if tok[0] == '[' && tok[len(tok)-1] == ']' {
if num, err := strconv.Atoi(tok[1 : len(tok)-1]); err == nil {
if num >= 0 && num < len(s) {
return recur(s[num], last+tok, remain)
}
}
}
return nil, &NodeNotFound{
Full: spec,
Spec: last + tok,
}
default:
m, ok := n.(Map)
if !ok {
return nil, &NodeTypeMismatch{
Node: n,
Expected: "yaml.Map",
Full: spec,
Spec: last,
Token: tok,
}
}
n, ok = m[tok[1:]]
if !ok {
return nil, &NodeNotFound{
Full: spec,
Spec: last + tok,
}
}
return recur(n, last+tok, remain)
}
panic("unreachable")
}
return recur(root, "", spec)
}
type NodeNotFound struct {
Full string
Spec string
}
func (e *NodeNotFound) Error() string {
return fmt.Sprintf("yaml: %s: %q not found", e.Full, e.Spec)
}
type NodeTypeMismatch struct {
Full string
Spec string
Token string
Node Node
Expected string
}
func (e *NodeTypeMismatch) Error() string {
return fmt.Sprintf("yaml: %s: type mismatch: %q is %T, want %s (at %q)",
e.Full, e.Spec, e.Node, e.Expected, e.Token)
}