use go modules
This commit is contained in:
		
							
								
								
									
										86
									
								
								vendor/github.com/spf13/viper/internal/encoding/javaproperties/codec.go
									
									
									
										generated
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										86
									
								
								vendor/github.com/spf13/viper/internal/encoding/javaproperties/codec.go
									
									
									
										generated
									
									
										vendored
									
									
										Normal file
									
								
							@ -0,0 +1,86 @@
 | 
			
		||||
package javaproperties
 | 
			
		||||
 | 
			
		||||
import (
 | 
			
		||||
	"bytes"
 | 
			
		||||
	"sort"
 | 
			
		||||
	"strings"
 | 
			
		||||
 | 
			
		||||
	"github.com/magiconair/properties"
 | 
			
		||||
	"github.com/spf13/cast"
 | 
			
		||||
)
 | 
			
		||||
 | 
			
		||||
// Codec implements the encoding.Encoder and encoding.Decoder interfaces for Java properties encoding.
 | 
			
		||||
type Codec struct {
 | 
			
		||||
	KeyDelimiter string
 | 
			
		||||
 | 
			
		||||
	// Store read properties on the object so that we can write back in order with comments.
 | 
			
		||||
	// This will only be used if the configuration read is a properties file.
 | 
			
		||||
	// TODO: drop this feature in v2
 | 
			
		||||
	// TODO: make use of the global properties object optional
 | 
			
		||||
	Properties *properties.Properties
 | 
			
		||||
}
 | 
			
		||||
 | 
			
		||||
func (c *Codec) Encode(v map[string]interface{}) ([]byte, error) {
 | 
			
		||||
	if c.Properties == nil {
 | 
			
		||||
		c.Properties = properties.NewProperties()
 | 
			
		||||
	}
 | 
			
		||||
 | 
			
		||||
	flattened := map[string]interface{}{}
 | 
			
		||||
 | 
			
		||||
	flattened = flattenAndMergeMap(flattened, v, "", c.keyDelimiter())
 | 
			
		||||
 | 
			
		||||
	keys := make([]string, 0, len(flattened))
 | 
			
		||||
 | 
			
		||||
	for key := range flattened {
 | 
			
		||||
		keys = append(keys, key)
 | 
			
		||||
	}
 | 
			
		||||
 | 
			
		||||
	sort.Strings(keys)
 | 
			
		||||
 | 
			
		||||
	for _, key := range keys {
 | 
			
		||||
		_, _, err := c.Properties.Set(key, cast.ToString(flattened[key]))
 | 
			
		||||
		if err != nil {
 | 
			
		||||
			return nil, err
 | 
			
		||||
		}
 | 
			
		||||
	}
 | 
			
		||||
 | 
			
		||||
	var buf bytes.Buffer
 | 
			
		||||
 | 
			
		||||
	_, err := c.Properties.WriteComment(&buf, "#", properties.UTF8)
 | 
			
		||||
	if err != nil {
 | 
			
		||||
		return nil, err
 | 
			
		||||
	}
 | 
			
		||||
 | 
			
		||||
	return buf.Bytes(), nil
 | 
			
		||||
}
 | 
			
		||||
 | 
			
		||||
func (c *Codec) Decode(b []byte, v map[string]interface{}) error {
 | 
			
		||||
	var err error
 | 
			
		||||
	c.Properties, err = properties.Load(b, properties.UTF8)
 | 
			
		||||
	if err != nil {
 | 
			
		||||
		return err
 | 
			
		||||
	}
 | 
			
		||||
 | 
			
		||||
	for _, key := range c.Properties.Keys() {
 | 
			
		||||
		// ignore existence check: we know it's there
 | 
			
		||||
		value, _ := c.Properties.Get(key)
 | 
			
		||||
 | 
			
		||||
		// recursively build nested maps
 | 
			
		||||
		path := strings.Split(key, c.keyDelimiter())
 | 
			
		||||
		lastKey := strings.ToLower(path[len(path)-1])
 | 
			
		||||
		deepestMap := deepSearch(v, path[0:len(path)-1])
 | 
			
		||||
 | 
			
		||||
		// set innermost value
 | 
			
		||||
		deepestMap[lastKey] = value
 | 
			
		||||
	}
 | 
			
		||||
 | 
			
		||||
	return nil
 | 
			
		||||
}
 | 
			
		||||
 | 
			
		||||
func (c Codec) keyDelimiter() string {
 | 
			
		||||
	if c.KeyDelimiter == "" {
 | 
			
		||||
		return "."
 | 
			
		||||
	}
 | 
			
		||||
 | 
			
		||||
	return c.KeyDelimiter
 | 
			
		||||
}
 | 
			
		||||
							
								
								
									
										74
									
								
								vendor/github.com/spf13/viper/internal/encoding/javaproperties/map_utils.go
									
									
									
										generated
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										74
									
								
								vendor/github.com/spf13/viper/internal/encoding/javaproperties/map_utils.go
									
									
									
										generated
									
									
										vendored
									
									
										Normal file
									
								
							@ -0,0 +1,74 @@
 | 
			
		||||
package javaproperties
 | 
			
		||||
 | 
			
		||||
import (
 | 
			
		||||
	"strings"
 | 
			
		||||
 | 
			
		||||
	"github.com/spf13/cast"
 | 
			
		||||
)
 | 
			
		||||
 | 
			
		||||
// THIS CODE IS COPIED HERE: IT SHOULD NOT BE MODIFIED
 | 
			
		||||
// AT SOME POINT IT WILL BE MOVED TO A COMMON PLACE
 | 
			
		||||
// deepSearch scans deep maps, following the key indexes listed in the
 | 
			
		||||
// sequence "path".
 | 
			
		||||
// The last value is expected to be another map, and is returned.
 | 
			
		||||
//
 | 
			
		||||
// In case intermediate keys do not exist, or map to a non-map value,
 | 
			
		||||
// a new map is created and inserted, and the search continues from there:
 | 
			
		||||
// the initial map "m" may be modified!
 | 
			
		||||
func deepSearch(m map[string]interface{}, path []string) map[string]interface{} {
 | 
			
		||||
	for _, k := range path {
 | 
			
		||||
		m2, ok := m[k]
 | 
			
		||||
		if !ok {
 | 
			
		||||
			// intermediate key does not exist
 | 
			
		||||
			// => create it and continue from there
 | 
			
		||||
			m3 := make(map[string]interface{})
 | 
			
		||||
			m[k] = m3
 | 
			
		||||
			m = m3
 | 
			
		||||
			continue
 | 
			
		||||
		}
 | 
			
		||||
		m3, ok := m2.(map[string]interface{})
 | 
			
		||||
		if !ok {
 | 
			
		||||
			// intermediate key is a value
 | 
			
		||||
			// => replace with a new map
 | 
			
		||||
			m3 = make(map[string]interface{})
 | 
			
		||||
			m[k] = m3
 | 
			
		||||
		}
 | 
			
		||||
		// continue search from here
 | 
			
		||||
		m = m3
 | 
			
		||||
	}
 | 
			
		||||
	return m
 | 
			
		||||
}
 | 
			
		||||
 | 
			
		||||
// flattenAndMergeMap recursively flattens the given map into a new map
 | 
			
		||||
// Code is based on the function with the same name in tha main package.
 | 
			
		||||
// TODO: move it to a common place
 | 
			
		||||
func flattenAndMergeMap(shadow map[string]interface{}, m map[string]interface{}, prefix string, delimiter string) map[string]interface{} {
 | 
			
		||||
	if shadow != nil && prefix != "" && shadow[prefix] != nil {
 | 
			
		||||
		// prefix is shadowed => nothing more to flatten
 | 
			
		||||
		return shadow
 | 
			
		||||
	}
 | 
			
		||||
	if shadow == nil {
 | 
			
		||||
		shadow = make(map[string]interface{})
 | 
			
		||||
	}
 | 
			
		||||
 | 
			
		||||
	var m2 map[string]interface{}
 | 
			
		||||
	if prefix != "" {
 | 
			
		||||
		prefix += delimiter
 | 
			
		||||
	}
 | 
			
		||||
	for k, val := range m {
 | 
			
		||||
		fullKey := prefix + k
 | 
			
		||||
		switch val.(type) {
 | 
			
		||||
		case map[string]interface{}:
 | 
			
		||||
			m2 = val.(map[string]interface{})
 | 
			
		||||
		case map[interface{}]interface{}:
 | 
			
		||||
			m2 = cast.ToStringMap(val)
 | 
			
		||||
		default:
 | 
			
		||||
			// immediate value
 | 
			
		||||
			shadow[strings.ToLower(fullKey)] = val
 | 
			
		||||
			continue
 | 
			
		||||
		}
 | 
			
		||||
		// recursively merge to shadow map
 | 
			
		||||
		shadow = flattenAndMergeMap(shadow, m2, fullKey, delimiter)
 | 
			
		||||
	}
 | 
			
		||||
	return shadow
 | 
			
		||||
}
 | 
			
		||||
		Reference in New Issue
	
	Block a user