Fixed formatting

cmd/test_program.go

@@ -1,12 +1,12 @@
 package main
 
 import (
-	"io/ioutil"
-	"os"
-	"github.com/pelletier/go-toml"
 	"encoding/json"
 	"fmt"
+	"github.com/pelletier/go-toml"
+	"io/ioutil"
 	"log"
+	"os"
 	"time"
 )
 
@@ -40,7 +40,7 @@ func translate(tomlData interface{}) interface{} {
 		return typed
 	case *toml.TomlTree:
 		return translate((map[string]interface{})(*orig))
-  case []*toml.TomlTree:
+	case []*toml.TomlTree:
 		typed := make([]map[string]interface{}, len(orig))
 		for i, v := range orig {
 			typed[i] = translate(v).(map[string]interface{})

lexer.go

@@ -419,7 +419,7 @@ func lexInsideKeyGroupArray(l *lexer) stateFn {
 			return lexVoid
 		} else if l.peek() == '[' {
 			return l.errorf("group name cannot contain ']'")
-    }
+		}
 
 		if l.next() == eof {
 			break
@@ -440,7 +440,7 @@ func lexInsideKeyGroup(l *lexer) stateFn {
 			return lexVoid
 		} else if l.peek() == '[' {
 			return l.errorf("group name cannot contain ']'")
-    }
+		}
 
 		if l.next() == eof {
 			break

toml.go

@@ -64,16 +64,16 @@ func (t *TomlTree) GetPath(keys []string) interface{} {
 		if !exists {
 			return nil
 		}
-    switch node := (*subtree)[intermediate_key].(type) {
+		switch node := (*subtree)[intermediate_key].(type) {
-    case *TomlTree:
+		case *TomlTree:
-      subtree = node
+			subtree = node
-    case []*TomlTree:
+		case []*TomlTree:
-      // go to most recent element
+			// go to most recent element
-      if len(node) == 0 {
+			if len(node) == 0 {
-        return nil //(*subtree)[intermediate_key] = append(node, &TomlTree{})
+				return nil //(*subtree)[intermediate_key] = append(node, &TomlTree{})
-      }
+			}
-      subtree = node[len(node)-1]
+			subtree = node[len(node)-1]
-    }
+		}
 	}
 	return (*subtree)[keys[len(keys)-1]]
 }
@@ -102,16 +102,16 @@ func (t *TomlTree) SetPath(keys []string, value interface{}) {
 			var new_tree TomlTree = make(TomlTree)
 			(*subtree)[intermediate_key] = &new_tree
 		}
-    switch node := (*subtree)[intermediate_key].(type) {
+		switch node := (*subtree)[intermediate_key].(type) {
-    case *TomlTree:
+		case *TomlTree:
-      subtree = node
+			subtree = node
-    case []*TomlTree:
+		case []*TomlTree:
-      // go to most recent element
+			// go to most recent element
-      if len(node) == 0 {
+			if len(node) == 0 {
-        (*subtree)[intermediate_key] = append(node, &TomlTree{})
+				(*subtree)[intermediate_key] = append(node, &TomlTree{})
-      }
+			}
-      subtree = node[len(node)-1]
+			subtree = node[len(node)-1]
-    }
+		}
 	}
 	(*subtree)[keys[len(keys)-1]] = value
 }