hcl/printer/nodes.go

261 lines
5.1 KiB
Go
Raw Normal View History

package printer
import (
"bytes"
"fmt"
"github.com/fatih/hcl/ast"
)
2015-10-25 13:08:09 +00:00
const (
blank = byte(' ')
newline = byte('\n')
tab = byte('\t')
)
2015-10-25 22:34:41 +00:00
// output prints creates a printable HCL output and returns it.
func (p *printer) output(n interface{}) []byte {
var buf bytes.Buffer
switch t := n.(type) {
case *ast.ObjectList:
2015-10-25 13:08:09 +00:00
for i, item := range t.Items {
buf.Write(p.objectItem(item))
2015-10-25 13:08:09 +00:00
if i != len(t.Items)-1 {
2015-10-25 13:12:08 +00:00
buf.Write([]byte{newline, newline})
2015-10-25 13:08:09 +00:00
}
}
case *ast.ObjectKey:
2015-10-25 13:08:09 +00:00
buf.WriteString(t.Token.Text)
case *ast.ObjectItem:
buf.Write(p.objectItem(t))
case *ast.LiteralType:
2015-10-25 13:08:09 +00:00
buf.WriteString(t.Token.Text)
case *ast.ListType:
buf.Write(p.list(t))
case *ast.ObjectType:
buf.Write(p.objectType(t))
default:
fmt.Printf(" unknown type: %T\n", n)
}
return buf.Bytes()
}
func (p *printer) objectItem(o *ast.ObjectItem) []byte {
var buf bytes.Buffer
if o.LeadComment != nil {
for _, comment := range o.LeadComment.List {
buf.WriteString(comment.Text)
buf.WriteByte(newline)
}
}
for i, k := range o.Keys {
buf.WriteString(k.Token.Text)
2015-10-25 13:08:09 +00:00
buf.WriteByte(blank)
// reach end of key
if i == len(o.Keys)-1 && len(o.Keys) == 1 {
buf.WriteString("=")
2015-10-25 13:08:09 +00:00
buf.WriteByte(blank)
}
}
buf.Write(p.output(o.Val))
if o.Val.Pos().Line == o.Keys[0].Pos().Line && o.LineComment != nil {
buf.WriteByte(blank)
for _, comment := range o.LineComment.List {
buf.WriteString(comment.Text)
}
}
return buf.Bytes()
}
func (p *printer) alignedItems(items []*ast.ObjectItem) []byte {
var buf bytes.Buffer
var longestLine int
for _, item := range items {
lineLen := len(item.Keys[0].Token.Text) + len(p.output(item.Val))
if lineLen > longestLine {
longestLine = lineLen
}
}
for _, item := range items {
curLen := 0
for i, k := range item.Keys {
buf.WriteString(k.Token.Text)
buf.WriteByte(blank)
// reach end of key
if i == len(item.Keys)-1 && len(item.Keys) == 1 {
buf.WriteString("=")
buf.WriteByte(blank)
}
curLen = len(k.Token.Text) // two blanks and one assign
}
val := p.output(item.Val)
buf.Write(val)
curLen += len(val)
if item.Val.Pos().Line == item.Keys[0].Pos().Line && item.LineComment != nil {
for i := 0; i < longestLine-curLen+1; i++ {
buf.WriteByte(blank)
}
for _, comment := range item.LineComment.List {
buf.WriteString(comment.Text)
}
}
buf.WriteByte(newline)
}
return buf.Bytes()
}
func (p *printer) literal(l *ast.LiteralType) []byte {
return []byte(l.Token.Text)
}
func (p *printer) objectType(o *ast.ObjectType) []byte {
2015-10-25 13:08:09 +00:00
var buf bytes.Buffer
buf.WriteString("{")
buf.WriteByte(newline)
var index int
for {
// check if we have adjacent one liner items. If yes we'll going to align
// the comments.
var oneLines []*ast.ObjectItem
for _, item := range o.List.Items[index:] {
// we don't group one line lists
if len(o.List.Items) == 1 {
break
}
cur := lines(string(p.objectItem(item)))
if cur != 1 {
break
}
next := 0
if index != len(o.List.Items)-1 {
next = lines(string(p.objectItem(o.List.Items[index+0])))
}
prev := 0
if index != 0 {
prev = lines(string(p.objectItem(o.List.Items[index-1])))
}
if cur == next {
oneLines = append(oneLines, item)
index++
} else if cur == prev {
oneLines = append(oneLines, item)
index++
} else {
break
}
}
if len(oneLines) != 0 {
items := p.alignedItems(oneLines)
// put newlines if the items are between other non aligned items
if index != len(oneLines) {
buf.WriteByte(newline)
}
buf.Write(p.indent(items))
if index != len(o.List.Items) && len(oneLines) > 1 {
buf.WriteByte(newline)
}
}
if index == len(o.List.Items) {
break
}
buf.Write(p.indent(p.objectItem(o.List.Items[index])))
2015-10-25 13:08:09 +00:00
buf.WriteByte(newline)
index++
2015-10-25 13:08:09 +00:00
}
buf.WriteString("}")
return buf.Bytes()
}
// printList prints a HCL list
func (p *printer) list(l *ast.ListType) []byte {
var buf bytes.Buffer
buf.WriteString("[")
for i, item := range l.List {
if item.Pos().Line != l.Lbrack.Line {
2015-10-25 16:09:22 +00:00
// multiline list, add newline before we add each item
2015-10-25 13:08:09 +00:00
buf.WriteByte(newline)
2015-10-25 16:09:22 +00:00
// also indent each line
buf.Write(p.indent(p.output(item)))
} else {
buf.Write(p.output(item))
}
if i != len(l.List)-1 {
buf.WriteString(",")
2015-10-25 13:08:09 +00:00
buf.WriteByte(blank)
} else if item.Pos().Line != l.Lbrack.Line {
buf.WriteString(",")
2015-10-25 13:08:09 +00:00
buf.WriteByte(newline)
}
}
buf.WriteString("]")
return buf.Bytes()
}
2015-10-25 13:08:09 +00:00
// indent indents the lines of the given buffer for each non-empty line
2015-10-25 15:02:40 +00:00
func (p *printer) indent(buf []byte) []byte {
var prefix []byte
if p.cfg.SpacesWidth != 0 {
for i := 0; i < p.cfg.SpacesWidth; i++ {
2015-10-25 15:02:40 +00:00
prefix = append(prefix, blank)
}
} else {
prefix = []byte{tab}
2015-10-25 15:02:40 +00:00
}
2015-10-25 14:51:18 +00:00
var res []byte
bol := true
for _, c := range buf {
if bol && c != '\n' {
2015-10-25 15:02:40 +00:00
res = append(res, prefix...)
2015-10-25 13:08:09 +00:00
}
2015-10-25 14:51:18 +00:00
res = append(res, c)
bol = c == '\n'
2015-10-25 13:08:09 +00:00
}
2015-10-25 14:51:18 +00:00
return res
2015-10-25 13:08:09 +00:00
}
func lines(txt string) int {
endline := 0
for i := 0; i < len(txt); i++ {
if txt[i] == '\n' {
endline++
}
}
// some txt do not have any kinde of newlines, treat them also as a one
// liner
if endline == 0 {
endline = 1
}
return endline
}