Method assignInlineTable

unmarshaler.go:2048–2086

(v reflect.Value, expr *unstable.Node, value *unstable.Node)

}

func (d *decoder) assignInlineTable(v reflect.Value, expr *unstable.Node, value *unstable.Node) (reflect.Value, error) {
	switch v.Kind() {
	case reflect.Map:
		// Inline tables are self-contained: they fully replace the target.
		v = reflect.MakeMap(v.Type())
	case reflect.Struct:
		// fields are set in place
	case reflect.Interface:
		elem := reflect.ValueOf(map[string]interface{}{})
		nv, err := d.assignInlineTable(elem, expr, value)
		if err != nil {
			return reflect.Value{}, err
		}
		return boxInto(v, nv)
	default:
		return reflect.Value{}, d.typeMismatchError("inline table", v.Type(), d.rawValue(expr, value))
	}

	it := value.Children()
	for it.Next() {
		kv := it.Node()
		// Build the path from the key of this key-value. Keys of inline
		// tables rarely have more than a few parts.
		var pathBuf [4]pathPart
		path := pathBuf[:0]
		kit := kv.Key()
		for kit.Next() {
			path = append(path, pathPart{node: kit.Node()})
		}
		nv, err := d.descend(v, path, 0, kv, kv.Value())
		if err != nil {
			return reflect.Value{}, err
		}
		if nv.IsValid() {
			v = nv
		}
	}
	return v, nil
}

// boxInto returns the value to store in place of the interface value v. The
// caller stores the result in the slot v was found in, which performs the